{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:25YSLROGUSFVJEGXQO7BBPYBVH","short_pith_number":"pith:25YSLROG","schema_version":"1.0","canonical_sha256":"d77125c5c6a48b5490d783be10bf01a9e68716c4d657c0071d82b89b55c8f7ed","source":{"kind":"arxiv","id":"2507.13765","version":1},"attestation_state":"computed","paper":{"title":"Dual-Center Graph Clustering with Neighbor Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Enhao Cheng, Jianhua Yin, Li Jin, Liqiang Nie, Shoujia Zhang","submitted_at":"2025-07-18T09:17:04Z","abstract_excerpt":"Graph clustering is crucial for unraveling intricate data structures, yet it presents significant challenges due to its unsupervised nature. Recently, goal-directed clustering techniques have yielded impressive results, with contrastive learning methods leveraging pseudo-label garnering considerable attention. Nonetheless, pseudo-label as a supervision signal is unreliable and existing goal-directed approaches utilize only features to construct a single-target distribution for single-center optimization, which lead to incomplete and less dependable guidance. In our work, we propose a novel Dua"},"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.13765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-18T09:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"0029b2238efaf9aefd986068c6f7d1d69ed0241f95f74bc85dc4b16452f1d01d","abstract_canon_sha256":"b0d287ab70cdbedca0888e0b3a7b8c338d73b2a98c5295252c62a495966fdf1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:22.589804Z","signature_b64":"KFBe/+0MZn08SfExdlBGfc9sxr73o302ZVTT40gVEy4PmaSOKW5ptgukGZYiqscLptGuKWwR3Dy2B6koaYe8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d77125c5c6a48b5490d783be10bf01a9e68716c4d657c0071d82b89b55c8f7ed","last_reissued_at":"2026-07-05T11:39:22.589346Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:22.589346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual-Center Graph Clustering with Neighbor Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Enhao Cheng, Jianhua Yin, Li Jin, Liqiang Nie, Shoujia Zhang","submitted_at":"2025-07-18T09:17:04Z","abstract_excerpt":"Graph clustering is crucial for unraveling intricate data structures, yet it presents significant challenges due to its unsupervised nature. Recently, goal-directed clustering techniques have yielded impressive results, with contrastive learning methods leveraging pseudo-label garnering considerable attention. Nonetheless, pseudo-label as a supervision signal is unreliable and existing goal-directed approaches utilize only features to construct a single-target distribution for single-center optimization, which lead to incomplete and less dependable guidance. In our work, we propose a novel Dua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13765","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/2507.13765/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.13765","created_at":"2026-07-05T11:39:22.589404+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13765v1","created_at":"2026-07-05T11:39:22.589404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13765","created_at":"2026-07-05T11:39:22.589404+00:00"},{"alias_kind":"pith_short_12","alias_value":"25YSLROGUSFV","created_at":"2026-07-05T11:39:22.589404+00:00"},{"alias_kind":"pith_short_16","alias_value":"25YSLROGUSFVJEGX","created_at":"2026-07-05T11:39:22.589404+00:00"},{"alias_kind":"pith_short_8","alias_value":"25YSLROG","created_at":"2026-07-05T11:39:22.589404+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/25YSLROGUSFVJEGXQO7BBPYBVH","json":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH.json","graph_json":"https://pith.science/api/pith-number/25YSLROGUSFVJEGXQO7BBPYBVH/graph.json","events_json":"https://pith.science/api/pith-number/25YSLROGUSFVJEGXQO7BBPYBVH/events.json","paper":"https://pith.science/paper/25YSLROG"},"agent_actions":{"view_html":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH","download_json":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH.json","view_paper":"https://pith.science/paper/25YSLROG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13765&json=true","fetch_graph":"https://pith.science/api/pith-number/25YSLROGUSFVJEGXQO7BBPYBVH/graph.json","fetch_events":"https://pith.science/api/pith-number/25YSLROGUSFVJEGXQO7BBPYBVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH/action/storage_attestation","attest_author":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH/action/author_attestation","sign_citation":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH/action/citation_signature","submit_replication":"https://pith.science/pith/25YSLROGUSFVJEGXQO7BBPYBVH/action/replication_record"}},"created_at":"2026-07-05T11:39:22.589404+00:00","updated_at":"2026-07-05T11:39:22.589404+00:00"}