{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GRENA727L6CN2GXACQQIROI7NO","short_pith_number":"pith:GRENA727","schema_version":"1.0","canonical_sha256":"3448d07f5f5f84dd1ae0142088b91f6b90a316f47a28e87a7b708ea1a72d3b19","source":{"kind":"arxiv","id":"1604.08553","version":4},"attestation_state":"computed","paper":{"title":"KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Emanuele Natale, Michele Borassi","submitted_at":"2016-04-28T18:46:52Z","abstract_excerpt":"We present KADABRA, a new algorithm to approximate betweenness centrality in directed and undirected graphs, which significantly outperforms all previous approaches on real-world complex networks. The efficiency of the new algorithm relies on two new theoretical contributions, of independent interest. The first contribution focuses on sampling shortest paths, a subroutine used by most algorithms that approximate betweenness centrality. We show that, on realistic random graph models, we can perform this task in time $|E|^{\\frac{1}{2}+o(1)}$ with high probability, obtaining a significant speedup"},"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":"1604.08553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T18:46:52Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"ccd9e83931fd0c024775eed7da4926f4177f37ffb69e77b47b9a29e407ddbe26","abstract_canon_sha256":"044e00cb905980da9bda6c5bdbcb9995ecc0a56a2617edc7630bf2cc6f8ba4bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:11.694478Z","signature_b64":"u7rgCI9YEwytEsgqEYvU5tKWxCzHhYFWasbXP0VOBf1vuUc7JQ7/kUpx8b7EX5FG9rki+V5mILJ3D+FAMMolBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3448d07f5f5f84dd1ae0142088b91f6b90a316f47a28e87a7b708ea1a72d3b19","last_reissued_at":"2026-05-18T01:09:11.693879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:11.693879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Emanuele Natale, Michele Borassi","submitted_at":"2016-04-28T18:46:52Z","abstract_excerpt":"We present KADABRA, a new algorithm to approximate betweenness centrality in directed and undirected graphs, which significantly outperforms all previous approaches on real-world complex networks. The efficiency of the new algorithm relies on two new theoretical contributions, of independent interest. The first contribution focuses on sampling shortest paths, a subroutine used by most algorithms that approximate betweenness centrality. We show that, on realistic random graph models, we can perform this task in time $|E|^{\\frac{1}{2}+o(1)}$ with high probability, obtaining a significant speedup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08553","kind":"arxiv","version":4},"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":"1604.08553","created_at":"2026-05-18T01:09:11.693986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08553v4","created_at":"2026-05-18T01:09:11.693986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08553","created_at":"2026-05-18T01:09:11.693986+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRENA727L6CN","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRENA727L6CN2GXA","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRENA727","created_at":"2026-05-18T12:30:19.053100+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/GRENA727L6CN2GXACQQIROI7NO","json":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO.json","graph_json":"https://pith.science/api/pith-number/GRENA727L6CN2GXACQQIROI7NO/graph.json","events_json":"https://pith.science/api/pith-number/GRENA727L6CN2GXACQQIROI7NO/events.json","paper":"https://pith.science/paper/GRENA727"},"agent_actions":{"view_html":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO","download_json":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO.json","view_paper":"https://pith.science/paper/GRENA727","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08553&json=true","fetch_graph":"https://pith.science/api/pith-number/GRENA727L6CN2GXACQQIROI7NO/graph.json","fetch_events":"https://pith.science/api/pith-number/GRENA727L6CN2GXACQQIROI7NO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/action/storage_attestation","attest_author":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/action/author_attestation","sign_citation":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/action/citation_signature","submit_replication":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/action/replication_record"}},"created_at":"2026-05-18T01:09:11.693986+00:00","updated_at":"2026-05-18T01:09:11.693986+00:00"}