{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SQBGPUKSY2M5EE737CAHDG6NSU","short_pith_number":"pith:SQBGPUKS","canonical_record":{"source":{"id":"2106.06935","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-13T07:03:34Z","cross_cats_sorted":[],"title_canon_sha256":"ba4c792979b57bb4030e118f181384f8b9cbb3bc6fff919c0ea3116c4a0073a3","abstract_canon_sha256":"e70b26a1591abc51615f3ebfc83cb930875abb809ed4d2456c7424d9afec36ec"},"schema_version":"1.0"},"canonical_sha256":"940267d152c699d213fbf880719bcd952deb7f41d558b4357e3db362749342b0","source":{"kind":"arxiv","id":"2106.06935","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06935","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06935v4","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06935","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"SQBGPUKSY2M5","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"pith_short_16","alias_value":"SQBGPUKSY2M5EE73","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"pith_short_8","alias_value":"SQBGPUKS","created_at":"2026-07-05T03:50:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SQBGPUKSY2M5EE737CAHDG6NSU","target":"record","payload":{"canonical_record":{"source":{"id":"2106.06935","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-13T07:03:34Z","cross_cats_sorted":[],"title_canon_sha256":"ba4c792979b57bb4030e118f181384f8b9cbb3bc6fff919c0ea3116c4a0073a3","abstract_canon_sha256":"e70b26a1591abc51615f3ebfc83cb930875abb809ed4d2456c7424d9afec36ec"},"schema_version":"1.0"},"canonical_sha256":"940267d152c699d213fbf880719bcd952deb7f41d558b4357e3db362749342b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:35.440658Z","signature_b64":"Uq6OckR5ZpDRulm2QdTiEJDiELXv2Rg+gCHKsFtsVnAf4DR2QQy+JxyYLN/56/+d0XWlTrHiu27X0TRTyFmWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"940267d152c699d213fbf880719bcd952deb7f41d558b4357e3db362749342b0","last_reissued_at":"2026-07-05T03:50:35.440127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:35.440127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.06935","source_version":4,"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-05T03:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fq/T93Gg7WiSK5RLIHGRWm2Nj+6rW5tEfn8GCE8gEUOah3Xc9aET3Js2AwCG3muKJ1GRvOv2AFpQMRm7+bTzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:12:02.030558Z"},"content_sha256":"3fe6dd438426fef33c9dfd20652a446aba5d76efb07ba99ec2f244c4cbb308ea","schema_version":"1.0","event_id":"sha256:3fe6dd438426fef33c9dfd20652a446aba5d76efb07ba99ec2f244c4cbb308ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SQBGPUKSY2M5EE737CAHDG6NSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Tang, Louis-Pascal Xhonneux, Zhaocheng Zhu, Zuobai Zhang","submitted_at":"2021-06-13T07:03:34Z","abstract_excerpt":"Link prediction is a very fundamental task on graphs. Inspired by traditional path-based methods, in this paper we propose a general and flexible representation learning framework based on paths for link prediction. Specifically, we define the representation of a pair of nodes as the generalized sum of all path representations, with each path representation as the generalized product of the edge representations in the path. Motivated by the Bellman-Ford algorithm for solving the shortest path problem, we show that the proposed path formulation can be efficiently solved by the generalized Bellm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06935","kind":"arxiv","version":4},"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/2106.06935/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-05T03:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVSqZ4H3Mw+4NgdgcxvbPztUjJK3cBQ0jyRojAUa3hK6vxqJ9WRY2YvhPD3k7IZuLuUtpBoic10tGAYh29skCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:12:02.030927Z"},"content_sha256":"5a68f8da0e4e67c0c2efc173c5dbd0ac54a12ec66cc44950bdb69d3a7844a1d1","schema_version":"1.0","event_id":"sha256:5a68f8da0e4e67c0c2efc173c5dbd0ac54a12ec66cc44950bdb69d3a7844a1d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/bundle.json","state_url":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQBGPUKSY2M5EE737CAHDG6NSU/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-05T14:12:02Z","links":{"resolver":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU","bundle":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/bundle.json","state":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQBGPUKSY2M5EE737CAHDG6NSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SQBGPUKSY2M5EE737CAHDG6NSU","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":"e70b26a1591abc51615f3ebfc83cb930875abb809ed4d2456c7424d9afec36ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-13T07:03:34Z","title_canon_sha256":"ba4c792979b57bb4030e118f181384f8b9cbb3bc6fff919c0ea3116c4a0073a3"},"schema_version":"1.0","source":{"id":"2106.06935","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06935","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06935v4","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06935","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"SQBGPUKSY2M5","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"pith_short_16","alias_value":"SQBGPUKSY2M5EE73","created_at":"2026-07-05T03:50:35Z"},{"alias_kind":"pith_short_8","alias_value":"SQBGPUKS","created_at":"2026-07-05T03:50:35Z"}],"graph_snapshots":[{"event_id":"sha256:5a68f8da0e4e67c0c2efc173c5dbd0ac54a12ec66cc44950bdb69d3a7844a1d1","target":"graph","created_at":"2026-07-05T03:50:35Z","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/2106.06935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Link prediction is a very fundamental task on graphs. Inspired by traditional path-based methods, in this paper we propose a general and flexible representation learning framework based on paths for link prediction. Specifically, we define the representation of a pair of nodes as the generalized sum of all path representations, with each path representation as the generalized product of the edge representations in the path. Motivated by the Bellman-Ford algorithm for solving the shortest path problem, we show that the proposed path formulation can be efficiently solved by the generalized Bellm","authors_text":"Jian Tang, Louis-Pascal Xhonneux, Zhaocheng Zhu, Zuobai Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-13T07:03:34Z","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06935","kind":"arxiv","version":4},"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:3fe6dd438426fef33c9dfd20652a446aba5d76efb07ba99ec2f244c4cbb308ea","target":"record","created_at":"2026-07-05T03:50:35Z","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":"e70b26a1591abc51615f3ebfc83cb930875abb809ed4d2456c7424d9afec36ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-13T07:03:34Z","title_canon_sha256":"ba4c792979b57bb4030e118f181384f8b9cbb3bc6fff919c0ea3116c4a0073a3"},"schema_version":"1.0","source":{"id":"2106.06935","kind":"arxiv","version":4}},"canonical_sha256":"940267d152c699d213fbf880719bcd952deb7f41d558b4357e3db362749342b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"940267d152c699d213fbf880719bcd952deb7f41d558b4357e3db362749342b0","first_computed_at":"2026-07-05T03:50:35.440127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:50:35.440127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uq6OckR5ZpDRulm2QdTiEJDiELXv2Rg+gCHKsFtsVnAf4DR2QQy+JxyYLN/56/+d0XWlTrHiu27X0TRTyFmWDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:50:35.440658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.06935","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fe6dd438426fef33c9dfd20652a446aba5d76efb07ba99ec2f244c4cbb308ea","sha256:5a68f8da0e4e67c0c2efc173c5dbd0ac54a12ec66cc44950bdb69d3a7844a1d1"],"state_sha256":"5a38b79324ae895db1b000e242f8e48b017ffde72efa8966f0b8acf9c5a14a2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYrpy0EPg4/u6zngw3CZ6Pn7XHdsbc2jH/0iGnxrPErB1DUyKZBq+dhcLp3+ZVcwiOlZXXkYbwymgRYRulzyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:12:02.033777Z","bundle_sha256":"d65b1a697c9106bb608e42e1032a504f3dcf4f38d942b3a0dc7eb839715e5c7d"}}