{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KHD4DUJA3W6XZTARUGNENGWDK3","short_pith_number":"pith:KHD4DUJA","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"},"canonical_sha256":"51c7c1d120ddbd7ccc11a19a469ac356e104bb1e0dfb9e470427d1900192873d","source":{"kind":"arxiv","id":"2405.20277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.20277","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"2405.20277v2","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20277","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"KHD4DUJA3W6X","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"KHD4DUJA3W6XZTAR","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"KHD4DUJA","created_at":"2026-07-05T08:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KHD4DUJA3W6XZTARUGNENGWDK3","target":"record","payload":{"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"},"canonical_sha256":"51c7c1d120ddbd7ccc11a19a469ac356e104bb1e0dfb9e470427d1900192873d","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"},"source_kind":"arxiv","source_id":"2405.20277","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5X3Diq9ihFmcnIlrpEBRTstLivj9+1nMIoSe0OxXmlq2a+Ig6jioxSX2d8UaI99DCDPUvSd3ZEs2w+OgWWICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:30:18.131806Z"},"content_sha256":"d0d9fcdfe1163143af03acd3094c7fc72bb721ea8f7552b942c7cd45a96a5554","schema_version":"1.0","event_id":"sha256:d0d9fcdfe1163143af03acd3094c7fc72bb721ea8f7552b942c7cd45a96a5554"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KHD4DUJA3W6XZTARUGNENGWDK3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMcI540Y2plM2cuXx9/bzXrXzXrVuIaCOT2jkUJ7lFtDCHkkb4czQVo/xn+QnZWtQXh/XEBmi9tU6ygQ1LqHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:30:18.132180Z"},"content_sha256":"3cc0595f24089b370b8159ea9a9ff2443b40c5d8c39bda0a2c35be69a396b29b","schema_version":"1.0","event_id":"sha256:3cc0595f24089b370b8159ea9a9ff2443b40c5d8c39bda0a2c35be69a396b29b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/bundle.json","state_url":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHD4DUJA3W6XZTARUGNENGWDK3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T10:30:18Z","links":{"resolver":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3","bundle":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/bundle.json","state":"https://pith.science/pith/KHD4DUJA3W6XZTARUGNENGWDK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHD4DUJA3W6XZTARUGNENGWDK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KHD4DUJA3W6XZTARUGNENGWDK3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c2fe01726138e3451eea2fed296ab9571abd0e9432e9bf293814acb527151c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-05-30T17:30:04Z","title_canon_sha256":"aa93210767a2058631c1845367c8a61bd64a256794cbd650803a4929f95f4bac"},"schema_version":"1.0","source":{"id":"2405.20277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.20277","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"2405.20277v2","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.20277","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"KHD4DUJA3W6X","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"KHD4DUJA3W6XZTAR","created_at":"2026-07-05T08:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"KHD4DUJA","created_at":"2026-07-05T08:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:3cc0595f24089b370b8159ea9a9ff2443b40c5d8c39bda0a2c35be69a396b29b","target":"graph","created_at":"2026-07-05T08:28:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.20277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chaorui Zhang, Dit-Yan Yeung, Meng Qin, Weixi Zhang, Yu Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-05-30T17:30:04Z","title":"Pre-train and Refine: Towards Higher Efficiency in K-Agnostic Community Detection without Quality Degradation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.20277","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d0d9fcdfe1163143af03acd3094c7fc72bb721ea8f7552b942c7cd45a96a5554","target":"record","created_at":"2026-07-05T08:28:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c2fe01726138e3451eea2fed296ab9571abd0e9432e9bf293814acb527151c92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-05-30T17:30:04Z","title_canon_sha256":"aa93210767a2058631c1845367c8a61bd64a256794cbd650803a4929f95f4bac"},"schema_version":"1.0","source":{"id":"2405.20277","kind":"arxiv","version":2}},"canonical_sha256":"51c7c1d120ddbd7ccc11a19a469ac356e104bb1e0dfb9e470427d1900192873d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51c7c1d120ddbd7ccc11a19a469ac356e104bb1e0dfb9e470427d1900192873d","first_computed_at":"2026-07-05T08:28:41.596420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:41.596420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hQvXLRmedmX07pGeagIa1R5pVgpPHGnLMqx3/TpkWFbOfEW0BjIFgPhVBFsZSkMwucP5hDl1ZbDPXgBMsLPrBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:41.596853Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.20277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0d9fcdfe1163143af03acd3094c7fc72bb721ea8f7552b942c7cd45a96a5554","sha256:3cc0595f24089b370b8159ea9a9ff2443b40c5d8c39bda0a2c35be69a396b29b"],"state_sha256":"5ee02477e4d7d59d2a1a8339a20671bef749980e06dab7a40c424aacd4dbb107"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6iWjfMRPdU6dGCbqq1P5QVSgNTdh4ZBVC0pTveKM8PxFjMRVEu/zIXrj0LXnRjCF9BjYRXy0m8+PC1J5sWtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:30:18.134109Z","bundle_sha256":"4f3cd8b74d8215f5d7ac791dbe8e49a640640339f7a0f9b25642ffcbfd13b0af"}}