{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FONUIVVFLOL7SKJSGFQJZ24A5X","short_pith_number":"pith:FONUIVVF","schema_version":"1.0","canonical_sha256":"2b9b4456a55b97f9293231609ceb80edf595e112a7180158defcc1ad99b945f8","source":{"kind":"arxiv","id":"1702.06087","version":2},"attestation_state":"computed","paper":{"title":"Identifying high betweenness centrality nodes in large social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Adriana Iamnitchi, Nicolas Kourtellis, Rahul Tripathi, Ramanuja Simha, Tharaka Alahakoon","submitted_at":"2017-02-20T18:06:42Z","abstract_excerpt":"This paper proposes an alternative way to identify nodes with high betweenness centrality. It introduces a new metric, k-path centrality, and a randomized algorithm for estimating it, and shows empirically that nodes with high k-path centrality have high node betweenness centrality. The randomized algorithm runs in time $O(\\kappa^{3}n^{2-2\\alpha}\\log n)$ and outputs, for each vertex v, an estimate of its k-path centrality up to additive error of $\\pm n^{1/2+ \\alpha}$ with probability $1-1/n^2$. Experimental evaluations on real and synthetic social networks show improved accuracy in detecting h"},"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":"1702.06087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:06:42Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d5e7a92674e683d3963a588ecb1d38a6804e790857d6b51a780aa6a0517da951","abstract_canon_sha256":"1b5fb45b7249d1bb8c23b39f95e8effeb43832578ec551f4a3c16e3abff1b116"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:13.309745Z","signature_b64":"sSEfvnZ0Tric7vvN2t9kULDxrOfbgqF7ZBMtfj5oZypRMwh+BLKRx6nGfDu2w8pNxKsJqNDBqpG3tHHGct6+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b9b4456a55b97f9293231609ceb80edf595e112a7180158defcc1ad99b945f8","last_reissued_at":"2026-05-18T00:50:13.309189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:13.309189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying high betweenness centrality nodes in large social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Adriana Iamnitchi, Nicolas Kourtellis, Rahul Tripathi, Ramanuja Simha, Tharaka Alahakoon","submitted_at":"2017-02-20T18:06:42Z","abstract_excerpt":"This paper proposes an alternative way to identify nodes with high betweenness centrality. It introduces a new metric, k-path centrality, and a randomized algorithm for estimating it, and shows empirically that nodes with high k-path centrality have high node betweenness centrality. The randomized algorithm runs in time $O(\\kappa^{3}n^{2-2\\alpha}\\log n)$ and outputs, for each vertex v, an estimate of its k-path centrality up to additive error of $\\pm n^{1/2+ \\alpha}$ with probability $1-1/n^2$. Experimental evaluations on real and synthetic social networks show improved accuracy in detecting h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06087","kind":"arxiv","version":2},"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":"1702.06087","created_at":"2026-05-18T00:50:13.309267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06087v2","created_at":"2026-05-18T00:50:13.309267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06087","created_at":"2026-05-18T00:50:13.309267+00:00"},{"alias_kind":"pith_short_12","alias_value":"FONUIVVFLOL7","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FONUIVVFLOL7SKJS","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FONUIVVF","created_at":"2026-05-18T12:31:15.632608+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/FONUIVVFLOL7SKJSGFQJZ24A5X","json":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X.json","graph_json":"https://pith.science/api/pith-number/FONUIVVFLOL7SKJSGFQJZ24A5X/graph.json","events_json":"https://pith.science/api/pith-number/FONUIVVFLOL7SKJSGFQJZ24A5X/events.json","paper":"https://pith.science/paper/FONUIVVF"},"agent_actions":{"view_html":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X","download_json":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X.json","view_paper":"https://pith.science/paper/FONUIVVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06087&json=true","fetch_graph":"https://pith.science/api/pith-number/FONUIVVFLOL7SKJSGFQJZ24A5X/graph.json","fetch_events":"https://pith.science/api/pith-number/FONUIVVFLOL7SKJSGFQJZ24A5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/action/storage_attestation","attest_author":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/action/author_attestation","sign_citation":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/action/citation_signature","submit_replication":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/action/replication_record"}},"created_at":"2026-05-18T00:50:13.309267+00:00","updated_at":"2026-05-18T00:50:13.309267+00:00"}