{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VODYH2SXH6UBVGNJDL3FQ4EULV","short_pith_number":"pith:VODYH2SX","schema_version":"1.0","canonical_sha256":"ab8783ea573fa81a99a91af65870945d5cdd9522330f9a235a0654b242378dd1","source":{"kind":"arxiv","id":"1302.7099","version":1},"attestation_state":"computed","paper":{"title":"Community Detection in 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-02-28T07:04:35Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1302.7099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-02-28T07:04:35Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"cab67d2753a70a40618181a8d211483f634f6029a03fe88b72e8ccd7f9ff41ae","abstract_canon_sha256":"6686efaf028cff87f98bf1a2e82ae8e4b9e5ad47960606d36ca800878c279c97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:17.441824Z","signature_b64":"ZNS52Wr3SKVP3GyrblMP9txh2z3gtEKtBGrLvfoBWrUvau90yjCzqRl7iLOwqiKpdmcsGWNU8pzV8VE+TEIBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab8783ea573fa81a99a91af65870945d5cdd9522330f9a235a0654b242378dd1","last_reissued_at":"2026-05-18T03:32:17.440900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:17.440900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Detection in 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-02-28T07:04:35Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7099","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.7099","created_at":"2026-05-18T03:32:17.441056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.7099v1","created_at":"2026-05-18T03:32:17.441056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7099","created_at":"2026-05-18T03:32:17.441056+00:00"},{"alias_kind":"pith_short_12","alias_value":"VODYH2SXH6UB","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VODYH2SXH6UBVGNJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VODYH2SX","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.14407","citing_title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV","json":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV.json","graph_json":"https://pith.science/api/pith-number/VODYH2SXH6UBVGNJDL3FQ4EULV/graph.json","events_json":"https://pith.science/api/pith-number/VODYH2SXH6UBVGNJDL3FQ4EULV/events.json","paper":"https://pith.science/paper/VODYH2SX"},"agent_actions":{"view_html":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV","download_json":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV.json","view_paper":"https://pith.science/paper/VODYH2SX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.7099&json=true","fetch_graph":"https://pith.science/api/pith-number/VODYH2SXH6UBVGNJDL3FQ4EULV/graph.json","fetch_events":"https://pith.science/api/pith-number/VODYH2SXH6UBVGNJDL3FQ4EULV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV/action/storage_attestation","attest_author":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV/action/author_attestation","sign_citation":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV/action/citation_signature","submit_replication":"https://pith.science/pith/VODYH2SXH6UBVGNJDL3FQ4EULV/action/replication_record"}},"created_at":"2026-05-18T03:32:17.441056+00:00","updated_at":"2026-05-18T03:32:17.441056+00:00"}