{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WZPO2A7244KWT23GNQUPEGYAC3","short_pith_number":"pith:WZPO2A72","canonical_record":{"source":{"id":"1308.2955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-13T19:39:48Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"5e61d4eaabc5b6a9cd30f2ec86360b4baa5749a1662607b7f05e31c880046456","abstract_canon_sha256":"63dac17f46ac58e8968b60085b274234da88d71190922064d1e04896e38fe86f"},"schema_version":"1.0"},"canonical_sha256":"b65eed03fae71569eb666c28f21b0016ebfccfe1d81c566792cda82b440d48ce","source":{"kind":"arxiv","id":"1308.2955","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2955","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2955v2","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2955","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"WZPO2A7244KW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZPO2A7244KWT23G","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZPO2A72","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WZPO2A7244KWT23GNQUPEGYAC3","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-13T19:39:48Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"5e61d4eaabc5b6a9cd30f2ec86360b4baa5749a1662607b7f05e31c880046456","abstract_canon_sha256":"63dac17f46ac58e8968b60085b274234da88d71190922064d1e04896e38fe86f"},"schema_version":"1.0"},"canonical_sha256":"b65eed03fae71569eb666c28f21b0016ebfccfe1d81c566792cda82b440d48ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:59.715839Z","signature_b64":"yJ8nTNQoa1ZTnxSl4+SQz9KG0JyKNF8MhdBe8dMQ5mmf+LrOvd3YMzOsGyngqPmNdXk4L8+KQLQT3EGgTl5DDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b65eed03fae71569eb666c28f21b0016ebfccfe1d81c566792cda82b440d48ce","last_reissued_at":"2026-05-18T02:41:59.715420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:59.715420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2955","source_version":2,"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-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zG4EJKkmDB4kakK+neAbwG9YAwAfyrOzxUJ9fD/7p4M807He8oPYwAkXM3mmrxDR+Mj2w+ml3QjajRqzrO+pAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:16:49.577276Z"},"content_sha256":"cd1686232c34b55ac0c49034b1fcd48e784995d2f390b4e5deed1d1b313ae0b4","schema_version":"1.0","event_id":"sha256:cd1686232c34b55ac0c49034b1fcd48e784995d2f390b4e5deed1d1b313ae0b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WZPO2A7244KWT23GNQUPEGYAC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Community Detection in Sparse Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Ery Arias-Castro (Math Dept, Nicolas Verzelen (MISTEA), UCSD)","submitted_at":"2013-08-13T19:39:48Z","abstract_excerpt":"We consider the problem of detecting a tight community in a sparse random network. This is formalized as testing for the existence of a dense random subgraph in a random graph. Under the null hypothesis, the graph is a realization of an Erd\\\"os-R\\'enyi graph on $N$ vertices and with connection probability $p_0$; under the alternative, there is an unknown subgraph on $n$ vertices where the connection probability is p1 > p0. In Arias-Castro and Verzelen (2012), we focused on the asymptotically dense regime where p0 is large enough that np0>(n/N)^{o(1)}. We consider here the asymptotically sparse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2955","kind":"arxiv","version":2},"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-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+aPZGtvkxHiztr5TlDdg+xko0g37332cy0o0IWM8ZlBWHGzoZvmPQi5Lf+uPUGpphsEPgb8bWM475UoUqsyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:16:49.577646Z"},"content_sha256":"5575a82c90ecbd8b66aa52d58298a9f41b04b473d8536f5268791401bccc3370","schema_version":"1.0","event_id":"sha256:5575a82c90ecbd8b66aa52d58298a9f41b04b473d8536f5268791401bccc3370"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/bundle.json","state_url":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZPO2A7244KWT23GNQUPEGYAC3/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-31T07:16:49Z","links":{"resolver":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3","bundle":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/bundle.json","state":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZPO2A7244KWT23GNQUPEGYAC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WZPO2A7244KWT23GNQUPEGYAC3","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":"63dac17f46ac58e8968b60085b274234da88d71190922064d1e04896e38fe86f","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-13T19:39:48Z","title_canon_sha256":"5e61d4eaabc5b6a9cd30f2ec86360b4baa5749a1662607b7f05e31c880046456"},"schema_version":"1.0","source":{"id":"1308.2955","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2955","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2955v2","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2955","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"WZPO2A7244KW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WZPO2A7244KWT23G","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WZPO2A72","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:5575a82c90ecbd8b66aa52d58298a9f41b04b473d8536f5268791401bccc3370","target":"graph","created_at":"2026-05-18T02:41:59Z","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 detecting a tight community in a sparse random network. This is formalized as testing for the existence of a dense random subgraph in a random graph. Under the null hypothesis, the graph is a realization of an Erd\\\"os-R\\'enyi graph on $N$ vertices and with connection probability $p_0$; under the alternative, there is an unknown subgraph on $n$ vertices where the connection probability is p1 > p0. In Arias-Castro and Verzelen (2012), we focused on the asymptotically dense regime where p0 is large enough that np0>(n/N)^{o(1)}. We consider here the asymptotically sparse","authors_text":"Ery Arias-Castro (Math Dept, Nicolas Verzelen (MISTEA), UCSD)","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-13T19:39:48Z","title":"Community Detection in Sparse Random Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2955","kind":"arxiv","version":2},"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:cd1686232c34b55ac0c49034b1fcd48e784995d2f390b4e5deed1d1b313ae0b4","target":"record","created_at":"2026-05-18T02:41:59Z","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":"63dac17f46ac58e8968b60085b274234da88d71190922064d1e04896e38fe86f","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-08-13T19:39:48Z","title_canon_sha256":"5e61d4eaabc5b6a9cd30f2ec86360b4baa5749a1662607b7f05e31c880046456"},"schema_version":"1.0","source":{"id":"1308.2955","kind":"arxiv","version":2}},"canonical_sha256":"b65eed03fae71569eb666c28f21b0016ebfccfe1d81c566792cda82b440d48ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b65eed03fae71569eb666c28f21b0016ebfccfe1d81c566792cda82b440d48ce","first_computed_at":"2026-05-18T02:41:59.715420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:59.715420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJ8nTNQoa1ZTnxSl4+SQz9KG0JyKNF8MhdBe8dMQ5mmf+LrOvd3YMzOsGyngqPmNdXk4L8+KQLQT3EGgTl5DDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:59.715839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2955","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd1686232c34b55ac0c49034b1fcd48e784995d2f390b4e5deed1d1b313ae0b4","sha256:5575a82c90ecbd8b66aa52d58298a9f41b04b473d8536f5268791401bccc3370"],"state_sha256":"c513a2262d9e7bbdb900335bef6942626acded1357986184db5d0f7f5a7ee6ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hN8P5+nqpjlWzS+Ul1DbZaUBpWmtpDFJGB/H/GpCOVqP9lRixfxBtNxqjN92gQ54e2HEitkhrgVpfnzMJu7pAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:16:49.579891Z","bundle_sha256":"817151de5365e256c404c8f518a6f878489656eb0147065647d0b402d57f162f"}}