{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HJLKYV26ILY5QJTHUCMHLIL3D6","short_pith_number":"pith:HJLKYV26","canonical_record":{"source":{"id":"2110.04375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-08T20:52:12Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d203affe7d2e24453d73a5cd8e7e6b17d7d41345f392b41efb8c64fbb7436313","abstract_canon_sha256":"c823f9633eca88be1b0300a56d378f3df1239dcfbbe71e27848927ed0692df1f"},"schema_version":"1.0"},"canonical_sha256":"3a56ac575e42f1d82667a09875a17b1f94b012fd7b4875b9593dd301464bb5b3","source":{"kind":"arxiv","id":"2110.04375","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04375","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04375v2","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04375","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"HJLKYV26ILY5","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"HJLKYV26ILY5QJTH","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"HJLKYV26","created_at":"2026-07-05T04:05:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HJLKYV26ILY5QJTHUCMHLIL3D6","target":"record","payload":{"canonical_record":{"source":{"id":"2110.04375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-08T20:52:12Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d203affe7d2e24453d73a5cd8e7e6b17d7d41345f392b41efb8c64fbb7436313","abstract_canon_sha256":"c823f9633eca88be1b0300a56d378f3df1239dcfbbe71e27848927ed0692df1f"},"schema_version":"1.0"},"canonical_sha256":"3a56ac575e42f1d82667a09875a17b1f94b012fd7b4875b9593dd301464bb5b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:05:35.536429Z","signature_b64":"kh1jPHrP3+A1Vw9BVNtsNclYz/z77SBz2pikYWEc4bEQb7pRRCtpFd1QD1YI7o6ntK4VKlpgNzN/65E3ppWoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a56ac575e42f1d82667a09875a17b1f94b012fd7b4875b9593dd301464bb5b3","last_reissued_at":"2026-07-05T04:05:35.535990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:05:35.535990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.04375","source_version":2,"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-05T04:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZ9Et/6WlBUXGfexfoXUakrX34UyjOzGa8HGVB3nSG1YK4AycVvjSkAM0Z2HMFhHYfOvZ0tX6AS7lQ3CVetTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:28:05.586662Z"},"content_sha256":"2454c51ed1f19de900a823d40e99abf25f2bcfc5c684411421219c4d8909447a","schema_version":"1.0","event_id":"sha256:2454c51ed1f19de900a823d40e99abf25f2bcfc5c684411421219c4d8909447a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HJLKYV26ILY5QJTHUCMHLIL3D6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Link Prediction with Walk Pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Cheng Shi, Ivan Dokmani\\'c, Liming Pan","submitted_at":"2021-10-08T20:52:12Z","abstract_excerpt":"Graph neural networks achieve high accuracy in link prediction by jointly leveraging graph topology and node attributes. Topology, however, is represented indirectly; state-of-the-art methods based on subgraph classification label nodes with distance to the target link, so that, although topological information is present, it is tempered by pooling. This makes it challenging to leverage features like loops and motifs associated with network formation mechanisms. We propose a link prediction algorithm based on a new pooling scheme called WalkPool. WalkPool combines the expressivity of topologic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04375","kind":"arxiv","version":2},"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/2110.04375/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-05T04:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ZwLVdyhbksasHSQ+6RuUXlWYQZxUr7L3+B53hyEEhus2EsK1WfRo6QOU8eJfyc2R1olshF09gxJW3siFvDsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T06:28:05.587165Z"},"content_sha256":"3bc11cb45610c0a302c8528b0ccf7a59b27c041df973051533f454de1b30eabe","schema_version":"1.0","event_id":"sha256:3bc11cb45610c0a302c8528b0ccf7a59b27c041df973051533f454de1b30eabe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJLKYV26ILY5QJTHUCMHLIL3D6/bundle.json","state_url":"https://pith.science/pith/HJLKYV26ILY5QJTHUCMHLIL3D6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJLKYV26ILY5QJTHUCMHLIL3D6/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-09T06:28:05Z","links":{"resolver":"https://pith.science/pith/HJLKYV26ILY5QJTHUCMHLIL3D6","bundle":"https://pith.science/pith/HJLKYV26ILY5QJTHUCMHLIL3D6/bundle.json","state":"https://pith.science/pith/HJLKYV26ILY5QJTHUCMHLIL3D6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJLKYV26ILY5QJTHUCMHLIL3D6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HJLKYV26ILY5QJTHUCMHLIL3D6","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":"c823f9633eca88be1b0300a56d378f3df1239dcfbbe71e27848927ed0692df1f","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-08T20:52:12Z","title_canon_sha256":"d203affe7d2e24453d73a5cd8e7e6b17d7d41345f392b41efb8c64fbb7436313"},"schema_version":"1.0","source":{"id":"2110.04375","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04375","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04375v2","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04375","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"HJLKYV26ILY5","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"HJLKYV26ILY5QJTH","created_at":"2026-07-05T04:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"HJLKYV26","created_at":"2026-07-05T04:05:35Z"}],"graph_snapshots":[{"event_id":"sha256:3bc11cb45610c0a302c8528b0ccf7a59b27c041df973051533f454de1b30eabe","target":"graph","created_at":"2026-07-05T04:05: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/2110.04375/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks achieve high accuracy in link prediction by jointly leveraging graph topology and node attributes. Topology, however, is represented indirectly; state-of-the-art methods based on subgraph classification label nodes with distance to the target link, so that, although topological information is present, it is tempered by pooling. This makes it challenging to leverage features like loops and motifs associated with network formation mechanisms. We propose a link prediction algorithm based on a new pooling scheme called WalkPool. WalkPool combines the expressivity of topologic","authors_text":"Cheng Shi, Ivan Dokmani\\'c, Liming Pan","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-08T20:52:12Z","title":"Neural Link Prediction with Walk Pooling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04375","kind":"arxiv","version":2},"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:2454c51ed1f19de900a823d40e99abf25f2bcfc5c684411421219c4d8909447a","target":"record","created_at":"2026-07-05T04:05: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":"c823f9633eca88be1b0300a56d378f3df1239dcfbbe71e27848927ed0692df1f","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-08T20:52:12Z","title_canon_sha256":"d203affe7d2e24453d73a5cd8e7e6b17d7d41345f392b41efb8c64fbb7436313"},"schema_version":"1.0","source":{"id":"2110.04375","kind":"arxiv","version":2}},"canonical_sha256":"3a56ac575e42f1d82667a09875a17b1f94b012fd7b4875b9593dd301464bb5b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a56ac575e42f1d82667a09875a17b1f94b012fd7b4875b9593dd301464bb5b3","first_computed_at":"2026-07-05T04:05:35.535990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:05:35.535990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kh1jPHrP3+A1Vw9BVNtsNclYz/z77SBz2pikYWEc4bEQb7pRRCtpFd1QD1YI7o6ntK4VKlpgNzN/65E3ppWoBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:05:35.536429Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.04375","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2454c51ed1f19de900a823d40e99abf25f2bcfc5c684411421219c4d8909447a","sha256:3bc11cb45610c0a302c8528b0ccf7a59b27c041df973051533f454de1b30eabe"],"state_sha256":"6a83f8b7590d76245421290684386abeca38d88b291b479318966ae1b70af892"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pt6RCFPoH7uVedjPi+KCec4criHQePQGc2QvhmgLLA/zi/Swvldt4dZoZvllv4WBqi1/wkgRXwpThHGsJC6qCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T06:28:05.592370Z","bundle_sha256":"e7a48fad11d4621a6582d86a58bfa3717f7039caac3307f85580e11b9c091d29"}}