{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JAT7CLJHENX5HW4PLK3WR5FWWE","short_pith_number":"pith:JAT7CLJH","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"},"canonical_sha256":"4827f12d27236fd3db8f5ab768f4b6b12b8f36c0de58d0cf042030f5b9ddcca0","source":{"kind":"arxiv","id":"1301.7047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7047","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7047v1","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7047","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"pith_short_12","alias_value":"JAT7CLJHENX5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JAT7CLJHENX5HW4P","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JAT7CLJH","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JAT7CLJHENX5HW4PLK3WR5FWWE","target":"record","payload":{"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"},"canonical_sha256":"4827f12d27236fd3db8f5ab768f4b6b12b8f36c0de58d0cf042030f5b9ddcca0","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"},"source_kind":"arxiv","source_id":"1301.7047","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:35:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpoPhywaoZM3qt6i9Fr/C5rZ/ihKFvJjeLMCtRooYHJ9Nctt2EVWPrNx1DAHeas2CcLjYi3r9GlyqjD4rf9ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:35:17.436005Z"},"content_sha256":"197ff2d8be35fb54ee01b3898973ab59df80d4f509d802b75907175bf02ad34e","schema_version":"1.0","event_id":"sha256:197ff2d8be35fb54ee01b3898973ab59df80d4f509d802b75907175bf02ad34e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JAT7CLJHENX5HW4PLK3WR5FWWE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:35:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCqlMiHaz0AG+LBSabS768yUej6Dsy71LCGF03Fhst0osX38Q22Po11XZ2EdnI3Y70dhNEG4PX3SfdWSvfm1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:35:17.436688Z"},"content_sha256":"684c41f661b000d94f4fa6f7e67bf5be32b32f63aefd2bfe3cddfded3c220d98","schema_version":"1.0","event_id":"sha256:684c41f661b000d94f4fa6f7e67bf5be32b32f63aefd2bfe3cddfded3c220d98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/bundle.json","state_url":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T06:35:17Z","links":{"resolver":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE","bundle":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/bundle.json","state":"https://pith.science/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAT7CLJHENX5HW4PLK3WR5FWWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JAT7CLJHENX5HW4PLK3WR5FWWE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3e69ea14be16592b4b916cb3d92eb1ebdb9ff04e85dd7f6804dc9e8afe434f5e","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-29T20:22:46Z","title_canon_sha256":"704c5fad4f7c2be0a7b24e13d31376be17dbc745bfd8310f065accb3bc263256"},"schema_version":"1.0","source":{"id":"1301.7047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7047","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7047v1","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7047","created_at":"2026-05-18T03:35:02Z"},{"alias_kind":"pith_short_12","alias_value":"JAT7CLJHENX5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JAT7CLJHENX5HW4P","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JAT7CLJH","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:684c41f661b000d94f4fa6f7e67bf5be32b32f63aefd2bfe3cddfded3c220d98","target":"graph","created_at":"2026-05-18T03:35:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Elizaveta Levina, Ji Zhu, Yunpeng Zhao","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-29T20:22:46Z","title":"Link prediction for partially observed networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7047","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:197ff2d8be35fb54ee01b3898973ab59df80d4f509d802b75907175bf02ad34e","target":"record","created_at":"2026-05-18T03:35:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3e69ea14be16592b4b916cb3d92eb1ebdb9ff04e85dd7f6804dc9e8afe434f5e","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-29T20:22:46Z","title_canon_sha256":"704c5fad4f7c2be0a7b24e13d31376be17dbc745bfd8310f065accb3bc263256"},"schema_version":"1.0","source":{"id":"1301.7047","kind":"arxiv","version":1}},"canonical_sha256":"4827f12d27236fd3db8f5ab768f4b6b12b8f36c0de58d0cf042030f5b9ddcca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4827f12d27236fd3db8f5ab768f4b6b12b8f36c0de58d0cf042030f5b9ddcca0","first_computed_at":"2026-05-18T03:35:02.798657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:02.798657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6b7oYLkPiScDwrS9hZNVulPtQh0lpYQLA2fORc20xlzt+JrWh2kVqi23e5zXaUwy/U/Wjo3AQ3xSq6fcGm0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:02.799333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:197ff2d8be35fb54ee01b3898973ab59df80d4f509d802b75907175bf02ad34e","sha256:684c41f661b000d94f4fa6f7e67bf5be32b32f63aefd2bfe3cddfded3c220d98"],"state_sha256":"f7b7c6e3117fe599acdd1b3718dd8ef74365b28d58de470ef5e144d302582f69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anBDf6tyOrv8BCdB4Dzf+MKC/zCobDcqnZ3hplQGWzN5utbRVi3RlDh7PzmutEgrdTY4mW+Xc1lxLsL/UwNrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:35:17.440306Z","bundle_sha256":"c770a607f384a5b7994596b1cf08e3ce3fae1958f3db90e19b037b68a04a2104"}}