{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AOOCCBK5E2GMTREJOFBWLE3GIP","short_pith_number":"pith:AOOCCBK5","schema_version":"1.0","canonical_sha256":"039c21055d268cc9c489714365936643ed14d15954c327bbb2ab5c5e6adaaf34","source":{"kind":"arxiv","id":"2405.16435","version":2},"attestation_state":"computed","paper":{"title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongkang Li, Lei Shi, Qijiong Liu, Xiao-Ming Wu, Yuankai Luo","submitted_at":"2024-05-26T05:22:38Z","abstract_excerpt":"We present a novel end-to-end framework that generates highly compact (typically 6-15 dimensions), discrete (int4 type), and interpretable node representations, termed node identifiers (node IDs), to tackle inference challenges on large-scale graphs. By employing vector quantization, we compress continuous node embeddings from multiple layers of a Graph Neural Network (GNN) into discrete codes, applicable under both self-supervised and supervised learning paradigms. These node IDs capture high-level abstractions of graph data and offer interpretability that traditional GNN embeddings lack. Ext"},"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":"2405.16435","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-26T05:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"6b8afbca788cd6529dd991a40238872042d196a540de7f34eb4979c1f686702f","abstract_canon_sha256":"7179e39fbec1e5d73f15589b87472d458b66e699386a1fd8af9eba8af283aec5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:18.315540Z","signature_b64":"tm9hUHJF01dBoUBTIUcwb3fxjdm/QeJFDyWrBslvPnxDvZRPeIu4hW+gneHiTx2SJ4CGZ26iI8Yc2tvf4tDRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"039c21055d268cc9c489714365936643ed14d15954c327bbb2ab5c5e6adaaf34","last_reissued_at":"2026-07-05T09:22:18.315034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:18.315034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongkang Li, Lei Shi, Qijiong Liu, Xiao-Ming Wu, Yuankai Luo","submitted_at":"2024-05-26T05:22:38Z","abstract_excerpt":"We present a novel end-to-end framework that generates highly compact (typically 6-15 dimensions), discrete (int4 type), and interpretable node representations, termed node identifiers (node IDs), to tackle inference challenges on large-scale graphs. By employing vector quantization, we compress continuous node embeddings from multiple layers of a Graph Neural Network (GNN) into discrete codes, applicable under both self-supervised and supervised learning paradigms. These node IDs capture high-level abstractions of graph data and offer interpretability that traditional GNN embeddings lack. Ext"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16435","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/2405.16435/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":"2405.16435","created_at":"2026-07-05T09:22:18.315097+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16435v2","created_at":"2026-07-05T09:22:18.315097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16435","created_at":"2026-07-05T09:22:18.315097+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOOCCBK5E2GM","created_at":"2026-07-05T09:22:18.315097+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOOCCBK5E2GMTREJ","created_at":"2026-07-05T09:22:18.315097+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOOCCBK5","created_at":"2026-07-05T09:22:18.315097+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/AOOCCBK5E2GMTREJOFBWLE3GIP","json":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP.json","graph_json":"https://pith.science/api/pith-number/AOOCCBK5E2GMTREJOFBWLE3GIP/graph.json","events_json":"https://pith.science/api/pith-number/AOOCCBK5E2GMTREJOFBWLE3GIP/events.json","paper":"https://pith.science/paper/AOOCCBK5"},"agent_actions":{"view_html":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP","download_json":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP.json","view_paper":"https://pith.science/paper/AOOCCBK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16435&json=true","fetch_graph":"https://pith.science/api/pith-number/AOOCCBK5E2GMTREJOFBWLE3GIP/graph.json","fetch_events":"https://pith.science/api/pith-number/AOOCCBK5E2GMTREJOFBWLE3GIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP/action/storage_attestation","attest_author":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP/action/author_attestation","sign_citation":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP/action/citation_signature","submit_replication":"https://pith.science/pith/AOOCCBK5E2GMTREJOFBWLE3GIP/action/replication_record"}},"created_at":"2026-07-05T09:22:18.315097+00:00","updated_at":"2026-07-05T09:22:18.315097+00:00"}