{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:76PVJEQGPQGCRKYVOUACWSXIDZ","short_pith_number":"pith:76PVJEQG","schema_version":"1.0","canonical_sha256":"ff9f5492067c0c28ab1575002b4ae81e46c5543a03592e4726d00c0a84efc93a","source":{"kind":"arxiv","id":"2412.00261","version":1},"attestation_state":"computed","paper":{"title":"Attribute-Enhanced Similarity Ranking for Sparse Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Ambuj Singh, Arlei Silva, Jo\\~ao Mattos, Mert Kosan, Zexi Huang","submitted_at":"2024-11-29T21:22:35Z","abstract_excerpt":"Link prediction is a fundamental problem in graph data. In its most realistic setting, the problem consists of predicting missing or future links between random pairs of nodes from the set of disconnected pairs. Graph Neural Networks (GNNs) have become the predominant framework for link prediction. GNN-based methods treat link prediction as a binary classification problem and handle the extreme class imbalance -- real graphs are very sparse -- by sampling (uniformly at random) a balanced number of disconnected pairs not only for training but also for evaluation. However, we show that the repor"},"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":"2412.00261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-29T21:22:35Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"d982cc45502e82777d691227e3a5a4f9852d24b8ba6c6237940d8fabc59786b7","abstract_canon_sha256":"2b22c4a59d07d020796a7161665f7059d08f9e69e7e8cff7611736176eae5397"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:38.506275Z","signature_b64":"rOfJkx6uy4TzIvjr5UwmeiltxdXlARTQNmC07m9nWxNfdIlbpMrTiQ9sRpVdUq1Tx+1KRlCH2k+uXOGl/doXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9f5492067c0c28ab1575002b4ae81e46c5543a03592e4726d00c0a84efc93a","last_reissued_at":"2026-07-05T09:42:38.505755Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:38.505755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attribute-Enhanced Similarity Ranking for Sparse Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Ambuj Singh, Arlei Silva, Jo\\~ao Mattos, Mert Kosan, Zexi Huang","submitted_at":"2024-11-29T21:22:35Z","abstract_excerpt":"Link prediction is a fundamental problem in graph data. In its most realistic setting, the problem consists of predicting missing or future links between random pairs of nodes from the set of disconnected pairs. Graph Neural Networks (GNNs) have become the predominant framework for link prediction. GNN-based methods treat link prediction as a binary classification problem and handle the extreme class imbalance -- real graphs are very sparse -- by sampling (uniformly at random) a balanced number of disconnected pairs not only for training but also for evaluation. However, we show that the repor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00261","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/2412.00261/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":"2412.00261","created_at":"2026-07-05T09:42:38.505825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.00261v1","created_at":"2026-07-05T09:42:38.505825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00261","created_at":"2026-07-05T09:42:38.505825+00:00"},{"alias_kind":"pith_short_12","alias_value":"76PVJEQGPQGC","created_at":"2026-07-05T09:42:38.505825+00:00"},{"alias_kind":"pith_short_16","alias_value":"76PVJEQGPQGCRKYV","created_at":"2026-07-05T09:42:38.505825+00:00"},{"alias_kind":"pith_short_8","alias_value":"76PVJEQG","created_at":"2026-07-05T09:42:38.505825+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/76PVJEQGPQGCRKYVOUACWSXIDZ","json":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ.json","graph_json":"https://pith.science/api/pith-number/76PVJEQGPQGCRKYVOUACWSXIDZ/graph.json","events_json":"https://pith.science/api/pith-number/76PVJEQGPQGCRKYVOUACWSXIDZ/events.json","paper":"https://pith.science/paper/76PVJEQG"},"agent_actions":{"view_html":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ","download_json":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ.json","view_paper":"https://pith.science/paper/76PVJEQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.00261&json=true","fetch_graph":"https://pith.science/api/pith-number/76PVJEQGPQGCRKYVOUACWSXIDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/76PVJEQGPQGCRKYVOUACWSXIDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/action/storage_attestation","attest_author":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/action/author_attestation","sign_citation":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/action/citation_signature","submit_replication":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/action/replication_record"}},"created_at":"2026-07-05T09:42:38.505825+00:00","updated_at":"2026-07-05T09:42:38.505825+00:00"}