{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NEBGAEIU2C57FYVCSOKATPEAL4","short_pith_number":"pith:NEBGAEIU","canonical_record":{"source":{"id":"2606.22167","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T17:56:36Z","cross_cats_sorted":[],"title_canon_sha256":"16e97f3f800cb48724092276992d2c280bf1c98b3dc7bc0ae7d87e75399a50c3","abstract_canon_sha256":"debff3cb2f0a1e166f59b02870227dab8c732727f55dcb23ea55342dfed4646f"},"schema_version":"1.0"},"canonical_sha256":"6902601114d0bbf2e2a2939409bc805f11955e3f0ad00500d974b322050de6ab","source":{"kind":"arxiv","id":"2606.22167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22167","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22167v1","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22167","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"NEBGAEIU2C57","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"pith_short_16","alias_value":"NEBGAEIU2C57FYVC","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"pith_short_8","alias_value":"NEBGAEIU","created_at":"2026-06-23T02:13:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NEBGAEIU2C57FYVCSOKATPEAL4","target":"record","payload":{"canonical_record":{"source":{"id":"2606.22167","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T17:56:36Z","cross_cats_sorted":[],"title_canon_sha256":"16e97f3f800cb48724092276992d2c280bf1c98b3dc7bc0ae7d87e75399a50c3","abstract_canon_sha256":"debff3cb2f0a1e166f59b02870227dab8c732727f55dcb23ea55342dfed4646f"},"schema_version":"1.0"},"canonical_sha256":"6902601114d0bbf2e2a2939409bc805f11955e3f0ad00500d974b322050de6ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:30.849486Z","signature_b64":"88rTxoxLLvJKu8pgbBSpl/OBnGOvxJBGomLKtMUyxvMxu2mjHfkBvykIhrdmhpTtfI11G+M9G+7bIQVIGbQEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6902601114d0bbf2e2a2939409bc805f11955e3f0ad00500d974b322050de6ab","last_reissued_at":"2026-06-23T02:13:30.849095Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:30.849095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.22167","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-06-23T02:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjCv2xzbihNiqKrEF4jXVUR6vacdB1fU4vsZHmYCdq2ItKRg6cdBdyNFbhNrvS/Nu3X79Y/g7Wco3Ly9q8TkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:21:15.517919Z"},"content_sha256":"67b41be9c65b5474a2275e0d1825bb451641df3142a1cbaceef46c71a062c15a","schema_version":"1.0","event_id":"sha256:67b41be9c65b5474a2275e0d1825bb451641df3142a1cbaceef46c71a062c15a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NEBGAEIU2C57FYVCSOKATPEAL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Early-Exit Graph Neural Networks for Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrea Giuseppe Di Francesco, Roman Knyazhitskiy","submitted_at":"2026-06-20T17:56:36Z","abstract_excerpt":"Graph Neural Networks are great for link prediction in various network-like structures; however, the question of their speed/quality tradeoff has been barely studied. While in practice the time it takes to do inference matters little for small benchmarks, the latency does limit applicability in large-scale domains. In this work, we explore early-exiting strategies that can be applied to Graph Neural Networks to solve the problem of link-prediction faster. We use no auxiliary losses to enforce early exiting, allowing it to emerge as an implicit property of the architecture. We show that our met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22167","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/2606.22167/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-06-23T02:13:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GS1yyAHiK/K8T5qwN3N849eK+Iq8xeoyl9WJPaYZMPjtZh+YXzqhw//GW5nyvgGt3XfBEQhEs0pEp/Jxq38qAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:21:15.518276Z"},"content_sha256":"c8c7fe0d6de070db6748611d2e366b8797f0d3127713442f14745e3f9195e057","schema_version":"1.0","event_id":"sha256:c8c7fe0d6de070db6748611d2e366b8797f0d3127713442f14745e3f9195e057"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/bundle.json","state_url":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEBGAEIU2C57FYVCSOKATPEAL4/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-06-26T22:21:15Z","links":{"resolver":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4","bundle":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/bundle.json","state":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEBGAEIU2C57FYVCSOKATPEAL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NEBGAEIU2C57FYVCSOKATPEAL4","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":"debff3cb2f0a1e166f59b02870227dab8c732727f55dcb23ea55342dfed4646f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T17:56:36Z","title_canon_sha256":"16e97f3f800cb48724092276992d2c280bf1c98b3dc7bc0ae7d87e75399a50c3"},"schema_version":"1.0","source":{"id":"2606.22167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22167","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22167v1","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22167","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"pith_short_12","alias_value":"NEBGAEIU2C57","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"pith_short_16","alias_value":"NEBGAEIU2C57FYVC","created_at":"2026-06-23T02:13:30Z"},{"alias_kind":"pith_short_8","alias_value":"NEBGAEIU","created_at":"2026-06-23T02:13:30Z"}],"graph_snapshots":[{"event_id":"sha256:c8c7fe0d6de070db6748611d2e366b8797f0d3127713442f14745e3f9195e057","target":"graph","created_at":"2026-06-23T02:13:30Z","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/2606.22167/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks are great for link prediction in various network-like structures; however, the question of their speed/quality tradeoff has been barely studied. While in practice the time it takes to do inference matters little for small benchmarks, the latency does limit applicability in large-scale domains. In this work, we explore early-exiting strategies that can be applied to Graph Neural Networks to solve the problem of link-prediction faster. We use no auxiliary losses to enforce early exiting, allowing it to emerge as an implicit property of the architecture. We show that our met","authors_text":"Andrea Giuseppe Di Francesco, Roman Knyazhitskiy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T17:56:36Z","title":"Early-Exit Graph Neural Networks for Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22167","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:67b41be9c65b5474a2275e0d1825bb451641df3142a1cbaceef46c71a062c15a","target":"record","created_at":"2026-06-23T02:13:30Z","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":"debff3cb2f0a1e166f59b02870227dab8c732727f55dcb23ea55342dfed4646f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T17:56:36Z","title_canon_sha256":"16e97f3f800cb48724092276992d2c280bf1c98b3dc7bc0ae7d87e75399a50c3"},"schema_version":"1.0","source":{"id":"2606.22167","kind":"arxiv","version":1}},"canonical_sha256":"6902601114d0bbf2e2a2939409bc805f11955e3f0ad00500d974b322050de6ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6902601114d0bbf2e2a2939409bc805f11955e3f0ad00500d974b322050de6ab","first_computed_at":"2026-06-23T02:13:30.849095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:30.849095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88rTxoxLLvJKu8pgbBSpl/OBnGOvxJBGomLKtMUyxvMxu2mjHfkBvykIhrdmhpTtfI11G+M9G+7bIQVIGbQEBQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:30.849486Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67b41be9c65b5474a2275e0d1825bb451641df3142a1cbaceef46c71a062c15a","sha256:c8c7fe0d6de070db6748611d2e366b8797f0d3127713442f14745e3f9195e057"],"state_sha256":"b7bc9fd5c0473e39c9fcf30e2936cf717c3af6267967e2a68a95ae6dd4140d83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgD2V78kWg5ZlmGAfhsvnNZfj4bDRX7FL8vG5jKvWuHfHrads7lnu1ZvzzfpxqRUkxCP+agYpzlhFvO7609xCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T22:21:15.520183Z","bundle_sha256":"af331bbaa626c3adfb4c6bce66541735d5e890b048cd422107027e41683e94b7"}}