{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CJDIWF5M7ROXFPIPCMY6GYXVWL","short_pith_number":"pith:CJDIWF5M","canonical_record":{"source":{"id":"2305.18405","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T15:33:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"86530ddab86a137d1060b9f37ad950e8d54e24e703ca5de53c5b0263614f928c","abstract_canon_sha256":"bf0d4f210d59fd107acea008df4bf1e92aba40709d0c81f4dde0e05c3fa18c5c"},"schema_version":"1.0"},"canonical_sha256":"12468b17acfc5d72bd0f1331e362f5b2f826a85e37b269ad4a7b0663d82fc8b1","source":{"kind":"arxiv","id":"2305.18405","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18405","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18405v3","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18405","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"CJDIWF5M7ROX","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"pith_short_16","alias_value":"CJDIWF5M7ROXFPIP","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"pith_short_8","alias_value":"CJDIWF5M","created_at":"2026-07-05T06:30:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CJDIWF5M7ROXFPIPCMY6GYXVWL","target":"record","payload":{"canonical_record":{"source":{"id":"2305.18405","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T15:33:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"86530ddab86a137d1060b9f37ad950e8d54e24e703ca5de53c5b0263614f928c","abstract_canon_sha256":"bf0d4f210d59fd107acea008df4bf1e92aba40709d0c81f4dde0e05c3fa18c5c"},"schema_version":"1.0"},"canonical_sha256":"12468b17acfc5d72bd0f1331e362f5b2f826a85e37b269ad4a7b0663d82fc8b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:45.920269Z","signature_b64":"ejj4Ci5pGrru/CNRDNFFcImYEdRlR02IwCRUSDkKjb+enUISetibVMpO2Zb5pGEEgKR9oiMEr7ATRYO9KzeyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12468b17acfc5d72bd0f1331e362f5b2f826a85e37b269ad4a7b0663d82fc8b1","last_reissued_at":"2026-07-05T06:30:45.919765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:45.919765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.18405","source_version":3,"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-05T06:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PBYtbwYpI/NZ1vX5E4z1btHKgeRHxCYM7WrBBQnEy1l1Unrc7yjXH9Z/FEw2DXljkdFB50nWMghy5+qjhlt8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:46:32.996385Z"},"content_sha256":"8a276898e971ac6488021da000a355fc4e0ce497812159796b2fd2c062b397f6","schema_version":"1.0","event_id":"sha256:8a276898e971ac6488021da000a355fc4e0ce497812159796b2fd2c062b397f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CJDIWF5M7ROXFPIPCMY6GYXVWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dink-Net: Neural Clustering on Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jun Xia, Ke Liang, Sihang Zhou, Stan Z. Li, Xihong Yang, Xinwang Liu, Yue Liu","submitted_at":"2023-05-28T15:33:24Z","abstract_excerpt":"Deep graph clustering, which aims to group the nodes of a graph into disjoint clusters with deep neural networks, has achieved promising progress in recent years. However, the existing methods fail to scale to the large graph with million nodes. To solve this problem, a scalable deep graph clustering method (Dink-Net) is proposed with the idea of dilation and shrink. Firstly, by discriminating nodes, whether being corrupted by augmentations, representations are learned in a self-supervised manner. Meanwhile, the cluster centres are initialized as learnable neural parameters. Subsequently, the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18405","kind":"arxiv","version":3},"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/2305.18405/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-05T06:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzxCwTD0/feEwpH5SiGCd2FmxEG6btMkxBrqTT8voNxz2QOgefptiqLTpzzvnLt8OTUS1QK10FKyacvgnZ41DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:46:32.996760Z"},"content_sha256":"9c229ac23b627c6c1f65d3836076bcaf414a7d6251441aa292d5af12a4210ec7","schema_version":"1.0","event_id":"sha256:9c229ac23b627c6c1f65d3836076bcaf414a7d6251441aa292d5af12a4210ec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJDIWF5M7ROXFPIPCMY6GYXVWL/bundle.json","state_url":"https://pith.science/pith/CJDIWF5M7ROXFPIPCMY6GYXVWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJDIWF5M7ROXFPIPCMY6GYXVWL/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-07T15:46:32Z","links":{"resolver":"https://pith.science/pith/CJDIWF5M7ROXFPIPCMY6GYXVWL","bundle":"https://pith.science/pith/CJDIWF5M7ROXFPIPCMY6GYXVWL/bundle.json","state":"https://pith.science/pith/CJDIWF5M7ROXFPIPCMY6GYXVWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJDIWF5M7ROXFPIPCMY6GYXVWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CJDIWF5M7ROXFPIPCMY6GYXVWL","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":"bf0d4f210d59fd107acea008df4bf1e92aba40709d0c81f4dde0e05c3fa18c5c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T15:33:24Z","title_canon_sha256":"86530ddab86a137d1060b9f37ad950e8d54e24e703ca5de53c5b0263614f928c"},"schema_version":"1.0","source":{"id":"2305.18405","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18405","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18405v3","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18405","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"CJDIWF5M7ROX","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"pith_short_16","alias_value":"CJDIWF5M7ROXFPIP","created_at":"2026-07-05T06:30:45Z"},{"alias_kind":"pith_short_8","alias_value":"CJDIWF5M","created_at":"2026-07-05T06:30:45Z"}],"graph_snapshots":[{"event_id":"sha256:9c229ac23b627c6c1f65d3836076bcaf414a7d6251441aa292d5af12a4210ec7","target":"graph","created_at":"2026-07-05T06:30:45Z","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/2305.18405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep graph clustering, which aims to group the nodes of a graph into disjoint clusters with deep neural networks, has achieved promising progress in recent years. However, the existing methods fail to scale to the large graph with million nodes. To solve this problem, a scalable deep graph clustering method (Dink-Net) is proposed with the idea of dilation and shrink. Firstly, by discriminating nodes, whether being corrupted by augmentations, representations are learned in a self-supervised manner. Meanwhile, the cluster centres are initialized as learnable neural parameters. Subsequently, the ","authors_text":"Jun Xia, Ke Liang, Sihang Zhou, Stan Z. Li, Xihong Yang, Xinwang Liu, Yue Liu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T15:33:24Z","title":"Dink-Net: Neural Clustering on Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18405","kind":"arxiv","version":3},"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:8a276898e971ac6488021da000a355fc4e0ce497812159796b2fd2c062b397f6","target":"record","created_at":"2026-07-05T06:30:45Z","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":"bf0d4f210d59fd107acea008df4bf1e92aba40709d0c81f4dde0e05c3fa18c5c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T15:33:24Z","title_canon_sha256":"86530ddab86a137d1060b9f37ad950e8d54e24e703ca5de53c5b0263614f928c"},"schema_version":"1.0","source":{"id":"2305.18405","kind":"arxiv","version":3}},"canonical_sha256":"12468b17acfc5d72bd0f1331e362f5b2f826a85e37b269ad4a7b0663d82fc8b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12468b17acfc5d72bd0f1331e362f5b2f826a85e37b269ad4a7b0663d82fc8b1","first_computed_at":"2026-07-05T06:30:45.919765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:30:45.919765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ejj4Ci5pGrru/CNRDNFFcImYEdRlR02IwCRUSDkKjb+enUISetibVMpO2Zb5pGEEgKR9oiMEr7ATRYO9KzeyBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:30:45.920269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.18405","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a276898e971ac6488021da000a355fc4e0ce497812159796b2fd2c062b397f6","sha256:9c229ac23b627c6c1f65d3836076bcaf414a7d6251441aa292d5af12a4210ec7"],"state_sha256":"96beb29f5fdda0e3596f86a2a60109d24a5f4aaf2285535db62450b0c19af721"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qG7yJM6tIlfzAhK+VnasSHuNMOykkmU+AyQ1IRddkv4AgXl2uX3FSE4ezXOiK7KPCGKkvRCDuyqSwgG4Z9vDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:46:32.998744Z","bundle_sha256":"b15c23725d44110489f7c51c830529c8d55713ee14f627af691d40e125b9474c"}}