{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FDKCKJLGCYDBDEMSG6Z4ASYCBI","short_pith_number":"pith:FDKCKJLG","schema_version":"1.0","canonical_sha256":"28d4252566160611919237b3c04b020a35cf910653583c41757ba31543047907","source":{"kind":"arxiv","id":"2112.14772","version":1},"attestation_state":"computed","paper":{"title":"Deep Graph Clustering via Dual Correlation Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"En Zhu, Linxuan Song, Sihang Zhou, Wenxuan Tu, Xihong Yang, Xinwang Liu, Yue Liu","submitted_at":"2021-12-29T04:05:38Z","abstract_excerpt":"Deep graph clustering, which aims to reveal the underlying graph structure and divide the nodes into different groups, has attracted intensive attention in recent years. However, we observe that, in the process of node encoding, existing methods suffer from representation collapse which tends to map all data into the same representation. Consequently, the discriminative capability of the node representation is limited, leading to unsatisfied clustering performance. To address this issue, we propose a novel self-supervised deep graph clustering method termed Dual Correlation Reduction Network ("},"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":"2112.14772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-29T04:05:38Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"5207bc5e21d3044a608168eb7809e8fbaaa6f32faccefdec502e51dc03178d84","abstract_canon_sha256":"32cc73dce82d9f4e1ccb22a6e1ad818e9fa4a1eb1b102da8cb6ccaaad05e0c6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:33.501327Z","signature_b64":"VHSxaq46yM/jNOEW84m8Hv1kHyf0Cqx8T5Dgzlf4BGQZqigYszzsZnDhZv5InC1ONKWTOEiKtyv/6KNakQGkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d4252566160611919237b3c04b020a35cf910653583c41757ba31543047907","last_reissued_at":"2026-07-05T03:44:33.500862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:33.500862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Graph Clustering via Dual Correlation Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"En Zhu, Linxuan Song, Sihang Zhou, Wenxuan Tu, Xihong Yang, Xinwang Liu, Yue Liu","submitted_at":"2021-12-29T04:05:38Z","abstract_excerpt":"Deep graph clustering, which aims to reveal the underlying graph structure and divide the nodes into different groups, has attracted intensive attention in recent years. However, we observe that, in the process of node encoding, existing methods suffer from representation collapse which tends to map all data into the same representation. Consequently, the discriminative capability of the node representation is limited, leading to unsatisfied clustering performance. To address this issue, we propose a novel self-supervised deep graph clustering method termed Dual Correlation Reduction Network ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.14772","kind":"arxiv","version":1},"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/2112.14772/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":"2112.14772","created_at":"2026-07-05T03:44:33.500928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.14772v1","created_at":"2026-07-05T03:44:33.500928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.14772","created_at":"2026-07-05T03:44:33.500928+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDKCKJLGCYDB","created_at":"2026-07-05T03:44:33.500928+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDKCKJLGCYDBDEMS","created_at":"2026-07-05T03:44:33.500928+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDKCKJLG","created_at":"2026-07-05T03:44:33.500928+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/FDKCKJLGCYDBDEMSG6Z4ASYCBI","json":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI.json","graph_json":"https://pith.science/api/pith-number/FDKCKJLGCYDBDEMSG6Z4ASYCBI/graph.json","events_json":"https://pith.science/api/pith-number/FDKCKJLGCYDBDEMSG6Z4ASYCBI/events.json","paper":"https://pith.science/paper/FDKCKJLG"},"agent_actions":{"view_html":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI","download_json":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI.json","view_paper":"https://pith.science/paper/FDKCKJLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.14772&json=true","fetch_graph":"https://pith.science/api/pith-number/FDKCKJLGCYDBDEMSG6Z4ASYCBI/graph.json","fetch_events":"https://pith.science/api/pith-number/FDKCKJLGCYDBDEMSG6Z4ASYCBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI/action/storage_attestation","attest_author":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI/action/author_attestation","sign_citation":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI/action/citation_signature","submit_replication":"https://pith.science/pith/FDKCKJLGCYDBDEMSG6Z4ASYCBI/action/replication_record"}},"created_at":"2026-07-05T03:44:33.500928+00:00","updated_at":"2026-07-05T03:44:33.500928+00:00"}