{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IP7EOMCHYEVAHFD2EGT6DGLQWL","short_pith_number":"pith:IP7EOMCH","schema_version":"1.0","canonical_sha256":"43fe473047c12a03947a21a7e19970b2d165a633d665e860f4bd345660bb0719","source":{"kind":"arxiv","id":"1412.6156","version":2},"attestation_state":"computed","paper":{"title":"Achieving Exact Cluster Recovery Threshold via Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"stat.ML","authors_text":"Bruce Hajek, Jiaming Xu, Yihong Wu","submitted_at":"2014-11-24T05:19:56Z","abstract_excerpt":"The binary symmetric stochastic block model deals with a random graph of $n$ vertices partitioned into two equal-sized clusters, such that each pair of vertices is connected independently with probability $p$ within clusters and $q$ across clusters. In the asymptotic regime of $p=a \\log n/n$ and $q=b \\log n/n$ for fixed $a,b$ and $n \\to \\infty$, we show that the semidefinite programming relaxation of the maximum likelihood estimator achieves the optimal threshold for exactly recovering the partition from the graph with probability tending to one, resolving a conjecture of Abbe et al. \\cite{Abb"},"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":"1412.6156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-24T05:19:56Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"7b51bf2bf1275071ba42f00f4dffa27c06a88d74e23aa18c7b55685d58bc1fb9","abstract_canon_sha256":"eb84d6fed181c0839058da5a50570f56f6e34c2d78a775d05a0b494c2164b661"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:19.034688Z","signature_b64":"C6mlwPGxOBU4cnjHlYu4Pl27KiYPxkhV+R+6VmwIJQHz6EA5J2K+GxtSD/Q1zVaNKD4iARgxm1KpjxdPaxs6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43fe473047c12a03947a21a7e19970b2d165a633d665e860f4bd345660bb0719","last_reissued_at":"2026-05-18T01:23:19.033975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:19.033975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Exact Cluster Recovery Threshold via Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"stat.ML","authors_text":"Bruce Hajek, Jiaming Xu, Yihong Wu","submitted_at":"2014-11-24T05:19:56Z","abstract_excerpt":"The binary symmetric stochastic block model deals with a random graph of $n$ vertices partitioned into two equal-sized clusters, such that each pair of vertices is connected independently with probability $p$ within clusters and $q$ across clusters. In the asymptotic regime of $p=a \\log n/n$ and $q=b \\log n/n$ for fixed $a,b$ and $n \\to \\infty$, we show that the semidefinite programming relaxation of the maximum likelihood estimator achieves the optimal threshold for exactly recovering the partition from the graph with probability tending to one, resolving a conjecture of Abbe et al. \\cite{Abb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6156","kind":"arxiv","version":2},"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":"1412.6156","created_at":"2026-05-18T01:23:19.034080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6156v2","created_at":"2026-05-18T01:23:19.034080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6156","created_at":"2026-05-18T01:23:19.034080+00:00"},{"alias_kind":"pith_short_12","alias_value":"IP7EOMCHYEVA","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IP7EOMCHYEVAHFD2","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IP7EOMCH","created_at":"2026-05-18T12:28:33.132498+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/IP7EOMCHYEVAHFD2EGT6DGLQWL","json":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL.json","graph_json":"https://pith.science/api/pith-number/IP7EOMCHYEVAHFD2EGT6DGLQWL/graph.json","events_json":"https://pith.science/api/pith-number/IP7EOMCHYEVAHFD2EGT6DGLQWL/events.json","paper":"https://pith.science/paper/IP7EOMCH"},"agent_actions":{"view_html":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL","download_json":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL.json","view_paper":"https://pith.science/paper/IP7EOMCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6156&json=true","fetch_graph":"https://pith.science/api/pith-number/IP7EOMCHYEVAHFD2EGT6DGLQWL/graph.json","fetch_events":"https://pith.science/api/pith-number/IP7EOMCHYEVAHFD2EGT6DGLQWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/action/storage_attestation","attest_author":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/action/author_attestation","sign_citation":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/action/citation_signature","submit_replication":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/action/replication_record"}},"created_at":"2026-05-18T01:23:19.034080+00:00","updated_at":"2026-05-18T01:23:19.034080+00:00"}