{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZV3KSQBKKJXTZK62EA4GI72BPG","short_pith_number":"pith:ZV3KSQBK","canonical_record":{"source":{"id":"2608.09031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T02:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"7bc1b947b85ed07f4657724f34d20b35c7a6d76f19227b6337da62a873577612","abstract_canon_sha256":"cef66245df979eaa070ac7c23283b224752c57936a4168873dc712455aa8ac72"},"schema_version":"1.0"},"canonical_sha256":"cd76a9402a526f3cabda2038647f4179a93f823f6f50b7fe69ef9d5cda696134","source":{"kind":"arxiv","id":"2608.09031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09031","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09031v1","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09031","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZV3KSQBKKJXT","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"pith_short_16","alias_value":"ZV3KSQBKKJXTZK62","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"pith_short_8","alias_value":"ZV3KSQBK","created_at":"2026-08-11T02:21:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZV3KSQBKKJXTZK62EA4GI72BPG","target":"record","payload":{"canonical_record":{"source":{"id":"2608.09031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T02:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"7bc1b947b85ed07f4657724f34d20b35c7a6d76f19227b6337da62a873577612","abstract_canon_sha256":"cef66245df979eaa070ac7c23283b224752c57936a4168873dc712455aa8ac72"},"schema_version":"1.0"},"canonical_sha256":"cd76a9402a526f3cabda2038647f4179a93f823f6f50b7fe69ef9d5cda696134","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:21:38.485234Z","signature_b64":"6AAZSdKuEB/afBoQf8+izaldmk1YNEwb7w1tHsnjV7t8tlzvLXF9slKGyJf7bmnUMlMheB+HR6QuhHNrBISnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd76a9402a526f3cabda2038647f4179a93f823f6f50b7fe69ef9d5cda696134","last_reissued_at":"2026-08-11T02:21:38.483653Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:21:38.483653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.09031","source_version":1,"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-08-11T02:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXZYAp4oSmrLen8CK/6BoLhjY/qeA0TzU6vohZq4S+A9+TUlPihMJU+pYiKmWXXVMnuG8YSW5v14JePCfQEJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:35:44.833943Z"},"content_sha256":"c94cf27c3a50813f801f9677a6dbeeaa102775deb556fad68ba8809364f3929a","schema_version":"1.0","event_id":"sha256:c94cf27c3a50813f801f9677a6dbeeaa102775deb556fad68ba8809364f3929a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZV3KSQBKKJXTZK62EA4GI72BPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arin Gopakumar, Isuru Herath, Sharan Sahu","submitted_at":"2026-08-10T02:31:46Z","abstract_excerpt":"Graph neural networks typically propagate information through repeated message-passing layers, coupling the distance over which information travels with the number of nonlinear transformations applied. This coupling can make deep architectures difficult to optimize and can lead to over-smoothing, over-squashing, and the loss of long-range information. Linearized Graph Sequence Models (LGSMs) address this issue by separating information depth from processing depth and treating the successive propagation states of each node as a sequence. However, existing LGSMs construct these sequences using f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09031","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/2608.09031/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-08-11T02:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhbqnPWdFKX/dB/isOFl90VjeHUVngkSBomHaG0fuWspmjhTyRihNdkxB1GtisnOHu8xjPi0/ua3/zbJoIILBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T10:35:44.834446Z"},"content_sha256":"2849ae8c1b04e1f0b22f65028179c5e290c1c5a7215c40044cd9e34ed9b109c8","schema_version":"1.0","event_id":"sha256:2849ae8c1b04e1f0b22f65028179c5e290c1c5a7215c40044cd9e34ed9b109c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZV3KSQBKKJXTZK62EA4GI72BPG/bundle.json","state_url":"https://pith.science/pith/ZV3KSQBKKJXTZK62EA4GI72BPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZV3KSQBKKJXTZK62EA4GI72BPG/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-08-18T10:35:44Z","links":{"resolver":"https://pith.science/pith/ZV3KSQBKKJXTZK62EA4GI72BPG","bundle":"https://pith.science/pith/ZV3KSQBKKJXTZK62EA4GI72BPG/bundle.json","state":"https://pith.science/pith/ZV3KSQBKKJXTZK62EA4GI72BPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZV3KSQBKKJXTZK62EA4GI72BPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZV3KSQBKKJXTZK62EA4GI72BPG","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":"cef66245df979eaa070ac7c23283b224752c57936a4168873dc712455aa8ac72","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T02:31:46Z","title_canon_sha256":"7bc1b947b85ed07f4657724f34d20b35c7a6d76f19227b6337da62a873577612"},"schema_version":"1.0","source":{"id":"2608.09031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09031","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09031v1","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09031","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZV3KSQBKKJXT","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"pith_short_16","alias_value":"ZV3KSQBKKJXTZK62","created_at":"2026-08-11T02:21:38Z"},{"alias_kind":"pith_short_8","alias_value":"ZV3KSQBK","created_at":"2026-08-11T02:21:38Z"}],"graph_snapshots":[{"event_id":"sha256:2849ae8c1b04e1f0b22f65028179c5e290c1c5a7215c40044cd9e34ed9b109c8","target":"graph","created_at":"2026-08-11T02:21:38Z","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/2608.09031/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks typically propagate information through repeated message-passing layers, coupling the distance over which information travels with the number of nonlinear transformations applied. This coupling can make deep architectures difficult to optimize and can lead to over-smoothing, over-squashing, and the loss of long-range information. Linearized Graph Sequence Models (LGSMs) address this issue by separating information depth from processing depth and treating the successive propagation states of each node as a sequence. However, existing LGSMs construct these sequences using f","authors_text":"Arin Gopakumar, Isuru Herath, Sharan Sahu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T02:31:46Z","title":"HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09031","kind":"arxiv","version":1},"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:c94cf27c3a50813f801f9677a6dbeeaa102775deb556fad68ba8809364f3929a","target":"record","created_at":"2026-08-11T02:21:38Z","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":"cef66245df979eaa070ac7c23283b224752c57936a4168873dc712455aa8ac72","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T02:31:46Z","title_canon_sha256":"7bc1b947b85ed07f4657724f34d20b35c7a6d76f19227b6337da62a873577612"},"schema_version":"1.0","source":{"id":"2608.09031","kind":"arxiv","version":1}},"canonical_sha256":"cd76a9402a526f3cabda2038647f4179a93f823f6f50b7fe69ef9d5cda696134","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd76a9402a526f3cabda2038647f4179a93f823f6f50b7fe69ef9d5cda696134","first_computed_at":"2026-08-11T02:21:38.483653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T02:21:38.483653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6AAZSdKuEB/afBoQf8+izaldmk1YNEwb7w1tHsnjV7t8tlzvLXF9slKGyJf7bmnUMlMheB+HR6QuhHNrBISnCA==","signature_status":"signed_v1","signed_at":"2026-08-11T02:21:38.485234Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.09031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c94cf27c3a50813f801f9677a6dbeeaa102775deb556fad68ba8809364f3929a","sha256:2849ae8c1b04e1f0b22f65028179c5e290c1c5a7215c40044cd9e34ed9b109c8"],"state_sha256":"c26829cf763b933e852ce4c61103f2100a054f1232be4607b0e5d9ac5e83677d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mc1RFMT94OEdP74+0+46NpaAjaa7mZeWVij0dpOXMu7RRXTDetbGcy3L5i/Uxv7hipwb5xFEYesvD1cln53ABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T10:35:44.840314Z","bundle_sha256":"c4cb9c2d77c20bce44e7c2888cf0c70f7a4d040ebbf2fabb3460476564ac302b"}}