{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MNGRZIKEJ6I5M6WOF4E5LW434O","short_pith_number":"pith:MNGRZIKE","canonical_record":{"source":{"id":"2301.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-12-31T10:07:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fe5bf53f6cde541cec00ad258a8cb06aadc6750ebe72a23256727ccd66de5bc4","abstract_canon_sha256":"a00fec3688fe3285ad937c1871a0919c139ffb02bdc1d2ba3acaa039b95f3557"},"schema_version":"1.0"},"canonical_sha256":"634d1ca1444f91d67ace2f09d5db9be382edd94df01d1ba07d8fffcb879008be","source":{"kind":"arxiv","id":"2301.00169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.00169","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"arxiv_version","alias_value":"2301.00169v1","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00169","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"pith_short_12","alias_value":"MNGRZIKEJ6I5","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"pith_short_16","alias_value":"MNGRZIKEJ6I5M6WO","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"pith_short_8","alias_value":"MNGRZIKE","created_at":"2026-07-05T05:29:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MNGRZIKEJ6I5M6WOF4E5LW434O","target":"record","payload":{"canonical_record":{"source":{"id":"2301.00169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-12-31T10:07:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fe5bf53f6cde541cec00ad258a8cb06aadc6750ebe72a23256727ccd66de5bc4","abstract_canon_sha256":"a00fec3688fe3285ad937c1871a0919c139ffb02bdc1d2ba3acaa039b95f3557"},"schema_version":"1.0"},"canonical_sha256":"634d1ca1444f91d67ace2f09d5db9be382edd94df01d1ba07d8fffcb879008be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:43.584770Z","signature_b64":"OF10RBRILjpmoUyW0VhxKbqBXBvqEx1yB1CmqBYcsVwTHHA51eTKrddQs59zf2I8eCcr7FLqw33qYV/LLQCrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"634d1ca1444f91d67ace2f09d5db9be382edd94df01d1ba07d8fffcb879008be","last_reissued_at":"2026-07-05T05:29:43.584266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:43.584266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.00169","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-05T05:29:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uSqe1YMHFu9z7+QiNOMg1qb33v26TqAz9lmaJlkgiIXFWtPDcZYF4m1p16C2XM2xcUZWqbV/ZpcVO9p9ftMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:53:08.379448Z"},"content_sha256":"f0254eeb9f0dc63c7f6e5f01ea8a9cd7ce7a02dfba061b20c6a63f7908361483","schema_version":"1.0","event_id":"sha256:f0254eeb9f0dc63c7f6e5f01ea8a9cd7ce7a02dfba061b20c6a63f7908361483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MNGRZIKEJ6I5M6WOF4E5LW434O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generative Graph Neural Networks for Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Chao Wang, Lin Yuan, Shaojie Qiao, Tao Wu, Xiaoke Ma, Xingping Xian, Yabin Shao, Yu Wu","submitted_at":"2022-12-31T10:07:19Z","abstract_excerpt":"Inferring missing links or detecting spurious ones based on observed graphs, known as link prediction, is a long-standing challenge in graph data analysis. With the recent advances in deep learning, graph neural networks have been used for link prediction and have achieved state-of-the-art performance. Nevertheless, existing methods developed for this purpose are typically discriminative, computing features of local subgraphs around two neighboring nodes and predicting potential links between them from the perspective of subgraph classification. In this formalism, the selection of enclosing su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00169","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/2301.00169/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-05T05:29:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnk7Hc2kxZ5Zaavki8HivbhPalkJVhd8A2j6fl69hrkKmjz71zFaevvJCc1cavo8HYW2ODYEs9OtpMYSjiokCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:53:08.379914Z"},"content_sha256":"0af9eebd8d36d0a851db060b555f04325cbaba3f698d12b540d5851bece8926a","schema_version":"1.0","event_id":"sha256:0af9eebd8d36d0a851db060b555f04325cbaba3f698d12b540d5851bece8926a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/bundle.json","state_url":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/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-05T18:53:08Z","links":{"resolver":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O","bundle":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/bundle.json","state":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MNGRZIKEJ6I5M6WOF4E5LW434O","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":"a00fec3688fe3285ad937c1871a0919c139ffb02bdc1d2ba3acaa039b95f3557","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-12-31T10:07:19Z","title_canon_sha256":"fe5bf53f6cde541cec00ad258a8cb06aadc6750ebe72a23256727ccd66de5bc4"},"schema_version":"1.0","source":{"id":"2301.00169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.00169","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"arxiv_version","alias_value":"2301.00169v1","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00169","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"pith_short_12","alias_value":"MNGRZIKEJ6I5","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"pith_short_16","alias_value":"MNGRZIKEJ6I5M6WO","created_at":"2026-07-05T05:29:43Z"},{"alias_kind":"pith_short_8","alias_value":"MNGRZIKE","created_at":"2026-07-05T05:29:43Z"}],"graph_snapshots":[{"event_id":"sha256:0af9eebd8d36d0a851db060b555f04325cbaba3f698d12b540d5851bece8926a","target":"graph","created_at":"2026-07-05T05:29:43Z","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/2301.00169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inferring missing links or detecting spurious ones based on observed graphs, known as link prediction, is a long-standing challenge in graph data analysis. With the recent advances in deep learning, graph neural networks have been used for link prediction and have achieved state-of-the-art performance. Nevertheless, existing methods developed for this purpose are typically discriminative, computing features of local subgraphs around two neighboring nodes and predicting potential links between them from the perspective of subgraph classification. In this formalism, the selection of enclosing su","authors_text":"Chao Wang, Lin Yuan, Shaojie Qiao, Tao Wu, Xiaoke Ma, Xingping Xian, Yabin Shao, Yu Wu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-12-31T10:07:19Z","title":"Generative Graph Neural Networks for Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00169","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:f0254eeb9f0dc63c7f6e5f01ea8a9cd7ce7a02dfba061b20c6a63f7908361483","target":"record","created_at":"2026-07-05T05:29:43Z","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":"a00fec3688fe3285ad937c1871a0919c139ffb02bdc1d2ba3acaa039b95f3557","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-12-31T10:07:19Z","title_canon_sha256":"fe5bf53f6cde541cec00ad258a8cb06aadc6750ebe72a23256727ccd66de5bc4"},"schema_version":"1.0","source":{"id":"2301.00169","kind":"arxiv","version":1}},"canonical_sha256":"634d1ca1444f91d67ace2f09d5db9be382edd94df01d1ba07d8fffcb879008be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"634d1ca1444f91d67ace2f09d5db9be382edd94df01d1ba07d8fffcb879008be","first_computed_at":"2026-07-05T05:29:43.584266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:29:43.584266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OF10RBRILjpmoUyW0VhxKbqBXBvqEx1yB1CmqBYcsVwTHHA51eTKrddQs59zf2I8eCcr7FLqw33qYV/LLQCrCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:29:43.584770Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.00169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0254eeb9f0dc63c7f6e5f01ea8a9cd7ce7a02dfba061b20c6a63f7908361483","sha256:0af9eebd8d36d0a851db060b555f04325cbaba3f698d12b540d5851bece8926a"],"state_sha256":"d936c240e4dbe5a0b3ec13327a566af08a89395e540ae7a3a8bb9e232ed7ef77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZ+VnDdsnSuP3797O1/dGGbkpwFxQn8Z4SOaCOCbh0bf6pCm/3remamqEpewQjYorzR72ktTjby+6UCaBHaWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:53:08.383703Z","bundle_sha256":"936672e4f26db98cf1b722dbe99c132b67b19118068a36f8f07656d3759e6f7b"}}