{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NEBGAEIU2C57FYVCSOKATPEAL4","short_pith_number":"pith:NEBGAEIU","schema_version":"1.0","canonical_sha256":"6902601114d0bbf2e2a2939409bc805f11955e3f0ad00500d974b322050de6ab","source":{"kind":"arxiv","id":"2606.22167","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.22167","created_at":"2026-06-23T02:13:30.849166+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22167v1","created_at":"2026-06-23T02:13:30.849166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22167","created_at":"2026-06-23T02:13:30.849166+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEBGAEIU2C57","created_at":"2026-06-23T02:13:30.849166+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEBGAEIU2C57FYVC","created_at":"2026-06-23T02:13:30.849166+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEBGAEIU","created_at":"2026-06-23T02:13:30.849166+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/NEBGAEIU2C57FYVCSOKATPEAL4","json":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4.json","graph_json":"https://pith.science/api/pith-number/NEBGAEIU2C57FYVCSOKATPEAL4/graph.json","events_json":"https://pith.science/api/pith-number/NEBGAEIU2C57FYVCSOKATPEAL4/events.json","paper":"https://pith.science/paper/NEBGAEIU"},"agent_actions":{"view_html":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4","download_json":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4.json","view_paper":"https://pith.science/paper/NEBGAEIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22167&json=true","fetch_graph":"https://pith.science/api/pith-number/NEBGAEIU2C57FYVCSOKATPEAL4/graph.json","fetch_events":"https://pith.science/api/pith-number/NEBGAEIU2C57FYVCSOKATPEAL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/action/storage_attestation","attest_author":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/action/author_attestation","sign_citation":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/action/citation_signature","submit_replication":"https://pith.science/pith/NEBGAEIU2C57FYVCSOKATPEAL4/action/replication_record"}},"created_at":"2026-06-23T02:13:30.849166+00:00","updated_at":"2026-06-23T02:13:30.849166+00:00"}