{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DRPGOA7QDOWBXKGMRP22PAZ32O","short_pith_number":"pith:DRPGOA7Q","canonical_record":{"source":{"id":"1404.1864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T17:57:33Z","cross_cats_sorted":["cs.IR","cs.SI"],"title_canon_sha256":"5409b8524e39bc4fb24a4c1d15854432172fc6f42d818bb1b9ede2c4eb5c19ed","abstract_canon_sha256":"d89b21e3a6b10e5f5917b5e5d8f251d0da7b97b3bd57acfe4a2f6582bbb29b73"},"schema_version":"1.0"},"canonical_sha256":"1c5e6703f01bac1ba8cc8bf5a7833bd388d681aa186c79a4684172fe4dedcd22","source":{"kind":"arxiv","id":"1404.1864","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1864","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1864v3","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1864","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"DRPGOA7QDOWB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DRPGOA7QDOWBXKGM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DRPGOA7Q","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DRPGOA7QDOWBXKGMRP22PAZ32O","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T17:57:33Z","cross_cats_sorted":["cs.IR","cs.SI"],"title_canon_sha256":"5409b8524e39bc4fb24a4c1d15854432172fc6f42d818bb1b9ede2c4eb5c19ed","abstract_canon_sha256":"d89b21e3a6b10e5f5917b5e5d8f251d0da7b97b3bd57acfe4a2f6582bbb29b73"},"schema_version":"1.0"},"canonical_sha256":"1c5e6703f01bac1ba8cc8bf5a7833bd388d681aa186c79a4684172fe4dedcd22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:58.291996Z","signature_b64":"DlJisbdLpJBmFzT1UMl5ZwfHewFVL+6oA2KZkG9YBzYohle6dRvESFbVO4eUr4E7QLDpO4ZTLGn4WUieI6/0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c5e6703f01bac1ba8cc8bf5a7833bd388d681aa186c79a4684172fe4dedcd22","last_reissued_at":"2026-05-18T00:08:58.291364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:58.291364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1864","source_version":3,"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:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLKszgyI/h6p3ig11x+3VBmSCV86um94EpkDbhLth3Z8NBW/N4VEQmdH98rwONVu1Xxb8WIVMq85H3ulHmTcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:28:27.889724Z"},"content_sha256":"b72b71f6e4035b69b7c873f5bf76593aabac07abb8ff717e23df772149800616","schema_version":"1.0","event_id":"sha256:b72b71f6e4035b69b7c873f5bf76593aabac07abb8ff717e23df772149800616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DRPGOA7QDOWBXKGMRP22PAZ32O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear algorithms for local graph centrality estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.DS","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","submitted_at":"2014-04-07T17:57:33Z","abstract_excerpt":"We study the complexity of local graph centrality estimation, with the goal of approximating the centrality score of a given target node while exploring only a sublinear number of nodes/arcs of the graph and performing a sublinear number of elementary operations. We develop a technique, that we apply to the PageRank and Heat Kernel centralities, for building a low-variance score estimator through a local exploration of the graph. We obtain an algorithm that, given any node in any graph of $m$ arcs, with probability $(1-\\delta)$ computes a multiplicative $(1\\pm\\epsilon)$-approximation of its sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1864","kind":"arxiv","version":3},"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:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkHHIkAPN7Z1wf0oh7VWWP0IrlF+ffosQrLdrbkh7nXR/+dJROGRyBdzzU6tAAK4pG3W7e06VdOzm7pe+ZrADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:28:27.890493Z"},"content_sha256":"3ae96994aee487815ce6bcbb52aac591cbf1c62f52ec9316649b9c8dd2586646","schema_version":"1.0","event_id":"sha256:3ae96994aee487815ce6bcbb52aac591cbf1c62f52ec9316649b9c8dd2586646"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRPGOA7QDOWBXKGMRP22PAZ32O/bundle.json","state_url":"https://pith.science/pith/DRPGOA7QDOWBXKGMRP22PAZ32O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRPGOA7QDOWBXKGMRP22PAZ32O/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-05-31T18:28:27Z","links":{"resolver":"https://pith.science/pith/DRPGOA7QDOWBXKGMRP22PAZ32O","bundle":"https://pith.science/pith/DRPGOA7QDOWBXKGMRP22PAZ32O/bundle.json","state":"https://pith.science/pith/DRPGOA7QDOWBXKGMRP22PAZ32O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRPGOA7QDOWBXKGMRP22PAZ32O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DRPGOA7QDOWBXKGMRP22PAZ32O","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":"d89b21e3a6b10e5f5917b5e5d8f251d0da7b97b3bd57acfe4a2f6582bbb29b73","cross_cats_sorted":["cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T17:57:33Z","title_canon_sha256":"5409b8524e39bc4fb24a4c1d15854432172fc6f42d818bb1b9ede2c4eb5c19ed"},"schema_version":"1.0","source":{"id":"1404.1864","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1864","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1864v3","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1864","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"DRPGOA7QDOWB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DRPGOA7QDOWBXKGM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DRPGOA7Q","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:3ae96994aee487815ce6bcbb52aac591cbf1c62f52ec9316649b9c8dd2586646","target":"graph","created_at":"2026-05-18T00:08:58Z","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 study the complexity of local graph centrality estimation, with the goal of approximating the centrality score of a given target node while exploring only a sublinear number of nodes/arcs of the graph and performing a sublinear number of elementary operations. We develop a technique, that we apply to the PageRank and Heat Kernel centralities, for building a low-variance score estimator through a local exploration of the graph. We obtain an algorithm that, given any node in any graph of $m$ arcs, with probability $(1-\\delta)$ computes a multiplicative $(1\\pm\\epsilon)$-approximation of its sc","authors_text":"Enoch Peserico, Luca Pretto, Marco Bressan","cross_cats":["cs.IR","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T17:57:33Z","title":"Sublinear algorithms for local graph centrality estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1864","kind":"arxiv","version":3},"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:b72b71f6e4035b69b7c873f5bf76593aabac07abb8ff717e23df772149800616","target":"record","created_at":"2026-05-18T00:08:58Z","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":"d89b21e3a6b10e5f5917b5e5d8f251d0da7b97b3bd57acfe4a2f6582bbb29b73","cross_cats_sorted":["cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T17:57:33Z","title_canon_sha256":"5409b8524e39bc4fb24a4c1d15854432172fc6f42d818bb1b9ede2c4eb5c19ed"},"schema_version":"1.0","source":{"id":"1404.1864","kind":"arxiv","version":3}},"canonical_sha256":"1c5e6703f01bac1ba8cc8bf5a7833bd388d681aa186c79a4684172fe4dedcd22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c5e6703f01bac1ba8cc8bf5a7833bd388d681aa186c79a4684172fe4dedcd22","first_computed_at":"2026-05-18T00:08:58.291364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:58.291364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DlJisbdLpJBmFzT1UMl5ZwfHewFVL+6oA2KZkG9YBzYohle6dRvESFbVO4eUr4E7QLDpO4ZTLGn4WUieI6/0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:58.291996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1864","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b72b71f6e4035b69b7c873f5bf76593aabac07abb8ff717e23df772149800616","sha256:3ae96994aee487815ce6bcbb52aac591cbf1c62f52ec9316649b9c8dd2586646"],"state_sha256":"f702ae610a13fe4d364e62299c3aaf73fe2017eb63776356558c78b506638f5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"575vQRzmQJsJo/T4D8YUWjOtDYuTGPjpwo+GCsOQxvY9gc92d2Nj3R0SfAw2ng++dIuT+X4e52lvh6+nT9LVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:28:27.894617Z","bundle_sha256":"98ace2c40509deb04bdfc7c74b84cae08dfb0c2579fb435356c66c533ef73c85"}}