{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:P2UCDYZY5P2LODUTRVSTQQPHM2","short_pith_number":"pith:P2UCDYZY","canonical_record":{"source":{"id":"1904.04828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T14:08:53Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"eb7aaec7a748f5d9e7d197d785c5c53e7eb6ee661a945c54552fafc3e720ea42","abstract_canon_sha256":"45bfacc72936ea3fc3053bf24c7451508bdda9b873fbc8f49decc0c6df996f40"},"schema_version":"1.0"},"canonical_sha256":"7ea821e338ebf4b70e938d653841e766a3121d77995fa125700a645a375deea1","source":{"kind":"arxiv","id":"1904.04828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04828","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04828v1","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04828","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"P2UCDYZY5P2L","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P2UCDYZY5P2LODUT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P2UCDYZY","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:P2UCDYZY5P2LODUTRVSTQQPHM2","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T14:08:53Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"eb7aaec7a748f5d9e7d197d785c5c53e7eb6ee661a945c54552fafc3e720ea42","abstract_canon_sha256":"45bfacc72936ea3fc3053bf24c7451508bdda9b873fbc8f49decc0c6df996f40"},"schema_version":"1.0"},"canonical_sha256":"7ea821e338ebf4b70e938d653841e766a3121d77995fa125700a645a375deea1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:57.861840Z","signature_b64":"8KHexHfmiuE+wYVaKHp0xivwsoeEDn0Db2I48/hgYMEH1lI0VrHMBOIbazGRwgotRogyHRbMNvLdtu9twWanDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ea821e338ebf4b70e938d653841e766a3121d77995fa125700a645a375deea1","last_reissued_at":"2026-05-17T23:48:57.861357Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:57.861357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04828","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-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdBJ6pmigCO8P8MLilorZoPWj4IWrt0RvjfompR6flw/2j7Mgl334iebImE80joreOTO70wfyzqtgdEH3e/FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:44.556645Z"},"content_sha256":"5cab9d214502f505737387152918f39c3122ad8a98aa7ce27a8682926e9fe123","schema_version":"1.0","event_id":"sha256:5cab9d214502f505737387152918f39c3122ad8a98aa7ce27a8682926e9fe123"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:P2UCDYZY5P2LODUTRVSTQQPHM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Oblivious Near-Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Kasper Green Larsen, Kevin Yeo, Omri Weinstein, Tal Malkin","submitted_at":"2019-04-09T14:08:53Z","abstract_excerpt":"We prove an $\\Omega(d \\lg n/ (\\lg\\lg n)^2)$ lower bound on the dynamic cell-probe complexity of statistically $\\mathit{oblivious}$ approximate-near-neighbor search ($\\mathsf{ANN}$) over the $d$-dimensional Hamming cube. For the natural setting of $d = \\Theta(\\log n)$, our result implies an $\\tilde{\\Omega}(\\lg^2 n)$ lower bound, which is a quadratic improvement over the highest (non-oblivious) cell-probe lower bound for $\\mathsf{ANN}$. This is the first super-logarithmic $\\mathit{unconditional}$ lower bound for $\\mathsf{ANN}$ against general (non black-box) data structures. We also show that an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04828","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-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMGnBmgHRw9u2V5j65JLL+dlDoUO3liNsBextEvhUDlkaMDI4VOy+XfFbTdJo1dX+G05S0k+xEvXssV5QbN4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:44.556997Z"},"content_sha256":"79b3bd47071badc6ffd936ab7dd85993caef216be15b5ad060595a53142d5823","schema_version":"1.0","event_id":"sha256:79b3bd47071badc6ffd936ab7dd85993caef216be15b5ad060595a53142d5823"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2UCDYZY5P2LODUTRVSTQQPHM2/bundle.json","state_url":"https://pith.science/pith/P2UCDYZY5P2LODUTRVSTQQPHM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2UCDYZY5P2LODUTRVSTQQPHM2/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-30T08:23:44Z","links":{"resolver":"https://pith.science/pith/P2UCDYZY5P2LODUTRVSTQQPHM2","bundle":"https://pith.science/pith/P2UCDYZY5P2LODUTRVSTQQPHM2/bundle.json","state":"https://pith.science/pith/P2UCDYZY5P2LODUTRVSTQQPHM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2UCDYZY5P2LODUTRVSTQQPHM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P2UCDYZY5P2LODUTRVSTQQPHM2","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":"45bfacc72936ea3fc3053bf24c7451508bdda9b873fbc8f49decc0c6df996f40","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T14:08:53Z","title_canon_sha256":"eb7aaec7a748f5d9e7d197d785c5c53e7eb6ee661a945c54552fafc3e720ea42"},"schema_version":"1.0","source":{"id":"1904.04828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04828","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04828v1","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04828","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"P2UCDYZY5P2L","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"P2UCDYZY5P2LODUT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"P2UCDYZY","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:79b3bd47071badc6ffd936ab7dd85993caef216be15b5ad060595a53142d5823","target":"graph","created_at":"2026-05-17T23:48: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 prove an $\\Omega(d \\lg n/ (\\lg\\lg n)^2)$ lower bound on the dynamic cell-probe complexity of statistically $\\mathit{oblivious}$ approximate-near-neighbor search ($\\mathsf{ANN}$) over the $d$-dimensional Hamming cube. For the natural setting of $d = \\Theta(\\log n)$, our result implies an $\\tilde{\\Omega}(\\lg^2 n)$ lower bound, which is a quadratic improvement over the highest (non-oblivious) cell-probe lower bound for $\\mathsf{ANN}$. This is the first super-logarithmic $\\mathit{unconditional}$ lower bound for $\\mathsf{ANN}$ against general (non black-box) data structures. We also show that an","authors_text":"Kasper Green Larsen, Kevin Yeo, Omri Weinstein, Tal Malkin","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T14:08:53Z","title":"Lower Bounds for Oblivious Near-Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04828","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:5cab9d214502f505737387152918f39c3122ad8a98aa7ce27a8682926e9fe123","target":"record","created_at":"2026-05-17T23:48: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":"45bfacc72936ea3fc3053bf24c7451508bdda9b873fbc8f49decc0c6df996f40","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T14:08:53Z","title_canon_sha256":"eb7aaec7a748f5d9e7d197d785c5c53e7eb6ee661a945c54552fafc3e720ea42"},"schema_version":"1.0","source":{"id":"1904.04828","kind":"arxiv","version":1}},"canonical_sha256":"7ea821e338ebf4b70e938d653841e766a3121d77995fa125700a645a375deea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ea821e338ebf4b70e938d653841e766a3121d77995fa125700a645a375deea1","first_computed_at":"2026-05-17T23:48:57.861357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:57.861357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8KHexHfmiuE+wYVaKHp0xivwsoeEDn0Db2I48/hgYMEH1lI0VrHMBOIbazGRwgotRogyHRbMNvLdtu9twWanDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:57.861840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cab9d214502f505737387152918f39c3122ad8a98aa7ce27a8682926e9fe123","sha256:79b3bd47071badc6ffd936ab7dd85993caef216be15b5ad060595a53142d5823"],"state_sha256":"152b9ca990835cf9a660651bd42875960617f76a111f5862b1272e14e118b25e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MSq7546Oot6nOt8kxSepQ23V3ZHbJpaa2+yvQ84VcDE05U5NBPlKTEGNVZtVGS+vsfgoT2SKM33RO89hao0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:23:44.559002Z","bundle_sha256":"f856c9d803d868a9fddef6161354e152550fe80c12a30c944d6b5867bd90a3d2"}}