{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XICGD4GZAZWYN772AKU23I4IB7","short_pith_number":"pith:XICGD4GZ","canonical_record":{"source":{"id":"1510.05956","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-20T16:47:27Z","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"title_canon_sha256":"96b4b37a4d4d262137703e0c1684662db48b39738dded25f9b9cc9117dd4fc4a","abstract_canon_sha256":"491c1b5b07e44a2e45b2b72d33a19eacc1782757a6fd9b148ff4770623f501c9"},"schema_version":"1.0"},"canonical_sha256":"ba0461f0d9066d86fffa02a9ada3880ffe908697123beaa8cef08828b657e006","source":{"kind":"arxiv","id":"1510.05956","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05956","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05956v6","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05956","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"XICGD4GZAZWY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XICGD4GZAZWYN772","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XICGD4GZ","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XICGD4GZAZWYN772AKU23I4IB7","target":"record","payload":{"canonical_record":{"source":{"id":"1510.05956","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-20T16:47:27Z","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"title_canon_sha256":"96b4b37a4d4d262137703e0c1684662db48b39738dded25f9b9cc9117dd4fc4a","abstract_canon_sha256":"491c1b5b07e44a2e45b2b72d33a19eacc1782757a6fd9b148ff4770623f501c9"},"schema_version":"1.0"},"canonical_sha256":"ba0461f0d9066d86fffa02a9ada3880ffe908697123beaa8cef08828b657e006","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:17.754596Z","signature_b64":"BEx2E2Q+hWlSMMNhslWE6tUrfQJLQ4N4TpTmuUtaVkfWUPPPSWNWSVHrBNgZRVCvcLRdjpmRu/qaFoCFmZW8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba0461f0d9066d86fffa02a9ada3880ffe908697123beaa8cef08828b657e006","last_reissued_at":"2026-05-18T01:14:17.753979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:17.753979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.05956","source_version":6,"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:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LG362p29oWKhBj4rNlsxKXALu0PAADQH7wnxi7UZIzgsKkqbxbBNfg96a21mUk31yPl54imhpwYafAezHMOMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:15:20.877161Z"},"content_sha256":"e4a5ec1d378dc8a7d9e5839d86f3f6be351279acd34ed51ba06580adbd2ee600","schema_version":"1.0","event_id":"sha256:e4a5ec1d378dc8a7d9e5839d86f3f6be351279acd34ed51ba06580adbd2ee600"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XICGD4GZAZWYN772AKU23I4IB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Cluster Recovery in the Labeled Stochastic Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","stat.ML"],"primary_cat":"math.PR","authors_text":"Alexandre Proutiere, Se-Young Yun","submitted_at":"2015-10-20T16:47:27Z","abstract_excerpt":"We consider the problem of community detection or clustering in the labeled Stochastic Block Model (LSBM) with a finite number $K$ of clusters of sizes linearly growing with the global population of items $n$. Every pair of items is labeled independently at random, and label $\\ell$ appears with probability $p(i,j,\\ell)$ between two items in clusters indexed by $i$ and $j$, respectively. The objective is to reconstruct the clusters from the observation of these random labels.\n  Clustering under the SBM and their extensions has attracted much attention recently. Most existing work aimed at chara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05956","kind":"arxiv","version":6},"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:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaqC3DNGrWd9l8L0j611yD9GcA5QrZlH7prVLKfR4iyF2is7YZ9gbxv8RsrvNqNWTU2JjFLg9N6oRRSaJs/WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:15:20.877530Z"},"content_sha256":"bbc18206eaa9d1036c9e2f966e900ebb28b7856a605d974231c28f98cb8d500b","schema_version":"1.0","event_id":"sha256:bbc18206eaa9d1036c9e2f966e900ebb28b7856a605d974231c28f98cb8d500b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XICGD4GZAZWYN772AKU23I4IB7/bundle.json","state_url":"https://pith.science/pith/XICGD4GZAZWYN772AKU23I4IB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XICGD4GZAZWYN772AKU23I4IB7/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-27T01:15:20Z","links":{"resolver":"https://pith.science/pith/XICGD4GZAZWYN772AKU23I4IB7","bundle":"https://pith.science/pith/XICGD4GZAZWYN772AKU23I4IB7/bundle.json","state":"https://pith.science/pith/XICGD4GZAZWYN772AKU23I4IB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XICGD4GZAZWYN772AKU23I4IB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XICGD4GZAZWYN772AKU23I4IB7","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":"491c1b5b07e44a2e45b2b72d33a19eacc1782757a6fd9b148ff4770623f501c9","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-20T16:47:27Z","title_canon_sha256":"96b4b37a4d4d262137703e0c1684662db48b39738dded25f9b9cc9117dd4fc4a"},"schema_version":"1.0","source":{"id":"1510.05956","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05956","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05956v6","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05956","created_at":"2026-05-18T01:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"XICGD4GZAZWY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XICGD4GZAZWYN772","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XICGD4GZ","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:bbc18206eaa9d1036c9e2f966e900ebb28b7856a605d974231c28f98cb8d500b","target":"graph","created_at":"2026-05-18T01:14:17Z","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 community detection or clustering in the labeled Stochastic Block Model (LSBM) with a finite number $K$ of clusters of sizes linearly growing with the global population of items $n$. Every pair of items is labeled independently at random, and label $\\ell$ appears with probability $p(i,j,\\ell)$ between two items in clusters indexed by $i$ and $j$, respectively. The objective is to reconstruct the clusters from the observation of these random labels.\n  Clustering under the SBM and their extensions has attracted much attention recently. Most existing work aimed at chara","authors_text":"Alexandre Proutiere, Se-Young Yun","cross_cats":["cs.LG","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-20T16:47:27Z","title":"Optimal Cluster Recovery in the Labeled Stochastic Block Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05956","kind":"arxiv","version":6},"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:e4a5ec1d378dc8a7d9e5839d86f3f6be351279acd34ed51ba06580adbd2ee600","target":"record","created_at":"2026-05-18T01:14:17Z","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":"491c1b5b07e44a2e45b2b72d33a19eacc1782757a6fd9b148ff4770623f501c9","cross_cats_sorted":["cs.LG","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-10-20T16:47:27Z","title_canon_sha256":"96b4b37a4d4d262137703e0c1684662db48b39738dded25f9b9cc9117dd4fc4a"},"schema_version":"1.0","source":{"id":"1510.05956","kind":"arxiv","version":6}},"canonical_sha256":"ba0461f0d9066d86fffa02a9ada3880ffe908697123beaa8cef08828b657e006","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba0461f0d9066d86fffa02a9ada3880ffe908697123beaa8cef08828b657e006","first_computed_at":"2026-05-18T01:14:17.753979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:17.753979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BEx2E2Q+hWlSMMNhslWE6tUrfQJLQ4N4TpTmuUtaVkfWUPPPSWNWSVHrBNgZRVCvcLRdjpmRu/qaFoCFmZW8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:17.754596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05956","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4a5ec1d378dc8a7d9e5839d86f3f6be351279acd34ed51ba06580adbd2ee600","sha256:bbc18206eaa9d1036c9e2f966e900ebb28b7856a605d974231c28f98cb8d500b"],"state_sha256":"78b372e1c60e15ac0ed5d044fec21328422bf1054db3829377c7ce5fffce746f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xN2u0uF8doZC7EHkJP/WyCYsb0sLed66DNed/B2k6SlD92n2XljuCAhxo82bEs582wNa5sUQg5XVkZwmwX3PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:15:20.880019Z","bundle_sha256":"0abf7b44a9e5ae275d1b7176fdd17994142af2c8cb885e4a7fe5cec122a5a180"}}