{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BXF37VR6FJUTA3S3IPQGTVUX2T","short_pith_number":"pith:BXF37VR6","schema_version":"1.0","canonical_sha256":"0dcbbfd63e2a69306e5b43e069d697d4e334a96185b2e6cfdcbfc524dad2f079","source":{"kind":"arxiv","id":"2106.15810","version":1},"attestation_state":"computed","paper":{"title":"Edge Proposal Sets for Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Abhay Singh, Austin R. Benson, Horace He, Omkar Bhalerao, Qian Huang, Ser-Nam Lim, Sijia Linda Huang","submitted_at":"2021-06-30T04:59:19Z","abstract_excerpt":"Graphs are a common model for complex relational data such as social networks and protein interactions, and such data can evolve over time (e.g., new friendships) and be noisy (e.g., unmeasured interactions). Link prediction aims to predict future edges or infer missing edges in the graph, and has diverse applications in recommender systems, experimental design, and complex systems. Even though link prediction algorithms strongly depend on the set of edges in the graph, existing approaches typically do not modify the graph topology to improve performance. Here, we demonstrate how simply adding"},"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":"2106.15810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-06-30T04:59:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"79c54c24c0c8949035f8f618ed6c08730a5c79a365217a387d7fedb2c670c7d0","abstract_canon_sha256":"5a87713d55b633948b5f1c302933172b2ec449217c67402c1cc907bfc0fef08c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:00.510449Z","signature_b64":"RFqHcfbboT+u5/+ISwDDfb87h6iR9VQ+K+dWoIFazr5rB7QjcEKCqduUUGDdi22QYEH2OAry7cx9aRm03euoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dcbbfd63e2a69306e5b43e069d697d4e334a96185b2e6cfdcbfc524dad2f079","last_reissued_at":"2026-07-05T02:54:00.510024Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:00.510024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge Proposal Sets for Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Abhay Singh, Austin R. Benson, Horace He, Omkar Bhalerao, Qian Huang, Ser-Nam Lim, Sijia Linda Huang","submitted_at":"2021-06-30T04:59:19Z","abstract_excerpt":"Graphs are a common model for complex relational data such as social networks and protein interactions, and such data can evolve over time (e.g., new friendships) and be noisy (e.g., unmeasured interactions). Link prediction aims to predict future edges or infer missing edges in the graph, and has diverse applications in recommender systems, experimental design, and complex systems. Even though link prediction algorithms strongly depend on the set of edges in the graph, existing approaches typically do not modify the graph topology to improve performance. Here, we demonstrate how simply adding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.15810","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/2106.15810/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":"2106.15810","created_at":"2026-07-05T02:54:00.510078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.15810v1","created_at":"2026-07-05T02:54:00.510078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15810","created_at":"2026-07-05T02:54:00.510078+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXF37VR6FJUT","created_at":"2026-07-05T02:54:00.510078+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXF37VR6FJUTA3S3","created_at":"2026-07-05T02:54:00.510078+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXF37VR6","created_at":"2026-07-05T02:54:00.510078+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/BXF37VR6FJUTA3S3IPQGTVUX2T","json":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T.json","graph_json":"https://pith.science/api/pith-number/BXF37VR6FJUTA3S3IPQGTVUX2T/graph.json","events_json":"https://pith.science/api/pith-number/BXF37VR6FJUTA3S3IPQGTVUX2T/events.json","paper":"https://pith.science/paper/BXF37VR6"},"agent_actions":{"view_html":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T","download_json":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T.json","view_paper":"https://pith.science/paper/BXF37VR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.15810&json=true","fetch_graph":"https://pith.science/api/pith-number/BXF37VR6FJUTA3S3IPQGTVUX2T/graph.json","fetch_events":"https://pith.science/api/pith-number/BXF37VR6FJUTA3S3IPQGTVUX2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T/action/storage_attestation","attest_author":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T/action/author_attestation","sign_citation":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T/action/citation_signature","submit_replication":"https://pith.science/pith/BXF37VR6FJUTA3S3IPQGTVUX2T/action/replication_record"}},"created_at":"2026-07-05T02:54:00.510078+00:00","updated_at":"2026-07-05T02:54:00.510078+00:00"}