{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GRENA727L6CN2GXACQQIROI7NO","short_pith_number":"pith:GRENA727","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"},"canonical_sha256":"3448d07f5f5f84dd1ae0142088b91f6b90a316f47a28e87a7b708ea1a72d3b19","source":{"kind":"arxiv","id":"1604.08553","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08553","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08553v4","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08553","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"GRENA727L6CN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GRENA727L6CN2GXA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GRENA727","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GRENA727L6CN2GXACQQIROI7NO","target":"record","payload":{"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"},"canonical_sha256":"3448d07f5f5f84dd1ae0142088b91f6b90a316f47a28e87a7b708ea1a72d3b19","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"},"source_kind":"arxiv","source_id":"1604.08553","source_version":4,"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-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oExE0mOVmAWEF4R1JV2eBH8tgaE0RdBVIQzx3L6hG9cOF6+FbraoiAYMZaKWin5JyIDew/nB1Tqanr+oCLE6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:12:42.591426Z"},"content_sha256":"bd2450a0a86b83ad1dea706e3d1082dc1bcabd88edd66dcb27d1e3e40ec09084","schema_version":"1.0","event_id":"sha256:bd2450a0a86b83ad1dea706e3d1082dc1bcabd88edd66dcb27d1e3e40ec09084"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GRENA727L6CN2GXACQQIROI7NO","target":"graph","payload":{"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"},"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-18T01:09:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5NvVKwW2jr4YGA4Beka/TtUMYX+fvkOP+ITmuZFgWxami9Yb1WKeQX2dh30NVIA/HwQmpxNn519XMLN6sErDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:12:42.591776Z"},"content_sha256":"633ac3e1196c526740d0aefdd96ce9c95545c0ec66e550911e8ac34638d5fe63","schema_version":"1.0","event_id":"sha256:633ac3e1196c526740d0aefdd96ce9c95545c0ec66e550911e8ac34638d5fe63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/bundle.json","state_url":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRENA727L6CN2GXACQQIROI7NO/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-06T19:12:42Z","links":{"resolver":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO","bundle":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/bundle.json","state":"https://pith.science/pith/GRENA727L6CN2GXACQQIROI7NO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRENA727L6CN2GXACQQIROI7NO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GRENA727L6CN2GXACQQIROI7NO","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":"044e00cb905980da9bda6c5bdbcb9995ecc0a56a2617edc7630bf2cc6f8ba4bc","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T18:46:52Z","title_canon_sha256":"ccd9e83931fd0c024775eed7da4926f4177f37ffb69e77b47b9a29e407ddbe26"},"schema_version":"1.0","source":{"id":"1604.08553","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08553","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08553v4","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08553","created_at":"2026-05-18T01:09:11Z"},{"alias_kind":"pith_short_12","alias_value":"GRENA727L6CN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GRENA727L6CN2GXA","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GRENA727","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:633ac3e1196c526740d0aefdd96ce9c95545c0ec66e550911e8ac34638d5fe63","target":"graph","created_at":"2026-05-18T01:09:11Z","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":"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","authors_text":"Emanuele Natale, Michele Borassi","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T18:46:52Z","title":"KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08553","kind":"arxiv","version":4},"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:bd2450a0a86b83ad1dea706e3d1082dc1bcabd88edd66dcb27d1e3e40ec09084","target":"record","created_at":"2026-05-18T01:09:11Z","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":"044e00cb905980da9bda6c5bdbcb9995ecc0a56a2617edc7630bf2cc6f8ba4bc","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T18:46:52Z","title_canon_sha256":"ccd9e83931fd0c024775eed7da4926f4177f37ffb69e77b47b9a29e407ddbe26"},"schema_version":"1.0","source":{"id":"1604.08553","kind":"arxiv","version":4}},"canonical_sha256":"3448d07f5f5f84dd1ae0142088b91f6b90a316f47a28e87a7b708ea1a72d3b19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3448d07f5f5f84dd1ae0142088b91f6b90a316f47a28e87a7b708ea1a72d3b19","first_computed_at":"2026-05-18T01:09:11.693879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:11.693879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u7rgCI9YEwytEsgqEYvU5tKWxCzHhYFWasbXP0VOBf1vuUc7JQ7/kUpx8b7EX5FG9rki+V5mILJ3D+FAMMolBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:11.694478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08553","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd2450a0a86b83ad1dea706e3d1082dc1bcabd88edd66dcb27d1e3e40ec09084","sha256:633ac3e1196c526740d0aefdd96ce9c95545c0ec66e550911e8ac34638d5fe63"],"state_sha256":"4fe9e0489070e4cc8241318f6b7c914e2600f40708e3d48453801afd0589c3a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gZu81/mnTj9AyPHdX39u0aQE9h9EqcXWVrN/pb2/xvccRiqiwMUo3jYfIqPvMcR9ZfAzu/9S2a5fEpnith7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:12:42.594039Z","bundle_sha256":"bc12806b6adb4d005cba144e8d57f6a0e1ea1e0d20b8cf4f8596d8d3d2ed2e90"}}