{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GYXDYRYUOGT2OW6U4N7FM7YHWW","short_pith_number":"pith:GYXDYRYU","schema_version":"1.0","canonical_sha256":"362e3c471471a7a75bd4e37e567f07b5a32868ca5d5daecee50609a04c596327","source":{"kind":"arxiv","id":"1105.4005","version":1},"attestation_state":"computed","paper":{"title":"Link prediction in complex networks: a local na\\\"{\\i}ve Bayes model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Linyuan L\\\"u, Qian-Ming Zhang, Tao Zhou, Zhen Liu","submitted_at":"2011-05-20T02:46:03Z","abstract_excerpt":"Common-neighbor-based method is simple yet effective to predict missing links, which assume that two nodes are more likely to be connected if they have more common neighbors. In such method, each common neighbor of two nodes contributes equally to the connection likelihood. In this Letter, we argue that different common neighbors may play different roles and thus lead to different contributions, and propose a local na\\\"{\\i}ve Bayes model accordingly. Extensive experiments were carried out on eight real networks. Compared with the common-neighbor-based methods, the present method can provide mo"},"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":"1105.4005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-05-20T02:46:03Z","cross_cats_sorted":["cs.SI","physics.data-an"],"title_canon_sha256":"e7f02b94664fd7722874482cef1bf294a3aac9c4c6af1790ebbad6df8a30302f","abstract_canon_sha256":"d4cfdeb849833afaafdea26b4064e6775ee058a338a5193f2361dc546e6fee73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:52.278238Z","signature_b64":"09WsNYnFiZnCa8Bi8B966b5ehts8zthriFvWwFdJTpkGcvV/E/LV8hwJkpprYgB1mPMXPbzLuCF236Vee6fjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"362e3c471471a7a75bd4e37e567f07b5a32868ca5d5daecee50609a04c596327","last_reissued_at":"2026-05-18T02:21:52.277615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:52.277615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Link prediction in complex networks: a local na\\\"{\\i}ve Bayes model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Linyuan L\\\"u, Qian-Ming Zhang, Tao Zhou, Zhen Liu","submitted_at":"2011-05-20T02:46:03Z","abstract_excerpt":"Common-neighbor-based method is simple yet effective to predict missing links, which assume that two nodes are more likely to be connected if they have more common neighbors. In such method, each common neighbor of two nodes contributes equally to the connection likelihood. In this Letter, we argue that different common neighbors may play different roles and thus lead to different contributions, and propose a local na\\\"{\\i}ve Bayes model accordingly. Extensive experiments were carried out on eight real networks. Compared with the common-neighbor-based methods, the present method can provide mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4005","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":"1105.4005","created_at":"2026-05-18T02:21:52.277699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4005v1","created_at":"2026-05-18T02:21:52.277699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4005","created_at":"2026-05-18T02:21:52.277699+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYXDYRYUOGT2","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYXDYRYUOGT2OW6U","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYXDYRYU","created_at":"2026-05-18T12:26:30.835961+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/GYXDYRYUOGT2OW6U4N7FM7YHWW","json":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW.json","graph_json":"https://pith.science/api/pith-number/GYXDYRYUOGT2OW6U4N7FM7YHWW/graph.json","events_json":"https://pith.science/api/pith-number/GYXDYRYUOGT2OW6U4N7FM7YHWW/events.json","paper":"https://pith.science/paper/GYXDYRYU"},"agent_actions":{"view_html":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW","download_json":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW.json","view_paper":"https://pith.science/paper/GYXDYRYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4005&json=true","fetch_graph":"https://pith.science/api/pith-number/GYXDYRYUOGT2OW6U4N7FM7YHWW/graph.json","fetch_events":"https://pith.science/api/pith-number/GYXDYRYUOGT2OW6U4N7FM7YHWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW/action/storage_attestation","attest_author":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW/action/author_attestation","sign_citation":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW/action/citation_signature","submit_replication":"https://pith.science/pith/GYXDYRYUOGT2OW6U4N7FM7YHWW/action/replication_record"}},"created_at":"2026-05-18T02:21:52.277699+00:00","updated_at":"2026-05-18T02:21:52.277699+00:00"}