{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZMAOKVKLCCJOWCU4MSANPJAP2W","short_pith_number":"pith:ZMAOKVKL","schema_version":"1.0","canonical_sha256":"cb00e5554b1092eb0a9c6480d7a40fd5a8bc530d46ed7680ea29b17ddc97ecad","source":{"kind":"arxiv","id":"2412.01519","version":2},"attestation_state":"computed","paper":{"title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel Freedman, Or Litany, Tomer Borreda","submitted_at":"2024-12-02T14:10:23Z","abstract_excerpt":"We present ReHub, a novel graph transformer architecture that achieves linear complexity through an efficient reassignment technique between nodes and virtual nodes. Graph transformers have become increasingly important in graph learning for their ability to utilize long-range node communication explicitly, addressing limitations such as oversmoothing and oversquashing found in message-passing graph networks. However, their dense attention mechanism scales quadratically with the number of nodes, limiting their applicability to large-scale graphs. ReHub draws inspiration from the airline indust"},"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.01519","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-02T14:10:23Z","cross_cats_sorted":[],"title_canon_sha256":"b07e624d56eef59f56fb3a973f34729341edb02416029ef23df94ffa660fc9d3","abstract_canon_sha256":"43418ca4ca2622348b83face090921596fff055f9d3bad4285835f424c23311d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:22.371916Z","signature_b64":"3bGQdtM9SLSPC32t2hNyc/Bwd+jukcNyxMzKWfqSwjEUTXFh6552MMgqltNRpY+1EZGPu/1okzbFZCa8d/iSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb00e5554b1092eb0a9c6480d7a40fd5a8bc530d46ed7680ea29b17ddc97ecad","last_reissued_at":"2026-07-05T11:58:22.371408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:22.371408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel Freedman, Or Litany, Tomer Borreda","submitted_at":"2024-12-02T14:10:23Z","abstract_excerpt":"We present ReHub, a novel graph transformer architecture that achieves linear complexity through an efficient reassignment technique between nodes and virtual nodes. Graph transformers have become increasingly important in graph learning for their ability to utilize long-range node communication explicitly, addressing limitations such as oversmoothing and oversquashing found in message-passing graph networks. However, their dense attention mechanism scales quadratically with the number of nodes, limiting their applicability to large-scale graphs. ReHub draws inspiration from the airline indust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01519","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.01519/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.01519","created_at":"2026-07-05T11:58:22.371471+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.01519v2","created_at":"2026-07-05T11:58:22.371471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01519","created_at":"2026-07-05T11:58:22.371471+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMAOKVKLCCJO","created_at":"2026-07-05T11:58:22.371471+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMAOKVKLCCJOWCU4","created_at":"2026-07-05T11:58:22.371471+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMAOKVKL","created_at":"2026-07-05T11:58:22.371471+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/ZMAOKVKLCCJOWCU4MSANPJAP2W","json":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W.json","graph_json":"https://pith.science/api/pith-number/ZMAOKVKLCCJOWCU4MSANPJAP2W/graph.json","events_json":"https://pith.science/api/pith-number/ZMAOKVKLCCJOWCU4MSANPJAP2W/events.json","paper":"https://pith.science/paper/ZMAOKVKL"},"agent_actions":{"view_html":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W","download_json":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W.json","view_paper":"https://pith.science/paper/ZMAOKVKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.01519&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMAOKVKLCCJOWCU4MSANPJAP2W/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMAOKVKLCCJOWCU4MSANPJAP2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/action/storage_attestation","attest_author":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/action/author_attestation","sign_citation":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/action/citation_signature","submit_replication":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/action/replication_record"}},"created_at":"2026-07-05T11:58:22.371471+00:00","updated_at":"2026-07-05T11:58:22.371471+00:00"}