{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3OOJHSYSZV6IJSYOKP5VGUKYM3","short_pith_number":"pith:3OOJHSYS","schema_version":"1.0","canonical_sha256":"db9c93cb12cd7c84cb0e53fb53515866c05610f37ac686c8eac32cbe045e290f","source":{"kind":"arxiv","id":"2412.09902","version":2},"attestation_state":"computed","paper":{"title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.SI"],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Erlin Pan, Wenyu Chen, Xuanting Xie, Zhaochen Guo, Zhao Kang","submitted_at":"2024-12-13T06:42:36Z","abstract_excerpt":"Most existing graph clustering methods primarily focus on exploiting topological structure, often neglecting the ``missing-half\" node feature information, especially how these features can enhance clustering performance. This issue is further compounded by the challenges associated with high-dimensional features. Feature selection in graph clustering is particularly difficult because it requires simultaneously discovering clusters and identifying the relevant features for these clusters. To address this gap, we introduce a novel paradigm called ``one node one model\", which builds an exclusive "},"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":"2412.09902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-13T06:42:36Z","cross_cats_sorted":["cs.AI","cs.DC","cs.SI"],"title_canon_sha256":"5fd6bf7dc1585ed6bae69f12879a5f447320c3320293eb34f793bba4287c0360","abstract_canon_sha256":"897244a085083cbed53dcd0ec0f15296f222ceca691867976895c7e2a4b67549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:44.084815Z","signature_b64":"RJeQ+B/7dGWMEg/kLNNhHjCbYeR8YT4D9bPlYNIe0jL5MftwFycEPIBo9D9V9TTEBrhuye2DfKly69mU/JHTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db9c93cb12cd7c84cb0e53fb53515866c05610f37ac686c8eac32cbe045e290f","last_reissued_at":"2026-07-05T09:58:44.084332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:44.084332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.SI"],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Erlin Pan, Wenyu Chen, Xuanting Xie, Zhaochen Guo, Zhao Kang","submitted_at":"2024-12-13T06:42:36Z","abstract_excerpt":"Most existing graph clustering methods primarily focus on exploiting topological structure, often neglecting the ``missing-half\" node feature information, especially how these features can enhance clustering performance. This issue is further compounded by the challenges associated with high-dimensional features. Feature selection in graph clustering is particularly difficult because it requires simultaneously discovering clusters and identifying the relevant features for these clusters. To address this gap, we introduce a novel paradigm called ``one node one model\", which builds an exclusive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09902","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/2412.09902/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":"2412.09902","created_at":"2026-07-05T09:58:44.084391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.09902v2","created_at":"2026-07-05T09:58:44.084391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09902","created_at":"2026-07-05T09:58:44.084391+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OOJHSYSZV6I","created_at":"2026-07-05T09:58:44.084391+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OOJHSYSZV6IJSYO","created_at":"2026-07-05T09:58:44.084391+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OOJHSYS","created_at":"2026-07-05T09:58:44.084391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06808","citing_title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3","json":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3.json","graph_json":"https://pith.science/api/pith-number/3OOJHSYSZV6IJSYOKP5VGUKYM3/graph.json","events_json":"https://pith.science/api/pith-number/3OOJHSYSZV6IJSYOKP5VGUKYM3/events.json","paper":"https://pith.science/paper/3OOJHSYS"},"agent_actions":{"view_html":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3","download_json":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3.json","view_paper":"https://pith.science/paper/3OOJHSYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.09902&json=true","fetch_graph":"https://pith.science/api/pith-number/3OOJHSYSZV6IJSYOKP5VGUKYM3/graph.json","fetch_events":"https://pith.science/api/pith-number/3OOJHSYSZV6IJSYOKP5VGUKYM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3/action/storage_attestation","attest_author":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3/action/author_attestation","sign_citation":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3/action/citation_signature","submit_replication":"https://pith.science/pith/3OOJHSYSZV6IJSYOKP5VGUKYM3/action/replication_record"}},"created_at":"2026-07-05T09:58:44.084391+00:00","updated_at":"2026-07-05T09:58:44.084391+00:00"}