Pith. sign in

REVIEW

Bicoloring Random Hypergraphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cond-mat/0306369 v2 pith:PZ5LP2AH submitted 2003-06-13 cond-mat.dis-nn cond-mat.stat-mech

Bicoloring Random Hypergraphs

Tommaso Castellani , Vincenzo Napolano , Federico Ricci-Tersenghi , Riccardo Zecchina This is my paper
classification cond-mat.dis-nn cond-mat.stat-mech
keywords bicoloringalgorithmhypergraphsphaserandomresultsagreementanalytical
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We study the problem of bicoloring random hypergraphs, both numerically and analytically. We apply the zero-temperature cavity method to find analytical results for the phase transitions (dynamic and static) in the 1RSB approximation. These points appear to be in agreement with the results of the numerical algorithm. In the second part, we implement and test the Survey Propagation algorithm for specific bicoloring instances in the so called HARD-SAT phase.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.