{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LAHQ6QQ33JEIV6WN526ECDMXQT","short_pith_number":"pith:LAHQ6QQ3","canonical_record":{"source":{"id":"1810.10094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T21:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"a972336463871a918136b72fbee24e105a66e68fed925bc450061f71273e42f4","abstract_canon_sha256":"f3ef108b0178035fb4a2581d058bb32f047ff173872108e3cc69fb6a9b85f743"},"schema_version":"1.0"},"canonical_sha256":"580f0f421bda488afacdeebc410d9784d39e0ee52fa66d688de66437c735787c","source":{"kind":"arxiv","id":"1810.10094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10094","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10094v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10094","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"LAHQ6QQ33JEI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LAHQ6QQ33JEIV6WN","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LAHQ6QQ3","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LAHQ6QQ33JEIV6WN526ECDMXQT","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T21:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"a972336463871a918136b72fbee24e105a66e68fed925bc450061f71273e42f4","abstract_canon_sha256":"f3ef108b0178035fb4a2581d058bb32f047ff173872108e3cc69fb6a9b85f743"},"schema_version":"1.0"},"canonical_sha256":"580f0f421bda488afacdeebc410d9784d39e0ee52fa66d688de66437c735787c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.258120Z","signature_b64":"zTz4QtbJXk0aE3iz1i8Nk+rpOi0c1XTONAsViBeK0deBCN0bBe8cgIc5M2uHpxCYFmdfo0irHZDZ1mXwXZhZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"580f0f421bda488afacdeebc410d9784d39e0ee52fa66d688de66437c735787c","last_reissued_at":"2026-05-18T00:02:24.257239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.257239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10094","source_version":1,"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:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"568cjE+O2HDW46iDu19XkaDV24LnNKjko/pU6Inrw3VbVNI5a20PYBNDEeqLG8B9UP3j+ssCI15mdsLNa8VbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:53:21.172690Z"},"content_sha256":"4dc904ca495ce810ff696bce8a76d990535c57bb52bfc47c734151d8b3a43acd","schema_version":"1.0","event_id":"sha256:4dc904ca495ce810ff696bce8a76d990535c57bb52bfc47c734151d8b3a43acd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LAHQ6QQ33JEIV6WN526ECDMXQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","submitted_at":"2018-10-23T21:17:57Z","abstract_excerpt":"An important index widely used to analyze social and information networks is betweenness centrality. In this paper, first given a directed network $G$ and a vertex $r\\in V(G)$, we present a novel adaptive algorithm for estimating betweenness score of $r$. Our algorithm first computes two subsets of the vertex set of $G$, called $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$, that define the sample spaces of the start-points and the end-points of the samples. Then, it adaptively samples from $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$ and stops as soon as some condition is satisfied. The stopping conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10094","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"},"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:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3f7IRYSwnm4avrBpWLeaoMUSAaGW6sUPu+3T2x3dhabjY1ObGXlS4/W3PK1enZ5oU12dukHL0GWWhCCE0Q0pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:53:21.173037Z"},"content_sha256":"570c9c3e6044c31cb11842e71573e69112f4cd0c4483201fe6831d07f6fa2c7c","schema_version":"1.0","event_id":"sha256:570c9c3e6044c31cb11842e71573e69112f4cd0c4483201fe6831d07f6fa2c7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/bundle.json","state_url":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/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-25T10:53:21Z","links":{"resolver":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT","bundle":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/bundle.json","state":"https://pith.science/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAHQ6QQ33JEIV6WN526ECDMXQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LAHQ6QQ33JEIV6WN526ECDMXQT","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":"f3ef108b0178035fb4a2581d058bb32f047ff173872108e3cc69fb6a9b85f743","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T21:17:57Z","title_canon_sha256":"a972336463871a918136b72fbee24e105a66e68fed925bc450061f71273e42f4"},"schema_version":"1.0","source":{"id":"1810.10094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10094","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10094v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10094","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"LAHQ6QQ33JEI","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LAHQ6QQ33JEIV6WN","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LAHQ6QQ3","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:570c9c3e6044c31cb11842e71573e69112f4cd0c4483201fe6831d07f6fa2c7c","target":"graph","created_at":"2026-05-18T00:02:24Z","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":"An important index widely used to analyze social and information networks is betweenness centrality. In this paper, first given a directed network $G$ and a vertex $r\\in V(G)$, we present a novel adaptive algorithm for estimating betweenness score of $r$. Our algorithm first computes two subsets of the vertex set of $G$, called $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$, that define the sample spaces of the start-points and the end-points of the samples. Then, it adaptively samples from $\\mathcal{RF}(r)$ and $\\mathcal{RT}(r)$ and stops as soon as some condition is satisfied. The stopping conditio","authors_text":"Albert Bifet, Mostafa Haghir Chehreghani, Talel Abdessalem","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T21:17:57Z","title":"Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10094","kind":"arxiv","version":1},"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:4dc904ca495ce810ff696bce8a76d990535c57bb52bfc47c734151d8b3a43acd","target":"record","created_at":"2026-05-18T00:02:24Z","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":"f3ef108b0178035fb4a2581d058bb32f047ff173872108e3cc69fb6a9b85f743","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T21:17:57Z","title_canon_sha256":"a972336463871a918136b72fbee24e105a66e68fed925bc450061f71273e42f4"},"schema_version":"1.0","source":{"id":"1810.10094","kind":"arxiv","version":1}},"canonical_sha256":"580f0f421bda488afacdeebc410d9784d39e0ee52fa66d688de66437c735787c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"580f0f421bda488afacdeebc410d9784d39e0ee52fa66d688de66437c735787c","first_computed_at":"2026-05-18T00:02:24.257239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.257239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zTz4QtbJXk0aE3iz1i8Nk+rpOi0c1XTONAsViBeK0deBCN0bBe8cgIc5M2uHpxCYFmdfo0irHZDZ1mXwXZhZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.258120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc904ca495ce810ff696bce8a76d990535c57bb52bfc47c734151d8b3a43acd","sha256:570c9c3e6044c31cb11842e71573e69112f4cd0c4483201fe6831d07f6fa2c7c"],"state_sha256":"533c74e77b011b91578ce33d2303a97bb23224451c8b83f3ce3ee6f39f8c8ac6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uKpEb/N/ixRdIkekYFm1vVUjGaIq7vD4NycT2B+fsMPXry+y25ZFirLKkXG3V9Ajv5OoFWKzeB8GVXcuuuqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:53:21.175006Z","bundle_sha256":"07047d636f2def3f6d94dd988b7d8c7abb555e5667b627fb58afeb65377c781a"}}