{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:C7OI7ZSD4T6HND73UEBZK4JQIP","short_pith_number":"pith:C7OI7ZSD","canonical_record":{"source":{"id":"2205.14816","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T02:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"fe1fc62e19f7757af1c7c4b5412cc1c862f86cf3f42dde2bfec3399dd2019b50","abstract_canon_sha256":"17b401a33b38442c1f5603d5ac3f3099241dd2d29fe531ed02526b42f8673960"},"schema_version":"1.0"},"canonical_sha256":"17dc8fe643e4fc768ffba10395713043f0078289e56ba4576d1d866e5fa2eab8","source":{"kind":"arxiv","id":"2205.14816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14816","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14816v1","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14816","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"C7OI7ZSD4T6H","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"pith_short_16","alias_value":"C7OI7ZSD4T6HND73","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"pith_short_8","alias_value":"C7OI7ZSD","created_at":"2026-07-05T04:27:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:C7OI7ZSD4T6HND73UEBZK4JQIP","target":"record","payload":{"canonical_record":{"source":{"id":"2205.14816","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T02:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"fe1fc62e19f7757af1c7c4b5412cc1c862f86cf3f42dde2bfec3399dd2019b50","abstract_canon_sha256":"17b401a33b38442c1f5603d5ac3f3099241dd2d29fe531ed02526b42f8673960"},"schema_version":"1.0"},"canonical_sha256":"17dc8fe643e4fc768ffba10395713043f0078289e56ba4576d1d866e5fa2eab8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:21.556808Z","signature_b64":"rWq+YX/Vd8cgVZNSot8NrC6Mj7Ku38d9QHGIKnzs0p5Gn/zaJHR7k5AOO8Pj6mHy5/574e/93qlCqWcISNdMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17dc8fe643e4fc768ffba10395713043f0078289e56ba4576d1d866e5fa2eab8","last_reissued_at":"2026-07-05T04:27:21.556346Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:21.556346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.14816","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-07-05T04:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"loNQUxHPqCP7CqsiVobOaHe/wdtDaNxRubdzZWxgf2BGU15QTD36715SWJE62tOFJ7mnNQ14TKEVNB4Fqnk6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:30:09.436650Z"},"content_sha256":"a03b648ca0c687bb3e3e7415fc715006b248204ef9c68c274e7c8b9d5dfa325b","schema_version":"1.0","event_id":"sha256:a03b648ca0c687bb3e3e7415fc715006b248204ef9c68c274e7c8b9d5dfa325b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:C7OI7ZSD4T6HND73UEBZK4JQIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Distance Oracles for Any Symmetric Norm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Omri Weinstein, Ruizhe Zhang, Yichuan Deng, Zhao Song","submitted_at":"2022-05-30T02:48:08Z","abstract_excerpt":"In the Distance Oracle problem, the goal is to preprocess $n$ vectors $x_1, x_2, \\cdots, x_n$ in a $d$-dimensional metric space $(\\mathbb{X}^d, \\| \\cdot \\|_l)$ into a cheap data structure, so that given a query vector $q \\in \\mathbb{X}^d$ and a subset $S\\subseteq [n]$ of the input data points, all distances $\\| q - x_i \\|_l$ for $x_i\\in S$ can be quickly approximated (faster than the trivial $\\sim d|S|$ query time). This primitive is a basic subroutine in machine learning, data mining and similarity search applications. In the case of $\\ell_p$ norms, the problem is well understood, and optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14816","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.14816/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAo2E1e0c8EbOxA9pFv+VvDmu1AffCQ922ixPZAkA9ju7J8+UQQ3N0IBmDQk0K+RFdWVTG+MvISuJAiDFScYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:30:09.437195Z"},"content_sha256":"d386233bddf2f47361498cb092da61dc200ca963b6d999aa988ff65140af0658","schema_version":"1.0","event_id":"sha256:d386233bddf2f47361498cb092da61dc200ca963b6d999aa988ff65140af0658"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7OI7ZSD4T6HND73UEBZK4JQIP/bundle.json","state_url":"https://pith.science/pith/C7OI7ZSD4T6HND73UEBZK4JQIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7OI7ZSD4T6HND73UEBZK4JQIP/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-08-09T05:30:09Z","links":{"resolver":"https://pith.science/pith/C7OI7ZSD4T6HND73UEBZK4JQIP","bundle":"https://pith.science/pith/C7OI7ZSD4T6HND73UEBZK4JQIP/bundle.json","state":"https://pith.science/pith/C7OI7ZSD4T6HND73UEBZK4JQIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7OI7ZSD4T6HND73UEBZK4JQIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:C7OI7ZSD4T6HND73UEBZK4JQIP","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":"17b401a33b38442c1f5603d5ac3f3099241dd2d29fe531ed02526b42f8673960","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T02:48:08Z","title_canon_sha256":"fe1fc62e19f7757af1c7c4b5412cc1c862f86cf3f42dde2bfec3399dd2019b50"},"schema_version":"1.0","source":{"id":"2205.14816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14816","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14816v1","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14816","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"C7OI7ZSD4T6H","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"pith_short_16","alias_value":"C7OI7ZSD4T6HND73","created_at":"2026-07-05T04:27:21Z"},{"alias_kind":"pith_short_8","alias_value":"C7OI7ZSD","created_at":"2026-07-05T04:27:21Z"}],"graph_snapshots":[{"event_id":"sha256:d386233bddf2f47361498cb092da61dc200ca963b6d999aa988ff65140af0658","target":"graph","created_at":"2026-07-05T04:27:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.14816/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Distance Oracle problem, the goal is to preprocess $n$ vectors $x_1, x_2, \\cdots, x_n$ in a $d$-dimensional metric space $(\\mathbb{X}^d, \\| \\cdot \\|_l)$ into a cheap data structure, so that given a query vector $q \\in \\mathbb{X}^d$ and a subset $S\\subseteq [n]$ of the input data points, all distances $\\| q - x_i \\|_l$ for $x_i\\in S$ can be quickly approximated (faster than the trivial $\\sim d|S|$ query time). This primitive is a basic subroutine in machine learning, data mining and similarity search applications. In the case of $\\ell_p$ norms, the problem is well understood, and optimal","authors_text":"Omri Weinstein, Ruizhe Zhang, Yichuan Deng, Zhao Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T02:48:08Z","title":"Fast Distance Oracles for Any Symmetric Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14816","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:a03b648ca0c687bb3e3e7415fc715006b248204ef9c68c274e7c8b9d5dfa325b","target":"record","created_at":"2026-07-05T04:27:21Z","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":"17b401a33b38442c1f5603d5ac3f3099241dd2d29fe531ed02526b42f8673960","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T02:48:08Z","title_canon_sha256":"fe1fc62e19f7757af1c7c4b5412cc1c862f86cf3f42dde2bfec3399dd2019b50"},"schema_version":"1.0","source":{"id":"2205.14816","kind":"arxiv","version":1}},"canonical_sha256":"17dc8fe643e4fc768ffba10395713043f0078289e56ba4576d1d866e5fa2eab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17dc8fe643e4fc768ffba10395713043f0078289e56ba4576d1d866e5fa2eab8","first_computed_at":"2026-07-05T04:27:21.556346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:21.556346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rWq+YX/Vd8cgVZNSot8NrC6Mj7Ku38d9QHGIKnzs0p5Gn/zaJHR7k5AOO8Pj6mHy5/574e/93qlCqWcISNdMAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:21.556808Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a03b648ca0c687bb3e3e7415fc715006b248204ef9c68c274e7c8b9d5dfa325b","sha256:d386233bddf2f47361498cb092da61dc200ca963b6d999aa988ff65140af0658"],"state_sha256":"3f9aea44995bec2b86bbfb5d6c39b5adc41ddb82c551bebaab0b37732f2027d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yoosgbLcgd9owlwuoT+2mYYzEnAgFzxRFhvr7eO0VQ4bhlF3xyDJ1tvVbCjioVFJfitIu4rAgzO5s8/h/eTqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:30:09.442627Z","bundle_sha256":"12fdab6be987208a95ead7df5c274fe58d91d3155f68b0f9731b37ddcd3bfb14"}}