{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IP7EOMCHYEVAHFD2EGT6DGLQWL","short_pith_number":"pith:IP7EOMCH","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"},"canonical_sha256":"43fe473047c12a03947a21a7e19970b2d165a633d665e860f4bd345660bb0719","source":{"kind":"arxiv","id":"1412.6156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6156","created_at":"2026-05-18T01:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6156v2","created_at":"2026-05-18T01:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6156","created_at":"2026-05-18T01:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"IP7EOMCHYEVA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IP7EOMCHYEVAHFD2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IP7EOMCH","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IP7EOMCHYEVAHFD2EGT6DGLQWL","target":"record","payload":{"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"},"canonical_sha256":"43fe473047c12a03947a21a7e19970b2d165a633d665e860f4bd345660bb0719","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"},"source_kind":"arxiv","source_id":"1412.6156","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdMEVwTBtiV0oOaBCSZPLZ348YWY72jgTPuC4ReAYy5dAbk7rHvBpxtp0Xtpnha4Zr8HzftcFVuC0SepUC6ECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:07:55.615419Z"},"content_sha256":"a8ce1fb74cf6a5f2cdbd6e90f2958c74dcd45cf8f0964bf038f956d44d274ca3","schema_version":"1.0","event_id":"sha256:a8ce1fb74cf6a5f2cdbd6e90f2958c74dcd45cf8f0964bf038f956d44d274ca3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IP7EOMCHYEVAHFD2EGT6DGLQWL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVDmS7nNtlIMFY73uw2On1PQ7qXIlnvMHbRwlSTBYmvSt7RFxPP0XRThXyCgZHGUBmLWQ1wl+IJCRqyPoe9bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:07:55.616113Z"},"content_sha256":"bc0f87cd12e575bea9cb2da6cbfb2998f9e2a0d1de0eae33cd2f348b3cfa81c9","schema_version":"1.0","event_id":"sha256:bc0f87cd12e575bea9cb2da6cbfb2998f9e2a0d1de0eae33cd2f348b3cfa81c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/bundle.json","state_url":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T08:07:55Z","links":{"resolver":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL","bundle":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/bundle.json","state":"https://pith.science/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IP7EOMCHYEVAHFD2EGT6DGLQWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IP7EOMCHYEVAHFD2EGT6DGLQWL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eb84d6fed181c0839058da5a50570f56f6e34c2d78a775d05a0b494c2164b661","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-24T05:19:56Z","title_canon_sha256":"7b51bf2bf1275071ba42f00f4dffa27c06a88d74e23aa18c7b55685d58bc1fb9"},"schema_version":"1.0","source":{"id":"1412.6156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6156","created_at":"2026-05-18T01:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6156v2","created_at":"2026-05-18T01:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6156","created_at":"2026-05-18T01:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"IP7EOMCHYEVA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IP7EOMCHYEVAHFD2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IP7EOMCH","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:bc0f87cd12e575bea9cb2da6cbfb2998f9e2a0d1de0eae33cd2f348b3cfa81c9","target":"graph","created_at":"2026-05-18T01:23:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bruce Hajek, Jiaming Xu, Yihong Wu","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-24T05:19:56Z","title":"Achieving Exact Cluster Recovery Threshold via Semidefinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6156","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a8ce1fb74cf6a5f2cdbd6e90f2958c74dcd45cf8f0964bf038f956d44d274ca3","target":"record","created_at":"2026-05-18T01:23:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eb84d6fed181c0839058da5a50570f56f6e34c2d78a775d05a0b494c2164b661","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-24T05:19:56Z","title_canon_sha256":"7b51bf2bf1275071ba42f00f4dffa27c06a88d74e23aa18c7b55685d58bc1fb9"},"schema_version":"1.0","source":{"id":"1412.6156","kind":"arxiv","version":2}},"canonical_sha256":"43fe473047c12a03947a21a7e19970b2d165a633d665e860f4bd345660bb0719","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43fe473047c12a03947a21a7e19970b2d165a633d665e860f4bd345660bb0719","first_computed_at":"2026-05-18T01:23:19.033975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:19.033975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C6mlwPGxOBU4cnjHlYu4Pl27KiYPxkhV+R+6VmwIJQHz6EA5J2K+GxtSD/Q1zVaNKD4iARgxm1KpjxdPaxs6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:19.034688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8ce1fb74cf6a5f2cdbd6e90f2958c74dcd45cf8f0964bf038f956d44d274ca3","sha256:bc0f87cd12e575bea9cb2da6cbfb2998f9e2a0d1de0eae33cd2f348b3cfa81c9"],"state_sha256":"c2073136046c503361ab1d5d56b9c7cf2a0b73d17d1806aebab89e2a0fb582e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBj5aavsJUmlqNWntP0ej9MpI/T4br/A3b1995Y4SA2/5x5UekFUneplq4Lz08d1zJ2mh/QXrrGDErzi7WmJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:07:55.622850Z","bundle_sha256":"ab2b65f53624620f1270d2dde1437921fbfffea5193591256cf3fac05650034f"}}