{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GWEXWFBZKYN37QWJ4IALYLKAKY","short_pith_number":"pith:GWEXWFBZ","canonical_record":{"source":{"id":"1302.5878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-02-24T07:19:22Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0075cae4858c3895692806d8180401f6e0c1ed8c3aefd685c8d4a2177e2919df","abstract_canon_sha256":"a7d1e77cc45db4fefa003260358b3d89c340fce59398b97696c4cd81e57c7b95"},"schema_version":"1.0"},"canonical_sha256":"35897b1439561bbfc2c9e200bc2d40561e03d19abef56571c000db6383168951","source":{"kind":"arxiv","id":"1302.5878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5878","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5878v1","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5878","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"GWEXWFBZKYN3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GWEXWFBZKYN37QWJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GWEXWFBZ","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GWEXWFBZKYN37QWJ4IALYLKAKY","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-02-24T07:19:22Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0075cae4858c3895692806d8180401f6e0c1ed8c3aefd685c8d4a2177e2919df","abstract_canon_sha256":"a7d1e77cc45db4fefa003260358b3d89c340fce59398b97696c4cd81e57c7b95"},"schema_version":"1.0"},"canonical_sha256":"35897b1439561bbfc2c9e200bc2d40561e03d19abef56571c000db6383168951","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:43.319050Z","signature_b64":"BXRXJqmZ7h+4zFOlbPK7FDOMO2+j84Hbucm2mLfISb12eAzG/K7CeBJmfQlsnK9cSpmg/jQiqk3gLG7RdfeXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35897b1439561bbfc2c9e200bc2d40561e03d19abef56571c000db6383168951","last_reissued_at":"2026-05-18T03:32:43.318356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:43.318356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5878","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:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ChNGV+vdiRcxkZEyXLl7CFJMkKL5kCc0wT8DDq/Sp0Cnhj0/lhS0z71h/hn27RHx0p4AbgIhVRNrIb/bYhnwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:33:37.044505Z"},"content_sha256":"51cfba1258615f6015531eb4f4f0cb8e91f80870072165c81a505cc0aef07e54","schema_version":"1.0","event_id":"sha256:51cfba1258615f6015531eb4f4f0cb8e91f80870072165c81a505cc0aef07e54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GWEXWFBZKYN37QWJ4IALYLKAKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness of Link-prediction Algorithm Based on Similarity and Application to Biological Networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Ke Hu, Liang Wang, Yi Tang","submitted_at":"2013-02-24T07:19:22Z","abstract_excerpt":"Many algorithms have been proposed to predict missing links in a variety of real networks. These studies focus on mainly both accuracy and efficiency of these algorithms. However, little attention is paid to their robustness against either noise or irrationality of a link existing in almost all of real networks. In this paper, we investigate the robustness of several typical node-similarity-based algorithms and find that these algorithms are sensitive to the strength of noise. Moreover, we find that it also depends on networks' structure properties, especially on network efficiency, clustering"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5878","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:32:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkJk38YC6b7rEdn/8YJtEmRE/yDvIYsiriMqtStZLr9/eVQq7bDWMzx5K4O2eitTohNc3/TTlQ8hGHtKdIN1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:33:37.045119Z"},"content_sha256":"df3e9f48f4d40b5df3e804cf9b32e6340e1d218cf03587d860c32664c087d191","schema_version":"1.0","event_id":"sha256:df3e9f48f4d40b5df3e804cf9b32e6340e1d218cf03587d860c32664c087d191"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWEXWFBZKYN37QWJ4IALYLKAKY/bundle.json","state_url":"https://pith.science/pith/GWEXWFBZKYN37QWJ4IALYLKAKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWEXWFBZKYN37QWJ4IALYLKAKY/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-31T00:33:37Z","links":{"resolver":"https://pith.science/pith/GWEXWFBZKYN37QWJ4IALYLKAKY","bundle":"https://pith.science/pith/GWEXWFBZKYN37QWJ4IALYLKAKY/bundle.json","state":"https://pith.science/pith/GWEXWFBZKYN37QWJ4IALYLKAKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWEXWFBZKYN37QWJ4IALYLKAKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GWEXWFBZKYN37QWJ4IALYLKAKY","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":"a7d1e77cc45db4fefa003260358b3d89c340fce59398b97696c4cd81e57c7b95","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-02-24T07:19:22Z","title_canon_sha256":"0075cae4858c3895692806d8180401f6e0c1ed8c3aefd685c8d4a2177e2919df"},"schema_version":"1.0","source":{"id":"1302.5878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5878","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5878v1","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5878","created_at":"2026-05-18T03:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"GWEXWFBZKYN3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GWEXWFBZKYN37QWJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GWEXWFBZ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:df3e9f48f4d40b5df3e804cf9b32e6340e1d218cf03587d860c32664c087d191","target":"graph","created_at":"2026-05-18T03:32:43Z","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":"Many algorithms have been proposed to predict missing links in a variety of real networks. These studies focus on mainly both accuracy and efficiency of these algorithms. However, little attention is paid to their robustness against either noise or irrationality of a link existing in almost all of real networks. In this paper, we investigate the robustness of several typical node-similarity-based algorithms and find that these algorithms are sensitive to the strength of noise. Moreover, we find that it also depends on networks' structure properties, especially on network efficiency, clustering","authors_text":"Ke Hu, Liang Wang, Yi Tang","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-02-24T07:19:22Z","title":"Robustness of Link-prediction Algorithm Based on Similarity and Application to Biological Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5878","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:51cfba1258615f6015531eb4f4f0cb8e91f80870072165c81a505cc0aef07e54","target":"record","created_at":"2026-05-18T03:32:43Z","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":"a7d1e77cc45db4fefa003260358b3d89c340fce59398b97696c4cd81e57c7b95","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-02-24T07:19:22Z","title_canon_sha256":"0075cae4858c3895692806d8180401f6e0c1ed8c3aefd685c8d4a2177e2919df"},"schema_version":"1.0","source":{"id":"1302.5878","kind":"arxiv","version":1}},"canonical_sha256":"35897b1439561bbfc2c9e200bc2d40561e03d19abef56571c000db6383168951","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35897b1439561bbfc2c9e200bc2d40561e03d19abef56571c000db6383168951","first_computed_at":"2026-05-18T03:32:43.318356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:43.318356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BXRXJqmZ7h+4zFOlbPK7FDOMO2+j84Hbucm2mLfISb12eAzG/K7CeBJmfQlsnK9cSpmg/jQiqk3gLG7RdfeXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:43.319050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51cfba1258615f6015531eb4f4f0cb8e91f80870072165c81a505cc0aef07e54","sha256:df3e9f48f4d40b5df3e804cf9b32e6340e1d218cf03587d860c32664c087d191"],"state_sha256":"003ff83ef5f0c74aa0cc9cba27a436e7a6dd8b564abb3fc7402a4b46676e5162"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFQ136FqBdgygjlR+vgRyAVWRMJLwkhtvt3lVIAbxL3f0dfzmL5chuVNSgBeygsZyehRsRlpGVhVu3w6vfxhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:33:37.048183Z","bundle_sha256":"ad7d4a7dd225b9a1570450760faca46428aa64cfa240122798af6062aa2adeb8"}}