{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MNGRZIKEJ6I5M6WOF4E5LW434O","short_pith_number":"pith:MNGRZIKE","schema_version":"1.0","canonical_sha256":"634d1ca1444f91d67ace2f09d5db9be382edd94df01d1ba07d8fffcb879008be","source":{"kind":"arxiv","id":"2301.00169","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2301.00169","created_at":"2026-07-05T05:29:43.584340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.00169v1","created_at":"2026-07-05T05:29:43.584340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00169","created_at":"2026-07-05T05:29:43.584340+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNGRZIKEJ6I5","created_at":"2026-07-05T05:29:43.584340+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNGRZIKEJ6I5M6WO","created_at":"2026-07-05T05:29:43.584340+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNGRZIKE","created_at":"2026-07-05T05:29:43.584340+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/MNGRZIKEJ6I5M6WOF4E5LW434O","json":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O.json","graph_json":"https://pith.science/api/pith-number/MNGRZIKEJ6I5M6WOF4E5LW434O/graph.json","events_json":"https://pith.science/api/pith-number/MNGRZIKEJ6I5M6WOF4E5LW434O/events.json","paper":"https://pith.science/paper/MNGRZIKE"},"agent_actions":{"view_html":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O","download_json":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O.json","view_paper":"https://pith.science/paper/MNGRZIKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.00169&json=true","fetch_graph":"https://pith.science/api/pith-number/MNGRZIKEJ6I5M6WOF4E5LW434O/graph.json","fetch_events":"https://pith.science/api/pith-number/MNGRZIKEJ6I5M6WOF4E5LW434O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/action/storage_attestation","attest_author":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/action/author_attestation","sign_citation":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/action/citation_signature","submit_replication":"https://pith.science/pith/MNGRZIKEJ6I5M6WOF4E5LW434O/action/replication_record"}},"created_at":"2026-07-05T05:29:43.584340+00:00","updated_at":"2026-07-05T05:29:43.584340+00:00"}