{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JM6CWDFDTRAT2GBBP33STTD3TJ","short_pith_number":"pith:JM6CWDFD","canonical_record":{"source":{"id":"1612.05623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T20:33:28Z","cross_cats_sorted":[],"title_canon_sha256":"e2b714c3b1c4abd0783afb7f76d76d9313c8d8c1579423231bec886fa4293620","abstract_canon_sha256":"216543f95980b30f674beceb2b00a4a3464fefb2dbb5f200aae88154475523b9"},"schema_version":"1.0"},"canonical_sha256":"4b3c2b0ca39c413d18217ef729cc7b9a66c0c5fa17e3b427512adba4ed023737","source":{"kind":"arxiv","id":"1612.05623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05623","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05623v1","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05623","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"JM6CWDFDTRAT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JM6CWDFDTRAT2GBB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JM6CWDFD","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JM6CWDFDTRAT2GBBP33STTD3TJ","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T20:33:28Z","cross_cats_sorted":[],"title_canon_sha256":"e2b714c3b1c4abd0783afb7f76d76d9313c8d8c1579423231bec886fa4293620","abstract_canon_sha256":"216543f95980b30f674beceb2b00a4a3464fefb2dbb5f200aae88154475523b9"},"schema_version":"1.0"},"canonical_sha256":"4b3c2b0ca39c413d18217ef729cc7b9a66c0c5fa17e3b427512adba4ed023737","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:51.433771Z","signature_b64":"2rds1zcs9p2HebdbTnzC4Xrii18mO1G1ME7uCPjJEXKswWu/g/aKhJV3cEFXjC6hvT2KKDYfheWuehD+cEaIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b3c2b0ca39c413d18217ef729cc7b9a66c0c5fa17e3b427512adba4ed023737","last_reissued_at":"2026-05-18T00:54:51.433312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:51.433312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05623","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:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUuaE1XvD+PevL1XXLRcKTRJ4sAL1aLIwNAfOPbhjcUsaxlGNnkX2qe69DZ2rk7mPPYABFjEH8ZKXmEMSHauAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:20:22.471179Z"},"content_sha256":"1d8bf3436ac431435f6a9fa1a89a96ce442acfa964a6f2fe87269b060a17ef19","schema_version":"1.0","event_id":"sha256:1d8bf3436ac431435f6a9fa1a89a96ce442acfa964a6f2fe87269b060a17ef19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JM6CWDFDTRAT2GBBP33STTD3TJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Approximate Distance Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Dinitz, Zeyu Zhang","submitted_at":"2016-12-16T20:33:28Z","abstract_excerpt":"Given a finite metric space $(V,d)$, an approximate distance oracle is a data structure which, when queried on two points $u,v \\in V$, returns an approximation to the the actual distance between $u$ and $v$ which is within some bounded stretch factor of the true distance. There has been significant work on the tradeoff between the important parameters of approximate distance oracles (and in particular between the size, stretch, and query time), but in this paper we take a different point of view, that of per-instance optimization. If we are given an particular input metric space and stretch bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05623","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:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"If8zLugwucFhJb6/NeRXOv16Umo+ssBPJSAWo9U+oApTpEkGuAedLDS9kklH9slUI+qfHB+27/irUHQyfk/9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:20:22.471530Z"},"content_sha256":"eadc5135d178901b1af38e4bab8568cf670e2f73ae2923edb471f3a00d1e629a","schema_version":"1.0","event_id":"sha256:eadc5135d178901b1af38e4bab8568cf670e2f73ae2923edb471f3a00d1e629a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JM6CWDFDTRAT2GBBP33STTD3TJ/bundle.json","state_url":"https://pith.science/pith/JM6CWDFDTRAT2GBBP33STTD3TJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JM6CWDFDTRAT2GBBP33STTD3TJ/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-08T10:20:22Z","links":{"resolver":"https://pith.science/pith/JM6CWDFDTRAT2GBBP33STTD3TJ","bundle":"https://pith.science/pith/JM6CWDFDTRAT2GBBP33STTD3TJ/bundle.json","state":"https://pith.science/pith/JM6CWDFDTRAT2GBBP33STTD3TJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JM6CWDFDTRAT2GBBP33STTD3TJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JM6CWDFDTRAT2GBBP33STTD3TJ","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":"216543f95980b30f674beceb2b00a4a3464fefb2dbb5f200aae88154475523b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T20:33:28Z","title_canon_sha256":"e2b714c3b1c4abd0783afb7f76d76d9313c8d8c1579423231bec886fa4293620"},"schema_version":"1.0","source":{"id":"1612.05623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05623","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05623v1","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05623","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"JM6CWDFDTRAT","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JM6CWDFDTRAT2GBB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JM6CWDFD","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:eadc5135d178901b1af38e4bab8568cf670e2f73ae2923edb471f3a00d1e629a","target":"graph","created_at":"2026-05-18T00:54:51Z","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":"Given a finite metric space $(V,d)$, an approximate distance oracle is a data structure which, when queried on two points $u,v \\in V$, returns an approximation to the the actual distance between $u$ and $v$ which is within some bounded stretch factor of the true distance. There has been significant work on the tradeoff between the important parameters of approximate distance oracles (and in particular between the size, stretch, and query time), but in this paper we take a different point of view, that of per-instance optimization. If we are given an particular input metric space and stretch bo","authors_text":"Michael Dinitz, Zeyu Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T20:33:28Z","title":"Approximating Approximate Distance Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05623","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:1d8bf3436ac431435f6a9fa1a89a96ce442acfa964a6f2fe87269b060a17ef19","target":"record","created_at":"2026-05-18T00:54:51Z","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":"216543f95980b30f674beceb2b00a4a3464fefb2dbb5f200aae88154475523b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-16T20:33:28Z","title_canon_sha256":"e2b714c3b1c4abd0783afb7f76d76d9313c8d8c1579423231bec886fa4293620"},"schema_version":"1.0","source":{"id":"1612.05623","kind":"arxiv","version":1}},"canonical_sha256":"4b3c2b0ca39c413d18217ef729cc7b9a66c0c5fa17e3b427512adba4ed023737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b3c2b0ca39c413d18217ef729cc7b9a66c0c5fa17e3b427512adba4ed023737","first_computed_at":"2026-05-18T00:54:51.433312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:51.433312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2rds1zcs9p2HebdbTnzC4Xrii18mO1G1ME7uCPjJEXKswWu/g/aKhJV3cEFXjC6hvT2KKDYfheWuehD+cEaIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:51.433771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d8bf3436ac431435f6a9fa1a89a96ce442acfa964a6f2fe87269b060a17ef19","sha256:eadc5135d178901b1af38e4bab8568cf670e2f73ae2923edb471f3a00d1e629a"],"state_sha256":"b9b6692a3f01b7b63e567b59a20e474d829267e9250b2dd75172c500df79e290"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGgAbn271dieCrc3FvuGTu9f5Cw+/5HFcibwTk2rpw2v+g5eXkx0+IBtsEOMuPRSxK4mPUWewFt2JCIOEjf0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:20:22.473301Z","bundle_sha256":"228269bf22cdfe2f3f2cb9c43a14f7f6c2bbed6f388119be823131fdf1a7d4c9"}}