{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3LANUAY5ITFEHSGGZC265WM2RC","short_pith_number":"pith:3LANUAY5","schema_version":"1.0","canonical_sha256":"dac0da031d44ca43c8c6c8b5eed99a88924ba979911d1062f194f6b591305e18","source":{"kind":"arxiv","id":"2308.06827","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Graph Clustering with Unknown Cluster Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jun Xia, Ke Liang, Meng Liu, Sihang Zhou, Stan Z. Li, Xihong Yang, Xinwang Liu, Yue Liu","submitted_at":"2023-08-13T18:12:28Z","abstract_excerpt":"Deep graph clustering, which aims to group nodes into disjoint clusters by neural networks in an unsupervised manner, has attracted great attention in recent years. Although the performance has been largely improved, the excellent performance of the existing methods heavily relies on an accurately predefined cluster number, which is not always available in the real-world scenario. To enable the deep graph clustering algorithms to work without the guidance of the predefined cluster number, we propose a new deep graph clustering method termed Reinforcement Graph Clustering (RGC). In our proposed"},"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":"2308.06827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-13T18:12:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"312733e16bc006f3f234f11d39332aebe61cc9a3d387ea161f1124d7175d39ed","abstract_canon_sha256":"6c10828844764e1065bc6e686a5415cd52a5cdf4c90c4e151fe017383b0a968f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:45.604662Z","signature_b64":"kOY+Mw9XdwQPIdNQZ8YS9PzxMwgGftr2p8JFI8oZ8tdyOLzqha4sxBMrPNWiGHs0bk1EVWQYgGTCIZkBh/ixAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac0da031d44ca43c8c6c8b5eed99a88924ba979911d1062f194f6b591305e18","last_reissued_at":"2026-07-05T06:40:45.604256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:45.604256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Graph Clustering with Unknown Cluster Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jun Xia, Ke Liang, Meng Liu, Sihang Zhou, Stan Z. Li, Xihong Yang, Xinwang Liu, Yue Liu","submitted_at":"2023-08-13T18:12:28Z","abstract_excerpt":"Deep graph clustering, which aims to group nodes into disjoint clusters by neural networks in an unsupervised manner, has attracted great attention in recent years. Although the performance has been largely improved, the excellent performance of the existing methods heavily relies on an accurately predefined cluster number, which is not always available in the real-world scenario. To enable the deep graph clustering algorithms to work without the guidance of the predefined cluster number, we propose a new deep graph clustering method termed Reinforcement Graph Clustering (RGC). In our proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06827","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/2308.06827/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":"2308.06827","created_at":"2026-07-05T06:40:45.604305+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.06827v1","created_at":"2026-07-05T06:40:45.604305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06827","created_at":"2026-07-05T06:40:45.604305+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LANUAY5ITFE","created_at":"2026-07-05T06:40:45.604305+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LANUAY5ITFEHSGG","created_at":"2026-07-05T06:40:45.604305+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LANUAY5","created_at":"2026-07-05T06:40:45.604305+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/3LANUAY5ITFEHSGGZC265WM2RC","json":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC.json","graph_json":"https://pith.science/api/pith-number/3LANUAY5ITFEHSGGZC265WM2RC/graph.json","events_json":"https://pith.science/api/pith-number/3LANUAY5ITFEHSGGZC265WM2RC/events.json","paper":"https://pith.science/paper/3LANUAY5"},"agent_actions":{"view_html":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC","download_json":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC.json","view_paper":"https://pith.science/paper/3LANUAY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.06827&json=true","fetch_graph":"https://pith.science/api/pith-number/3LANUAY5ITFEHSGGZC265WM2RC/graph.json","fetch_events":"https://pith.science/api/pith-number/3LANUAY5ITFEHSGGZC265WM2RC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC/action/storage_attestation","attest_author":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC/action/author_attestation","sign_citation":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC/action/citation_signature","submit_replication":"https://pith.science/pith/3LANUAY5ITFEHSGGZC265WM2RC/action/replication_record"}},"created_at":"2026-07-05T06:40:45.604305+00:00","updated_at":"2026-07-05T06:40:45.604305+00:00"}