{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GMBDYTZFVP6BWK2WUHE5F4PVFO","short_pith_number":"pith:GMBDYTZF","canonical_record":{"source":{"id":"2507.07138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-09T01:37:19Z","cross_cats_sorted":[],"title_canon_sha256":"bfac1a479afb9f15ed68dfa38270c37c87d759aff4dce01cf07af87dba0389e2","abstract_canon_sha256":"46efc605aa639ecb9d0465e970f1a4f08d5735cc54dedb8e4ac76c19279865b4"},"schema_version":"1.0"},"canonical_sha256":"33023c4f25abfc1b2b56a1c9d2f1f52ba18b43a541e42dab9bb22ed011fc290a","source":{"kind":"arxiv","id":"2507.07138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07138","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07138v1","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07138","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"GMBDYTZFVP6B","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"pith_short_16","alias_value":"GMBDYTZFVP6BWK2W","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"pith_short_8","alias_value":"GMBDYTZF","created_at":"2026-07-05T11:34:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GMBDYTZFVP6BWK2WUHE5F4PVFO","target":"record","payload":{"canonical_record":{"source":{"id":"2507.07138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-09T01:37:19Z","cross_cats_sorted":[],"title_canon_sha256":"bfac1a479afb9f15ed68dfa38270c37c87d759aff4dce01cf07af87dba0389e2","abstract_canon_sha256":"46efc605aa639ecb9d0465e970f1a4f08d5735cc54dedb8e4ac76c19279865b4"},"schema_version":"1.0"},"canonical_sha256":"33023c4f25abfc1b2b56a1c9d2f1f52ba18b43a541e42dab9bb22ed011fc290a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:31.668661Z","signature_b64":"hj7qVTyOU+/lNDdOYSfWHsdkvuybR1GWVJkW+GTvAcNFoRN3zjCjuDIgXh2uuSnNsrUjDAGOMG9uMn7rSJPtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33023c4f25abfc1b2b56a1c9d2f1f52ba18b43a541e42dab9bb22ed011fc290a","last_reissued_at":"2026-07-05T11:34:31.668182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:31.668182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.07138","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-07-05T11:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeYDc016U1pzhbc4JZFxofj4w2LFasmG8SJX7TGPIi/fXMQlH8iatGoVU8x63R0479n84hUvmxPutvP3KC+LCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:11:05.876825Z"},"content_sha256":"4b38519d59331ea22af1beda859798a157d9de4bc9192853f478ceb7059bb0a4","schema_version":"1.0","event_id":"sha256:4b38519d59331ea22af1beda859798a157d9de4bc9192853f478ceb7059bb0a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GMBDYTZFVP6BWK2WUHE5F4PVFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrea Passerini, Antonio Longa, Bruno Lepri, Francesco Ferrini, Veronica Lachi","submitted_at":"2025-07-09T01:37:19Z","abstract_excerpt":"Graph Neural Networks (GNNs) often struggle to capture the link-specific structural patterns crucial for accurate link prediction, as their node-centric message-passing schemes overlook the subgraph structures connecting a pair of nodes. Existing methods to inject such structural context either incur high computational cost or rely on simplistic heuristics (e.g., common neighbor counts) that fail to model multi-hop dependencies. We introduce SP4LP (Shortest Path for Link Prediction), a novel framework that combines GNN-based node encodings with sequence modeling over shortest paths. Specifical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07138","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/2507.07138/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:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VthOB9Nqq10Ash//nZNufxbxR8TAK97UQwxQTGwMRrMb2Rpm/mwHoRCOp+0TmytXqLL77ELh4vfPyjCX+0rwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:11:05.877347Z"},"content_sha256":"74d1bf781747b1546dd379430ba235d9e1ffa7714d2650b4aa3fb57177b24486","schema_version":"1.0","event_id":"sha256:74d1bf781747b1546dd379430ba235d9e1ffa7714d2650b4aa3fb57177b24486"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMBDYTZFVP6BWK2WUHE5F4PVFO/bundle.json","state_url":"https://pith.science/pith/GMBDYTZFVP6BWK2WUHE5F4PVFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMBDYTZFVP6BWK2WUHE5F4PVFO/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-07T17:11:05Z","links":{"resolver":"https://pith.science/pith/GMBDYTZFVP6BWK2WUHE5F4PVFO","bundle":"https://pith.science/pith/GMBDYTZFVP6BWK2WUHE5F4PVFO/bundle.json","state":"https://pith.science/pith/GMBDYTZFVP6BWK2WUHE5F4PVFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMBDYTZFVP6BWK2WUHE5F4PVFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GMBDYTZFVP6BWK2WUHE5F4PVFO","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":"46efc605aa639ecb9d0465e970f1a4f08d5735cc54dedb8e4ac76c19279865b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-09T01:37:19Z","title_canon_sha256":"bfac1a479afb9f15ed68dfa38270c37c87d759aff4dce01cf07af87dba0389e2"},"schema_version":"1.0","source":{"id":"2507.07138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07138","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07138v1","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07138","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"GMBDYTZFVP6B","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"pith_short_16","alias_value":"GMBDYTZFVP6BWK2W","created_at":"2026-07-05T11:34:31Z"},{"alias_kind":"pith_short_8","alias_value":"GMBDYTZF","created_at":"2026-07-05T11:34:31Z"}],"graph_snapshots":[{"event_id":"sha256:74d1bf781747b1546dd379430ba235d9e1ffa7714d2650b4aa3fb57177b24486","target":"graph","created_at":"2026-07-05T11:34:31Z","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/2507.07138/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) often struggle to capture the link-specific structural patterns crucial for accurate link prediction, as their node-centric message-passing schemes overlook the subgraph structures connecting a pair of nodes. Existing methods to inject such structural context either incur high computational cost or rely on simplistic heuristics (e.g., common neighbor counts) that fail to model multi-hop dependencies. We introduce SP4LP (Shortest Path for Link Prediction), a novel framework that combines GNN-based node encodings with sequence modeling over shortest paths. Specifical","authors_text":"Andrea Passerini, Antonio Longa, Bruno Lepri, Francesco Ferrini, Veronica Lachi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07138","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:4b38519d59331ea22af1beda859798a157d9de4bc9192853f478ceb7059bb0a4","target":"record","created_at":"2026-07-05T11:34:31Z","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":"46efc605aa639ecb9d0465e970f1a4f08d5735cc54dedb8e4ac76c19279865b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-09T01:37:19Z","title_canon_sha256":"bfac1a479afb9f15ed68dfa38270c37c87d759aff4dce01cf07af87dba0389e2"},"schema_version":"1.0","source":{"id":"2507.07138","kind":"arxiv","version":1}},"canonical_sha256":"33023c4f25abfc1b2b56a1c9d2f1f52ba18b43a541e42dab9bb22ed011fc290a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33023c4f25abfc1b2b56a1c9d2f1f52ba18b43a541e42dab9bb22ed011fc290a","first_computed_at":"2026-07-05T11:34:31.668182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:31.668182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hj7qVTyOU+/lNDdOYSfWHsdkvuybR1GWVJkW+GTvAcNFoRN3zjCjuDIgXh2uuSnNsrUjDAGOMG9uMn7rSJPtAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:31.668661Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.07138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b38519d59331ea22af1beda859798a157d9de4bc9192853f478ceb7059bb0a4","sha256:74d1bf781747b1546dd379430ba235d9e1ffa7714d2650b4aa3fb57177b24486"],"state_sha256":"69005827d0c260188171d41804aa22af424f4ab0ff924c1ad2863c5f31a4bb8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WH/zbDe+0VZ6tCeJ2XXHZcC0SabDWePXmpDgFK+JGiU/UUzZRVNdAz1IH65exG6nFmLVODXl/8uWorEUHiGmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T17:11:05.883179Z","bundle_sha256":"6ad1a2186bcd3a80ab4bafde1d9fd7cfd727ae2a9417abb48db1f255a964f7eb"}}