{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Z53VJMEVFYT3F7LKH27B3RHNBK","short_pith_number":"pith:Z53VJMEV","canonical_record":{"source":{"id":"2605.17559","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-17T17:42:56Z","cross_cats_sorted":["cs.AI","q-bio.QM","stat.ML"],"title_canon_sha256":"6d441a0b5fe096f69419526564a38708ac8c4bd07b72558e6a6f8b82d6c135e3","abstract_canon_sha256":"eb75974cafd05462c929c7eb5ee1a1d1d1b0540325808162129a39f35124d212"},"schema_version":"1.0"},"canonical_sha256":"cf7754b0952e27b2fd6a3ebe1dc4ed0a95b411b34650f3b86d357770efdc1329","source":{"kind":"arxiv","id":"2605.17559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17559","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17559v1","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17559","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"Z53VJMEVFYT3","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"pith_short_16","alias_value":"Z53VJMEVFYT3F7LK","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"pith_short_8","alias_value":"Z53VJMEV","created_at":"2026-05-20T00:04:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Z53VJMEVFYT3F7LKH27B3RHNBK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17559","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-17T17:42:56Z","cross_cats_sorted":["cs.AI","q-bio.QM","stat.ML"],"title_canon_sha256":"6d441a0b5fe096f69419526564a38708ac8c4bd07b72558e6a6f8b82d6c135e3","abstract_canon_sha256":"eb75974cafd05462c929c7eb5ee1a1d1d1b0540325808162129a39f35124d212"},"schema_version":"1.0"},"canonical_sha256":"cf7754b0952e27b2fd6a3ebe1dc4ed0a95b411b34650f3b86d357770efdc1329","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:45.846050Z","signature_b64":"nbm9fsXljgTNfxx60LsXswzepLsZ3RioEwSoCqBNOqvob/13OlPsl/PLW0IoaBBZjq/ErY0SGLqMpuLR/SVZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf7754b0952e27b2fd6a3ebe1dc4ed0a95b411b34650f3b86d357770efdc1329","last_reissued_at":"2026-05-20T00:04:45.845080Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:45.845080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17559","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:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIqX07LCn0iHLyUdLKQXsp7/GAdOC8cnKHxRenvzllwc9nGrZ0F5YjGshmuRF8EuETmDNfGg2aJ8O/9RHpYiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:07:58.616244Z"},"content_sha256":"d4c68d4a0f5130ab5c84c2282a76aa9fc0c5f29bd14dbcd8e3e6b028ed44fc27","schema_version":"1.0","event_id":"sha256:d4c68d4a0f5130ab5c84c2282a76aa9fc0c5f29bd14dbcd8e3e6b028ed44fc27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Z53VJMEVFYT3F7LKH27B3RHNBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Controlling False Discovery in Arbitrarily Structured Hypothesis Spaces via Reproducing Kernels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Optimizing in a reproducing kernel Hilbert space controls false discoveries for structured hypotheses.","cross_cats":["cs.AI","q-bio.QM","stat.ML"],"primary_cat":"stat.ME","authors_text":"Binyamin Perets, Shie Mannor","submitted_at":"2026-05-17T17:42:56Z","abstract_excerpt":"Large-scale hypothesis testing is central to modern science, where controlling the False Discovery Rate (FDR) has become the standard approach to managing false positives across many simultaneous tests. Hypotheses rarely exist in isolation; they often exhibit structure through proximity, connectivity, or hierarchy. This structure represents both a challenge and an opportunity: while classical methods treat these dependencies as obstacles requiring conservative correction, leveraging them can substantially increase discovery power. Here, we reframe structured FDR control as a regularized learni"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By optimizing within a suitable Reproducing Kernel Hilbert Space (RKHS), we introduce a framework that unifies continuous domains, graphs, and hierarchies under a single algorithm through kernel choice alone. Building on this estimator, we provide two decision rules which we prove to control the FDR.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The structure among hypotheses admits a positive-definite kernel representation such that the regularized estimator plus the two decision rules provably control FDR at the target level.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A kernel-based regularized learning framework for FDR control that unifies arbitrary structures and supplies provably valid decision rules with likelihood-based tuning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Optimizing in a reproducing kernel Hilbert space controls false discoveries for structured hypotheses.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9f6f3cb85c4f22dea1ac7834cb6906e22a3046396e17d6e09437355ac016b0bc"},"source":{"id":"2605.17559","kind":"arxiv","version":1},"verdict":{"id":"9765b253-b0e5-422a-9704-ef701379b28a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:32:20.481009Z","strongest_claim":"By optimizing within a suitable Reproducing Kernel Hilbert Space (RKHS), we introduce a framework that unifies continuous domains, graphs, and hierarchies under a single algorithm through kernel choice alone. Building on this estimator, we provide two decision rules which we prove to control the FDR.","one_line_summary":"A kernel-based regularized learning framework for FDR control that unifies arbitrary structures and supplies provably valid decision rules with likelihood-based tuning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The structure among hypotheses admits a positive-definite kernel representation such that the regularized estimator plus the two decision rules provably control FDR at the target level.","pith_extraction_headline":"Optimizing in a reproducing kernel Hilbert space controls false discoveries for structured hypotheses."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17559/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.445799Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:41:13.460699Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.602397Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.535277Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3e7cb4c4d5e64cc335c94df7eda8636d8bde2cc50763bbf26793383d95ae68b5"},"references":{"count":44,"sample":[{"doi":"10.1090/s0002-9947-1950-0051437-7","year":1950,"title":"N. Aronszajn. Theory of reproducing kernels.Transactions of the American Mathematical Society, 68(3):337–404, 1950. ISSN 1088-6850. doi: 10.1090/s0002-9947-1950-0051437-7. URLhttp://dx.doi.org/10.1090","work_id":"3d293de8-03ea-4c27-bfa3-eb4531244dc9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1214/15-aos1337","year":2015,"title":"R. F. Barber and E. J. Candès. Controlling the false discovery rate via knockoffs.The Annals of Statistics, 43(5), Oct. 2015. ISSN 0090-5364. doi: 10.1214/15-aos1337. URL http://dx.doi.org/10.1214/15-","work_id":"24db219e-b8cd-41a1-b65e-bd6d1f6e5143","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"arXiv preprint arXiv:1801.03896 , year=","work_id":"fb334d07-f3a1-4d3b-9de0-75e096003d14","ref_index":3,"cited_arxiv_id":"1801.03896","is_internal_anchor":true},{"doi":"10.1111/j.2517-6161.1995.tb02031.x","year":2018,"title":"Controlling the false discovery rate: A practical and powerful approach to multiple testing","work_id":"57db4313-9a78-4a80-86cb-88c366e5478f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1214/aos/","year":2001,"title":"doi: 10.1214/aos/ 1176342360","work_id":"5bd55533-e64d-4884-b62b-14c429566078","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":44,"snapshot_sha256":"076bfe74127eb18cafaf955c20215cad87dca6a7206f9a75600ec0166308ea3a","internal_anchors":5},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5b4fb3759c4cafeec67399e95c88ceffebe801d029d75e48dce70d2f539e5374"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9765b253-b0e5-422a-9704-ef701379b28a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfFaeSZzdNqbcbchHR/obBpnIdlnC13qJlHXt59v9mn0zfZxNz8RvveE/fokRHTYIMao1iM69VZnyrn8wizZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:07:58.617779Z"},"content_sha256":"0b9a250c861ec8bac78f74a6eb34c2b423199a4c6432a42a2a9969684a959005","schema_version":"1.0","event_id":"sha256:0b9a250c861ec8bac78f74a6eb34c2b423199a4c6432a42a2a9969684a959005"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z53VJMEVFYT3F7LKH27B3RHNBK/bundle.json","state_url":"https://pith.science/pith/Z53VJMEVFYT3F7LKH27B3RHNBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z53VJMEVFYT3F7LKH27B3RHNBK/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-27T05:07:58Z","links":{"resolver":"https://pith.science/pith/Z53VJMEVFYT3F7LKH27B3RHNBK","bundle":"https://pith.science/pith/Z53VJMEVFYT3F7LKH27B3RHNBK/bundle.json","state":"https://pith.science/pith/Z53VJMEVFYT3F7LKH27B3RHNBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z53VJMEVFYT3F7LKH27B3RHNBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z53VJMEVFYT3F7LKH27B3RHNBK","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":"eb75974cafd05462c929c7eb5ee1a1d1d1b0540325808162129a39f35124d212","cross_cats_sorted":["cs.AI","q-bio.QM","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-17T17:42:56Z","title_canon_sha256":"6d441a0b5fe096f69419526564a38708ac8c4bd07b72558e6a6f8b82d6c135e3"},"schema_version":"1.0","source":{"id":"2605.17559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17559","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17559v1","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17559","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"pith_short_12","alias_value":"Z53VJMEVFYT3","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"pith_short_16","alias_value":"Z53VJMEVFYT3F7LK","created_at":"2026-05-20T00:04:45Z"},{"alias_kind":"pith_short_8","alias_value":"Z53VJMEV","created_at":"2026-05-20T00:04:45Z"}],"graph_snapshots":[{"event_id":"sha256:0b9a250c861ec8bac78f74a6eb34c2b423199a4c6432a42a2a9969684a959005","target":"graph","created_at":"2026-05-20T00:04:45Z","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":"By optimizing within a suitable Reproducing Kernel Hilbert Space (RKHS), we introduce a framework that unifies continuous domains, graphs, and hierarchies under a single algorithm through kernel choice alone. Building on this estimator, we provide two decision rules which we prove to control the FDR."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The structure among hypotheses admits a positive-definite kernel representation such that the regularized estimator plus the two decision rules provably control FDR at the target level."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A kernel-based regularized learning framework for FDR control that unifies arbitrary structures and supplies provably valid decision rules with likelihood-based tuning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Optimizing in a reproducing kernel Hilbert space controls false discoveries for structured hypotheses."}],"snapshot_sha256":"9f6f3cb85c4f22dea1ac7834cb6906e22a3046396e17d6e09437355ac016b0bc"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5b4fb3759c4cafeec67399e95c88ceffebe801d029d75e48dce70d2f539e5374"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.445799Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:41:13.460699Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.602397Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.535277Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17559/integrity.json","findings":[],"snapshot_sha256":"3e7cb4c4d5e64cc335c94df7eda8636d8bde2cc50763bbf26793383d95ae68b5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large-scale hypothesis testing is central to modern science, where controlling the False Discovery Rate (FDR) has become the standard approach to managing false positives across many simultaneous tests. Hypotheses rarely exist in isolation; they often exhibit structure through proximity, connectivity, or hierarchy. This structure represents both a challenge and an opportunity: while classical methods treat these dependencies as obstacles requiring conservative correction, leveraging them can substantially increase discovery power. Here, we reframe structured FDR control as a regularized learni","authors_text":"Binyamin Perets, Shie Mannor","cross_cats":["cs.AI","q-bio.QM","stat.ML"],"headline":"Optimizing in a reproducing kernel Hilbert space controls false discoveries for structured hypotheses.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-17T17:42:56Z","title":"Controlling False Discovery in Arbitrarily Structured Hypothesis Spaces via Reproducing Kernels"},"references":{"count":44,"internal_anchors":5,"resolved_work":44,"sample":[{"cited_arxiv_id":"","doi":"10.1090/s0002-9947-1950-0051437-7","is_internal_anchor":false,"ref_index":1,"title":"N. Aronszajn. Theory of reproducing kernels.Transactions of the American Mathematical Society, 68(3):337–404, 1950. ISSN 1088-6850. doi: 10.1090/s0002-9947-1950-0051437-7. URLhttp://dx.doi.org/10.1090","work_id":"3d293de8-03ea-4c27-bfa3-eb4531244dc9","year":1950},{"cited_arxiv_id":"","doi":"10.1214/15-aos1337","is_internal_anchor":false,"ref_index":2,"title":"R. F. Barber and E. J. Candès. Controlling the false discovery rate via knockoffs.The Annals of Statistics, 43(5), Oct. 2015. ISSN 0090-5364. doi: 10.1214/15-aos1337. URL http://dx.doi.org/10.1214/15-","work_id":"24db219e-b8cd-41a1-b65e-bd6d1f6e5143","year":2015},{"cited_arxiv_id":"1801.03896","doi":"","is_internal_anchor":true,"ref_index":3,"title":"arXiv preprint arXiv:1801.03896 , year=","work_id":"fb334d07-f3a1-4d3b-9de0-75e096003d14","year":2019},{"cited_arxiv_id":"","doi":"10.1111/j.2517-6161.1995.tb02031.x","is_internal_anchor":false,"ref_index":4,"title":"Controlling the false discovery rate: A practical and powerful approach to multiple testing","work_id":"57db4313-9a78-4a80-86cb-88c366e5478f","year":2018},{"cited_arxiv_id":"","doi":"10.1214/aos/","is_internal_anchor":false,"ref_index":5,"title":"doi: 10.1214/aos/ 1176342360","work_id":"5bd55533-e64d-4884-b62b-14c429566078","year":2001}],"snapshot_sha256":"076bfe74127eb18cafaf955c20215cad87dca6a7206f9a75600ec0166308ea3a"},"source":{"id":"2605.17559","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:32:20.481009Z","id":"9765b253-b0e5-422a-9704-ef701379b28a","model_set":{"reader":"grok-4.3"},"one_line_summary":"A kernel-based regularized learning framework for FDR control that unifies arbitrary structures and supplies provably valid decision rules with likelihood-based tuning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Optimizing in a reproducing kernel Hilbert space controls false discoveries for structured hypotheses.","strongest_claim":"By optimizing within a suitable Reproducing Kernel Hilbert Space (RKHS), we introduce a framework that unifies continuous domains, graphs, and hierarchies under a single algorithm through kernel choice alone. Building on this estimator, we provide two decision rules which we prove to control the FDR.","weakest_assumption":"The structure among hypotheses admits a positive-definite kernel representation such that the regularized estimator plus the two decision rules provably control FDR at the target level."}},"verdict_id":"9765b253-b0e5-422a-9704-ef701379b28a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d4c68d4a0f5130ab5c84c2282a76aa9fc0c5f29bd14dbcd8e3e6b028ed44fc27","target":"record","created_at":"2026-05-20T00:04:45Z","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":"eb75974cafd05462c929c7eb5ee1a1d1d1b0540325808162129a39f35124d212","cross_cats_sorted":["cs.AI","q-bio.QM","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-17T17:42:56Z","title_canon_sha256":"6d441a0b5fe096f69419526564a38708ac8c4bd07b72558e6a6f8b82d6c135e3"},"schema_version":"1.0","source":{"id":"2605.17559","kind":"arxiv","version":1}},"canonical_sha256":"cf7754b0952e27b2fd6a3ebe1dc4ed0a95b411b34650f3b86d357770efdc1329","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf7754b0952e27b2fd6a3ebe1dc4ed0a95b411b34650f3b86d357770efdc1329","first_computed_at":"2026-05-20T00:04:45.845080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:45.845080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nbm9fsXljgTNfxx60LsXswzepLsZ3RioEwSoCqBNOqvob/13OlPsl/PLW0IoaBBZjq/ErY0SGLqMpuLR/SVZAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:45.846050Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4c68d4a0f5130ab5c84c2282a76aa9fc0c5f29bd14dbcd8e3e6b028ed44fc27","sha256:0b9a250c861ec8bac78f74a6eb34c2b423199a4c6432a42a2a9969684a959005"],"state_sha256":"5075e84527f7eebdd3febb9d1873ab06315997948556cca159685fe3895408ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Al71GLrpsABC7mgOoiyxJMeKK06KHjTsXQ+rrtqJq8TwGHH12qxG5pcGhAFcYUKn5vA/kI1USsPfEQpO3QhfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:07:58.624718Z","bundle_sha256":"7806d94b1036f209548be6c882ef4ceeba6b251bb29dff94376925b92a079ef7"}}