{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TTAUM3WLXBDUYA7ELKCB4N7IRE","short_pith_number":"pith:TTAUM3WL","canonical_record":{"source":{"id":"2605.16846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-16T07:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"492e9e28a5be61402ecb0867af382cba9e44ab32a97c9c1848ffc48338819d9a","abstract_canon_sha256":"34cd783b80d9e5f9a8ca54e8e2dca1e4047db73b0d2e76a8f4c70bba499e6f03"},"schema_version":"1.0"},"canonical_sha256":"9cc1466ecbb8474c03e45a841e37e88922a5a3020a881641ca1497d3f11d1589","source":{"kind":"arxiv","id":"2605.16846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16846","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16846v1","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16846","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"TTAUM3WLXBDU","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_16","alias_value":"TTAUM3WLXBDUYA7E","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_8","alias_value":"TTAUM3WL","created_at":"2026-05-20T00:03:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TTAUM3WLXBDUYA7ELKCB4N7IRE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16846","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-16T07:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"492e9e28a5be61402ecb0867af382cba9e44ab32a97c9c1848ffc48338819d9a","abstract_canon_sha256":"34cd783b80d9e5f9a8ca54e8e2dca1e4047db73b0d2e76a8f4c70bba499e6f03"},"schema_version":"1.0"},"canonical_sha256":"9cc1466ecbb8474c03e45a841e37e88922a5a3020a881641ca1497d3f11d1589","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:25.897349Z","signature_b64":"C4Yqbo8nEmfIRehHqf4NNJG0veIvhlOVJEAtvf5h7/O6FZuXdNcXJdBFeJZdzzVtVYBo/gpSMPHIdPVXB2NNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc1466ecbb8474c03e45a841e37e88922a5a3020a881641ca1497d3f11d1589","last_reissued_at":"2026-05-20T00:03:25.896543Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:25.896543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16846","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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mtBght4ip75KxNJQIfZVtXGBgUqbBbQsCvvuPo8yMS0G7DXBf8aUhE7dHtcs9cd8c0WPWsMWqJKQT+3knccBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:58:36.665750Z"},"content_sha256":"a874ff9bde69678861e1abd400d9733f0f3caf019719af42c22b47f139d28710","schema_version":"1.0","event_id":"sha256:a874ff9bde69678861e1abd400d9733f0f3caf019719af42c22b47f139d28710"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TTAUM3WLXBDUYA7ELKCB4N7IRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Maximization Method with Fractional Polynomial Basis: A Frequentist Bridge to Bayesian Fractional Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"PMM-FP extends polynomial maximization to fractional bases and delivers a closed-form variance-reduction factor of 1 minus gamma_3 squared over 2 plus gamma_4 relative to ordinary least squares for asymmetric non-Gaussian errors.","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Serhii Zabolotnii","submitted_at":"2026-05-16T07:07:26Z","abstract_excerpt":"Fractional polynomials are widely used for dose-response modelling, and recent Bayesian fractional polynomial work has renewed interest in this finite model class. We propose PMM-FP, a frequentist extension of Kunchenko's polynomial maximization method to fractional-polynomial bases, developed in two parallel tracks for positive and full FP power sets under appropriate moment conditions. The main result is the closed-form variance-reduction coefficient g_2=1-gamma_3^2/(2+gamma_4) relative to OLS-FP for asymmetric non-Gaussian errors, formalised in Lean 4 and validated by Monte Carlo. On GBSG r"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The main result is the closed-form variance-reduction coefficient g_2=1-gamma_3^2/(2+gamma_4) relative to OLS-FP for asymmetric non-Gaussian errors, formalised in Lean 4 and validated by Monte Carlo.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The extension to fractional-polynomial bases is developed under appropriate moment conditions for the positive and full FP power sets.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PMM-FP extends polynomial maximization to fractional polynomial bases and derives a closed-form variance-reduction coefficient g2 for asymmetric non-Gaussian errors, formalized in Lean 4 and checked via Monte Carlo.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"PMM-FP extends polynomial maximization to fractional bases and delivers a closed-form variance-reduction factor of 1 minus gamma_3 squared over 2 plus gamma_4 relative to ordinary least squares for asymmetric non-Gaussian errors.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8b7ef932c7c4f35b431aa039681db529b5108c66ac5c831e52101d662365df72"},"source":{"id":"2605.16846","kind":"arxiv","version":1},"verdict":{"id":"8a30210d-c340-4f65-8036-58ae9d16c866","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:26:28.378123Z","strongest_claim":"The main result is the closed-form variance-reduction coefficient g_2=1-gamma_3^2/(2+gamma_4) relative to OLS-FP for asymmetric non-Gaussian errors, formalised in Lean 4 and validated by Monte Carlo.","one_line_summary":"PMM-FP extends polynomial maximization to fractional polynomial bases and derives a closed-form variance-reduction coefficient g2 for asymmetric non-Gaussian errors, formalized in Lean 4 and checked via Monte Carlo.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The extension to fractional-polynomial bases is developed under appropriate moment conditions for the positive and full FP power sets.","pith_extraction_headline":"PMM-FP extends polynomial maximization to fractional bases and delivers a closed-form variance-reduction factor of 1 minus gamma_3 squared over 2 plus gamma_4 relative to ordinary least squares for asymmetric non-Gaussian errors."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16846/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T20:31:45.676913Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.123167Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.317873Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.390665Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2c88d539bf96cb1a0e0f5ed0fe0e6a46353b33330a4126021e9a0c2c919faff8"},"references":{"count":30,"sample":[{"doi":"","year":2002,"title":"Kunchenko, Yuriy P. , title =. 2002 , isbn =","work_id":"b03aaa70-e8b6-4e23-b0f1-ae23f4aef6ce","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"and Warsza, Zygmunt L","work_id":"f14bbf9c-ec75-479f-883d-ff186cc041e7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"and Warsza, Zygmunt L","work_id":"fcbad252-194f-4b39-8571-3009e3a46f56","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Zabolotnii, Serhii and Tkachenko, Oleksandr and Warsza, Zygmunt L. , title =. Automation 2022: New Solutions and Technologies for Automation, Robotics and Measurement Techniques , series =. 2022 , doi","work_id":"461c1d19-d483-4851-b698-537a37c201f5","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Zabolotnii, Serhii and Tkachenko, Oleksandr and Warsza, Zygmunt L. , title =. Automation 2023: Key Challenges in Automation, Robotics and Measurement Techniques , series =. 2023 , doi =","work_id":"e9ba6a24-3146-44ff-b513-6291b9e9cef2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":30,"snapshot_sha256":"0a98fe86b1f5728a5d33f6e739f8eb3789628019d310585e6b1022c6f8418f3e","internal_anchors":3},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a455f65798a59b0ce3103f3a92b0241bf8fbff77064ef000fc0598677a107ab4"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"8a30210d-c340-4f65-8036-58ae9d16c866"},"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCbVM89QPieT9EcAfn5Nhpu1hFkZLJir957LHshLNdUSEi6MlcI9RnrG7LcyDzaqICpUQHn+fr6m3o0jGHkQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:58:36.666350Z"},"content_sha256":"fd827ba66e8b71712caa20b9a6048cbb01441e592047f25dfab38cb81259ba3e","schema_version":"1.0","event_id":"sha256:fd827ba66e8b71712caa20b9a6048cbb01441e592047f25dfab38cb81259ba3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTAUM3WLXBDUYA7ELKCB4N7IRE/bundle.json","state_url":"https://pith.science/pith/TTAUM3WLXBDUYA7ELKCB4N7IRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTAUM3WLXBDUYA7ELKCB4N7IRE/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-21T06:58:36Z","links":{"resolver":"https://pith.science/pith/TTAUM3WLXBDUYA7ELKCB4N7IRE","bundle":"https://pith.science/pith/TTAUM3WLXBDUYA7ELKCB4N7IRE/bundle.json","state":"https://pith.science/pith/TTAUM3WLXBDUYA7ELKCB4N7IRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTAUM3WLXBDUYA7ELKCB4N7IRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TTAUM3WLXBDUYA7ELKCB4N7IRE","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":"34cd783b80d9e5f9a8ca54e8e2dca1e4047db73b0d2e76a8f4c70bba499e6f03","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-16T07:07:26Z","title_canon_sha256":"492e9e28a5be61402ecb0867af382cba9e44ab32a97c9c1848ffc48338819d9a"},"schema_version":"1.0","source":{"id":"2605.16846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16846","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16846v1","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16846","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"TTAUM3WLXBDU","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_16","alias_value":"TTAUM3WLXBDUYA7E","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_8","alias_value":"TTAUM3WL","created_at":"2026-05-20T00:03:25Z"}],"graph_snapshots":[{"event_id":"sha256:fd827ba66e8b71712caa20b9a6048cbb01441e592047f25dfab38cb81259ba3e","target":"graph","created_at":"2026-05-20T00:03:25Z","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":"The main result is the closed-form variance-reduction coefficient g_2=1-gamma_3^2/(2+gamma_4) relative to OLS-FP for asymmetric non-Gaussian errors, formalised in Lean 4 and validated by Monte Carlo."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The extension to fractional-polynomial bases is developed under appropriate moment conditions for the positive and full FP power sets."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PMM-FP extends polynomial maximization to fractional polynomial bases and derives a closed-form variance-reduction coefficient g2 for asymmetric non-Gaussian errors, formalized in Lean 4 and checked via Monte Carlo."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"PMM-FP extends polynomial maximization to fractional bases and delivers a closed-form variance-reduction factor of 1 minus gamma_3 squared over 2 plus gamma_4 relative to ordinary least squares for asymmetric non-Gaussian errors."}],"snapshot_sha256":"8b7ef932c7c4f35b431aa039681db529b5108c66ac5c831e52101d662365df72"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a455f65798a59b0ce3103f3a92b0241bf8fbff77064ef000fc0598677a107ab4"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:31:45.676913Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.123167Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.317873Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.390665Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16846/integrity.json","findings":[],"snapshot_sha256":"2c88d539bf96cb1a0e0f5ed0fe0e6a46353b33330a4126021e9a0c2c919faff8","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fractional polynomials are widely used for dose-response modelling, and recent Bayesian fractional polynomial work has renewed interest in this finite model class. We propose PMM-FP, a frequentist extension of Kunchenko's polynomial maximization method to fractional-polynomial bases, developed in two parallel tracks for positive and full FP power sets under appropriate moment conditions. The main result is the closed-form variance-reduction coefficient g_2=1-gamma_3^2/(2+gamma_4) relative to OLS-FP for asymmetric non-Gaussian errors, formalised in Lean 4 and validated by Monte Carlo. On GBSG r","authors_text":"Serhii Zabolotnii","cross_cats":[],"headline":"PMM-FP extends polynomial maximization to fractional bases and delivers a closed-form variance-reduction factor of 1 minus gamma_3 squared over 2 plus gamma_4 relative to ordinary least squares for asymmetric non-Gaussian errors.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-16T07:07:26Z","title":"Polynomial Maximization Method with Fractional Polynomial Basis: A Frequentist Bridge to Bayesian Fractional Polynomials"},"references":{"count":30,"internal_anchors":3,"resolved_work":30,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Kunchenko, Yuriy P. , title =. 2002 , isbn =","work_id":"b03aaa70-e8b6-4e23-b0f1-ae23f4aef6ce","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"and Warsza, Zygmunt L","work_id":"f14bbf9c-ec75-479f-883d-ff186cc041e7","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"and Warsza, Zygmunt L","work_id":"fcbad252-194f-4b39-8571-3009e3a46f56","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Zabolotnii, Serhii and Tkachenko, Oleksandr and Warsza, Zygmunt L. , title =. Automation 2022: New Solutions and Technologies for Automation, Robotics and Measurement Techniques , series =. 2022 , doi","work_id":"461c1d19-d483-4851-b698-537a37c201f5","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Zabolotnii, Serhii and Tkachenko, Oleksandr and Warsza, Zygmunt L. , title =. Automation 2023: Key Challenges in Automation, Robotics and Measurement Techniques , series =. 2023 , doi =","work_id":"e9ba6a24-3146-44ff-b513-6291b9e9cef2","year":2023}],"snapshot_sha256":"0a98fe86b1f5728a5d33f6e739f8eb3789628019d310585e6b1022c6f8418f3e"},"source":{"id":"2605.16846","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:26:28.378123Z","id":"8a30210d-c340-4f65-8036-58ae9d16c866","model_set":{"reader":"grok-4.3"},"one_line_summary":"PMM-FP extends polynomial maximization to fractional polynomial bases and derives a closed-form variance-reduction coefficient g2 for asymmetric non-Gaussian errors, formalized in Lean 4 and checked via Monte Carlo.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"PMM-FP extends polynomial maximization to fractional bases and delivers a closed-form variance-reduction factor of 1 minus gamma_3 squared over 2 plus gamma_4 relative to ordinary least squares for asymmetric non-Gaussian errors.","strongest_claim":"The main result is the closed-form variance-reduction coefficient g_2=1-gamma_3^2/(2+gamma_4) relative to OLS-FP for asymmetric non-Gaussian errors, formalised in Lean 4 and validated by Monte Carlo.","weakest_assumption":"The extension to fractional-polynomial bases is developed under appropriate moment conditions for the positive and full FP power sets."}},"verdict_id":"8a30210d-c340-4f65-8036-58ae9d16c866"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a874ff9bde69678861e1abd400d9733f0f3caf019719af42c22b47f139d28710","target":"record","created_at":"2026-05-20T00:03:25Z","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":"34cd783b80d9e5f9a8ca54e8e2dca1e4047db73b0d2e76a8f4c70bba499e6f03","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-16T07:07:26Z","title_canon_sha256":"492e9e28a5be61402ecb0867af382cba9e44ab32a97c9c1848ffc48338819d9a"},"schema_version":"1.0","source":{"id":"2605.16846","kind":"arxiv","version":1}},"canonical_sha256":"9cc1466ecbb8474c03e45a841e37e88922a5a3020a881641ca1497d3f11d1589","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cc1466ecbb8474c03e45a841e37e88922a5a3020a881641ca1497d3f11d1589","first_computed_at":"2026-05-20T00:03:25.896543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:25.896543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C4Yqbo8nEmfIRehHqf4NNJG0veIvhlOVJEAtvf5h7/O6FZuXdNcXJdBFeJZdzzVtVYBo/gpSMPHIdPVXB2NNBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:25.897349Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a874ff9bde69678861e1abd400d9733f0f3caf019719af42c22b47f139d28710","sha256:fd827ba66e8b71712caa20b9a6048cbb01441e592047f25dfab38cb81259ba3e"],"state_sha256":"f1432cd1464042d214eb530261091c64294ac51aabc6829c240737f758e081ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQIXU3cu6vWQULrRqDerWCF9NWHgNFoSiyFrGPwek2GFwJaN0bi3SP8a5N6jU4q89ULXPwt3Bc1V3oyX7JQXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T06:58:36.669018Z","bundle_sha256":"b237cbceeeb99a74ca14614bf1c6f8e8874824da8a9a2bcc24dd8831efc68a65"}}