{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:U4HL2ZXCNRGSVW3BFIHRL3X7IO","short_pith_number":"pith:U4HL2ZXC","schema_version":"1.0","canonical_sha256":"a70ebd66e26c4d2adb612a0f15eeff43b141f76df19481f6abafaa78b849fc66","source":{"kind":"arxiv","id":"1308.0777","version":4},"attestation_state":"computed","paper":{"title":"A testing based extraction algorithm for identifying significant communities in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.ME"],"primary_cat":"cs.SI","authors_text":"Andrew B. Nobel, James D. Wilson, Peter J. Mucha, Shankar Bhamidi, Simi Wang","submitted_at":"2013-08-04T04:40:26Z","abstract_excerpt":"A common and important problem arising in the study of networks is how to divide the vertices of a given network into one or more groups, called communities, in such a way that vertices of the same community are more interconnected than vertices belonging to different ones. We propose and investigate a testing based community detection procedure called Extraction of Statistically Significant Communities (ESSC). The ESSC procedure is based on $p$-values for the strength of connection between a single vertex and a set of vertices under a reference distribution derived from a conditional configur"},"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.0777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-08-04T04:40:26Z","cross_cats_sorted":["physics.soc-ph","stat.ME"],"title_canon_sha256":"dab6981f9f5d8578e5ab7ad3ff47612f1f6e6f63c94464cf9f4124ad90ebf1bb","abstract_canon_sha256":"d89d31c7d4643d6065babfc028d3564896ae2b87520455eeddb6c7721b7fa91b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:14.400186Z","signature_b64":"vk3FSGR7zJznBE1ootiaxqZH9lJflwIjCSv24Ed7xmW3LSv7R3rL8GTVqJQmrzKOMuYWYIKYSbXyLz3AgS2TCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a70ebd66e26c4d2adb612a0f15eeff43b141f76df19481f6abafaa78b849fc66","last_reissued_at":"2026-05-18T02:32:14.399461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:14.399461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A testing based extraction algorithm for identifying significant communities in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.ME"],"primary_cat":"cs.SI","authors_text":"Andrew B. Nobel, James D. Wilson, Peter J. Mucha, Shankar Bhamidi, Simi Wang","submitted_at":"2013-08-04T04:40:26Z","abstract_excerpt":"A common and important problem arising in the study of networks is how to divide the vertices of a given network into one or more groups, called communities, in such a way that vertices of the same community are more interconnected than vertices belonging to different ones. We propose and investigate a testing based community detection procedure called Extraction of Statistically Significant Communities (ESSC). The ESSC procedure is based on $p$-values for the strength of connection between a single vertex and a set of vertices under a reference distribution derived from a conditional configur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0777","kind":"arxiv","version":4},"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.0777","created_at":"2026-05-18T02:32:14.399578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0777v4","created_at":"2026-05-18T02:32:14.399578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0777","created_at":"2026-05-18T02:32:14.399578+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4HL2ZXCNRGS","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4HL2ZXCNRGSVW3B","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4HL2ZXC","created_at":"2026-05-18T12:28:02.375192+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/U4HL2ZXCNRGSVW3BFIHRL3X7IO","json":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO.json","graph_json":"https://pith.science/api/pith-number/U4HL2ZXCNRGSVW3BFIHRL3X7IO/graph.json","events_json":"https://pith.science/api/pith-number/U4HL2ZXCNRGSVW3BFIHRL3X7IO/events.json","paper":"https://pith.science/paper/U4HL2ZXC"},"agent_actions":{"view_html":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO","download_json":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO.json","view_paper":"https://pith.science/paper/U4HL2ZXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0777&json=true","fetch_graph":"https://pith.science/api/pith-number/U4HL2ZXCNRGSVW3BFIHRL3X7IO/graph.json","fetch_events":"https://pith.science/api/pith-number/U4HL2ZXCNRGSVW3BFIHRL3X7IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO/action/storage_attestation","attest_author":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO/action/author_attestation","sign_citation":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO/action/citation_signature","submit_replication":"https://pith.science/pith/U4HL2ZXCNRGSVW3BFIHRL3X7IO/action/replication_record"}},"created_at":"2026-05-18T02:32:14.399578+00:00","updated_at":"2026-05-18T02:32:14.399578+00:00"}