{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FONUIVVFLOL7SKJSGFQJZ24A5X","short_pith_number":"pith:FONUIVVF","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"},"canonical_sha256":"2b9b4456a55b97f9293231609ceb80edf595e112a7180158defcc1ad99b945f8","source":{"kind":"arxiv","id":"1702.06087","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06087","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06087v2","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06087","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"FONUIVVFLOL7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FONUIVVFLOL7SKJS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FONUIVVF","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FONUIVVFLOL7SKJSGFQJZ24A5X","target":"record","payload":{"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"},"canonical_sha256":"2b9b4456a55b97f9293231609ceb80edf595e112a7180158defcc1ad99b945f8","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"},"source_kind":"arxiv","source_id":"1702.06087","source_version":2,"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-18T00:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYO1Po7BfDGDtpgCXdVxWK9fakyE/dkn77k2DD9rSrMdMvnnssRk3J5j/CNgWP+Ij/SarEfEQLtuOSqR1jskDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:18:16.840909Z"},"content_sha256":"3fada48480baaa59d01b10b5403d9b6cc40d8f49fb5695fd6c539c8ad80277f6","schema_version":"1.0","event_id":"sha256:3fada48480baaa59d01b10b5403d9b6cc40d8f49fb5695fd6c539c8ad80277f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FONUIVVFLOL7SKJSGFQJZ24A5X","target":"graph","payload":{"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"},"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-18T00:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDn5QOAjC6mdW6LpipKyTNe7XYqvHKZae2Uc/eE3yh6PAa7hWlE6MU0FS2YPh2vylIi3DU06unGSH3K9VU6UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:18:16.841254Z"},"content_sha256":"e71d587c725653f9e128b4314e3b14d1b5d8a84506c80fcaab3fac3e0a821082","schema_version":"1.0","event_id":"sha256:e71d587c725653f9e128b4314e3b14d1b5d8a84506c80fcaab3fac3e0a821082"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/bundle.json","state_url":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/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-06-01T08:18:16Z","links":{"resolver":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X","bundle":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/bundle.json","state":"https://pith.science/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FONUIVVFLOL7SKJSGFQJZ24A5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FONUIVVFLOL7SKJSGFQJZ24A5X","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":"1b5fb45b7249d1bb8c23b39f95e8effeb43832578ec551f4a3c16e3abff1b116","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:06:42Z","title_canon_sha256":"d5e7a92674e683d3963a588ecb1d38a6804e790857d6b51a780aa6a0517da951"},"schema_version":"1.0","source":{"id":"1702.06087","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06087","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06087v2","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06087","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"FONUIVVFLOL7","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FONUIVVFLOL7SKJS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FONUIVVF","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:e71d587c725653f9e128b4314e3b14d1b5d8a84506c80fcaab3fac3e0a821082","target":"graph","created_at":"2026-05-18T00:50:13Z","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":"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","authors_text":"Adriana Iamnitchi, Nicolas Kourtellis, Rahul Tripathi, Ramanuja Simha, Tharaka Alahakoon","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:06:42Z","title":"Identifying high betweenness centrality nodes in large social networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06087","kind":"arxiv","version":2},"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:3fada48480baaa59d01b10b5403d9b6cc40d8f49fb5695fd6c539c8ad80277f6","target":"record","created_at":"2026-05-18T00:50:13Z","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":"1b5fb45b7249d1bb8c23b39f95e8effeb43832578ec551f4a3c16e3abff1b116","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T18:06:42Z","title_canon_sha256":"d5e7a92674e683d3963a588ecb1d38a6804e790857d6b51a780aa6a0517da951"},"schema_version":"1.0","source":{"id":"1702.06087","kind":"arxiv","version":2}},"canonical_sha256":"2b9b4456a55b97f9293231609ceb80edf595e112a7180158defcc1ad99b945f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b9b4456a55b97f9293231609ceb80edf595e112a7180158defcc1ad99b945f8","first_computed_at":"2026-05-18T00:50:13.309189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:13.309189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sSEfvnZ0Tric7vvN2t9kULDxrOfbgqF7ZBMtfj5oZypRMwh+BLKRx6nGfDu2w8pNxKsJqNDBqpG3tHHGct6+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:13.309745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06087","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fada48480baaa59d01b10b5403d9b6cc40d8f49fb5695fd6c539c8ad80277f6","sha256:e71d587c725653f9e128b4314e3b14d1b5d8a84506c80fcaab3fac3e0a821082"],"state_sha256":"16a93dc064c007906c4832a6f9be17380476a96fb29d7ce2fb2d18e2681ccb33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0IInkLOaaJX49wIKJmkAGgyxeo16uJEIqndP09Q8vOorBKeD2FoVCyM9o1PlfRkv4Tnu1tE6tHbEhwyhO+9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:18:16.843356Z","bundle_sha256":"b1c0c86bf8004706e5414015fafc5b692e75078f09025686e582c31ee1238514"}}