{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PUUDIBWIM2BHS4YPIOLEC2BQ6R","short_pith_number":"pith:PUUDIBWI","schema_version":"1.0","canonical_sha256":"7d283406c8668279730f4396416830f4522e2c7e60f49328adc29e0be10af96a","source":{"kind":"arxiv","id":"1506.06516","version":1},"attestation_state":"computed","paper":{"title":"Bounded link prediction for very large networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Cunlai Pu, Wei Cui, Zhongqi Xu","submitted_at":"2015-06-22T09:19:33Z","abstract_excerpt":"Evaluation of link prediction methods is a hard task in very large complex networks because of the inhibitive computational cost. By setting a lower bound of the number of common neighbors (CN), we propose a new framework to efficiently and precisely evaluate the performances of CN-based similarity indices in link prediction for very large heterogeneous networks. Specifically, we propose a fast algorithm based on the parallel computing scheme to obtain all the node pairs with CN values larger than the lower bound. Furthermore, we propose a new measurement, called self-predictability, to quanti"},"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":"1506.06516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-06-22T09:19:33Z","cross_cats_sorted":["cs.SI","physics.data-an"],"title_canon_sha256":"3f3c0fa19821ee22e7aee50b76cad93a04cb96a67917d824a5d857350eeafe76","abstract_canon_sha256":"89a602c17cbd2aa431c106a4ca32d00049eef86843ddfc24c12efdb2de64c9a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:46.573722Z","signature_b64":"2sK5z/Enslke7OEct4Tvf41Yr6XK9jFWThUkEJx7uHIh7t4NwmiKJXBsnI9EABKs0kWyb747QwwXlCKf2oNvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d283406c8668279730f4396416830f4522e2c7e60f49328adc29e0be10af96a","last_reissued_at":"2026-05-18T01:15:46.573093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:46.573093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded link prediction for very large networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Cunlai Pu, Wei Cui, Zhongqi Xu","submitted_at":"2015-06-22T09:19:33Z","abstract_excerpt":"Evaluation of link prediction methods is a hard task in very large complex networks because of the inhibitive computational cost. By setting a lower bound of the number of common neighbors (CN), we propose a new framework to efficiently and precisely evaluate the performances of CN-based similarity indices in link prediction for very large heterogeneous networks. Specifically, we propose a fast algorithm based on the parallel computing scheme to obtain all the node pairs with CN values larger than the lower bound. Furthermore, we propose a new measurement, called self-predictability, to quanti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06516","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":"1506.06516","created_at":"2026-05-18T01:15:46.573186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06516v1","created_at":"2026-05-18T01:15:46.573186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06516","created_at":"2026-05-18T01:15:46.573186+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUUDIBWIM2BH","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUUDIBWIM2BHS4YP","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUUDIBWI","created_at":"2026-05-18T12:29:37.295048+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/PUUDIBWIM2BHS4YPIOLEC2BQ6R","json":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R.json","graph_json":"https://pith.science/api/pith-number/PUUDIBWIM2BHS4YPIOLEC2BQ6R/graph.json","events_json":"https://pith.science/api/pith-number/PUUDIBWIM2BHS4YPIOLEC2BQ6R/events.json","paper":"https://pith.science/paper/PUUDIBWI"},"agent_actions":{"view_html":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R","download_json":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R.json","view_paper":"https://pith.science/paper/PUUDIBWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06516&json=true","fetch_graph":"https://pith.science/api/pith-number/PUUDIBWIM2BHS4YPIOLEC2BQ6R/graph.json","fetch_events":"https://pith.science/api/pith-number/PUUDIBWIM2BHS4YPIOLEC2BQ6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R/action/storage_attestation","attest_author":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R/action/author_attestation","sign_citation":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R/action/citation_signature","submit_replication":"https://pith.science/pith/PUUDIBWIM2BHS4YPIOLEC2BQ6R/action/replication_record"}},"created_at":"2026-05-18T01:15:46.573186+00:00","updated_at":"2026-05-18T01:15:46.573186+00:00"}