{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E5EZOSNB2YXIMI4RJQDK7YI4EP","short_pith_number":"pith:E5EZOSNB","schema_version":"1.0","canonical_sha256":"27499749a1d62e8623914c06afe11c23d6f62becc0ffe35d82a6584ee1122e7d","source":{"kind":"arxiv","id":"1905.10031","version":1},"attestation_state":"computed","paper":{"title":"Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.CO","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Elchanan Mossel, Frederic Koehler, Jingbo Liu, Vishesh Jain","submitted_at":"2019-05-24T04:56:12Z","abstract_excerpt":"The analysis of Belief Propagation and other algorithms for the {\\em reconstruction problem} plays a key role in the analysis of community detection in inference on graphs, phylogenetic reconstruction in bioinformatics, and the cavity method in statistical physics.\n  We prove a conjecture of Evans, Kenyon, Peres, and Schulman (2000) which states that any bounded memory message passing algorithm is statistically much weaker than Belief Propagation for the reconstruction problem. More formally, any recursive algorithm with bounded memory for the reconstruction problem on the trees with the binar"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.10031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-24T04:56:12Z","cross_cats_sorted":["math.IT","math.ST","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"e646eef399310baff320a06c256682eb4e1206984f03b736c506b91ca3dd8bb4","abstract_canon_sha256":"2fd802a419f0caacfe5a4b7311353a6e521f4831011b6571abf6b43f7d91cd85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:11.662756Z","signature_b64":"jpLAW3juowzvlDi8V1tarphzymihAMa/z77FqR6pMtaukYatcyXCUuV8CDzDFt4x3QGxHl31qmM2LPeZ2jYUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27499749a1d62e8623914c06afe11c23d6f62becc0ffe35d82a6584ee1122e7d","last_reissued_at":"2026-05-17T23:45:11.662025Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:11.662025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.CO","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Elchanan Mossel, Frederic Koehler, Jingbo Liu, Vishesh Jain","submitted_at":"2019-05-24T04:56:12Z","abstract_excerpt":"The analysis of Belief Propagation and other algorithms for the {\\em reconstruction problem} plays a key role in the analysis of community detection in inference on graphs, phylogenetic reconstruction in bioinformatics, and the cavity method in statistical physics.\n  We prove a conjecture of Evans, Kenyon, Peres, and Schulman (2000) which states that any bounded memory message passing algorithm is statistically much weaker than Belief Propagation for the reconstruction problem. More formally, any recursive algorithm with bounded memory for the reconstruction problem on the trees with the binar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10031","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.10031","created_at":"2026-05-17T23:45:11.662156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10031v1","created_at":"2026-05-17T23:45:11.662156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10031","created_at":"2026-05-17T23:45:11.662156+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5EZOSNB2YXI","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5EZOSNB2YXIMI4R","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5EZOSNB","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP","json":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP.json","graph_json":"https://pith.science/api/pith-number/E5EZOSNB2YXIMI4RJQDK7YI4EP/graph.json","events_json":"https://pith.science/api/pith-number/E5EZOSNB2YXIMI4RJQDK7YI4EP/events.json","paper":"https://pith.science/paper/E5EZOSNB"},"agent_actions":{"view_html":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP","download_json":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP.json","view_paper":"https://pith.science/paper/E5EZOSNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10031&json=true","fetch_graph":"https://pith.science/api/pith-number/E5EZOSNB2YXIMI4RJQDK7YI4EP/graph.json","fetch_events":"https://pith.science/api/pith-number/E5EZOSNB2YXIMI4RJQDK7YI4EP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP/action/storage_attestation","attest_author":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP/action/author_attestation","sign_citation":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP/action/citation_signature","submit_replication":"https://pith.science/pith/E5EZOSNB2YXIMI4RJQDK7YI4EP/action/replication_record"}},"created_at":"2026-05-17T23:45:11.662156+00:00","updated_at":"2026-05-17T23:45:11.662156+00:00"}