{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KHD4DUJA3W6XZTARUGNENGWDK3","short_pith_number":"pith:KHD4DUJA","schema_version":"1.0","canonical_sha256":"51c7c1d120ddbd7ccc11a19a469ac356e104bb1e0dfb9e470427d1900192873d","source":{"kind":"arxiv","id":"2405.20277","version":2},"attestation_state":"computed","paper":{"title":"Pre-train and Refine: Towards Higher Efficiency in K-Agnostic Community Detection without Quality Degradation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chaorui Zhang, Dit-Yan Yeung, Meng Qin, Weixi Zhang, Yu Gao","submitted_at":"2024-05-30T17:30:04Z","abstract_excerpt":"Community detection (CD) is a classic graph inference task that partitions nodes of a graph into densely connected groups. While many CD methods have been proposed with either impressive quality or efficiency, balancing the two aspects remains a challenge. This study explores the potential of deep graph learning to achieve a better trade-off between the quality and efficiency of K-agnostic CD, where the number of communities K is unknown. We propose PRoCD (Pre-training & Refinement fOr Community Detection), a simple yet effective method that reformulates K-agnostic CD as the binary node pair c"},"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":"2405.20277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-05-30T17:30:04Z","cross_cats_sorted":[],"title_canon_sha256":"aa93210767a2058631c1845367c8a61bd64a256794cbd650803a4929f95f4bac","abstract_canon_sha256":"c2fe01726138e3451eea2fed296ab9571abd0e9432e9bf293814acb527151c92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:41.596853Z","signature_b64":"hQvXLRmedmX07pGeagIa1R5pVgpPHGnLMqx3/TpkWFbOfEW0BjIFgPhVBFsZSkMwucP5hDl1ZbDPXgBMsLPrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51c7c1d120ddbd7ccc11a19a469ac356e104bb1e0dfb9e470427d1900192873d","last_reissued_at":"2026-07-05T08:28:41.596420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:41.596420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pre-train and Refine: Towards Higher Efficiency in K-Agnostic Community Detection without Quality Degradation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chaorui Zhang, Dit-Yan Yeung, Meng Qin, Weixi Zhang, Yu Gao","submitted_at":"2024-05-30T17:30:04Z","abstract_excerpt":"Community detection (CD) is a classic graph inference task that partitions nodes of a graph into densely connected groups. While many CD methods have been proposed with either impressive quality or efficiency, balancing the two aspects remains a challenge. This study explores the potential of deep graph learning to achieve a better trade-off between the quality and efficiency of K-agnostic CD, where the number of communities K is unknown. We propose PRoCD (Pre-training & Refinement fOr Community Detection), a simple yet effective method that reformulates K-agnostic CD as the binary node pair c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20277","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.20277/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.20277","created_at":"2026-07-05T08:28:41.596467+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.20277v2","created_at":"2026-07-05T08:28:41.596467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20277","created_at":"2026-07-05T08:28:41.596467+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHD4DUJA3W6X","created_at":"2026-07-05T08:28:41.596467+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHD4DUJA3W6XZTAR","created_at":"2026-07-05T08:28:41.596467+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHD4DUJA","created_at":"2026-07-05T08:28:41.596467+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/KHD4DUJA3W6XZTARUGNENGWDK3","json":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3.json","graph_json":"https://pith.science/api/pith-number/KHD4DUJA3W6XZTARUGNENGWDK3/graph.json","events_json":"https://pith.science/api/pith-number/KHD4DUJA3W6XZTARUGNENGWDK3/events.json","paper":"https://pith.science/paper/KHD4DUJA"},"agent_actions":{"view_html":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3","download_json":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3.json","view_paper":"https://pith.science/paper/KHD4DUJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.20277&json=true","fetch_graph":"https://pith.science/api/pith-number/KHD4DUJA3W6XZTARUGNENGWDK3/graph.json","fetch_events":"https://pith.science/api/pith-number/KHD4DUJA3W6XZTARUGNENGWDK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/action/storage_attestation","attest_author":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/action/author_attestation","sign_citation":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/action/citation_signature","submit_replication":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/action/replication_record"}},"created_at":"2026-07-05T08:28:41.596467+00:00","updated_at":"2026-07-05T08:28:41.596467+00:00"}