{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GEHO2OPIHPJOZAWBRH27G6KLUF","short_pith_number":"pith:GEHO2OPI","canonical_record":{"source":{"id":"1607.01760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T19:42:06Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d","abstract_canon_sha256":"6583d7b46db2840ff5a6d385227653dcb2a0bc88e84a1c27f8121319c0d95bff"},"schema_version":"1.0"},"canonical_sha256":"310eed39e83bd2ec82c189f5f3794ba16cbf6bcfb2bd2ff11603f69fdd02ef40","source":{"kind":"arxiv","id":"1607.01760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01760","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01760v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01760","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"GEHO2OPIHPJO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GEHO2OPIHPJOZAWB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GEHO2OPI","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GEHO2OPIHPJOZAWBRH27G6KLUF","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-07-06T19:42:06Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.IT","cs.SI","math.IT"],"title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d","abstract_canon_sha256":"6583d7b46db2840ff5a6d385227653dcb2a0bc88e84a1c27f8121319c0d95bff"},"schema_version":"1.0"},"canonical_sha256":"310eed39e83bd2ec82c189f5f3794ba16cbf6bcfb2bd2ff11603f69fdd02ef40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.553910Z","signature_b64":"Bloktf27iUX6Fys5bFi84wysNUivplicp3xL6BNCSLNyPpk1XRo46K4h5f0/Wg4Udo47JotY0lTXrTaDMDLXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"310eed39e83bd2ec82c189f5f3794ba16cbf6bcfb2bd2ff11603f69fdd02ef40","last_reissued_at":"2026-05-18T01:11:25.553156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.553156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01760","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmmtntckrfRx/RuOffUYo2tuCfDNsrAo67ny/g1m8hL4T3uMzJ9CAXjvme6H8xfpbayCEDKyIfWMc2k0DudZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:55:45.398086Z"},"content_sha256":"0eecf96689ba67dce95d45c289be294890b8db9c264969388662930e110947ba","schema_version":"1.0","event_id":"sha256:0eecf96689ba67dce95d45c289be294890b8db9c264969388662930e110947ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GEHO2OPIHPJOZAWBRH27G6KLUF","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, Joe Neeman, Praneeth Netrapalli","submitted_at":"2016-07-06T19:42:06Z","abstract_excerpt":"We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, consider the symmetric stochastic block model with $q$ groups, average degree $d$, and connection probabilities $c_\\text{in}/n$ and $c_\\text{out}/n$ for within-group and between-group edges respectively; let $\\lambda = (c_\\text{in}-c_\\text{out})/(qd)$. We show that, when $q$ is large, and $\\lambda = O(1/q)$, the critical value of $d$ at which community detection becomes possible---in physical terms, the condensation threshold---is \\[ d_\\text{c} = \\Theta\\!\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01760","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6evTU6iyyfvlLUbd+oik8jQGcsXM118sBcy12WrUHgK36AJg3FwuNSIVir8AsMXb3u6DLkKduHF0ngaykkwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:55:45.398508Z"},"content_sha256":"06b0b406dea85a19f937be27931c4e29a24a46a0cd84014917afeba77b30de57","schema_version":"1.0","event_id":"sha256:06b0b406dea85a19f937be27931c4e29a24a46a0cd84014917afeba77b30de57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEHO2OPIHPJOZAWBRH27G6KLUF/bundle.json","state_url":"https://pith.science/pith/GEHO2OPIHPJOZAWBRH27G6KLUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEHO2OPIHPJOZAWBRH27G6KLUF/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-27T04:55:45Z","links":{"resolver":"https://pith.science/pith/GEHO2OPIHPJOZAWBRH27G6KLUF","bundle":"https://pith.science/pith/GEHO2OPIHPJOZAWBRH27G6KLUF/bundle.json","state":"https://pith.science/pith/GEHO2OPIHPJOZAWBRH27G6KLUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEHO2OPIHPJOZAWBRH27G6KLUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GEHO2OPIHPJOZAWBRH27G6KLUF","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":"6583d7b46db2840ff5a6d385227653dcb2a0bc88e84a1c27f8121319c0d95bff","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-07-06T19:42:06Z","title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d"},"schema_version":"1.0","source":{"id":"1607.01760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01760","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01760v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01760","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"GEHO2OPIHPJO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GEHO2OPIHPJOZAWB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GEHO2OPI","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:06b0b406dea85a19f937be27931c4e29a24a46a0cd84014917afeba77b30de57","target":"graph","created_at":"2026-05-18T01:11:25Z","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, consider the symmetric stochastic block model with $q$ groups, average degree $d$, and connection probabilities $c_\\text{in}/n$ and $c_\\text{out}/n$ for within-group and between-group edges respectively; let $\\lambda = (c_\\text{in}-c_\\text{out})/(qd)$. We show that, when $q$ is large, and $\\lambda = O(1/q)$, the critical value of $d$ at which community detection becomes possible---in physical terms, the condensation threshold---is \\[ d_\\text{c} = \\Theta\\!\\l","authors_text":"Cristopher Moore, Jess Banks, Joe Neeman, Praneeth Netrapalli","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-07-06T19:42:06Z","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":"1607.01760","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:0eecf96689ba67dce95d45c289be294890b8db9c264969388662930e110947ba","target":"record","created_at":"2026-05-18T01:11:25Z","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":"6583d7b46db2840ff5a6d385227653dcb2a0bc88e84a1c27f8121319c0d95bff","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-07-06T19:42:06Z","title_canon_sha256":"d6126ed9aa988d677b07790a601401039c1d635904281706bbb765cdeac27b3d"},"schema_version":"1.0","source":{"id":"1607.01760","kind":"arxiv","version":1}},"canonical_sha256":"310eed39e83bd2ec82c189f5f3794ba16cbf6bcfb2bd2ff11603f69fdd02ef40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"310eed39e83bd2ec82c189f5f3794ba16cbf6bcfb2bd2ff11603f69fdd02ef40","first_computed_at":"2026-05-18T01:11:25.553156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:25.553156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bloktf27iUX6Fys5bFi84wysNUivplicp3xL6BNCSLNyPpk1XRo46K4h5f0/Wg4Udo47JotY0lTXrTaDMDLXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:25.553910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eecf96689ba67dce95d45c289be294890b8db9c264969388662930e110947ba","sha256:06b0b406dea85a19f937be27931c4e29a24a46a0cd84014917afeba77b30de57"],"state_sha256":"811f6c5e9b42b464e08f00e5ba88eff8d2c00ed97370de9557c19756af208a1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2EpwfqR51T2tIFQONjdP4f2NHJNdN9j8csLamdfyZc9MXLp/LXT2U0SGm12DCfRkMVq+qGZ6PeIoTyOErA1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:55:45.401584Z","bundle_sha256":"998503ca16407102205e3368752b5d8837c374dc1a1ee606f95f4ba72a4af87c"}}