{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZMAOKVKLCCJOWCU4MSANPJAP2W","short_pith_number":"pith:ZMAOKVKL","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"},"canonical_sha256":"cb00e5554b1092eb0a9c6480d7a40fd5a8bc530d46ed7680ea29b17ddc97ecad","source":{"kind":"arxiv","id":"2412.01519","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01519","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01519v2","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01519","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZMAOKVKLCCJO","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_16","alias_value":"ZMAOKVKLCCJOWCU4","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_8","alias_value":"ZMAOKVKL","created_at":"2026-07-05T11:58:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZMAOKVKLCCJOWCU4MSANPJAP2W","target":"record","payload":{"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"},"canonical_sha256":"cb00e5554b1092eb0a9c6480d7a40fd5a8bc530d46ed7680ea29b17ddc97ecad","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"},"source_kind":"arxiv","source_id":"2412.01519","source_version":2,"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-05T11:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMse7K6CP8/B/XOkln5gZrKdTbODizyDQ6Z6+XSs43LgR0zIKFiiaoI2KAk4kHaoT4Paz+TdfF4X9cPPzkpQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T14:18:59.474438Z"},"content_sha256":"bdee3a77c4f7f61b66b1586c6d6312573bbe9628674a92cae468453367a849d0","schema_version":"1.0","event_id":"sha256:bdee3a77c4f7f61b66b1586c6d6312573bbe9628674a92cae468453367a849d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZMAOKVKLCCJOWCU4MSANPJAP2W","target":"graph","payload":{"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"},"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-05T11:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzSVZkz5EErBCSZEYow80DORdGM3X82QTzLLYNX0ZdKD317JNWBjWDD1i4VgcuJgapAoy/F3e6TH764bHs5QBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T14:18:59.474814Z"},"content_sha256":"2a1afb40cc885c43a1e7722614318a60d0eb8591e3587834dc2facbf4bdfa708","schema_version":"1.0","event_id":"sha256:2a1afb40cc885c43a1e7722614318a60d0eb8591e3587834dc2facbf4bdfa708"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/bundle.json","state_url":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/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-11T14:18:59Z","links":{"resolver":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W","bundle":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/bundle.json","state":"https://pith.science/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMAOKVKLCCJOWCU4MSANPJAP2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZMAOKVKLCCJOWCU4MSANPJAP2W","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":"43418ca4ca2622348b83face090921596fff055f9d3bad4285835f424c23311d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-02T14:10:23Z","title_canon_sha256":"b07e624d56eef59f56fb3a973f34729341edb02416029ef23df94ffa660fc9d3"},"schema_version":"1.0","source":{"id":"2412.01519","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.01519","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"2412.01519v2","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01519","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZMAOKVKLCCJO","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_16","alias_value":"ZMAOKVKLCCJOWCU4","created_at":"2026-07-05T11:58:22Z"},{"alias_kind":"pith_short_8","alias_value":"ZMAOKVKL","created_at":"2026-07-05T11:58:22Z"}],"graph_snapshots":[{"event_id":"sha256:2a1afb40cc885c43a1e7722614318a60d0eb8591e3587834dc2facbf4bdfa708","target":"graph","created_at":"2026-07-05T11:58:22Z","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/2412.01519/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Daniel Freedman, Or Litany, Tomer Borreda","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01519","kind":"arxiv","version":2},"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:bdee3a77c4f7f61b66b1586c6d6312573bbe9628674a92cae468453367a849d0","target":"record","created_at":"2026-07-05T11:58:22Z","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":"43418ca4ca2622348b83face090921596fff055f9d3bad4285835f424c23311d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-02T14:10:23Z","title_canon_sha256":"b07e624d56eef59f56fb3a973f34729341edb02416029ef23df94ffa660fc9d3"},"schema_version":"1.0","source":{"id":"2412.01519","kind":"arxiv","version":2}},"canonical_sha256":"cb00e5554b1092eb0a9c6480d7a40fd5a8bc530d46ed7680ea29b17ddc97ecad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb00e5554b1092eb0a9c6480d7a40fd5a8bc530d46ed7680ea29b17ddc97ecad","first_computed_at":"2026-07-05T11:58:22.371408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:22.371408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3bGQdtM9SLSPC32t2hNyc/Bwd+jukcNyxMzKWfqSwjEUTXFh6552MMgqltNRpY+1EZGPu/1okzbFZCa8d/iSDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:22.371916Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.01519","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdee3a77c4f7f61b66b1586c6d6312573bbe9628674a92cae468453367a849d0","sha256:2a1afb40cc885c43a1e7722614318a60d0eb8591e3587834dc2facbf4bdfa708"],"state_sha256":"86ff37337e6fa9e44a6cd5b3afe7cb79233d90a225bd278dbcf674ac431a3434"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhpW6MSFd3x3BPMf3H9n354GPAqkP6z5vYvhyGTy1TWGwpmfVJh3M9edRmEfda6RQPgnX2UTGufjyYdNc7p8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T14:18:59.476973Z","bundle_sha256":"c49a4a9cba0153d19b4e3eead15526b67d133a6a14ad71edc5cf9ca4c5ebd956"}}