{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VODYH2SXH6UBVGNJDL3FQ4EULV","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":"6686efaf028cff87f98bf1a2e82ae8e4b9e5ad47960606d36ca800878c279c97","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-02-28T07:04:35Z","title_canon_sha256":"cab67d2753a70a40618181a8d211483f634f6029a03fe88b72e8ccd7f9ff41ae"},"schema_version":"1.0","source":{"id":"1302.7099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.7099","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1302.7099v1","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7099","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"VODYH2SXH6UB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VODYH2SXH6UBVGNJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VODYH2SX","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:e201450b0a762a643d88305ad0094c00754a2002f3d24b5a2f33ad3c4c71055e","target":"graph","created_at":"2026-05-18T03:32: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 formalize the problem of detecting a community in a network into testing whether in a given (random) graph there is a subgraph that is unusually dense. We observe an undirected and unweighted graph on N nodes. Under the null hypothesis, the graph is a realization of an Erd\\\"os-R\\'enyi graph with probability p0. Under the (composite) alternative, there is a subgraph of n nodes where the probability of connection is p1 > p0. We derive a detection lower bound for detecting such a subgraph in terms of N, n, p0, p1 and exhibit a test that achieves that lower bound. We do this both when p0 is kno","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-02-28T07:04:35Z","title":"Community Detection in Random Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7099","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:e9053559b91f228034ac7b3806abb59eaf27dc41a483d3c24a7480c1b827cc0b","target":"record","created_at":"2026-05-18T03:32: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":"6686efaf028cff87f98bf1a2e82ae8e4b9e5ad47960606d36ca800878c279c97","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-02-28T07:04:35Z","title_canon_sha256":"cab67d2753a70a40618181a8d211483f634f6029a03fe88b72e8ccd7f9ff41ae"},"schema_version":"1.0","source":{"id":"1302.7099","kind":"arxiv","version":1}},"canonical_sha256":"ab8783ea573fa81a99a91af65870945d5cdd9522330f9a235a0654b242378dd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab8783ea573fa81a99a91af65870945d5cdd9522330f9a235a0654b242378dd1","first_computed_at":"2026-05-18T03:32:17.440900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:17.440900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNS52Wr3SKVP3GyrblMP9txh2z3gtEKtBGrLvfoBWrUvau90yjCzqRl7iLOwqiKpdmcsGWNU8pzV8VE+TEIBBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:17.441824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.7099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9053559b91f228034ac7b3806abb59eaf27dc41a483d3c24a7480c1b827cc0b","sha256:e201450b0a762a643d88305ad0094c00754a2002f3d24b5a2f33ad3c4c71055e"],"state_sha256":"d023eb1e976835196cf025fb88083626161b2e90a4a26304ad297036d223c735"}