{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NDJBOE5FAIEFYGAH473GKFON4O","short_pith_number":"pith:NDJBOE5F","canonical_record":{"source":{"id":"1601.02658","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T21:29:42Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d","abstract_canon_sha256":"f8fccd5468d64d4b9c9b3675933be21f31fef4b6ade994955b802ca25015db86"},"schema_version":"1.0"},"canonical_sha256":"68d21713a502085c1807e7f66515cde3b20479ef2e4828a49cf4cee41ba455ed","source":{"kind":"arxiv","id":"1601.02658","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02658","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02658v4","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02658","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"NDJBOE5FAIEF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NDJBOE5FAIEFYGAH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NDJBOE5F","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NDJBOE5FAIEFYGAH473GKFON4O","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02658","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T21:29:42Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d","abstract_canon_sha256":"f8fccd5468d64d4b9c9b3675933be21f31fef4b6ade994955b802ca25015db86"},"schema_version":"1.0"},"canonical_sha256":"68d21713a502085c1807e7f66515cde3b20479ef2e4828a49cf4cee41ba455ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:29.310102Z","signature_b64":"VjQyvUD7xBtHNaaX7VHqfdgPjbBlTfgBXtnpBJeTGpb71aJb6jGF1qxmQOTmuoWFe/dp8lu3ohfLAVwBTt6xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68d21713a502085c1807e7f66515cde3b20479ef2e4828a49cf4cee41ba455ed","last_reissued_at":"2026-05-18T01:16:29.309595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:29.309595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02658","source_version":4,"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:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+U6hKidhzmOOPuY9zR6dlaUehOlPwVMy1d9kY1Mo1VSbiHUg5wYSvJ+rQNPxTAs4X5zu9DknibCOPh7MAh5tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:21:23.763808Z"},"content_sha256":"259ec602ef317b0bc6706a035903c9ea2b8b3421e958fa795042bda9236f3810","schema_version":"1.0","event_id":"sha256:259ec602ef317b0bc6706a035903c9ea2b8b3421e958fa795042bda9236f3810"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NDJBOE5FAIEFYGAH473GKFON4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-theoretic thresholds for community detection in sparse networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"primary_cat":"math.PR","authors_text":"Cristopher Moore, Jess Banks","submitted_at":"2016-01-11T21:29:42Z","abstract_excerpt":"We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, let $k$ be the number of groups, $d$ be the average degree, the probability of edges between vertices within and between groups be $c_\\mathrm{in}/n$ and $c_\\mathrm{out}/n$ respectively, and let $\\lambda = (c_\\mathrm{in}-c_\\mathrm{out})/(kd)$. We show that, when $k$ is large, and $\\lambda = O(1/k)$, the critical value of $d$ at which community detection becomes possible -- in physical terms, the condensation threshold -- is \\[ d_c = \\Theta\\!\\left( \\frac{\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02658","kind":"arxiv","version":4},"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:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kTK67bj3IYpIpU8I5Hh+f4QcuuQlkRAHO6Z2yUFsMz1/voMnCd2ce+UrrKJckldN2cMmTWsrnBdI7o6EbZ9uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:21:23.764520Z"},"content_sha256":"cecd41aec15030b4d1cfb683098df6824ce6a89be6333e95493d578b16a0b4a5","schema_version":"1.0","event_id":"sha256:cecd41aec15030b4d1cfb683098df6824ce6a89be6333e95493d578b16a0b4a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDJBOE5FAIEFYGAH473GKFON4O/bundle.json","state_url":"https://pith.science/pith/NDJBOE5FAIEFYGAH473GKFON4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDJBOE5FAIEFYGAH473GKFON4O/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-27T14:21:23Z","links":{"resolver":"https://pith.science/pith/NDJBOE5FAIEFYGAH473GKFON4O","bundle":"https://pith.science/pith/NDJBOE5FAIEFYGAH473GKFON4O/bundle.json","state":"https://pith.science/pith/NDJBOE5FAIEFYGAH473GKFON4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDJBOE5FAIEFYGAH473GKFON4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NDJBOE5FAIEFYGAH473GKFON4O","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":"f8fccd5468d64d4b9c9b3675933be21f31fef4b6ade994955b802ca25015db86","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T21:29:42Z","title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d"},"schema_version":"1.0","source":{"id":"1601.02658","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02658","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02658v4","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02658","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"NDJBOE5FAIEF","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NDJBOE5FAIEFYGAH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NDJBOE5F","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:cecd41aec15030b4d1cfb683098df6824ce6a89be6333e95493d578b16a0b4a5","target":"graph","created_at":"2026-05-18T01:16:29Z","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 give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, let $k$ be the number of groups, $d$ be the average degree, the probability of edges between vertices within and between groups be $c_\\mathrm{in}/n$ and $c_\\mathrm{out}/n$ respectively, and let $\\lambda = (c_\\mathrm{in}-c_\\mathrm{out})/(kd)$. We show that, when $k$ is large, and $\\lambda = O(1/k)$, the critical value of $d$ at which community detection becomes possible -- in physical terms, the condensation threshold -- is \\[ d_c = \\Theta\\!\\left( \\frac{\\log","authors_text":"Cristopher Moore, Jess Banks","cross_cats":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T21:29:42Z","title":"Information-theoretic thresholds for community detection in sparse networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02658","kind":"arxiv","version":4},"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:259ec602ef317b0bc6706a035903c9ea2b8b3421e958fa795042bda9236f3810","target":"record","created_at":"2026-05-18T01:16:29Z","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":"f8fccd5468d64d4b9c9b3675933be21f31fef4b6ade994955b802ca25015db86","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-11T21:29:42Z","title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d"},"schema_version":"1.0","source":{"id":"1601.02658","kind":"arxiv","version":4}},"canonical_sha256":"68d21713a502085c1807e7f66515cde3b20479ef2e4828a49cf4cee41ba455ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68d21713a502085c1807e7f66515cde3b20479ef2e4828a49cf4cee41ba455ed","first_computed_at":"2026-05-18T01:16:29.309595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:29.309595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VjQyvUD7xBtHNaaX7VHqfdgPjbBlTfgBXtnpBJeTGpb71aJb6jGF1qxmQOTmuoWFe/dp8lu3ohfLAVwBTt6xDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:29.310102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02658","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:259ec602ef317b0bc6706a035903c9ea2b8b3421e958fa795042bda9236f3810","sha256:cecd41aec15030b4d1cfb683098df6824ce6a89be6333e95493d578b16a0b4a5"],"state_sha256":"f954aa5dece0ee68f52ab134702b08d442ea291ab48cbfb066e907f9c3530741"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNy8jPYjKwMo5djIRtNJzuMM97KBcLoI2YXuCguLfCAOhbqxlLzMt5RtK9e3/Kje2sjgpedIjWX9OVYwx9l8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:21:23.768423Z","bundle_sha256":"42bae60534f0d4a0f43b084e94186da94fe9aab2999426d9d36c5fb8bd85b86c"}}