{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U7HRBTLQYINPFTEJTQGU6F6QZH","short_pith_number":"pith:U7HRBTLQ","schema_version":"1.0","canonical_sha256":"a7cf10cd70c21af2cc899c0d4f17d0c9f5a64abdabda6d5347b459d8e48fcb86","source":{"kind":"arxiv","id":"1612.07365","version":1},"attestation_state":"computed","paper":{"title":"A Proximity Measure using Blink Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Haifeng Qian, Hui Wan, Luis A. Lastras, Mark N. Wegman, Ruchir Puri","submitted_at":"2016-12-21T22:07:23Z","abstract_excerpt":"This paper proposes a new graph proximity measure. This measure is a derivative of network reliability. By analyzing its properties and comparing it against other proximity measures through graph examples, we demonstrate that it is more consistent with human intuition than competitors. A new deterministic algorithm is developed to approximate this measure with practical complexity. Empirical evaluation by two link prediction benchmarks, one in coauthorship networks and one in Wikipedia, shows promising results. For example, a single parameterization of this measure achieves accuracies that are"},"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":"1612.07365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-21T22:07:23Z","cross_cats_sorted":[],"title_canon_sha256":"ee82290f4b7a8a01f766a93e591bc2b67bd78cd98b09fb79dc99a40356211f12","abstract_canon_sha256":"72dcaf71ccb8ae8d5e7959566109a4a07869f1a7383d56c80bb171dfd609512f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:10.200584Z","signature_b64":"g7341TUOdUx/KXuFk+GhQx1TfTLF0nhcbOXPjkZo2z6iRhWFz2NfCy0jw6NzYJR1yOm22yfnybLMNpW/4GlXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7cf10cd70c21af2cc899c0d4f17d0c9f5a64abdabda6d5347b459d8e48fcb86","last_reissued_at":"2026-05-18T00:54:10.200145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:10.200145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proximity Measure using Blink Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Haifeng Qian, Hui Wan, Luis A. Lastras, Mark N. Wegman, Ruchir Puri","submitted_at":"2016-12-21T22:07:23Z","abstract_excerpt":"This paper proposes a new graph proximity measure. This measure is a derivative of network reliability. By analyzing its properties and comparing it against other proximity measures through graph examples, we demonstrate that it is more consistent with human intuition than competitors. A new deterministic algorithm is developed to approximate this measure with practical complexity. Empirical evaluation by two link prediction benchmarks, one in coauthorship networks and one in Wikipedia, shows promising results. For example, a single parameterization of this measure achieves accuracies that are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07365","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":"1612.07365","created_at":"2026-05-18T00:54:10.200205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07365v1","created_at":"2026-05-18T00:54:10.200205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07365","created_at":"2026-05-18T00:54:10.200205+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7HRBTLQYINP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7HRBTLQYINPFTEJ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7HRBTLQ","created_at":"2026-05-18T12:30:46.583412+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/U7HRBTLQYINPFTEJTQGU6F6QZH","json":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH.json","graph_json":"https://pith.science/api/pith-number/U7HRBTLQYINPFTEJTQGU6F6QZH/graph.json","events_json":"https://pith.science/api/pith-number/U7HRBTLQYINPFTEJTQGU6F6QZH/events.json","paper":"https://pith.science/paper/U7HRBTLQ"},"agent_actions":{"view_html":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH","download_json":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH.json","view_paper":"https://pith.science/paper/U7HRBTLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07365&json=true","fetch_graph":"https://pith.science/api/pith-number/U7HRBTLQYINPFTEJTQGU6F6QZH/graph.json","fetch_events":"https://pith.science/api/pith-number/U7HRBTLQYINPFTEJTQGU6F6QZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH/action/storage_attestation","attest_author":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH/action/author_attestation","sign_citation":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH/action/citation_signature","submit_replication":"https://pith.science/pith/U7HRBTLQYINPFTEJTQGU6F6QZH/action/replication_record"}},"created_at":"2026-05-18T00:54:10.200205+00:00","updated_at":"2026-05-18T00:54:10.200205+00:00"}