{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WUVMRZYKUQRLDZPAJHOYNK43UP","short_pith_number":"pith:WUVMRZYK","canonical_record":{"source":{"id":"1604.07359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T18:39:25Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"56d66be667c25fb0d10438612d09d17ea812a0166d27d8f89f0035d0b86a9847","abstract_canon_sha256":"a83a3e9f144d1187507897517bb92ae57582603926b536639398c8be0d951d24"},"schema_version":"1.0"},"canonical_sha256":"b52ac8e70aa422b1e5e049dd86ab9ba3d01179b24f7e120693c3bc24fefa4271","source":{"kind":"arxiv","id":"1604.07359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07359","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07359v1","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07359","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"WUVMRZYKUQRL","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WUVMRZYKUQRLDZPA","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WUVMRZYK","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WUVMRZYKUQRLDZPAJHOYNK43UP","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T18:39:25Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"56d66be667c25fb0d10438612d09d17ea812a0166d27d8f89f0035d0b86a9847","abstract_canon_sha256":"a83a3e9f144d1187507897517bb92ae57582603926b536639398c8be0d951d24"},"schema_version":"1.0"},"canonical_sha256":"b52ac8e70aa422b1e5e049dd86ab9ba3d01179b24f7e120693c3bc24fefa4271","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:57.197985Z","signature_b64":"0+7HbUmCnDzA3qlwSgyy055Yidl6lFbupHtjRYvmRy/wJ9P+P3IgTvIgdzrlqe8CVScObv/0oK3GI8JNRqfdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b52ac8e70aa422b1e5e049dd86ab9ba3d01179b24f7e120693c3bc24fefa4271","last_reissued_at":"2026-05-18T01:15:57.197462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:57.197462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07359","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-18T01:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35JmdPVmmCNdh9N4IE9EqxLM/+d5Rk/ftEdX0XO/oTA1TZwBjIXDNRCoE6L7G9yEc2KAYXBIPgCW2ysl/nZkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:39:09.364239Z"},"content_sha256":"4ebfedb5107d4831492518a74ae9557520063bd1a04c64e61a94f89307e180c3","schema_version":"1.0","event_id":"sha256:4ebfedb5107d4831492518a74ae9557520063bd1a04c64e61a94f89307e180c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WUVMRZYKUQRLDZPAJHOYNK43UP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast approximation algorithms for $p$-centres in large $\\delta$-hyperbolic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.DS","authors_text":"Iraj Saniee, Katherine Edwards, W. Sean Kennedy","submitted_at":"2016-04-25T18:39:25Z","abstract_excerpt":"We provide a quasilinear time algorithm for the $p$-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph $G=(V,E)$ with $n$ vertices, $m$ edges and hyperbolic constant $\\delta$, we construct an algorithm for $p$-centers in time $O(p(\\delta+1)(n+m)\\log(n))$ with radius not exceeding $r_p + \\delta$ when $p \\leq 2$ and $r_p + 3\\delta$ when $p \\geq 3$, where $r_p$ are the optimal radii. Prior work identified $p$-centers with accuracy $r_p+\\delta$ but with time complexity $O((n^3\\log n + n^2m)\\log(diam(G)))$ which is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07359","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-18T01:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcwHBQGDcKzHwpffeU/1RBtkK/fTGk2HeFdIlkIaQfC29YqOLcuQ+c08Yn79NBzBGfpmUnPjsyl9pI9M1Q2tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:39:09.364603Z"},"content_sha256":"72e075149edaeeeaac74917c168af8c508304b201b68a01d32dc4dcbd5eb0815","schema_version":"1.0","event_id":"sha256:72e075149edaeeeaac74917c168af8c508304b201b68a01d32dc4dcbd5eb0815"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUVMRZYKUQRLDZPAJHOYNK43UP/bundle.json","state_url":"https://pith.science/pith/WUVMRZYKUQRLDZPAJHOYNK43UP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUVMRZYKUQRLDZPAJHOYNK43UP/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-28T12:39:09Z","links":{"resolver":"https://pith.science/pith/WUVMRZYKUQRLDZPAJHOYNK43UP","bundle":"https://pith.science/pith/WUVMRZYKUQRLDZPAJHOYNK43UP/bundle.json","state":"https://pith.science/pith/WUVMRZYKUQRLDZPAJHOYNK43UP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUVMRZYKUQRLDZPAJHOYNK43UP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WUVMRZYKUQRLDZPAJHOYNK43UP","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":"a83a3e9f144d1187507897517bb92ae57582603926b536639398c8be0d951d24","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T18:39:25Z","title_canon_sha256":"56d66be667c25fb0d10438612d09d17ea812a0166d27d8f89f0035d0b86a9847"},"schema_version":"1.0","source":{"id":"1604.07359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07359","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07359v1","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07359","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"WUVMRZYKUQRL","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WUVMRZYKUQRLDZPA","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WUVMRZYK","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:72e075149edaeeeaac74917c168af8c508304b201b68a01d32dc4dcbd5eb0815","target":"graph","created_at":"2026-05-18T01:15:57Z","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 provide a quasilinear time algorithm for the $p$-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph $G=(V,E)$ with $n$ vertices, $m$ edges and hyperbolic constant $\\delta$, we construct an algorithm for $p$-centers in time $O(p(\\delta+1)(n+m)\\log(n))$ with radius not exceeding $r_p + \\delta$ when $p \\leq 2$ and $r_p + 3\\delta$ when $p \\geq 3$, where $r_p$ are the optimal radii. Prior work identified $p$-centers with accuracy $r_p+\\delta$ but with time complexity $O((n^3\\log n + n^2m)\\log(diam(G)))$ which is ","authors_text":"Iraj Saniee, Katherine Edwards, W. Sean Kennedy","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T18:39:25Z","title":"Fast approximation algorithms for $p$-centres in large $\\delta$-hyperbolic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07359","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:4ebfedb5107d4831492518a74ae9557520063bd1a04c64e61a94f89307e180c3","target":"record","created_at":"2026-05-18T01:15:57Z","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":"a83a3e9f144d1187507897517bb92ae57582603926b536639398c8be0d951d24","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T18:39:25Z","title_canon_sha256":"56d66be667c25fb0d10438612d09d17ea812a0166d27d8f89f0035d0b86a9847"},"schema_version":"1.0","source":{"id":"1604.07359","kind":"arxiv","version":1}},"canonical_sha256":"b52ac8e70aa422b1e5e049dd86ab9ba3d01179b24f7e120693c3bc24fefa4271","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b52ac8e70aa422b1e5e049dd86ab9ba3d01179b24f7e120693c3bc24fefa4271","first_computed_at":"2026-05-18T01:15:57.197462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:57.197462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0+7HbUmCnDzA3qlwSgyy055Yidl6lFbupHtjRYvmRy/wJ9P+P3IgTvIgdzrlqe8CVScObv/0oK3GI8JNRqfdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:57.197985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ebfedb5107d4831492518a74ae9557520063bd1a04c64e61a94f89307e180c3","sha256:72e075149edaeeeaac74917c168af8c508304b201b68a01d32dc4dcbd5eb0815"],"state_sha256":"7f587c192757c226006a8649f5ca487ac028694dafc11ab37bed140e189d0de2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGvA/oQbNvESHUMDf6mro/7Kj0C0/Gg0fNlpcBVyflYZzm9Dhu9GW33TGaWUeL5m6clr3o7fyYdtnv/iae0eCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:39:09.366563Z","bundle_sha256":"c5e248495362b29b0e0985f67486bb934015894ff94017c602f912a7962c50ac"}}