Metraipolis › archive › dc_fe8b45e1d5ee

Entropy-Weighted Soundness for Multi-Answer Birthday Graphs — arXiv:2611.04457

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04457
License (as archived)
CC0-1.0
Archived
2026-11-04T12:59:29.063Z
SHA-256 of the archived text
edc1539b4c96b5e2dee6c68d4b220bcbfd8fede84fdea430828d006470c8d842
Stable URL of this page
https://metraipolis.com/documento/dc_fe8b45e1d5ee

How to cite

Entropy-Weighted Soundness for Multi-Answer Birthday Graphs — arXiv:2611.04457 — arXiv (en), https://arxiv.org/abs/2611.04457 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe8b45e1d5ee (Metraipolis archive dc_fe8b45e1d5ee, sha256 edc1539b4c96b5e2dee6c68d4b220bcbfd8fede84fdea430828d006470c8d842)
BibTeX
@misc{dcfe8b45e1d5ee,
  title = {Entropy-Weighted Soundness for Multi-Answer Birthday Graphs — arXiv:2611.04457},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04457},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe8b45e1d5ee; sha256 edc1539b4c96b5e2dee6c68d4b220bcbfd8fede84fdea430828d006470c8d842},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04457. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The vertices of a Boolean birthday graph are partial assignments on $\ell$-subsets of $n$ variables. Although a satisfying assignment induces a $K$-clique for $K=\binom n\ell$, an arbitrary selection of $K$ vertices may repeat some views and omit others. This makes soundness substantially harder than under uniform view sampling. For bounded-occurrence, constant-gap Boolean ternary CSPs whose constraints each involve three distinct variables (allowing arbitrary Boolean predicates), we prove that the graph's maximum induced $K$-vertex density satisfies \[ \rho^*(K)\le 2\exp\!\left(-c\, \frac{\ell^3}{n^2\log(en/\ell)}\right) \] for $2\le\ell\le x_0n$ and $\ell\log(en/\ell)\ge C_0\log(n+1)$, with positive constants depending only on the source parameters. The argument refines the biclique counting method by charging the entropy of an adversarially chosen flattening to mutual information and a combinatorial obstruction energy. In the overlapping parameter range it strengthens the explicit soundness exponent previously established for this graph. We also establish an unconditional stability theorem for arbitrary sets $H$ of exactly $K$ distinct local assignments, with missing views and multiple answers: $f_*(H)\le34(n/\ell)q_{\mathrm{con}}(H)$ for every $1\le\ell\le n$. It gives a complementary additive near-clique soundness bound. We do not derive a new fine-grained hardness theorem.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.04457 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:35:02.340Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).