{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WZPO2A7244KWT23GNQUPEGYAC3","short_pith_number":"pith:WZPO2A72","schema_version":"1.0","canonical_sha256":"b65eed03fae71569eb666c28f21b0016ebfccfe1d81c566792cda82b440d48ce","source":{"kind":"arxiv","id":"1308.2955","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.2955","created_at":"2026-05-18T02:41:59.715497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2955v2","created_at":"2026-05-18T02:41:59.715497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2955","created_at":"2026-05-18T02:41:59.715497+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZPO2A7244KW","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZPO2A7244KWT23G","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZPO2A72","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3","json":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3.json","graph_json":"https://pith.science/api/pith-number/WZPO2A7244KWT23GNQUPEGYAC3/graph.json","events_json":"https://pith.science/api/pith-number/WZPO2A7244KWT23GNQUPEGYAC3/events.json","paper":"https://pith.science/paper/WZPO2A72"},"agent_actions":{"view_html":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3","download_json":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3.json","view_paper":"https://pith.science/paper/WZPO2A72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2955&json=true","fetch_graph":"https://pith.science/api/pith-number/WZPO2A7244KWT23GNQUPEGYAC3/graph.json","fetch_events":"https://pith.science/api/pith-number/WZPO2A7244KWT23GNQUPEGYAC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/action/storage_attestation","attest_author":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/action/author_attestation","sign_citation":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/action/citation_signature","submit_replication":"https://pith.science/pith/WZPO2A7244KWT23GNQUPEGYAC3/action/replication_record"}},"created_at":"2026-05-18T02:41:59.715497+00:00","updated_at":"2026-05-18T02:41:59.715497+00:00"}