{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QJ6RYEMQWCHA2K2T56PWCMFAPO","short_pith_number":"pith:QJ6RYEMQ","schema_version":"1.0","canonical_sha256":"827d1c1190b08e0d2b53ef9f6130a07b861c77d3cc7e0f7a5fda6587bf19846d","source":{"kind":"arxiv","id":"1309.1380","version":4},"attestation_state":"computed","paper":{"title":"Belief propagation, robust reconstruction and optimal recovery of block models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.PR","authors_text":"Allan Sly, Elchanan Mossel, Joe Neeman","submitted_at":"2013-09-05T15:59:01Z","abstract_excerpt":"We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities $a/n$ and $b/n$ for inter- and intra-block edge probabilities, respectively. It was recently shown that one can do better than a random guess if and only if $(a-b)^2>2(a+b)$. Using a variant of belief propagation, we give a reconstruction algorithm that is optimal in the sense that if $(a-b)^2>C(a+b)$ for some constant $C$ then our algorithm maximizes the fraction of the nodes labeled correctly. Ours is the only algorithm proven to achieve the optimal fraction of nodes labeled c"},"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":"1309.1380","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-05T15:59:01Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"070bb391ad507dc391a8aff92923d25fef3f18e5e6abce8b56f1c210040a6368","abstract_canon_sha256":"30f1a7722e5c1687129aadcd0a5e563f3d65f4acfbe8e6451fa24102361794fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:53.714036Z","signature_b64":"2nEnWsl7sHixwRARvleMVWK63LAunHdQMn/cOSM99VcwzNtDvLd+ppvVXb9sLloonnmugP89PJiSfsIza0KFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"827d1c1190b08e0d2b53ef9f6130a07b861c77d3cc7e0f7a5fda6587bf19846d","last_reissued_at":"2026-05-18T01:03:53.713385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:53.713385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Belief propagation, robust reconstruction and optimal recovery of block models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.PR","authors_text":"Allan Sly, Elchanan Mossel, Joe Neeman","submitted_at":"2013-09-05T15:59:01Z","abstract_excerpt":"We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities $a/n$ and $b/n$ for inter- and intra-block edge probabilities, respectively. It was recently shown that one can do better than a random guess if and only if $(a-b)^2>2(a+b)$. Using a variant of belief propagation, we give a reconstruction algorithm that is optimal in the sense that if $(a-b)^2>C(a+b)$ for some constant $C$ then our algorithm maximizes the fraction of the nodes labeled correctly. Ours is the only algorithm proven to achieve the optimal fraction of nodes labeled c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1380","kind":"arxiv","version":4},"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":"1309.1380","created_at":"2026-05-18T01:03:53.713490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1380v4","created_at":"2026-05-18T01:03:53.713490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1380","created_at":"2026-05-18T01:03:53.713490+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJ6RYEMQWCHA","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJ6RYEMQWCHA2K2T","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJ6RYEMQ","created_at":"2026-05-18T12:27:57.521954+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/QJ6RYEMQWCHA2K2T56PWCMFAPO","json":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO.json","graph_json":"https://pith.science/api/pith-number/QJ6RYEMQWCHA2K2T56PWCMFAPO/graph.json","events_json":"https://pith.science/api/pith-number/QJ6RYEMQWCHA2K2T56PWCMFAPO/events.json","paper":"https://pith.science/paper/QJ6RYEMQ"},"agent_actions":{"view_html":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO","download_json":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO.json","view_paper":"https://pith.science/paper/QJ6RYEMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1380&json=true","fetch_graph":"https://pith.science/api/pith-number/QJ6RYEMQWCHA2K2T56PWCMFAPO/graph.json","fetch_events":"https://pith.science/api/pith-number/QJ6RYEMQWCHA2K2T56PWCMFAPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO/action/storage_attestation","attest_author":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO/action/author_attestation","sign_citation":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO/action/citation_signature","submit_replication":"https://pith.science/pith/QJ6RYEMQWCHA2K2T56PWCMFAPO/action/replication_record"}},"created_at":"2026-05-18T01:03:53.713490+00:00","updated_at":"2026-05-18T01:03:53.713490+00:00"}