{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RPYVI4DJ7WYAMEQW6UQPLPJZJT","short_pith_number":"pith:RPYVI4DJ","canonical_record":{"source":{"id":"2604.13137","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-04-14T11:23:40Z","cross_cats_sorted":["math.NT","math.ST","stat.TH"],"title_canon_sha256":"cd35ec1597e48ac2a9819a24108e305d436a79ee83e8474d6fc7c8b5a0e3d8a2","abstract_canon_sha256":"7c3cc79ea29e4c3cc74e5b7dce010d5e193ce85fa9a6dbfd6b269bcdb0ba5a57"},"schema_version":"1.0"},"canonical_sha256":"8bf1547069fdb0061216f520f5bd394cfb8fcc3ca79b0f57edf6d38ab96e7ef2","source":{"kind":"arxiv","id":"2604.13137","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13137","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13137v2","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13137","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"RPYVI4DJ7WYA","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_16","alias_value":"RPYVI4DJ7WYAMEQW","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_8","alias_value":"RPYVI4DJ","created_at":"2026-05-20T00:00:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RPYVI4DJ7WYAMEQW6UQPLPJZJT","target":"record","payload":{"canonical_record":{"source":{"id":"2604.13137","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-04-14T11:23:40Z","cross_cats_sorted":["math.NT","math.ST","stat.TH"],"title_canon_sha256":"cd35ec1597e48ac2a9819a24108e305d436a79ee83e8474d6fc7c8b5a0e3d8a2","abstract_canon_sha256":"7c3cc79ea29e4c3cc74e5b7dce010d5e193ce85fa9a6dbfd6b269bcdb0ba5a57"},"schema_version":"1.0"},"canonical_sha256":"8bf1547069fdb0061216f520f5bd394cfb8fcc3ca79b0f57edf6d38ab96e7ef2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:37.943897Z","signature_b64":"0QwjwNQUH3g0aoCl7ViSaHOXkCStr+oivPnFfYxvbAZxAm699UjFPmhNwulANYxcAy2/W+0L8jnZ0BUgsKoXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bf1547069fdb0061216f520f5bd394cfb8fcc3ca79b0f57edf6d38ab96e7ef2","last_reissued_at":"2026-05-20T00:00:37.943361Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:37.943361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.13137","source_version":2,"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:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VevgLTo0z9YeAg5QwhLNvejMVleVhyQbv6RWx8BTSPnolqk7qld5FnlwJ93nSKfngcSr4JiKrsD/Tp1g8+DwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:29:32.451781Z"},"content_sha256":"4bd00479dd6e8faea3c2e7b2f5d93d3afd4f63af297c0ffee959f805e89adba6","schema_version":"1.0","event_id":"sha256:4bd00479dd6e8faea3c2e7b2f5d93d3afd4f63af297c0ffee959f805e89adba6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RPYVI4DJ7WYAMEQW6UQPLPJZJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$p$-adic Linear Regression for Random Sampling with Digitwise Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise.","cross_cats":["math.NT","math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"Tomoki Mihara","submitted_at":"2026-04-14T11:23:40Z","abstract_excerpt":"We propose a new probabilistic algorithm of $p$-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo $p$ linear regression."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose a new probabilistic algorithm of p-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo p linear regression.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That digitwise noise admits a natural probabilistic model within the p-adic metric that allows a regression algorithm to recover the underlying linear relation with non-trivial success probability.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proposes a probabilistic algorithm for p-adic linear regression under digitwise noise, including a modulo p version.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"91487fde13de936ce62775a944d8c2509c9c80d3ad20f91f5169c0b685f9fde8"},"source":{"id":"2604.13137","kind":"arxiv","version":2},"verdict":{"id":"7a771aff-c5df-41f5-96bf-e300212ba519","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T17:50:15.747908Z","strongest_claim":"We propose a new probabilistic algorithm of p-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo p linear regression.","one_line_summary":"Proposes a probabilistic algorithm for p-adic linear regression under digitwise noise, including a modulo p version.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That digitwise noise admits a natural probabilistic model within the p-adic metric that allows a regression algorithm to recover the underlying linear relation with non-trivial success probability.","pith_extraction_headline":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.13137/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":22,"sample":[{"doi":"","year":1995,"title":"E.\\ Amaldi and V.\\ Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations , Theoretical Computer Science, Volume 147, pp.\\ 181--210, 1995","work_id":"0a240fed-ede0-4cab-a826-1788b59d8f9f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"S.\\ Albeverio, A.\\ Khrennikov, and B.\\ Tirrozi, p -Adic Dynamical Systems and Neural Networks , Mathematical Models and Methods in Applied Sciences, Volume 09, Issue 09, pp.\\ 1417--1437, 1999","work_id":"da8dda7a-3641-4d8b-987e-c53fb82f0873","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"V.\\ G.\\ Berkovich, Spectral Theory and Analytic Geometry over non-\\ Fields , Mathematical Surveys and Monographs, Number 33, the American Mathematical Society, 1990","work_id":"df2acce9-2d9e-4e27-9e8e-7e9d2e7ace97","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":", F.\\ Bambozzi and T,\\ Mihara, Derived Analytic Geometry for -Valued Functions Part I: Topological Properties , Bulletin of the Iranian Mathematical Society, Volume 50, Issue 4, article number 58, 202","work_id":"19f9dc91-0cc5-4764-bcb8-3651cbedd8eb","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"G.\\ D.\\ Baker, S.\\ Mccallum, and D.\\ Pattinson, Linear Regression in p -adic Metric Spaces , p -Adic Numbers, Ultrametric Analysis and Applications, Volume 17, Issue 4, pp.\\ 333--347, 2025","work_id":"87715657-7f8e-475f-be4c-bceb9e062d18","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":22,"snapshot_sha256":"a6dc76b2a11f46837bdaa268fbde48e30ae1326613e737a2fbc217c0dd427b12","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"19a6fbd3a18e4f8ea893e3bb75fbf4fedc7e9a3c66782f145252352856820b62"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7a771aff-c5df-41f5-96bf-e300212ba519"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RjPPbpfm/lkZ7oNaBpl0odB3Tv62YTiTqh8Fv7hGT+mHbnKELFpBXdzQCGDtvZTLRtxmGNzzlDSNtxHAbibCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:29:32.452885Z"},"content_sha256":"cdfa2b6b1877c10adc1c4c8df1a11188c86b0da229f77af8be30f10521841c68","schema_version":"1.0","event_id":"sha256:cdfa2b6b1877c10adc1c4c8df1a11188c86b0da229f77af8be30f10521841c68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/bundle.json","state_url":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/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-06-08T18:29:32Z","links":{"resolver":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT","bundle":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/bundle.json","state":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RPYVI4DJ7WYAMEQW6UQPLPJZJT","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":"7c3cc79ea29e4c3cc74e5b7dce010d5e193ce85fa9a6dbfd6b269bcdb0ba5a57","cross_cats_sorted":["math.NT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-04-14T11:23:40Z","title_canon_sha256":"cd35ec1597e48ac2a9819a24108e305d436a79ee83e8474d6fc7c8b5a0e3d8a2"},"schema_version":"1.0","source":{"id":"2604.13137","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13137","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13137v2","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13137","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"RPYVI4DJ7WYA","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_16","alias_value":"RPYVI4DJ7WYAMEQW","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_8","alias_value":"RPYVI4DJ","created_at":"2026-05-20T00:00:37Z"}],"graph_snapshots":[{"event_id":"sha256:cdfa2b6b1877c10adc1c4c8df1a11188c86b0da229f77af8be30f10521841c68","target":"graph","created_at":"2026-05-20T00:00:37Z","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 propose a new probabilistic algorithm of p-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo p linear regression."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That digitwise noise admits a natural probabilistic model within the p-adic metric that allows a regression algorithm to recover the underlying linear relation with non-trivial success probability."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Proposes a probabilistic algorithm for p-adic linear regression under digitwise noise, including a modulo p version."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise."}],"snapshot_sha256":"91487fde13de936ce62775a944d8c2509c9c80d3ad20f91f5169c0b685f9fde8"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"19a6fbd3a18e4f8ea893e3bb75fbf4fedc7e9a3c66782f145252352856820b62"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.13137/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new probabilistic algorithm of $p$-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo $p$ linear regression.","authors_text":"Tomoki Mihara","cross_cats":["math.NT","math.ST","stat.TH"],"headline":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-04-14T11:23:40Z","title":"$p$-adic Linear Regression for Random Sampling with Digitwise Noise"},"references":{"count":22,"internal_anchors":0,"resolved_work":22,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"E.\\ Amaldi and V.\\ Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations , Theoretical Computer Science, Volume 147, pp.\\ 181--210, 1995","work_id":"0a240fed-ede0-4cab-a826-1788b59d8f9f","year":1995},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"S.\\ Albeverio, A.\\ Khrennikov, and B.\\ Tirrozi, p -Adic Dynamical Systems and Neural Networks , Mathematical Models and Methods in Applied Sciences, Volume 09, Issue 09, pp.\\ 1417--1437, 1999","work_id":"da8dda7a-3641-4d8b-987e-c53fb82f0873","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"V.\\ G.\\ Berkovich, Spectral Theory and Analytic Geometry over non-\\ Fields , Mathematical Surveys and Monographs, Number 33, the American Mathematical Society, 1990","work_id":"df2acce9-2d9e-4e27-9e8e-7e9d2e7ace97","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":", F.\\ Bambozzi and T,\\ Mihara, Derived Analytic Geometry for -Valued Functions Part I: Topological Properties , Bulletin of the Iranian Mathematical Society, Volume 50, Issue 4, article number 58, 202","work_id":"19f9dc91-0cc5-4764-bcb8-3651cbedd8eb","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"G.\\ D.\\ Baker, S.\\ Mccallum, and D.\\ Pattinson, Linear Regression in p -adic Metric Spaces , p -Adic Numbers, Ultrametric Analysis and Applications, Volume 17, Issue 4, pp.\\ 333--347, 2025","work_id":"87715657-7f8e-475f-be4c-bceb9e062d18","year":2025}],"snapshot_sha256":"a6dc76b2a11f46837bdaa268fbde48e30ae1326613e737a2fbc217c0dd427b12"},"source":{"id":"2604.13137","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-19T17:50:15.747908Z","id":"7a771aff-c5df-41f5-96bf-e300212ba519","model_set":{"reader":"grok-4.3"},"one_line_summary":"Proposes a probabilistic algorithm for p-adic linear regression under digitwise noise, including a modulo p version.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise.","strongest_claim":"We propose a new probabilistic algorithm of p-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo p linear regression.","weakest_assumption":"That digitwise noise admits a natural probabilistic model within the p-adic metric that allows a regression algorithm to recover the underlying linear relation with non-trivial success probability."}},"verdict_id":"7a771aff-c5df-41f5-96bf-e300212ba519"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4bd00479dd6e8faea3c2e7b2f5d93d3afd4f63af297c0ffee959f805e89adba6","target":"record","created_at":"2026-05-20T00:00:37Z","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":"7c3cc79ea29e4c3cc74e5b7dce010d5e193ce85fa9a6dbfd6b269bcdb0ba5a57","cross_cats_sorted":["math.NT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-04-14T11:23:40Z","title_canon_sha256":"cd35ec1597e48ac2a9819a24108e305d436a79ee83e8474d6fc7c8b5a0e3d8a2"},"schema_version":"1.0","source":{"id":"2604.13137","kind":"arxiv","version":2}},"canonical_sha256":"8bf1547069fdb0061216f520f5bd394cfb8fcc3ca79b0f57edf6d38ab96e7ef2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bf1547069fdb0061216f520f5bd394cfb8fcc3ca79b0f57edf6d38ab96e7ef2","first_computed_at":"2026-05-20T00:00:37.943361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:37.943361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0QwjwNQUH3g0aoCl7ViSaHOXkCStr+oivPnFfYxvbAZxAm699UjFPmhNwulANYxcAy2/W+0L8jnZ0BUgsKoXAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:37.943897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.13137","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bd00479dd6e8faea3c2e7b2f5d93d3afd4f63af297c0ffee959f805e89adba6","sha256:cdfa2b6b1877c10adc1c4c8df1a11188c86b0da229f77af8be30f10521841c68"],"state_sha256":"5ca054e9132b9c9c135a9efec8cb0e7e267abf5449e9069ad5b3b77c54e64adb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMFD0DnAh12mpR791Lf/pGoltkTTtB8y2WY8ZyEZ0BRlhUELZAKMOpwjCRoEZSJjxy0wjAGR3Deu/a+QDvNxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:29:32.457945Z","bundle_sha256":"2e4f3f3f4f359a49fe5fd16be75457124272f4f72c6cc9a808202baf8957883a"}}