{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7BFAP66TTFVVFCBRRCXWPJWAQY","short_pith_number":"pith:7BFAP66T","canonical_record":{"source":{"id":"2605.12656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T19:03:36Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"81d6a2fa1aa4c5b555d464e453d33aa1930b71a0e42d515f97eef982e81ecab4","abstract_canon_sha256":"6045dd74df55ec8d7f7da502dbfafbe5f2951342b19c66011fcc4647972e7b65"},"schema_version":"1.0"},"canonical_sha256":"f84a07fbd3996b52883188af67a6c086223797ccfb57f29eada0e22a18649314","source":{"kind":"arxiv","id":"2605.12656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12656","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12656v1","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12656","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"7BFAP66TTFVV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7BFAP66TTFVVFCBR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7BFAP66T","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7BFAP66TTFVVFCBRRCXWPJWAQY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T19:03:36Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"81d6a2fa1aa4c5b555d464e453d33aa1930b71a0e42d515f97eef982e81ecab4","abstract_canon_sha256":"6045dd74df55ec8d7f7da502dbfafbe5f2951342b19c66011fcc4647972e7b65"},"schema_version":"1.0"},"canonical_sha256":"f84a07fbd3996b52883188af67a6c086223797ccfb57f29eada0e22a18649314","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:50.627412Z","signature_b64":"Zk3M3HhwVzeua/xlnFOXdUlqINZA0rzPcQChhYaKzKpvu0pq7ufVisNzyucXLNJWKZACzneVMqswnFBZIq1sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f84a07fbd3996b52883188af67a6c086223797ccfb57f29eada0e22a18649314","last_reissued_at":"2026-05-18T03:09:50.626661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:50.626661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12656","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-18T03:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvNdTzC1cVtZVJ2tiRTfR+Otwltp41JHhVQrKMLtLcYHUjzEf7EPcGKmykEHJRFXweDDoB2zopD8wlaaAaDODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:04:06.987374Z"},"content_sha256":"750eb748b7d1bbb8e4e253d35341dceb5bae5b1f9ee9d6d63d9627d8674f9acc","schema_version":"1.0","event_id":"sha256:750eb748b7d1bbb8e4e253d35341dceb5bae5b1f9ee9d6d63d9627d8674f9acc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7BFAP66TTFVVFCBRRCXWPJWAQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Bounds, Barriers, and Extensions for Non-Hermitian Bivariate Quantum Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation.","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Joshua M. Courtney","submitted_at":"2026-05-12T19:03:36Z","abstract_excerpt":"Multivariate quantum signal processing (M-QSP) has recently been shown to be applicable for non-Hermitian Hamiltonian simulation, opening several problems regarding the optimization landscape, angle-finding, and constant-factor analysis. We resolve several of these problems here. We find the anti-Hermitian query complexity $d_I = \\Theta(\\betaI T + \\log(1/\\varepsilon)/\\log\\log(1/\\varepsilon))$ to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert~$W$ inversion. Fast-forwarding to $d_I = \\mathcal{O}(\\sqrt{\\betaI T})$ is impossible in the biv"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We find the anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert W inversion.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The bivariate polynomial model and walk-operator oracle model assumptions continue to apply without modification to the non-Hermitian setting and that the constant-ratio condition extends to non-identical signal operators.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Tight anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) is established for non-Hermitian M-QSP, with impossibility of √(β_I T) fast-forwarding, new angle-finding algorithms, and extensions to time-dependent cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"944996f23a8620ace1863c1b1afd5942097d5fcccc82f17d2dc9ff012455f896"},"source":{"id":"2605.12656","kind":"arxiv","version":1},"verdict":{"id":"d8110df5-4f00-4d96-b8c0-b39b929cae14","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:17:45.022815Z","strongest_claim":"We find the anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert W inversion.","one_line_summary":"Tight anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) is established for non-Hermitian M-QSP, with impossibility of √(β_I T) fast-forwarding, new angle-finding algorithms, and extensions to time-dependent cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The bivariate polynomial model and walk-operator oracle model assumptions continue to apply without modification to the non-Hermitian setting and that the constant-ratio condition extends to non-identical signal operators.","pith_extraction_headline":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation."},"references":{"count":48,"sample":[{"doi":"","year":null,"title":"Standard recursive:O(d·d R ·d I) =O(d 3)","work_id":"3cf8e6f1-2753-49c5-a17e-167243e62c1f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"CRC-exploiting block peeling:O(dR ·d I) =O(d 2)","work_id":"23e6884e-3587-4126-9026-45ebeb29378e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"ap- proximately2","work_id":"02db4a62-8830-442d-b522-2f2115d37e14","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The warm-start basin guarantee (Theorem 10) requires a full-rank Jacobian, and the analytical basin radius de- cays polynomially with degree asρ analytical ∼d −4.62 (Eq","work_id":"f5152b39-36a5-4076-9bdf-12102436de2f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Direct-access polynomial construction.A poly- nomial designed ab initio for the direct-access model that achievesλ=e ωT (1 +o(1))on the full bitorus (Problem 42) would establish exponential advantage ","work_id":"cac23478-fd4e-4a63-a260-31063398e060","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":48,"snapshot_sha256":"46ff21561e160a104da89fb271b3498b1500a68ad93dc82fbd25c60744a66bc0","internal_anchors":1},"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":"d8110df5-4f00-4d96-b8c0-b39b929cae14"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTTM7/vtGHv62McgMajA6Jofup0cg/VoOG0a+nqYLICV6lmTdebt37N8otpqZBTSQAS6DYlagVHW0TYI0BYBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:04:06.988413Z"},"content_sha256":"c001355da699d271ad70641e8526429fd8ca198869923458c6e5fc7bdc5eccca","schema_version":"1.0","event_id":"sha256:c001355da699d271ad70641e8526429fd8ca198869923458c6e5fc7bdc5eccca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/bundle.json","state_url":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/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-22T21:04:06Z","links":{"resolver":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY","bundle":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/bundle.json","state":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7BFAP66TTFVVFCBRRCXWPJWAQY","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":"6045dd74df55ec8d7f7da502dbfafbe5f2951342b19c66011fcc4647972e7b65","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T19:03:36Z","title_canon_sha256":"81d6a2fa1aa4c5b555d464e453d33aa1930b71a0e42d515f97eef982e81ecab4"},"schema_version":"1.0","source":{"id":"2605.12656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12656","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12656v1","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12656","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"7BFAP66TTFVV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7BFAP66TTFVVFCBR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7BFAP66T","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c001355da699d271ad70641e8526429fd8ca198869923458c6e5fc7bdc5eccca","target":"graph","created_at":"2026-05-18T03:09:50Z","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 find the anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert W inversion."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The bivariate polynomial model and walk-operator oracle model assumptions continue to apply without modification to the non-Hermitian setting and that the constant-ratio condition extends to non-identical signal operators."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Tight anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) is established for non-Hermitian M-QSP, with impossibility of √(β_I T) fast-forwarding, new angle-finding algorithms, and extensions to time-dependent cases."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation."}],"snapshot_sha256":"944996f23a8620ace1863c1b1afd5942097d5fcccc82f17d2dc9ff012455f896"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Multivariate quantum signal processing (M-QSP) has recently been shown to be applicable for non-Hermitian Hamiltonian simulation, opening several problems regarding the optimization landscape, angle-finding, and constant-factor analysis. We resolve several of these problems here. We find the anti-Hermitian query complexity $d_I = \\Theta(\\betaI T + \\log(1/\\varepsilon)/\\log\\log(1/\\varepsilon))$ to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert~$W$ inversion. Fast-forwarding to $d_I = \\mathcal{O}(\\sqrt{\\betaI T})$ is impossible in the biv","authors_text":"Joshua M. Courtney","cross_cats":["cs.CC","cs.DS"],"headline":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T19:03:36Z","title":"Optimal Bounds, Barriers, and Extensions for Non-Hermitian Bivariate Quantum Signal Processing"},"references":{"count":48,"internal_anchors":1,"resolved_work":48,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Standard recursive:O(d·d R ·d I) =O(d 3)","work_id":"3cf8e6f1-2753-49c5-a17e-167243e62c1f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"CRC-exploiting block peeling:O(dR ·d I) =O(d 2)","work_id":"23e6884e-3587-4126-9026-45ebeb29378e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"ap- proximately2","work_id":"02db4a62-8830-442d-b522-2f2115d37e14","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The warm-start basin guarantee (Theorem 10) requires a full-rank Jacobian, and the analytical basin radius de- cays polynomially with degree asρ analytical ∼d −4.62 (Eq","work_id":"f5152b39-36a5-4076-9bdf-12102436de2f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Direct-access polynomial construction.A poly- nomial designed ab initio for the direct-access model that achievesλ=e ωT (1 +o(1))on the full bitorus (Problem 42) would establish exponential advantage ","work_id":"cac23478-fd4e-4a63-a260-31063398e060","year":null}],"snapshot_sha256":"46ff21561e160a104da89fb271b3498b1500a68ad93dc82fbd25c60744a66bc0"},"source":{"id":"2605.12656","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:17:45.022815Z","id":"d8110df5-4f00-4d96-b8c0-b39b929cae14","model_set":{"reader":"grok-4.3"},"one_line_summary":"Tight anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) is established for non-Hermitian M-QSP, with impossibility of √(β_I T) fast-forwarding, new angle-finding algorithms, and extensions to time-dependent cases.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation.","strongest_claim":"We find the anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert W inversion.","weakest_assumption":"The bivariate polynomial model and walk-operator oracle model assumptions continue to apply without modification to the non-Hermitian setting and that the constant-ratio condition extends to non-identical signal operators."}},"verdict_id":"d8110df5-4f00-4d96-b8c0-b39b929cae14"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:750eb748b7d1bbb8e4e253d35341dceb5bae5b1f9ee9d6d63d9627d8674f9acc","target":"record","created_at":"2026-05-18T03:09:50Z","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":"6045dd74df55ec8d7f7da502dbfafbe5f2951342b19c66011fcc4647972e7b65","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T19:03:36Z","title_canon_sha256":"81d6a2fa1aa4c5b555d464e453d33aa1930b71a0e42d515f97eef982e81ecab4"},"schema_version":"1.0","source":{"id":"2605.12656","kind":"arxiv","version":1}},"canonical_sha256":"f84a07fbd3996b52883188af67a6c086223797ccfb57f29eada0e22a18649314","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f84a07fbd3996b52883188af67a6c086223797ccfb57f29eada0e22a18649314","first_computed_at":"2026-05-18T03:09:50.626661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:50.626661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zk3M3HhwVzeua/xlnFOXdUlqINZA0rzPcQChhYaKzKpvu0pq7ufVisNzyucXLNJWKZACzneVMqswnFBZIq1sBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:50.627412Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:750eb748b7d1bbb8e4e253d35341dceb5bae5b1f9ee9d6d63d9627d8674f9acc","sha256:c001355da699d271ad70641e8526429fd8ca198869923458c6e5fc7bdc5eccca"],"state_sha256":"b3466dffdd4f6878c24c1ca8d2595f047b034c243566ec24b9bc19a5d1cfbd13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxLAAHk2U1FjgG1tJKfhBJ6AilJ0s4bQPZ7/Or1L0ofLwbD4tnBM3NeKLbQm8raTqishZ+rH7Ct3n1RKAZecAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:04:06.991467Z","bundle_sha256":"1ff3790214b85188c61a4f6cfa6f2f02a61959bc5f6cca7cc726c2842e083a09"}}