{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7ZGHNUT4R5X73NXUB5ZDVXYFM2","short_pith_number":"pith:7ZGHNUT4","schema_version":"1.0","canonical_sha256":"fe4c76d27c8f6ffdb6f40f723adf0566aee9a5d89b1695c617ba69a3697aeab0","source":{"kind":"arxiv","id":"2110.08264","version":1},"attestation_state":"computed","paper":{"title":"Self-supervised Contrastive Attributed Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ming Yang, Quanxue Gao, Wei Xia, Xinbo Gao","submitted_at":"2021-10-15T03:25:28Z","abstract_excerpt":"Attributed graph clustering, which learns node representation from node attribute and topological graph for clustering, is a fundamental but challenging task for graph analysis. Recently, methods based on graph contrastive learning (GCL) have obtained impressive clustering performance on this task. Yet, we observe that existing GCL-based methods 1) fail to benefit from imprecise clustering labels; 2) require a post-processing operation to get clustering labels; 3) cannot solve out-of-sample (OOS) problem. To address these issues, we propose a novel attributed graph clustering network, namely S"},"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":"2110.08264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-15T03:25:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"89b611631625ce0a8653c33ae180fdd5e800a5a8aeca7270369bfa109f224590","abstract_canon_sha256":"1858db568349fbf4f2f3dfd01b7036b94fd8aafa30c97c31c43f5daac2fc11ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:19.349550Z","signature_b64":"Wtm7/U3PHJ6tB7n3qtgGpLpBdIhXd+gA6wBCHNZ4Rlw7qPC3qfi+oLkcO2zpJwehE1inLlcPVRSIfbHgMcNLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe4c76d27c8f6ffdb6f40f723adf0566aee9a5d89b1695c617ba69a3697aeab0","last_reissued_at":"2026-07-05T06:09:19.349080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:19.349080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-supervised Contrastive Attributed Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ming Yang, Quanxue Gao, Wei Xia, Xinbo Gao","submitted_at":"2021-10-15T03:25:28Z","abstract_excerpt":"Attributed graph clustering, which learns node representation from node attribute and topological graph for clustering, is a fundamental but challenging task for graph analysis. Recently, methods based on graph contrastive learning (GCL) have obtained impressive clustering performance on this task. Yet, we observe that existing GCL-based methods 1) fail to benefit from imprecise clustering labels; 2) require a post-processing operation to get clustering labels; 3) cannot solve out-of-sample (OOS) problem. To address these issues, we propose a novel attributed graph clustering network, namely S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08264","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/2110.08264/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":"2110.08264","created_at":"2026-07-05T06:09:19.349138+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.08264v1","created_at":"2026-07-05T06:09:19.349138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08264","created_at":"2026-07-05T06:09:19.349138+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZGHNUT4R5X7","created_at":"2026-07-05T06:09:19.349138+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZGHNUT4R5X73NXU","created_at":"2026-07-05T06:09:19.349138+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZGHNUT4","created_at":"2026-07-05T06:09:19.349138+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/7ZGHNUT4R5X73NXUB5ZDVXYFM2","json":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2.json","graph_json":"https://pith.science/api/pith-number/7ZGHNUT4R5X73NXUB5ZDVXYFM2/graph.json","events_json":"https://pith.science/api/pith-number/7ZGHNUT4R5X73NXUB5ZDVXYFM2/events.json","paper":"https://pith.science/paper/7ZGHNUT4"},"agent_actions":{"view_html":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2","download_json":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2.json","view_paper":"https://pith.science/paper/7ZGHNUT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.08264&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZGHNUT4R5X73NXUB5ZDVXYFM2/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZGHNUT4R5X73NXUB5ZDVXYFM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2/action/storage_attestation","attest_author":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2/action/author_attestation","sign_citation":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2/action/citation_signature","submit_replication":"https://pith.science/pith/7ZGHNUT4R5X73NXUB5ZDVXYFM2/action/replication_record"}},"created_at":"2026-07-05T06:09:19.349138+00:00","updated_at":"2026-07-05T06:09:19.349138+00:00"}