{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DJHDJ2QSB2HDHU62U2NRI6IJXB","short_pith_number":"pith:DJHDJ2QS","schema_version":"1.0","canonical_sha256":"1a4e34ea120e8e33d3daa69b147909b850368c72a040b7cc29ab1261b481ed9e","source":{"kind":"arxiv","id":"2310.00793","version":3},"attestation_state":"computed","paper":{"title":"Revisiting Link Prediction: A Data Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Bingheng Li, Haitao Mao, Harry Shomer, Jiliang Tang, Juanhui Li, Neil Shah, Tong Zhao, Wenqi Fan, Yao Ma","submitted_at":"2023-10-01T21:09:59Z","abstract_excerpt":"Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction. However, since datasets span a multitude of domains, they could have distinct underlying mechanisms of link formation. Evidence in existing literature underscores the absence of a universally best algorithm suitable for all datasets. In this paper, we endeavor to explore principles of link prediction across diverse datasets from a data-centric perspective. We recognize three fundamental factors critical to link predicti"},"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":"2310.00793","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-10-01T21:09:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bd3ead141bda5cc3d8447d3a7af1d082831bf025a27fcf5a590e90eae405e499","abstract_canon_sha256":"f210791ad0183f2b564acbac0f91c168ebd3d367c351156d2f8a9c2fd0dd4b57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:40.302811Z","signature_b64":"wIYDOk3lu1635W6ysmcmfqunZ3B/Sly8vxF3oA3Daa4Y+bei85qCJbvpfYsLGYNb7msFbO3F3SKoAqv2+9TaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a4e34ea120e8e33d3daa69b147909b850368c72a040b7cc29ab1261b481ed9e","last_reissued_at":"2026-07-05T09:32:40.302333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:40.302333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Link Prediction: A Data Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Bingheng Li, Haitao Mao, Harry Shomer, Jiliang Tang, Juanhui Li, Neil Shah, Tong Zhao, Wenqi Fan, Yao Ma","submitted_at":"2023-10-01T21:09:59Z","abstract_excerpt":"Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction. However, since datasets span a multitude of domains, they could have distinct underlying mechanisms of link formation. Evidence in existing literature underscores the absence of a universally best algorithm suitable for all datasets. In this paper, we endeavor to explore principles of link prediction across diverse datasets from a data-centric perspective. We recognize three fundamental factors critical to link predicti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00793","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/2310.00793/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":"2310.00793","created_at":"2026-07-05T09:32:40.302394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.00793v3","created_at":"2026-07-05T09:32:40.302394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00793","created_at":"2026-07-05T09:32:40.302394+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJHDJ2QSB2HD","created_at":"2026-07-05T09:32:40.302394+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJHDJ2QSB2HDHU62","created_at":"2026-07-05T09:32:40.302394+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJHDJ2QS","created_at":"2026-07-05T09:32:40.302394+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07168","citing_title":"Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB","json":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB.json","graph_json":"https://pith.science/api/pith-number/DJHDJ2QSB2HDHU62U2NRI6IJXB/graph.json","events_json":"https://pith.science/api/pith-number/DJHDJ2QSB2HDHU62U2NRI6IJXB/events.json","paper":"https://pith.science/paper/DJHDJ2QS"},"agent_actions":{"view_html":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB","download_json":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB.json","view_paper":"https://pith.science/paper/DJHDJ2QS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.00793&json=true","fetch_graph":"https://pith.science/api/pith-number/DJHDJ2QSB2HDHU62U2NRI6IJXB/graph.json","fetch_events":"https://pith.science/api/pith-number/DJHDJ2QSB2HDHU62U2NRI6IJXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB/action/storage_attestation","attest_author":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB/action/author_attestation","sign_citation":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB/action/citation_signature","submit_replication":"https://pith.science/pith/DJHDJ2QSB2HDHU62U2NRI6IJXB/action/replication_record"}},"created_at":"2026-07-05T09:32:40.302394+00:00","updated_at":"2026-07-05T09:32:40.302394+00:00"}