{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7XXT7CZROZTCRUIZQ2GOMHXID2","short_pith_number":"pith:7XXT7CZR","canonical_record":{"source":{"id":"1505.03772","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-14T15:59:00Z","cross_cats_sorted":["cs.SI","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"dd805a74cf5689b504a3828c73fc8cbe5e61069f79b34587f7c28b0467351c06","abstract_canon_sha256":"cce0288bb8e08aec8e249ef51697d203d8718cdf5b6a6c0be389718a16c7abd8"},"schema_version":"1.0"},"canonical_sha256":"fdef3f8b31766628d119868ce61ee81e83719e1b1f6ae15171e97614066ee2c8","source":{"kind":"arxiv","id":"1505.03772","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03772","created_at":"2026-05-18T01:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03772v5","created_at":"2026-05-18T01:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03772","created_at":"2026-05-18T01:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"7XXT7CZROZTC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7XXT7CZROZTCRUIZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7XXT7CZR","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7XXT7CZROZTCRUIZQ2GOMHXID2","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03772","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-14T15:59:00Z","cross_cats_sorted":["cs.SI","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"dd805a74cf5689b504a3828c73fc8cbe5e61069f79b34587f7c28b0467351c06","abstract_canon_sha256":"cce0288bb8e08aec8e249ef51697d203d8718cdf5b6a6c0be389718a16c7abd8"},"schema_version":"1.0"},"canonical_sha256":"fdef3f8b31766628d119868ce61ee81e83719e1b1f6ae15171e97614066ee2c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:10.960679Z","signature_b64":"UwY5HJwOLoImeAmRom+YkGEonjQyq8xAMK5OrfBQWI7PkEO188MgV14q+pdsyYkraUPk/EFqXgX11wrmakxDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdef3f8b31766628d119868ce61ee81e83719e1b1f6ae15171e97614066ee2c8","last_reissued_at":"2026-05-18T01:31:10.958883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:10.958883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03772","source_version":5,"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:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfb10AFlnEQgvXSJC4MbiFQlnMHS7pwufp0l8RjFKZ/gu3H/+pDS7A66ecMKva2AYkCeBGAWiV3nRfrX81QFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:31:39.910973Z"},"content_sha256":"6e88813d7a097d89aab01a7b61726345c8c404f3f6d1be669ef91598cb59df34","schema_version":"1.0","event_id":"sha256:6e88813d7a097d89aab01a7b61726345c8c404f3f6d1be669ef91598cb59df34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7XXT7CZROZTCRUIZQ2GOMHXID2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Optimal Misclassification Proportion in Stochastic Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Anderson Y. Zhang, Chao Gao, Harrison H. Zhou, Zongming Ma","submitted_at":"2015-05-14T15:59:00Z","abstract_excerpt":"Community detection is a fundamental statistical problem in network data analysis. Many algorithms have been proposed to tackle this problem. Most of these algorithms are not guaranteed to achieve the statistical optimality of the problem, while procedures that achieve information theoretic limits for general parameter spaces are not computationally tractable. In this paper, we present a computationally feasible two-stage method that achieves optimal statistical performance in misclassification proportion for stochastic block model under weak regularity conditions. Our two-stage procedure cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03772","kind":"arxiv","version":5},"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:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBwxNZkrVp/gXZpfFnvB+e1tn4DCTQjmSWen/+BntT/AoG1S/94PKaWUfJ3t0wk1aLF9wdU3W2SqIOALcsPyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:31:39.911585Z"},"content_sha256":"caf3191e295d782e4f086ad0d0de314b307bf16b30b9af17ffbe4a303e17a73f","schema_version":"1.0","event_id":"sha256:caf3191e295d782e4f086ad0d0de314b307bf16b30b9af17ffbe4a303e17a73f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XXT7CZROZTCRUIZQ2GOMHXID2/bundle.json","state_url":"https://pith.science/pith/7XXT7CZROZTCRUIZQ2GOMHXID2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XXT7CZROZTCRUIZQ2GOMHXID2/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-06T22:31:39Z","links":{"resolver":"https://pith.science/pith/7XXT7CZROZTCRUIZQ2GOMHXID2","bundle":"https://pith.science/pith/7XXT7CZROZTCRUIZQ2GOMHXID2/bundle.json","state":"https://pith.science/pith/7XXT7CZROZTCRUIZQ2GOMHXID2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XXT7CZROZTCRUIZQ2GOMHXID2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7XXT7CZROZTCRUIZQ2GOMHXID2","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":"cce0288bb8e08aec8e249ef51697d203d8718cdf5b6a6c0be389718a16c7abd8","cross_cats_sorted":["cs.SI","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-14T15:59:00Z","title_canon_sha256":"dd805a74cf5689b504a3828c73fc8cbe5e61069f79b34587f7c28b0467351c06"},"schema_version":"1.0","source":{"id":"1505.03772","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03772","created_at":"2026-05-18T01:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03772v5","created_at":"2026-05-18T01:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03772","created_at":"2026-05-18T01:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"7XXT7CZROZTC","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7XXT7CZROZTCRUIZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7XXT7CZR","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:caf3191e295d782e4f086ad0d0de314b307bf16b30b9af17ffbe4a303e17a73f","target":"graph","created_at":"2026-05-18T01:31:10Z","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":"Community detection is a fundamental statistical problem in network data analysis. Many algorithms have been proposed to tackle this problem. Most of these algorithms are not guaranteed to achieve the statistical optimality of the problem, while procedures that achieve information theoretic limits for general parameter spaces are not computationally tractable. In this paper, we present a computationally feasible two-stage method that achieves optimal statistical performance in misclassification proportion for stochastic block model under weak regularity conditions. Our two-stage procedure cons","authors_text":"Anderson Y. Zhang, Chao Gao, Harrison H. Zhou, Zongming Ma","cross_cats":["cs.SI","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-14T15:59:00Z","title":"Achieving Optimal Misclassification Proportion in Stochastic Block Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03772","kind":"arxiv","version":5},"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:6e88813d7a097d89aab01a7b61726345c8c404f3f6d1be669ef91598cb59df34","target":"record","created_at":"2026-05-18T01:31:10Z","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":"cce0288bb8e08aec8e249ef51697d203d8718cdf5b6a6c0be389718a16c7abd8","cross_cats_sorted":["cs.SI","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-14T15:59:00Z","title_canon_sha256":"dd805a74cf5689b504a3828c73fc8cbe5e61069f79b34587f7c28b0467351c06"},"schema_version":"1.0","source":{"id":"1505.03772","kind":"arxiv","version":5}},"canonical_sha256":"fdef3f8b31766628d119868ce61ee81e83719e1b1f6ae15171e97614066ee2c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdef3f8b31766628d119868ce61ee81e83719e1b1f6ae15171e97614066ee2c8","first_computed_at":"2026-05-18T01:31:10.958883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:10.958883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UwY5HJwOLoImeAmRom+YkGEonjQyq8xAMK5OrfBQWI7PkEO188MgV14q+pdsyYkraUPk/EFqXgX11wrmakxDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:10.960679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03772","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e88813d7a097d89aab01a7b61726345c8c404f3f6d1be669ef91598cb59df34","sha256:caf3191e295d782e4f086ad0d0de314b307bf16b30b9af17ffbe4a303e17a73f"],"state_sha256":"2018094ae4fd19072e43a97ecda493f8c9b079acc2f7ab15552aca9b3d5dae7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOkK3V9t6loQ6rzi9uHjFkttdU2L6WA/eY7Ww6tqeU9eKcOQkimr5qFzRUu/nNyR6k+C+YhQuOozwgAmpCKtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:31:39.914831Z","bundle_sha256":"c095f470141593bf215a2db2f990e3ff794706d60ad8fddeef3e9941115d0f2b"}}