{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GXTUJJ66YPK46MPVMP5HZIMTNQ","short_pith_number":"pith:GXTUJJ66","canonical_record":{"source":{"id":"1507.02323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T22:02:45Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"babedb1429da0ecbba4121cee056020c3c579d8f07073a737eded682923abb36","abstract_canon_sha256":"d2760bee2eaf5f1d3aee1d9584ff7093cfbbbf3c5a6db3b510bb3c3d9d9f07d5"},"schema_version":"1.0"},"canonical_sha256":"35e744a7dec3d5cf31f563fa7ca1936c3b536025f16a7eec1b4c455530210c9d","source":{"kind":"arxiv","id":"1507.02323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02323","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02323v1","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02323","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"GXTUJJ66YPK4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GXTUJJ66YPK46MPV","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GXTUJJ66","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GXTUJJ66YPK46MPVMP5HZIMTNQ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T22:02:45Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"babedb1429da0ecbba4121cee056020c3c579d8f07073a737eded682923abb36","abstract_canon_sha256":"d2760bee2eaf5f1d3aee1d9584ff7093cfbbbf3c5a6db3b510bb3c3d9d9f07d5"},"schema_version":"1.0"},"canonical_sha256":"35e744a7dec3d5cf31f563fa7ca1936c3b536025f16a7eec1b4c455530210c9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:06.994589Z","signature_b64":"zT8QXyMgowsXbRjjq8QLVmCW26Z/nUL1ldA64C7E6pSTHPEl0XYZVsxveUdrwGKRRmCHNRLQxGWIuFlpqgF/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35e744a7dec3d5cf31f563fa7ca1936c3b536025f16a7eec1b4c455530210c9d","last_reissued_at":"2026-05-18T01:37:06.993852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:06.993852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02323","source_version":1,"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:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxmE2GxcBR2Hj/UYkepj6weyep2eHva3fiDeVwa0V7eNhE+WTGBicFkaS9tFC1YyW4jQjdSNekUhcUc6bc3lDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:33:13.620138Z"},"content_sha256":"1dd20b1276b03c768c709daf64c8823467ab06a10a627bcc8984afbfd7062d1a","schema_version":"1.0","event_id":"sha256:1dd20b1276b03c768c709daf64c8823467ab06a10a627bcc8984afbfd7062d1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GXTUJJ66YPK46MPVMP5HZIMTNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multisection in the Stochastic Block Model using Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.DS","authors_text":"Afonso S. Bandeira, Alexandra Kolla, Konstantinos Koiliaris, Naman Agarwal","submitted_at":"2015-07-08T22:02:45Z","abstract_excerpt":"We consider the problem of identifying underlying community-like structures in graphs. Towards this end we study the Stochastic Block Model (SBM) on $k$-clusters: a random model on $n=km$ vertices, partitioned in $k$ equal sized clusters, with edges sampled independently across clusters with probability $q$ and within clusters with probability $p$, $p>q$. The goal is to recover the initial \"hidden\" partition of $[n]$. We study semidefinite programming (SDP) based algorithms in this context. In the regime $p = \\frac{\\alpha \\log(m)}{m}$ and $q = \\frac{\\beta \\log(m)}{m}$ we show that a certain na"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02323","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"},"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:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFNo+exxECtho/jJBwkqnuTcX1JrrFEPSsTC71ic5Id4S9VnzO/vMLQoXDzSXgRUoCtN4jNm12GKAli43v99Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:33:13.620511Z"},"content_sha256":"78f4c2e0c346ea62fa5b2c5d38dccf9ccb8405d1b6c98c5767eef9418d983715","schema_version":"1.0","event_id":"sha256:78f4c2e0c346ea62fa5b2c5d38dccf9ccb8405d1b6c98c5767eef9418d983715"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXTUJJ66YPK46MPVMP5HZIMTNQ/bundle.json","state_url":"https://pith.science/pith/GXTUJJ66YPK46MPVMP5HZIMTNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXTUJJ66YPK46MPVMP5HZIMTNQ/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-05-28T13:33:13Z","links":{"resolver":"https://pith.science/pith/GXTUJJ66YPK46MPVMP5HZIMTNQ","bundle":"https://pith.science/pith/GXTUJJ66YPK46MPVMP5HZIMTNQ/bundle.json","state":"https://pith.science/pith/GXTUJJ66YPK46MPVMP5HZIMTNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXTUJJ66YPK46MPVMP5HZIMTNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GXTUJJ66YPK46MPVMP5HZIMTNQ","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":"d2760bee2eaf5f1d3aee1d9584ff7093cfbbbf3c5a6db3b510bb3c3d9d9f07d5","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T22:02:45Z","title_canon_sha256":"babedb1429da0ecbba4121cee056020c3c579d8f07073a737eded682923abb36"},"schema_version":"1.0","source":{"id":"1507.02323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02323","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02323v1","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02323","created_at":"2026-05-18T01:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"GXTUJJ66YPK4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GXTUJJ66YPK46MPV","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GXTUJJ66","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:78f4c2e0c346ea62fa5b2c5d38dccf9ccb8405d1b6c98c5767eef9418d983715","target":"graph","created_at":"2026-05-18T01:37:06Z","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":"We consider the problem of identifying underlying community-like structures in graphs. Towards this end we study the Stochastic Block Model (SBM) on $k$-clusters: a random model on $n=km$ vertices, partitioned in $k$ equal sized clusters, with edges sampled independently across clusters with probability $q$ and within clusters with probability $p$, $p>q$. The goal is to recover the initial \"hidden\" partition of $[n]$. We study semidefinite programming (SDP) based algorithms in this context. In the regime $p = \\frac{\\alpha \\log(m)}{m}$ and $q = \\frac{\\beta \\log(m)}{m}$ we show that a certain na","authors_text":"Afonso S. Bandeira, Alexandra Kolla, Konstantinos Koiliaris, Naman Agarwal","cross_cats":["math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T22:02:45Z","title":"Multisection in the Stochastic Block Model using Semidefinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02323","kind":"arxiv","version":1},"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:1dd20b1276b03c768c709daf64c8823467ab06a10a627bcc8984afbfd7062d1a","target":"record","created_at":"2026-05-18T01:37:06Z","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":"d2760bee2eaf5f1d3aee1d9584ff7093cfbbbf3c5a6db3b510bb3c3d9d9f07d5","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T22:02:45Z","title_canon_sha256":"babedb1429da0ecbba4121cee056020c3c579d8f07073a737eded682923abb36"},"schema_version":"1.0","source":{"id":"1507.02323","kind":"arxiv","version":1}},"canonical_sha256":"35e744a7dec3d5cf31f563fa7ca1936c3b536025f16a7eec1b4c455530210c9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35e744a7dec3d5cf31f563fa7ca1936c3b536025f16a7eec1b4c455530210c9d","first_computed_at":"2026-05-18T01:37:06.993852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:06.993852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zT8QXyMgowsXbRjjq8QLVmCW26Z/nUL1ldA64C7E6pSTHPEl0XYZVsxveUdrwGKRRmCHNRLQxGWIuFlpqgF/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:06.994589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dd20b1276b03c768c709daf64c8823467ab06a10a627bcc8984afbfd7062d1a","sha256:78f4c2e0c346ea62fa5b2c5d38dccf9ccb8405d1b6c98c5767eef9418d983715"],"state_sha256":"2f070b65802d2522c90465115443cd745d21e2c14af01bea6b65963f970034d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxMGzFyVir6OtsXdyNYSXHMVZIkQkrSOBriHNIlCEzjGGi3CIhPlpbLkZEVVlWP6U7hzibzI85gYBL4VHirJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:33:13.622458Z","bundle_sha256":"68a1beb83d1d433337ddfb9400d8f1aab5e75937af4f314663622c5ca2d30f77"}}