{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SQBGPUKSY2M5EE737CAHDG6NSU","short_pith_number":"pith:SQBGPUKS","schema_version":"1.0","canonical_sha256":"940267d152c699d213fbf880719bcd952deb7f41d558b4357e3db362749342b0","source":{"kind":"arxiv","id":"2106.06935","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2106.06935","created_at":"2026-07-05T03:50:35.440192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.06935v4","created_at":"2026-07-05T03:50:35.440192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06935","created_at":"2026-07-05T03:50:35.440192+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQBGPUKSY2M5","created_at":"2026-07-05T03:50:35.440192+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQBGPUKSY2M5EE73","created_at":"2026-07-05T03:50:35.440192+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQBGPUKS","created_at":"2026-07-05T03:50:35.440192+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/SQBGPUKSY2M5EE737CAHDG6NSU","json":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU.json","graph_json":"https://pith.science/api/pith-number/SQBGPUKSY2M5EE737CAHDG6NSU/graph.json","events_json":"https://pith.science/api/pith-number/SQBGPUKSY2M5EE737CAHDG6NSU/events.json","paper":"https://pith.science/paper/SQBGPUKS"},"agent_actions":{"view_html":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU","download_json":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU.json","view_paper":"https://pith.science/paper/SQBGPUKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.06935&json=true","fetch_graph":"https://pith.science/api/pith-number/SQBGPUKSY2M5EE737CAHDG6NSU/graph.json","fetch_events":"https://pith.science/api/pith-number/SQBGPUKSY2M5EE737CAHDG6NSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/action/storage_attestation","attest_author":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/action/author_attestation","sign_citation":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/action/citation_signature","submit_replication":"https://pith.science/pith/SQBGPUKSY2M5EE737CAHDG6NSU/action/replication_record"}},"created_at":"2026-07-05T03:50:35.440192+00:00","updated_at":"2026-07-05T03:50:35.440192+00:00"}