{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:I52ZNCZOGFEQI7WNCXI2P5U7ZQ","short_pith_number":"pith:I52ZNCZO","canonical_record":{"source":{"id":"2605.17251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T04:18:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"61f218bdad53f902706b2338dd0c1fa0174e4088940ac69970d43be2c45274f5","abstract_canon_sha256":"a700f1d200a78ebc018c4381237c313ba39fd98429623dc03b92899554c02a6f"},"schema_version":"1.0"},"canonical_sha256":"4775968b2e3149047ecd15d1a7f69fcc00d4970c82632647ee53ab3b779a52f7","source":{"kind":"arxiv","id":"2605.17251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17251","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17251v1","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17251","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"I52ZNCZOGFEQ","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"I52ZNCZOGFEQI7WN","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"I52ZNCZO","created_at":"2026-05-20T00:03:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:I52ZNCZOGFEQI7WNCXI2P5U7ZQ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T04:18:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"61f218bdad53f902706b2338dd0c1fa0174e4088940ac69970d43be2c45274f5","abstract_canon_sha256":"a700f1d200a78ebc018c4381237c313ba39fd98429623dc03b92899554c02a6f"},"schema_version":"1.0"},"canonical_sha256":"4775968b2e3149047ecd15d1a7f69fcc00d4970c82632647ee53ab3b779a52f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:47.669619Z","signature_b64":"GM3IZVw1sXK2yESmg2AQRY4Bo84NsUCMezlFQ4oaLzMLkNU0dxiolWEaj7nKVGxTFNgClCrRIpHQhqUfLxt5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4775968b2e3149047ecd15d1a7f69fcc00d4970c82632647ee53ab3b779a52f7","last_reissued_at":"2026-05-20T00:03:47.668770Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:47.668770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17251","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:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0r8XQSXU5Pn5HHyIuozaXF06+7kSK6eV4kBQlc3W8KzLacjwwIrmXPEUxtTp7lo+SHSPd7teUx2wpPjUdsdrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:54:57.876298Z"},"content_sha256":"62e10739e114b4667ef0ff17ae4caee667d9cd0e8c3b8fb7616cf5b5087223cd","schema_version":"1.0","event_id":"sha256:62e10739e114b4667ef0ff17ae4caee667d9cd0e8c3b8fb7616cf5b5087223cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:I52ZNCZOGFEQI7WNCXI2P5U7ZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Chow Filtering for Learning with Distribution Shift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"L1 sandwiching suffices for efficient PQ learning of DNFs under distribution shift","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Adam R. Klivans, Arsen Vasilyan, Gautam Chandrasekaran, Georgios Gkrinias, Konstantinos Stavropoulos","submitted_at":"2026-05-17T04:18:17Z","abstract_excerpt":"Recent work due to Goel et al. gave the first efficient algorithms for learning with distribution shift in the challenging PQ framework. In this setting, a learner receives labeled training examples, unlabeled test examples, and must make correct predictions on the test set but is allowed to abstain from predicting on out-of-distribution points. Their results rely on ${\\cal L}_2$ sandwiching approximations, a strong requirement that leads to poor bounds for several basic function classes such as DNF formulas.\n  Here, we show that the weaker notion of ${\\cal L}_1$ sandwiching suffices for effic"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we show that the weaker notion of L1 sandwiching suffices for efficient PQ learning. As a consequence, we obtain the first quasipolynomial-time PQ learning algorithm for DNFs under the uniform distribution and essentially match the guarantees known for ordinary PAC learning.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The procedure relies on low-degree Chow parameters being able to reliably identify and remove test points incompatible with the training distribution without harming the learning guarantees for the target class (stated in the abstract as the main technical ingredient).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"L1 sandwiching suffices for efficient PQ learning via Iterative Chow Filtering, giving quasipolynomial-time algorithms for DNFs under uniform distribution and exponential improvements for circuits and PTFs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"L1 sandwiching suffices for efficient PQ learning of DNFs under distribution shift","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2ac6483bc0e8071b358715e8e4a90c73c20c9673c8c1e4d050d427c5992e15e9"},"source":{"id":"2605.17251","kind":"arxiv","version":1},"verdict":{"id":"e0949d2a-9ebf-4e43-9b07-adc3e00af60f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:15:55.177753Z","strongest_claim":"we show that the weaker notion of L1 sandwiching suffices for efficient PQ learning. As a consequence, we obtain the first quasipolynomial-time PQ learning algorithm for DNFs under the uniform distribution and essentially match the guarantees known for ordinary PAC learning.","one_line_summary":"L1 sandwiching suffices for efficient PQ learning via Iterative Chow Filtering, giving quasipolynomial-time algorithms for DNFs under uniform distribution and exponential improvements for circuits and PTFs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The procedure relies on low-degree Chow parameters being able to reliably identify and remove test points incompatible with the training distribution without harming the learning guarantees for the target class (stated in the abstract as the main technical ingredient).","pith_extraction_headline":"L1 sandwiching suffices for efficient PQ learning of DNFs under distribution shift"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17251/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.302712Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:31:06.260739Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.865378Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.789985Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d507bc3eb2c592613021e8ee75966159f07f50f99be73837a21baa6332f0d51e"},"references":{"count":12,"sample":[{"doi":"","year":2009,"title":"[VW09] Aad Vaart and Jon Wellner","work_id":"cda2b327-51bd-40a2-b614-0b283be89b80","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Then, with probability at least 1−δoverSandS′, we have that for anyi∈[k], it holds E x∼D′ [fi(x)pi(x)s(x)]≤(R+ϵ)(1 +ϵ)E x∼D [fi(x)|pi(x)|] + 2ϵ","work_id":"d4ae3cea-898d-443b-94c8-55763624f63f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proof.Let s,B,∆,t,S 0,...,St,µ⋆ 1,...,µ⋆ t+1,f ⋆ 1,...,f ⋆ t+1,p⋆ 1,...,p⋆ t+1,τ⋆ 1,...,τ⋆ t,P(f 1),...,P(fk) be defined as in the description of Algorithm 2","work_id":"f48109b7-9001-4c68-b5b4-4f88bcbf6645","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"examples fromD train","work_id":"995692a0-dfdd-41f6-ac5d-aebdccc3260e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"examples from D andD′ respectively","work_id":"17b81828-2011-4d50-9e02-36ed1a81ef0d","ref_index":6,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"8d16db55097e93a2fa2190f4f90295f3094a2689cca0bef54650f2e3ff5c459a","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"62b363951c4ba8ebaedd9839e2b8931495b2d92786e18af70a9345696be13ff1"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"e0949d2a-9ebf-4e43-9b07-adc3e00af60f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yC5J9iEsrTRdZgqsV5pkb76DQRtmEMemwiXzjBAKUltN/ryd5si5y587bwP+zD+S6PIFUWt/AmKE83HKmjwlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:54:57.877625Z"},"content_sha256":"e0fa61ca283bddb1244919764684f63f92e773a066e4d0a7413e35275cdb3c9b","schema_version":"1.0","event_id":"sha256:e0fa61ca283bddb1244919764684f63f92e773a066e4d0a7413e35275cdb3c9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I52ZNCZOGFEQI7WNCXI2P5U7ZQ/bundle.json","state_url":"https://pith.science/pith/I52ZNCZOGFEQI7WNCXI2P5U7ZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I52ZNCZOGFEQI7WNCXI2P5U7ZQ/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-29T21:54:57Z","links":{"resolver":"https://pith.science/pith/I52ZNCZOGFEQI7WNCXI2P5U7ZQ","bundle":"https://pith.science/pith/I52ZNCZOGFEQI7WNCXI2P5U7ZQ/bundle.json","state":"https://pith.science/pith/I52ZNCZOGFEQI7WNCXI2P5U7ZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I52ZNCZOGFEQI7WNCXI2P5U7ZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:I52ZNCZOGFEQI7WNCXI2P5U7ZQ","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":"a700f1d200a78ebc018c4381237c313ba39fd98429623dc03b92899554c02a6f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T04:18:17Z","title_canon_sha256":"61f218bdad53f902706b2338dd0c1fa0174e4088940ac69970d43be2c45274f5"},"schema_version":"1.0","source":{"id":"2605.17251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17251","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17251v1","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17251","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"I52ZNCZOGFEQ","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"I52ZNCZOGFEQI7WN","created_at":"2026-05-20T00:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"I52ZNCZO","created_at":"2026-05-20T00:03:47Z"}],"graph_snapshots":[{"event_id":"sha256:e0fa61ca283bddb1244919764684f63f92e773a066e4d0a7413e35275cdb3c9b","target":"graph","created_at":"2026-05-20T00:03:47Z","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 show that the weaker notion of L1 sandwiching suffices for efficient PQ learning. As a consequence, we obtain the first quasipolynomial-time PQ learning algorithm for DNFs under the uniform distribution and essentially match the guarantees known for ordinary PAC learning."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The procedure relies on low-degree Chow parameters being able to reliably identify and remove test points incompatible with the training distribution without harming the learning guarantees for the target class (stated in the abstract as the main technical ingredient)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"L1 sandwiching suffices for efficient PQ learning via Iterative Chow Filtering, giving quasipolynomial-time algorithms for DNFs under uniform distribution and exponential improvements for circuits and PTFs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"L1 sandwiching suffices for efficient PQ learning of DNFs under distribution shift"}],"snapshot_sha256":"2ac6483bc0e8071b358715e8e4a90c73c20c9673c8c1e4d050d427c5992e15e9"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"62b363951c4ba8ebaedd9839e2b8931495b2d92786e18af70a9345696be13ff1"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.302712Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:31:06.260739Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.865378Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.789985Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17251/integrity.json","findings":[],"snapshot_sha256":"d507bc3eb2c592613021e8ee75966159f07f50f99be73837a21baa6332f0d51e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent work due to Goel et al. gave the first efficient algorithms for learning with distribution shift in the challenging PQ framework. In this setting, a learner receives labeled training examples, unlabeled test examples, and must make correct predictions on the test set but is allowed to abstain from predicting on out-of-distribution points. Their results rely on ${\\cal L}_2$ sandwiching approximations, a strong requirement that leads to poor bounds for several basic function classes such as DNF formulas.\n  Here, we show that the weaker notion of ${\\cal L}_1$ sandwiching suffices for effic","authors_text":"Adam R. Klivans, Arsen Vasilyan, Gautam Chandrasekaran, Georgios Gkrinias, Konstantinos Stavropoulos","cross_cats":["cs.LG"],"headline":"L1 sandwiching suffices for efficient PQ learning of DNFs under distribution shift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T04:18:17Z","title":"Iterative Chow Filtering for Learning with Distribution Shift"},"references":{"count":12,"internal_anchors":0,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"[VW09] Aad Vaart and Jon Wellner","work_id":"cda2b327-51bd-40a2-b614-0b283be89b80","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Then, with probability at least 1−δoverSandS′, we have that for anyi∈[k], it holds E x∼D′ [fi(x)pi(x)s(x)]≤(R+ϵ)(1 +ϵ)E x∼D [fi(x)|pi(x)|] + 2ϵ","work_id":"d4ae3cea-898d-443b-94c8-55763624f63f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Proof.Let s,B,∆,t,S 0,...,St,µ⋆ 1,...,µ⋆ t+1,f ⋆ 1,...,f ⋆ t+1,p⋆ 1,...,p⋆ t+1,τ⋆ 1,...,τ⋆ t,P(f 1),...,P(fk) be defined as in the description of Algorithm 2","work_id":"f48109b7-9001-4c68-b5b4-4f88bcbf6645","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"examples fromD train","work_id":"995692a0-dfdd-41f6-ac5d-aebdccc3260e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":6,"title":"examples from D andD′ respectively","work_id":"17b81828-2011-4d50-9e02-36ed1a81ef0d","year":null}],"snapshot_sha256":"8d16db55097e93a2fa2190f4f90295f3094a2689cca0bef54650f2e3ff5c459a"},"source":{"id":"2605.17251","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:15:55.177753Z","id":"e0949d2a-9ebf-4e43-9b07-adc3e00af60f","model_set":{"reader":"grok-4.3"},"one_line_summary":"L1 sandwiching suffices for efficient PQ learning via Iterative Chow Filtering, giving quasipolynomial-time algorithms for DNFs under uniform distribution and exponential improvements for circuits and PTFs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"L1 sandwiching suffices for efficient PQ learning of DNFs under distribution shift","strongest_claim":"we show that the weaker notion of L1 sandwiching suffices for efficient PQ learning. As a consequence, we obtain the first quasipolynomial-time PQ learning algorithm for DNFs under the uniform distribution and essentially match the guarantees known for ordinary PAC learning.","weakest_assumption":"The procedure relies on low-degree Chow parameters being able to reliably identify and remove test points incompatible with the training distribution without harming the learning guarantees for the target class (stated in the abstract as the main technical ingredient)."}},"verdict_id":"e0949d2a-9ebf-4e43-9b07-adc3e00af60f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:62e10739e114b4667ef0ff17ae4caee667d9cd0e8c3b8fb7616cf5b5087223cd","target":"record","created_at":"2026-05-20T00:03:47Z","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":"a700f1d200a78ebc018c4381237c313ba39fd98429623dc03b92899554c02a6f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T04:18:17Z","title_canon_sha256":"61f218bdad53f902706b2338dd0c1fa0174e4088940ac69970d43be2c45274f5"},"schema_version":"1.0","source":{"id":"2605.17251","kind":"arxiv","version":1}},"canonical_sha256":"4775968b2e3149047ecd15d1a7f69fcc00d4970c82632647ee53ab3b779a52f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4775968b2e3149047ecd15d1a7f69fcc00d4970c82632647ee53ab3b779a52f7","first_computed_at":"2026-05-20T00:03:47.668770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:47.668770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GM3IZVw1sXK2yESmg2AQRY4Bo84NsUCMezlFQ4oaLzMLkNU0dxiolWEaj7nKVGxTFNgClCrRIpHQhqUfLxt5CQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:47.669619Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62e10739e114b4667ef0ff17ae4caee667d9cd0e8c3b8fb7616cf5b5087223cd","sha256:e0fa61ca283bddb1244919764684f63f92e773a066e4d0a7413e35275cdb3c9b"],"state_sha256":"ec299b617b75d2d25ddd9ada4b0a7ed3d685e5633c2c1ffaf5a3e5e6fe9e96f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BuMFDuYeJaqxIX20zuZyG6+kvSzWw3Dg5nyPigBFumn2C/t3Eatoct43aa0un3vVGwS9lGX5PYEY17JmL1uUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:54:57.883011Z","bundle_sha256":"2f7e26cbb886c42c93c1e083cd7d342a83bdde2275f74bce2298956c5b9b1bb5"}}