{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XJJ7YLY4MYRYCQF2KJTN5POM2H","short_pith_number":"pith:XJJ7YLY4","schema_version":"1.0","canonical_sha256":"ba53fc2f1c66238140ba5266debdccd1c1c6bf2d68e1249dc378753b6a2442a6","source":{"kind":"arxiv","id":"1910.04807","version":3},"attestation_state":"computed","paper":{"title":"Link Prediction via Graph Attention Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Fei Gao, Jiang Zhang, Weiwei Gu, Xiaodan Lou","submitted_at":"2019-10-10T18:41:54Z","abstract_excerpt":"Link prediction aims to infer missing links or predicting the future ones based on currently observed partial networks, it is a fundamental problem in network science with tremendous real-world applications. However, conventional link prediction approaches neither have high prediction accuracy nor being capable of revealing the hidden information behind links. To address this problem, we generalize the latest techniques in deep learning on graphs and present a new link prediction model - DeepLinker. Instead of learning node representation with the node label information, DeepLinker uses the li"},"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":"1910.04807","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-10-10T18:41:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3b6580adc2fa0c3c980d3ed8134d9ea8ad63387002f8312573079a88ea7339c5","abstract_canon_sha256":"d55a58d7eeffb3d535b2ce29fed4a10b9479ad1bc6a23709cfb0916507240b86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:41.357870Z","signature_b64":"xhXnLiF3/YXQ8BlZEq7Ww04wrnyxvXo+7giOCRaVgb5UGj5CJsV9fNM5AW/2BbRwwDeNvZVNUhRdQS5D2ijNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba53fc2f1c66238140ba5266debdccd1c1c6bf2d68e1249dc378753b6a2442a6","last_reissued_at":"2026-07-05T00:15:41.357391Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:41.357391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Link Prediction via Graph Attention Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Fei Gao, Jiang Zhang, Weiwei Gu, Xiaodan Lou","submitted_at":"2019-10-10T18:41:54Z","abstract_excerpt":"Link prediction aims to infer missing links or predicting the future ones based on currently observed partial networks, it is a fundamental problem in network science with tremendous real-world applications. However, conventional link prediction approaches neither have high prediction accuracy nor being capable of revealing the hidden information behind links. To address this problem, we generalize the latest techniques in deep learning on graphs and present a new link prediction model - DeepLinker. Instead of learning node representation with the node label information, DeepLinker uses the li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.04807","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.04807/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":"1910.04807","created_at":"2026-07-05T00:15:41.357455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.04807v3","created_at":"2026-07-05T00:15:41.357455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.04807","created_at":"2026-07-05T00:15:41.357455+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJJ7YLY4MYRY","created_at":"2026-07-05T00:15:41.357455+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJJ7YLY4MYRYCQF2","created_at":"2026-07-05T00:15:41.357455+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJJ7YLY4","created_at":"2026-07-05T00:15:41.357455+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23606","citing_title":"Hamiltonian Graph Inference Networks: Joint structure discovery and dynamics prediction for lattice Hamiltonian systems from trajectory data","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H","json":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H.json","graph_json":"https://pith.science/api/pith-number/XJJ7YLY4MYRYCQF2KJTN5POM2H/graph.json","events_json":"https://pith.science/api/pith-number/XJJ7YLY4MYRYCQF2KJTN5POM2H/events.json","paper":"https://pith.science/paper/XJJ7YLY4"},"agent_actions":{"view_html":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H","download_json":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H.json","view_paper":"https://pith.science/paper/XJJ7YLY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.04807&json=true","fetch_graph":"https://pith.science/api/pith-number/XJJ7YLY4MYRYCQF2KJTN5POM2H/graph.json","fetch_events":"https://pith.science/api/pith-number/XJJ7YLY4MYRYCQF2KJTN5POM2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H/action/storage_attestation","attest_author":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H/action/author_attestation","sign_citation":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H/action/citation_signature","submit_replication":"https://pith.science/pith/XJJ7YLY4MYRYCQF2KJTN5POM2H/action/replication_record"}},"created_at":"2026-07-05T00:15:41.357455+00:00","updated_at":"2026-07-05T00:15:41.357455+00:00"}