{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X6ARFY3E45UXAET3PB4NRSOMXX","short_pith_number":"pith:X6ARFY3E","canonical_record":{"source":{"id":"1805.07232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T02:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"456e0bb3c93ebed452da544dee420206e6b7839cc41cc295313148802b8ee4cf","abstract_canon_sha256":"5aafe75c4dc2be3a864430a0ea3b6854c38d1c2a3346858bb411d1da585972f0"},"schema_version":"1.0"},"canonical_sha256":"bf8112e364e76970127b7878d8c9ccbdd4ad6c71c218fafdf0cd0cbf93de86ff","source":{"kind":"arxiv","id":"1805.07232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07232","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07232v1","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07232","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"X6ARFY3E45UX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X6ARFY3E45UXAET3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X6ARFY3E","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X6ARFY3E45UXAET3PB4NRSOMXX","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T02:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"456e0bb3c93ebed452da544dee420206e6b7839cc41cc295313148802b8ee4cf","abstract_canon_sha256":"5aafe75c4dc2be3a864430a0ea3b6854c38d1c2a3346858bb411d1da585972f0"},"schema_version":"1.0"},"canonical_sha256":"bf8112e364e76970127b7878d8c9ccbdd4ad6c71c218fafdf0cd0cbf93de86ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.835163Z","signature_b64":"/5W7Rmr0Vl/eWNk798IcYN6h2OBcN1vWP98gY48/wW5RHBAduVJmk+Jpa1dcLMslxenSU7Zva5Lz1DAEET6zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf8112e364e76970127b7878d8c9ccbdd4ad6c71c218fafdf0cd0cbf93de86ff","last_reissued_at":"2026-05-18T00:15:38.834603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.834603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07232","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:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I38A7EQEIwTtfTBhp1MMV5dMNgCU0WPaIKVt1oxov/RoL5bVgAPlx9q3EtYCPG+nbFRFBZrgklPCUGplIkrQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:07:50.580762Z"},"content_sha256":"0716f1f51058dd65f81a90659c1919bec39b0d144352f19e95f81deacaf30c52","schema_version":"1.0","event_id":"sha256:0716f1f51058dd65f81a90659c1919bec39b0d144352f19e95f81deacaf30c52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X6ARFY3E45UXAET3PB4NRSOMXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast approximation of centrality and distances in hyperbolic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Feodor F. Dragan, Hend Al-Rasheed, Michel Habib, Victor Chepoi, Yann Vax\\`es","submitted_at":"2018-05-17T02:29:42Z","abstract_excerpt":"We show that the eccentricities (and thus the centrality indices) of all vertices of a $\\delta$-hyperbolic graph $G=(V,E)$ can be computed in linear time with an additive one-sided error of at most $c\\delta$, i.e., after a linear time preprocessing, for every vertex $v$ of $G$ one can compute in $O(1)$ time an estimate $\\hat{e}(v)$ of its eccentricity $ecc_G(v)$ such that $ecc_G(v)\\leq \\hat{e}(v)\\leq ecc_G(v)+ c\\delta$ for a small constant $c$. We prove that every $\\delta$-hyperbolic graph $G$ has a shortest path tree, constructible in linear time, such that for every vertex $v$ of $G$, $ecc_G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07232","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:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYpet2UM/RpfYVmAh7zCmqO57fBOapYe6dE9YSMsz0n4GjEHS4p0bDUZS3vKuZ2Z18GwVNQU2iNbOzD0dJIWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:07:50.581416Z"},"content_sha256":"d70bafd8dada1e537ef660f027630ada841c41385a69ad2cf924cc2268148b78","schema_version":"1.0","event_id":"sha256:d70bafd8dada1e537ef660f027630ada841c41385a69ad2cf924cc2268148b78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/bundle.json","state_url":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6ARFY3E45UXAET3PB4NRSOMXX/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-31T21:07:50Z","links":{"resolver":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX","bundle":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/bundle.json","state":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6ARFY3E45UXAET3PB4NRSOMXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X6ARFY3E45UXAET3PB4NRSOMXX","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":"5aafe75c4dc2be3a864430a0ea3b6854c38d1c2a3346858bb411d1da585972f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T02:29:42Z","title_canon_sha256":"456e0bb3c93ebed452da544dee420206e6b7839cc41cc295313148802b8ee4cf"},"schema_version":"1.0","source":{"id":"1805.07232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07232","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07232v1","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07232","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"X6ARFY3E45UX","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X6ARFY3E45UXAET3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X6ARFY3E","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:d70bafd8dada1e537ef660f027630ada841c41385a69ad2cf924cc2268148b78","target":"graph","created_at":"2026-05-18T00:15:38Z","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 show that the eccentricities (and thus the centrality indices) of all vertices of a $\\delta$-hyperbolic graph $G=(V,E)$ can be computed in linear time with an additive one-sided error of at most $c\\delta$, i.e., after a linear time preprocessing, for every vertex $v$ of $G$ one can compute in $O(1)$ time an estimate $\\hat{e}(v)$ of its eccentricity $ecc_G(v)$ such that $ecc_G(v)\\leq \\hat{e}(v)\\leq ecc_G(v)+ c\\delta$ for a small constant $c$. We prove that every $\\delta$-hyperbolic graph $G$ has a shortest path tree, constructible in linear time, such that for every vertex $v$ of $G$, $ecc_G","authors_text":"Feodor F. Dragan, Hend Al-Rasheed, Michel Habib, Victor Chepoi, Yann Vax\\`es","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T02:29:42Z","title":"Fast approximation of centrality and distances in hyperbolic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07232","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:0716f1f51058dd65f81a90659c1919bec39b0d144352f19e95f81deacaf30c52","target":"record","created_at":"2026-05-18T00:15:38Z","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":"5aafe75c4dc2be3a864430a0ea3b6854c38d1c2a3346858bb411d1da585972f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-17T02:29:42Z","title_canon_sha256":"456e0bb3c93ebed452da544dee420206e6b7839cc41cc295313148802b8ee4cf"},"schema_version":"1.0","source":{"id":"1805.07232","kind":"arxiv","version":1}},"canonical_sha256":"bf8112e364e76970127b7878d8c9ccbdd4ad6c71c218fafdf0cd0cbf93de86ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf8112e364e76970127b7878d8c9ccbdd4ad6c71c218fafdf0cd0cbf93de86ff","first_computed_at":"2026-05-18T00:15:38.834603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:38.834603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/5W7Rmr0Vl/eWNk798IcYN6h2OBcN1vWP98gY48/wW5RHBAduVJmk+Jpa1dcLMslxenSU7Zva5Lz1DAEET6zAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:38.835163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0716f1f51058dd65f81a90659c1919bec39b0d144352f19e95f81deacaf30c52","sha256:d70bafd8dada1e537ef660f027630ada841c41385a69ad2cf924cc2268148b78"],"state_sha256":"d191fd7b42904826e471b869a17abe48babff9bb4f0193a7d4e68366c061ad31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62GYrkg1oVDeS9Bnr/MZvoys58T0CFmKd069IlJhd2F/pL0wA1y+t5OvyU9zAJ1QvVTrNDRZeeJismPcAl0CCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:07:50.585238Z","bundle_sha256":"b41e57b674cc862433cc3bd8c27223fb8361f7c3d85674c62a9b637abce545bd"}}