{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AE5SJEYN42C66WV5PVI6JKSCXS","short_pith_number":"pith:AE5SJEYN","canonical_record":{"source":{"id":"1802.09691","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-27T02:35:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cf7b4118d9fefc65fb566a59a83e851e60deaee597eec45de6a96707cb4cd4ae","abstract_canon_sha256":"4a1ce4fd3e863ef7644e6116a3d717581106bfc45693107f55b8cadbe61e35c5"},"schema_version":"1.0"},"canonical_sha256":"013b24930de685ef5abd7d51e4aa42bc9abb80c337e3384826ca806006b11b3e","source":{"kind":"arxiv","id":"1802.09691","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09691","created_at":"2026-05-18T00:00:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09691v3","created_at":"2026-05-18T00:00:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09691","created_at":"2026-05-18T00:00:21Z"},{"alias_kind":"pith_short_12","alias_value":"AE5SJEYN42C6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AE5SJEYN42C66WV5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AE5SJEYN","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AE5SJEYN42C66WV5PVI6JKSCXS","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09691","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-27T02:35:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cf7b4118d9fefc65fb566a59a83e851e60deaee597eec45de6a96707cb4cd4ae","abstract_canon_sha256":"4a1ce4fd3e863ef7644e6116a3d717581106bfc45693107f55b8cadbe61e35c5"},"schema_version":"1.0"},"canonical_sha256":"013b24930de685ef5abd7d51e4aa42bc9abb80c337e3384826ca806006b11b3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:21.838692Z","signature_b64":"Wf2wzW8LeOfE0zX8WEqYGgd3jvvwZBi2ebT3BghV16DOcLpPQyCURBgoMm5nJoTXhywwkHJ2v0VeZvS1X1lkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"013b24930de685ef5abd7d51e4aa42bc9abb80c337e3384826ca806006b11b3e","last_reissued_at":"2026-05-18T00:00:21.838066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:21.838066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09691","source_version":3,"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-05-18T00:00:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9yhtsi7eBOuRGer9uKqtkm6qvjUzRcPs3kfiU7mjYmJYJ4EKxZLPOl0sGYT8VZzybuh1JssN+UQePYuV64fBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:23:47.049434Z"},"content_sha256":"5b360edb0c1b86f1658b201a4f64b1b5f163fc10177f790764b483d6e9a43966","schema_version":"1.0","event_id":"sha256:5b360edb0c1b86f1658b201a4f64b1b5f163fc10177f790764b483d6e9a43966"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AE5SJEYN42C66WV5PVI6JKSCXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Link Prediction Based on Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Muhan Zhang, Yixin Chen","submitted_at":"2018-02-27T02:35:52Z","abstract_excerpt":"Link prediction is a key problem for network-structured data. Link prediction heuristics use some score functions, such as common neighbors and Katz index, to measure the likelihood of links. They have obtained wide practical uses due to their simplicity, interpretability, and for some of them, scalability. However, every heuristic has a strong assumption on when two nodes are likely to link, which limits their effectiveness on networks where these assumptions fail. In this regard, a more reasonable way should be learning a suitable heuristic from a given network instead of using predefined on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09691","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:00:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97kxp1hJS8bCM0CP6cfUxmYv7rEZtoeksntirLhAyHcvUUKhXKDEPwDjr6P9VLLMEmaR77jbwpqJZ7lbKbrwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:23:47.050132Z"},"content_sha256":"75acb9bea0e362a020ca648c6b2ff5d9e454357fcf19d3c882a745b54ad3358a","schema_version":"1.0","event_id":"sha256:75acb9bea0e362a020ca648c6b2ff5d9e454357fcf19d3c882a745b54ad3358a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AE5SJEYN42C66WV5PVI6JKSCXS/bundle.json","state_url":"https://pith.science/pith/AE5SJEYN42C66WV5PVI6JKSCXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AE5SJEYN42C66WV5PVI6JKSCXS/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-06-04T22:23:47Z","links":{"resolver":"https://pith.science/pith/AE5SJEYN42C66WV5PVI6JKSCXS","bundle":"https://pith.science/pith/AE5SJEYN42C66WV5PVI6JKSCXS/bundle.json","state":"https://pith.science/pith/AE5SJEYN42C66WV5PVI6JKSCXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AE5SJEYN42C66WV5PVI6JKSCXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AE5SJEYN42C66WV5PVI6JKSCXS","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":"4a1ce4fd3e863ef7644e6116a3d717581106bfc45693107f55b8cadbe61e35c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-27T02:35:52Z","title_canon_sha256":"cf7b4118d9fefc65fb566a59a83e851e60deaee597eec45de6a96707cb4cd4ae"},"schema_version":"1.0","source":{"id":"1802.09691","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09691","created_at":"2026-05-18T00:00:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09691v3","created_at":"2026-05-18T00:00:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09691","created_at":"2026-05-18T00:00:21Z"},{"alias_kind":"pith_short_12","alias_value":"AE5SJEYN42C6","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AE5SJEYN42C66WV5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AE5SJEYN","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:75acb9bea0e362a020ca648c6b2ff5d9e454357fcf19d3c882a745b54ad3358a","target":"graph","created_at":"2026-05-18T00:00:21Z","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"},"paper":{"abstract_excerpt":"Link prediction is a key problem for network-structured data. Link prediction heuristics use some score functions, such as common neighbors and Katz index, to measure the likelihood of links. They have obtained wide practical uses due to their simplicity, interpretability, and for some of them, scalability. However, every heuristic has a strong assumption on when two nodes are likely to link, which limits their effectiveness on networks where these assumptions fail. In this regard, a more reasonable way should be learning a suitable heuristic from a given network instead of using predefined on","authors_text":"Muhan Zhang, Yixin Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-27T02:35:52Z","title":"Link Prediction Based on Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09691","kind":"arxiv","version":3},"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:5b360edb0c1b86f1658b201a4f64b1b5f163fc10177f790764b483d6e9a43966","target":"record","created_at":"2026-05-18T00:00:21Z","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":"4a1ce4fd3e863ef7644e6116a3d717581106bfc45693107f55b8cadbe61e35c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-27T02:35:52Z","title_canon_sha256":"cf7b4118d9fefc65fb566a59a83e851e60deaee597eec45de6a96707cb4cd4ae"},"schema_version":"1.0","source":{"id":"1802.09691","kind":"arxiv","version":3}},"canonical_sha256":"013b24930de685ef5abd7d51e4aa42bc9abb80c337e3384826ca806006b11b3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"013b24930de685ef5abd7d51e4aa42bc9abb80c337e3384826ca806006b11b3e","first_computed_at":"2026-05-18T00:00:21.838066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:21.838066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wf2wzW8LeOfE0zX8WEqYGgd3jvvwZBi2ebT3BghV16DOcLpPQyCURBgoMm5nJoTXhywwkHJ2v0VeZvS1X1lkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:21.838692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09691","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b360edb0c1b86f1658b201a4f64b1b5f163fc10177f790764b483d6e9a43966","sha256:75acb9bea0e362a020ca648c6b2ff5d9e454357fcf19d3c882a745b54ad3358a"],"state_sha256":"8a8eb02d9025a0856d75a1252d55b845b680dd30d32039f9e8bca6af2a6c3b7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qb0kGFeAw2SSiXymTuPCWSSTEHQf2na2VudnKtjb/pTLLNJStaRtNvgFUb35xkifE0hCGUpln2Ac6vBFQg6wCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:23:47.053658Z","bundle_sha256":"ea87ec4604ce3320bbc47060863ac500258043ca264d75c29b68184cb5e26272"}}