{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2WLNQN6M3YCKMWPX6NW3FWVZCB","short_pith_number":"pith:2WLNQN6M","canonical_record":{"source":{"id":"2605.16618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T20:40:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e1f72fc82eef0c717c5c46e694115199da275155839433e03c6a63024ce85f45","abstract_canon_sha256":"18d0df79beb5fa66f12fb968f388996af0a10e75228ba7c19f77c5320e2ef25b"},"schema_version":"1.0"},"canonical_sha256":"d596d837ccde04a659f7f36db2dab9104b4b79d3e7de730aa5aac1e3872d284d","source":{"kind":"arxiv","id":"2605.16618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16618","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16618v1","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16618","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"2WLNQN6M3YCK","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_16","alias_value":"2WLNQN6M3YCKMWPX","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_8","alias_value":"2WLNQN6M","created_at":"2026-05-20T00:02:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2WLNQN6M3YCKMWPX6NW3FWVZCB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T20:40:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e1f72fc82eef0c717c5c46e694115199da275155839433e03c6a63024ce85f45","abstract_canon_sha256":"18d0df79beb5fa66f12fb968f388996af0a10e75228ba7c19f77c5320e2ef25b"},"schema_version":"1.0"},"canonical_sha256":"d596d837ccde04a659f7f36db2dab9104b4b79d3e7de730aa5aac1e3872d284d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:32.826491Z","signature_b64":"oFCfSU4FzCl2C7pVVAcXoSBd29Yye3eztF1dy30fKGAywlzXt4iDnlgdfMcgUScfHSk3aW8Bn3vz5sdZIUDtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d596d837ccde04a659f7f36db2dab9104b4b79d3e7de730aa5aac1e3872d284d","last_reissued_at":"2026-05-20T00:02:32.825767Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:32.825767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16618","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-20T00:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qq5sFLWZWIMfI5RDYNTQxEJKMOWHXxmIDG+zuiLTun9rzS0DbFg2qfR3E9MofqGj14+ewWQflpcPcocEMWO2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:27:23.108324Z"},"content_sha256":"30cc951cf4b8bb9a2522f9e141a5b37cb35b1189cc8bcdb036d98b12260212a1","schema_version":"1.0","event_id":"sha256:30cc951cf4b8bb9a2522f9e141a5b37cb35b1189cc8bcdb036d98b12260212a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2WLNQN6M3YCKMWPX6NW3FWVZCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarially Robust Approximate Furthest Neighbor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A data structure answers c-approximate furthest neighbor queries correctly against adaptive adversaries at query time Õ(min(d n^{1/c²}, n^{2/c²} + d)).","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Jeff Giliberti, Kiarash Banihashem, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Prashant Gokhale, Samira Goudarzi, Sandeep Silwal, Yuhao Liu","submitted_at":"2026-05-15T20:40:24Z","abstract_excerpt":"We work in the adaptive query model, where one is given a point set $P \\subset \\mathbb{R}^d$ and seeks to construct a data structure that can answer correctly and efficiently a sequence of adaptive queries. In this model, an adversary observes the answers returned by the data structure to previous queries $q_1, \\ldots, q_{i-1}$ and, based on this information, chooses the next query point $q_i$. This setting captures strong forms of adaptivity that naturally arise in modern machine learning pipelines, and rules out many classical randomized techniques that assume oblivious queries. Our focus is"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present the first adversarially robust data structure for c-approximate furthest neighbor queries that achieves query time Õ(min(d n^{1/c²}, n^{2/c²} + d)).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The construction assumes a fixed point set P known in advance that can be preprocessed, and that the underlying distance computations and data-structure primitives (such as those from Indyk 2003) can be invoked in the stated time bounds under the adaptive adversary model.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"First adversarially robust data structure for c-approximate furthest neighbor search with query time matching the best known oblivious results for many parameter regimes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A data structure answers c-approximate furthest neighbor queries correctly against adaptive adversaries at query time Õ(min(d n^{1/c²}, n^{2/c²} + d)).","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e8dc71dd876c5cb2013395e8b17d907eef13266ab8be62e95c22e16bf6811b53"},"source":{"id":"2605.16618","kind":"arxiv","version":1},"verdict":{"id":"ae9163bf-ac74-48f4-8377-64dc702eb37d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:12:06.987058Z","strongest_claim":"We present the first adversarially robust data structure for c-approximate furthest neighbor queries that achieves query time Õ(min(d n^{1/c²}, n^{2/c²} + d)).","one_line_summary":"First adversarially robust data structure for c-approximate furthest neighbor search with query time matching the best known oblivious results for many parameter regimes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The construction assumes a fixed point set P known in advance that can be preprocessed, and that the underlying distance computations and data-structure primitives (such as those from Indyk 2003) can be invoked in the stated time bounds under the adaptive adversary model.","pith_extraction_headline":"A data structure answers c-approximate furthest neighbor queries correctly against adaptive adversaries at query time Õ(min(d n^{1/c²}, n^{2/c²} + d))."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16618/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.418839Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:21:28.522078Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.775625Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.589515Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0068d257f9d170432d9697692c081d356be8235ccacf184c633c4ffba905ab31"},"references":{"count":73,"sample":[{"doi":"","year":2017,"title":"Ahle, T. D. Optimal las vegas locality sensitive data structures. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp.\\ 938--949. IEEE, 2017","work_id":"345dd021-67af-4053-b42d-6097cde9a993","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3517804.3526228","year":2022,"title":"P., and Zhou, S","work_id":"801d365b-5a1e-4a1b-88d1-21a70d09385c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Adversarial laws of large numbers and optimal regret in online classification","work_id":"ee084163-bc91-49be-a303-f738994ace9e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1992,"title":"Altman, N. S. An introduction to kernel and nearest-neighbor nonparametric regression. The American Statistician, 46 0 (3): 0 175--185, 1992","work_id":"540c1697-0464-4795-84bc-7fc1a3c157b7","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"C., Shiragur, K., and Xu, H","work_id":"7fe25e36-5acf-47eb-bc78-fde983d36a4e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":73,"snapshot_sha256":"00ff7408c502f2ee1ce4247c81f15bbf87e1ee1d1823b19afcd4e1af119f6997","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9f1372e5f7c6de658dbe859a311c8abf0219032ec58e374f5db44eeaed7a6d83"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"ae9163bf-ac74-48f4-8377-64dc702eb37d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:02:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEqwsv+CwyBnGtU9nnCBCzfoAmC6cRUIWOT8ZepEUIZaUDDwJ6sxY49YGj8sQW7lkwqAmF+URnKU5Qu/aqLjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:27:23.109012Z"},"content_sha256":"77b8a32c82f7fc4708a5ee8218d79489743fef25cf7a78d39ca14db75eb43e45","schema_version":"1.0","event_id":"sha256:77b8a32c82f7fc4708a5ee8218d79489743fef25cf7a78d39ca14db75eb43e45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WLNQN6M3YCKMWPX6NW3FWVZCB/bundle.json","state_url":"https://pith.science/pith/2WLNQN6M3YCKMWPX6NW3FWVZCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WLNQN6M3YCKMWPX6NW3FWVZCB/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-30T09:27:23Z","links":{"resolver":"https://pith.science/pith/2WLNQN6M3YCKMWPX6NW3FWVZCB","bundle":"https://pith.science/pith/2WLNQN6M3YCKMWPX6NW3FWVZCB/bundle.json","state":"https://pith.science/pith/2WLNQN6M3YCKMWPX6NW3FWVZCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WLNQN6M3YCKMWPX6NW3FWVZCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2WLNQN6M3YCKMWPX6NW3FWVZCB","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":"18d0df79beb5fa66f12fb968f388996af0a10e75228ba7c19f77c5320e2ef25b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T20:40:24Z","title_canon_sha256":"e1f72fc82eef0c717c5c46e694115199da275155839433e03c6a63024ce85f45"},"schema_version":"1.0","source":{"id":"2605.16618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16618","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16618v1","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16618","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"2WLNQN6M3YCK","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_16","alias_value":"2WLNQN6M3YCKMWPX","created_at":"2026-05-20T00:02:32Z"},{"alias_kind":"pith_short_8","alias_value":"2WLNQN6M","created_at":"2026-05-20T00:02:32Z"}],"graph_snapshots":[{"event_id":"sha256:77b8a32c82f7fc4708a5ee8218d79489743fef25cf7a78d39ca14db75eb43e45","target":"graph","created_at":"2026-05-20T00:02:32Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We present the first adversarially robust data structure for c-approximate furthest neighbor queries that achieves query time Õ(min(d n^{1/c²}, n^{2/c²} + d))."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The construction assumes a fixed point set P known in advance that can be preprocessed, and that the underlying distance computations and data-structure primitives (such as those from Indyk 2003) can be invoked in the stated time bounds under the adaptive adversary model."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"First adversarially robust data structure for c-approximate furthest neighbor search with query time matching the best known oblivious results for many parameter regimes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A data structure answers c-approximate furthest neighbor queries correctly against adaptive adversaries at query time Õ(min(d n^{1/c²}, n^{2/c²} + d))."}],"snapshot_sha256":"e8dc71dd876c5cb2013395e8b17d907eef13266ab8be62e95c22e16bf6811b53"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9f1372e5f7c6de658dbe859a311c8abf0219032ec58e374f5db44eeaed7a6d83"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.418839Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:21:28.522078Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.775625Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.589515Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16618/integrity.json","findings":[],"snapshot_sha256":"0068d257f9d170432d9697692c081d356be8235ccacf184c633c4ffba905ab31","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We work in the adaptive query model, where one is given a point set $P \\subset \\mathbb{R}^d$ and seeks to construct a data structure that can answer correctly and efficiently a sequence of adaptive queries. In this model, an adversary observes the answers returned by the data structure to previous queries $q_1, \\ldots, q_{i-1}$ and, based on this information, chooses the next query point $q_i$. This setting captures strong forms of adaptivity that naturally arise in modern machine learning pipelines, and rules out many classical randomized techniques that assume oblivious queries. Our focus is","authors_text":"Jeff Giliberti, Kiarash Banihashem, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Prashant Gokhale, Samira Goudarzi, Sandeep Silwal, Yuhao Liu","cross_cats":["cs.CG"],"headline":"A data structure answers c-approximate furthest neighbor queries correctly against adaptive adversaries at query time Õ(min(d n^{1/c²}, n^{2/c²} + d)).","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T20:40:24Z","title":"Adversarially Robust Approximate Furthest Neighbor"},"references":{"count":73,"internal_anchors":2,"resolved_work":73,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Ahle, T. D. Optimal las vegas locality sensitive data structures. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp.\\ 938--949. IEEE, 2017","work_id":"345dd021-67af-4053-b42d-6097cde9a993","year":2017},{"cited_arxiv_id":"","doi":"10.1145/3517804.3526228","is_internal_anchor":false,"ref_index":2,"title":"P., and Zhou, S","work_id":"801d365b-5a1e-4a1b-88d1-21a70d09385c","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Adversarial laws of large numbers and optimal regret in online classification","work_id":"ee084163-bc91-49be-a303-f738994ace9e","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Altman, N. S. An introduction to kernel and nearest-neighbor nonparametric regression. The American Statistician, 46 0 (3): 0 175--185, 1992","work_id":"540c1697-0464-4795-84bc-7fc1a3c157b7","year":1992},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"C., Shiragur, K., and Xu, H","work_id":"7fe25e36-5acf-47eb-bc78-fde983d36a4e","year":2025}],"snapshot_sha256":"00ff7408c502f2ee1ce4247c81f15bbf87e1ee1d1823b19afcd4e1af119f6997"},"source":{"id":"2605.16618","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:12:06.987058Z","id":"ae9163bf-ac74-48f4-8377-64dc702eb37d","model_set":{"reader":"grok-4.3"},"one_line_summary":"First adversarially robust data structure for c-approximate furthest neighbor search with query time matching the best known oblivious results for many parameter regimes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A data structure answers c-approximate furthest neighbor queries correctly against adaptive adversaries at query time Õ(min(d n^{1/c²}, n^{2/c²} + d)).","strongest_claim":"We present the first adversarially robust data structure for c-approximate furthest neighbor queries that achieves query time Õ(min(d n^{1/c²}, n^{2/c²} + d)).","weakest_assumption":"The construction assumes a fixed point set P known in advance that can be preprocessed, and that the underlying distance computations and data-structure primitives (such as those from Indyk 2003) can be invoked in the stated time bounds under the adaptive adversary model."}},"verdict_id":"ae9163bf-ac74-48f4-8377-64dc702eb37d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:30cc951cf4b8bb9a2522f9e141a5b37cb35b1189cc8bcdb036d98b12260212a1","target":"record","created_at":"2026-05-20T00:02:32Z","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":"18d0df79beb5fa66f12fb968f388996af0a10e75228ba7c19f77c5320e2ef25b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T20:40:24Z","title_canon_sha256":"e1f72fc82eef0c717c5c46e694115199da275155839433e03c6a63024ce85f45"},"schema_version":"1.0","source":{"id":"2605.16618","kind":"arxiv","version":1}},"canonical_sha256":"d596d837ccde04a659f7f36db2dab9104b4b79d3e7de730aa5aac1e3872d284d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d596d837ccde04a659f7f36db2dab9104b4b79d3e7de730aa5aac1e3872d284d","first_computed_at":"2026-05-20T00:02:32.825767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:32.825767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oFCfSU4FzCl2C7pVVAcXoSBd29Yye3eztF1dy30fKGAywlzXt4iDnlgdfMcgUScfHSk3aW8Bn3vz5sdZIUDtAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:32.826491Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30cc951cf4b8bb9a2522f9e141a5b37cb35b1189cc8bcdb036d98b12260212a1","sha256:77b8a32c82f7fc4708a5ee8218d79489743fef25cf7a78d39ca14db75eb43e45"],"state_sha256":"c8208100150d7876bf0dc5f706c68b12b1484b1ec1835eea4023d94874a3922c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tiVHKMdfPMfdtASwqyglBTRGLxw9cexFP1GrMyR4vJUZT2Io1X6ek85YL+piasocd28P+HArkbYE3hGs3mGrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:27:23.112463Z","bundle_sha256":"82d55282b5c7845bc8d36cab6a2531507c37f9f1a1286e989e670cda3b5f00f6"}}