{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XWXVUVX5KAVBDKUFGL4FUMIBH7","short_pith_number":"pith:XWXVUVX5","schema_version":"1.0","canonical_sha256":"bdaf5a56fd502a11aa8532f85a31013ff71a8486a4d132635860c04dcdd4361c","source":{"kind":"arxiv","id":"2507.13368","version":2},"attestation_state":"computed","paper":{"title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Junyi Yan, Taichun Zhou, Wenxuan Tu, Xinhang Wan, Xinwang Liu, Yaowen Hu, Yue Liu","submitted_at":"2025-07-09T13:42:43Z","abstract_excerpt":"Deep graph clustering (DGC), which aims to unsupervisedly separate the nodes in an attribute graph into different clusters, has seen substantial potential in various industrial scenarios like community detection and recommendation. However, the real-world attribute graphs, e.g., social networks interactions, are usually large-scale and attribute-missing. To solve these two problems, we propose a novel DGC method termed \\underline{\\textbf{C}}omplementary \\underline{\\textbf{M}}ulti-\\underline{\\textbf{V}}iew \\underline{\\textbf{N}}eighborhood \\underline{\\textbf{D}}ifferentiation (\\textit{CMV-ND}),"},"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":"2507.13368","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-07-09T13:42:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"de6994c1d9edefdadd232ea937ba097c6cc92bd7242c58020df108ee3c833858","abstract_canon_sha256":"595dfb82f944971663da65a355c871fbfc14f67a73da69bd7031197120454dfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:27.435191Z","signature_b64":"RJ5GQEuI3UQIOv1AOGRGOSDqa4D6H4Bqgtrz66bOuFhbeY+6X3bePgzB9mlOygScFRjRRvAg1G03Kz/Z6AFOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdaf5a56fd502a11aa8532f85a31013ff71a8486a4d132635860c04dcdd4361c","last_reissued_at":"2026-07-05T11:48:27.434693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:27.434693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Junyi Yan, Taichun Zhou, Wenxuan Tu, Xinhang Wan, Xinwang Liu, Yaowen Hu, Yue Liu","submitted_at":"2025-07-09T13:42:43Z","abstract_excerpt":"Deep graph clustering (DGC), which aims to unsupervisedly separate the nodes in an attribute graph into different clusters, has seen substantial potential in various industrial scenarios like community detection and recommendation. However, the real-world attribute graphs, e.g., social networks interactions, are usually large-scale and attribute-missing. To solve these two problems, we propose a novel DGC method termed \\underline{\\textbf{C}}omplementary \\underline{\\textbf{M}}ulti-\\underline{\\textbf{V}}iew \\underline{\\textbf{N}}eighborhood \\underline{\\textbf{D}}ifferentiation (\\textit{CMV-ND}),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13368","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/2507.13368/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":"2507.13368","created_at":"2026-07-05T11:48:27.434755+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13368v2","created_at":"2026-07-05T11:48:27.434755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13368","created_at":"2026-07-05T11:48:27.434755+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWXVUVX5KAVB","created_at":"2026-07-05T11:48:27.434755+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWXVUVX5KAVBDKUF","created_at":"2026-07-05T11:48:27.434755+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWXVUVX5","created_at":"2026-07-05T11:48:27.434755+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/XWXVUVX5KAVBDKUFGL4FUMIBH7","json":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7.json","graph_json":"https://pith.science/api/pith-number/XWXVUVX5KAVBDKUFGL4FUMIBH7/graph.json","events_json":"https://pith.science/api/pith-number/XWXVUVX5KAVBDKUFGL4FUMIBH7/events.json","paper":"https://pith.science/paper/XWXVUVX5"},"agent_actions":{"view_html":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7","download_json":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7.json","view_paper":"https://pith.science/paper/XWXVUVX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13368&json=true","fetch_graph":"https://pith.science/api/pith-number/XWXVUVX5KAVBDKUFGL4FUMIBH7/graph.json","fetch_events":"https://pith.science/api/pith-number/XWXVUVX5KAVBDKUFGL4FUMIBH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7/action/storage_attestation","attest_author":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7/action/author_attestation","sign_citation":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7/action/citation_signature","submit_replication":"https://pith.science/pith/XWXVUVX5KAVBDKUFGL4FUMIBH7/action/replication_record"}},"created_at":"2026-07-05T11:48:27.434755+00:00","updated_at":"2026-07-05T11:48:27.434755+00:00"}