{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3WX5QGO77WC3HR3CCLAVPIQR4E","short_pith_number":"pith:3WX5QGO7","schema_version":"1.0","canonical_sha256":"ddafd819dffd85b3c76212c157a211e122fa5b8b7adda6e0054666f338927763","source":{"kind":"arxiv","id":"1702.00467","version":3},"attestation_state":"computed","paper":{"title":"The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","math.PR","physics.soc-ph"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore","submitted_at":"2017-02-01T21:54:41Z","abstract_excerpt":"Community detection in graphs is the problem of finding groups of vertices which are more densely connected than they are to the rest of the graph. This problem has a long history, but it is undergoing a resurgence of interest due to the need to analyze social and biological networks. While there are many ways to formalize it, one of the most popular is as an inference problem, where there is a \"ground truth\" community structure built into the graph somehow. The task is then to recover the ground truth knowing only the graph.\n  Recently it was discovered, first heuristically in physics and the"},"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":"1702.00467","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-01T21:54:41Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI","math.PR","physics.soc-ph"],"title_canon_sha256":"d7e80da12b17305f61abffa7fb29d0566abd0393b85b189f055fc9f0fd4dbb45","abstract_canon_sha256":"0209aec7ab2e47dda570d232bd8882370a43aa0e2f5895d0f916211c97f3c5bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:47.671710Z","signature_b64":"2ycnYyzSfgGCNlwSiOHfgmajhX0ndmIFCIw+8uh/Ty2lL6XBVDbj8HvQlOm293ZNnDjsSAKmllEgov7dXxU1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddafd819dffd85b3c76212c157a211e122fa5b8b7adda6e0054666f338927763","last_reissued_at":"2026-05-18T00:36:47.671237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:47.671237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","math.PR","physics.soc-ph"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore","submitted_at":"2017-02-01T21:54:41Z","abstract_excerpt":"Community detection in graphs is the problem of finding groups of vertices which are more densely connected than they are to the rest of the graph. This problem has a long history, but it is undergoing a resurgence of interest due to the need to analyze social and biological networks. While there are many ways to formalize it, one of the most popular is as an inference problem, where there is a \"ground truth\" community structure built into the graph somehow. The task is then to recover the ground truth knowing only the graph.\n  Recently it was discovered, first heuristically in physics and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00467","kind":"arxiv","version":3},"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":"1702.00467","created_at":"2026-05-18T00:36:47.671307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00467v3","created_at":"2026-05-18T00:36:47.671307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00467","created_at":"2026-05-18T00:36:47.671307+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WX5QGO77WC3","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WX5QGO77WC3HR3C","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WX5QGO7","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2502.14407","citing_title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19894","citing_title":"Sharp Spectral Thresholds for Multi-View Spiked Wigner Models","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E","json":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E.json","graph_json":"https://pith.science/api/pith-number/3WX5QGO77WC3HR3CCLAVPIQR4E/graph.json","events_json":"https://pith.science/api/pith-number/3WX5QGO77WC3HR3CCLAVPIQR4E/events.json","paper":"https://pith.science/paper/3WX5QGO7"},"agent_actions":{"view_html":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E","download_json":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E.json","view_paper":"https://pith.science/paper/3WX5QGO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00467&json=true","fetch_graph":"https://pith.science/api/pith-number/3WX5QGO77WC3HR3CCLAVPIQR4E/graph.json","fetch_events":"https://pith.science/api/pith-number/3WX5QGO77WC3HR3CCLAVPIQR4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E/action/storage_attestation","attest_author":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E/action/author_attestation","sign_citation":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E/action/citation_signature","submit_replication":"https://pith.science/pith/3WX5QGO77WC3HR3CCLAVPIQR4E/action/replication_record"}},"created_at":"2026-05-18T00:36:47.671307+00:00","updated_at":"2026-05-18T00:36:47.671307+00:00"}