{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X6ARFY3E45UXAET3PB4NRSOMXX","short_pith_number":"pith:X6ARFY3E","schema_version":"1.0","canonical_sha256":"bf8112e364e76970127b7878d8c9ccbdd4ad6c71c218fafdf0cd0cbf93de86ff","source":{"kind":"arxiv","id":"1805.07232","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.07232","created_at":"2026-05-18T00:15:38.834689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07232v1","created_at":"2026-05-18T00:15:38.834689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07232","created_at":"2026-05-18T00:15:38.834689+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6ARFY3E45UX","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6ARFY3E45UXAET3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6ARFY3E","created_at":"2026-05-18T12:33:01.666342+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/X6ARFY3E45UXAET3PB4NRSOMXX","json":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX.json","graph_json":"https://pith.science/api/pith-number/X6ARFY3E45UXAET3PB4NRSOMXX/graph.json","events_json":"https://pith.science/api/pith-number/X6ARFY3E45UXAET3PB4NRSOMXX/events.json","paper":"https://pith.science/paper/X6ARFY3E"},"agent_actions":{"view_html":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX","download_json":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX.json","view_paper":"https://pith.science/paper/X6ARFY3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07232&json=true","fetch_graph":"https://pith.science/api/pith-number/X6ARFY3E45UXAET3PB4NRSOMXX/graph.json","fetch_events":"https://pith.science/api/pith-number/X6ARFY3E45UXAET3PB4NRSOMXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/action/storage_attestation","attest_author":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/action/author_attestation","sign_citation":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/action/citation_signature","submit_replication":"https://pith.science/pith/X6ARFY3E45UXAET3PB4NRSOMXX/action/replication_record"}},"created_at":"2026-05-18T00:15:38.834689+00:00","updated_at":"2026-05-18T00:15:38.834689+00:00"}