{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JAT7CLJHENX5HW4PLK3WR5FWWE","short_pith_number":"pith:JAT7CLJH","schema_version":"1.0","canonical_sha256":"4827f12d27236fd3db8f5ab768f4b6b12b8f36c0de58d0cf042030f5b9ddcca0","source":{"kind":"arxiv","id":"1301.7047","version":1},"attestation_state":"computed","paper":{"title":"Link prediction for partially observed networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Elizaveta Levina, Ji Zhu, Yunpeng Zhao","submitted_at":"2013-01-29T20:22:46Z","abstract_excerpt":"Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many existing supervised learning approaches. We develop a new method which treats the observed network as a sample of the true network with different sampling rates for positive and negative examples. We obtain a relative ranking of potential links by their probabilities, utilizing information on node covariates as well as on network topology. Empirically, the method"},"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":"1301.7047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-29T20:22:46Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"704c5fad4f7c2be0a7b24e13d31376be17dbc745bfd8310f065accb3bc263256","abstract_canon_sha256":"3e69ea14be16592b4b916cb3d92eb1ebdb9ff04e85dd7f6804dc9e8afe434f5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:02.799333Z","signature_b64":"s6b7oYLkPiScDwrS9hZNVulPtQh0lpYQLA2fORc20xlzt+JrWh2kVqi23e5zXaUwy/U/Wjo3AQ3xSq6fcGm0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4827f12d27236fd3db8f5ab768f4b6b12b8f36c0de58d0cf042030f5b9ddcca0","last_reissued_at":"2026-05-18T03:35:02.798657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:02.798657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Link prediction for partially observed networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Elizaveta Levina, Ji Zhu, Yunpeng Zhao","submitted_at":"2013-01-29T20:22:46Z","abstract_excerpt":"Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many existing supervised learning approaches. We develop a new method which treats the observed network as a sample of the true network with different sampling rates for positive and negative examples. We obtain a relative ranking of potential links by their probabilities, utilizing information on node covariates as well as on network topology. Empirically, the method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7047","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":""},"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":"1301.7047","created_at":"2026-05-18T03:35:02.798773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7047v1","created_at":"2026-05-18T03:35:02.798773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7047","created_at":"2026-05-18T03:35:02.798773+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAT7CLJHENX5","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAT7CLJHENX5HW4P","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAT7CLJH","created_at":"2026-05-18T12:27:49.015174+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/JAT7CLJHENX5HW4PLK3WR5FWWE","json":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE.json","graph_json":"https://pith.science/api/pith-number/JAT7CLJHENX5HW4PLK3WR5FWWE/graph.json","events_json":"https://pith.science/api/pith-number/JAT7CLJHENX5HW4PLK3WR5FWWE/events.json","paper":"https://pith.science/paper/JAT7CLJH"},"agent_actions":{"view_html":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE","download_json":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE.json","view_paper":"https://pith.science/paper/JAT7CLJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7047&json=true","fetch_graph":"https://pith.science/api/pith-number/JAT7CLJHENX5HW4PLK3WR5FWWE/graph.json","fetch_events":"https://pith.science/api/pith-number/JAT7CLJHENX5HW4PLK3WR5FWWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/action/storage_attestation","attest_author":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/action/author_attestation","sign_citation":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/action/citation_signature","submit_replication":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/action/replication_record"}},"created_at":"2026-05-18T03:35:02.798773+00:00","updated_at":"2026-05-18T03:35:02.798773+00:00"}