{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EAZBTXEROVX6YN4KDJM3CSQIXP","short_pith_number":"pith:EAZBTXER","canonical_record":{"source":{"id":"2605.16722","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T00:11:19Z","cross_cats_sorted":[],"title_canon_sha256":"47360971c3ee2af69f5611ac329674890adfbf08602bfd4c5258b5d1d9d61fb2","abstract_canon_sha256":"61afcb9a369f3d53371dd4b7a304b02c91be1862abcce4d0ce3d5a860b4037fa"},"schema_version":"1.0"},"canonical_sha256":"203219dc91756fec378a1a59b14a08bbfd1f01045828d4005fff2d53f37f23b4","source":{"kind":"arxiv","id":"2605.16722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16722","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16722v1","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16722","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"EAZBTXEROVX6","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"EAZBTXEROVX6YN4K","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"EAZBTXER","created_at":"2026-05-20T00:02:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EAZBTXEROVX6YN4KDJM3CSQIXP","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16722","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T00:11:19Z","cross_cats_sorted":[],"title_canon_sha256":"47360971c3ee2af69f5611ac329674890adfbf08602bfd4c5258b5d1d9d61fb2","abstract_canon_sha256":"61afcb9a369f3d53371dd4b7a304b02c91be1862abcce4d0ce3d5a860b4037fa"},"schema_version":"1.0"},"canonical_sha256":"203219dc91756fec378a1a59b14a08bbfd1f01045828d4005fff2d53f37f23b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:38.431532Z","signature_b64":"o8/1rXbDoVOZBapqE3+zdqrystTJi7aqlinLq1KbaqrZAey7ThxebJ7JvNvWtI0Sjtnfnrm+0RzOCuZQOH1TDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"203219dc91756fec378a1a59b14a08bbfd1f01045828d4005fff2d53f37f23b4","last_reissued_at":"2026-05-20T00:02:38.430628Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:38.430628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16722","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:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRkYkvuPGfyzTqipir0aG+H5xR3Vge9URwuW/1gVEnOmfR7P1oQp5qbr5xYAXJE8Plr19RYTR8hGO8X2J8klDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:18:37.940429Z"},"content_sha256":"f647b965871b49e2989a593602d0ced206142237023e2d45c185ea857dc32667","schema_version":"1.0","event_id":"sha256:f647b965871b49e2989a593602d0ced206142237023e2d45c185ea857dc32667"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EAZBTXEROVX6YN4KDJM3CSQIXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hadamard Hypercubes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Two constructions produce Hadamard hypercubes from conference matrices and from recursive merges with Latin hypercubes.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amin Bahmanian, Sho Suda","submitted_at":"2026-05-16T00:11:19Z","abstract_excerpt":"Although Hadamard matrices have been investigated since the nineteenth century, relatively little is known about their higher-dimensional analogues. In this paper, we introduce two constructions of Hadamard hypercubes. The first construction is derived from conference matrices, while the second is recursive, combining Hadamard matrices (and hypercubes) of smaller order with Latin hypercubes. The former approach draws on the theory of association schemes on triples, whereas the latter yields applications to the construction of higher-dimensional symmetric designs."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We introduce two constructions of Hadamard hypercubes. The first construction is derived from conference matrices, while the second is recursive, combining Hadamard matrices (and hypercubes) of smaller order with Latin hypercubes.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The defined Hadamard hypercubes satisfy the required higher-dimensional orthogonality or balance conditions, and the recursive combination with Latin hypercubes preserves these properties without introducing inconsistencies in the multi-dimensional setting.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The authors present two constructions of Hadamard hypercubes: one derived from conference matrices using association schemes on triples, and a recursive construction combining smaller Hadamard matrices or hypercubes with Latin hypercubes, yielding applications to higher-dimensional symmetric designs","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Two constructions produce Hadamard hypercubes from conference matrices and from recursive merges with Latin hypercubes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"37133f4421139f9b8c312d5609d2ef64c9232a57a5f652693493a6898314272b"},"source":{"id":"2605.16722","kind":"arxiv","version":1},"verdict":{"id":"3d292230-632a-4a96-8c20-3c43aacebd24","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:40:42.261773Z","strongest_claim":"We introduce two constructions of Hadamard hypercubes. The first construction is derived from conference matrices, while the second is recursive, combining Hadamard matrices (and hypercubes) of smaller order with Latin hypercubes.","one_line_summary":"The authors present two constructions of Hadamard hypercubes: one derived from conference matrices using association schemes on triples, and a recursive construction combining smaller Hadamard matrices or hypercubes with Latin hypercubes, yielding applications to higher-dimensional symmetric designs","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The defined Hadamard hypercubes satisfy the required higher-dimensional orthogonality or balance conditions, and the recursive combination with Latin hypercubes preserves these properties without introducing inconsistencies in the multi-dimensional setting.","pith_extraction_headline":"Two constructions produce Hadamard hypercubes from conference matrices and from recursive merges with Latin hypercubes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16722/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:23.101421Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:51:05.422163Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.350085Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.474931Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"4282f49b4fb96b3cb1a4575c65ee05176837e7b043840e24e74267aedff959eb"},"references":{"count":46,"sample":[{"doi":"","year":2023,"title":"Symmetric layer-rainbow colorations of cubes.SIAM J","work_id":"745c02b6-6ed2-442f-b7bd-d0a045c61ef9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"A review and new symmetric conference matrices.University of Wollongong","work_id":"42b930a4-16d2-4b79-a1ee-7e491fd95729","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"Benjamin/Cummings Publishing Company, California, 1984","work_id":"4d79729d-dfe9-4cb2-aaf2-6668b90da3cd","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"The edge-coloring of complete hypergraphs","work_id":"d6940c19-40f9-4f07-a68e-f85c6b922aa6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Brouwer and Willem H","work_id":"e4e67ed7-952e-435f-af5e-4fbc32de8d50","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"4eecf4c1f7c845274d1077b0b0e1c1e513d301f21f74ef7808fa87e21e3c7900","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a41dd4652d40f3efc05fb8a89503d86e0d0157380f16b2ee340fb285377b72e4"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"3d292230-632a-4a96-8c20-3c43aacebd24"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swh+dGXdcJrEEYqazfTBBQePz7YIYrAxVTPzDyGT6sq+Xu5jGaXQA83Q3Z5f7fAzz0/ONzznWv9yyYz8VGoqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:18:37.941580Z"},"content_sha256":"b9f42bd33b517935b5742d1155a530b4942d6e57161eb1e697a884a7d959e450","schema_version":"1.0","event_id":"sha256:b9f42bd33b517935b5742d1155a530b4942d6e57161eb1e697a884a7d959e450"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAZBTXEROVX6YN4KDJM3CSQIXP/bundle.json","state_url":"https://pith.science/pith/EAZBTXEROVX6YN4KDJM3CSQIXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAZBTXEROVX6YN4KDJM3CSQIXP/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-25T19:18:37Z","links":{"resolver":"https://pith.science/pith/EAZBTXEROVX6YN4KDJM3CSQIXP","bundle":"https://pith.science/pith/EAZBTXEROVX6YN4KDJM3CSQIXP/bundle.json","state":"https://pith.science/pith/EAZBTXEROVX6YN4KDJM3CSQIXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAZBTXEROVX6YN4KDJM3CSQIXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EAZBTXEROVX6YN4KDJM3CSQIXP","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":"61afcb9a369f3d53371dd4b7a304b02c91be1862abcce4d0ce3d5a860b4037fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T00:11:19Z","title_canon_sha256":"47360971c3ee2af69f5611ac329674890adfbf08602bfd4c5258b5d1d9d61fb2"},"schema_version":"1.0","source":{"id":"2605.16722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16722","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16722v1","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16722","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"EAZBTXEROVX6","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"EAZBTXEROVX6YN4K","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"EAZBTXER","created_at":"2026-05-20T00:02:38Z"}],"graph_snapshots":[{"event_id":"sha256:b9f42bd33b517935b5742d1155a530b4942d6e57161eb1e697a884a7d959e450","target":"graph","created_at":"2026-05-20T00:02:38Z","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 introduce two constructions of Hadamard hypercubes. The first construction is derived from conference matrices, while the second is recursive, combining Hadamard matrices (and hypercubes) of smaller order with Latin hypercubes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The defined Hadamard hypercubes satisfy the required higher-dimensional orthogonality or balance conditions, and the recursive combination with Latin hypercubes preserves these properties without introducing inconsistencies in the multi-dimensional setting."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The authors present two constructions of Hadamard hypercubes: one derived from conference matrices using association schemes on triples, and a recursive construction combining smaller Hadamard matrices or hypercubes with Latin hypercubes, yielding applications to higher-dimensional symmetric designs"},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Two constructions produce Hadamard hypercubes from conference matrices and from recursive merges with Latin hypercubes."}],"snapshot_sha256":"37133f4421139f9b8c312d5609d2ef64c9232a57a5f652693493a6898314272b"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a41dd4652d40f3efc05fb8a89503d86e0d0157380f16b2ee340fb285377b72e4"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:23.101421Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:51:05.422163Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.350085Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.474931Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16722/integrity.json","findings":[],"snapshot_sha256":"4282f49b4fb96b3cb1a4575c65ee05176837e7b043840e24e74267aedff959eb","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Although Hadamard matrices have been investigated since the nineteenth century, relatively little is known about their higher-dimensional analogues. In this paper, we introduce two constructions of Hadamard hypercubes. The first construction is derived from conference matrices, while the second is recursive, combining Hadamard matrices (and hypercubes) of smaller order with Latin hypercubes. The former approach draws on the theory of association schemes on triples, whereas the latter yields applications to the construction of higher-dimensional symmetric designs.","authors_text":"Amin Bahmanian, Sho Suda","cross_cats":[],"headline":"Two constructions produce Hadamard hypercubes from conference matrices and from recursive merges with Latin hypercubes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T00:11:19Z","title":"Hadamard Hypercubes"},"references":{"count":46,"internal_anchors":1,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Symmetric layer-rainbow colorations of cubes.SIAM J","work_id":"745c02b6-6ed2-442f-b7bd-d0a045c61ef9","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A review and new symmetric conference matrices.University of Wollongong","work_id":"42b930a4-16d2-4b79-a1ee-7e491fd95729","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Benjamin/Cummings Publishing Company, California, 1984","work_id":"4d79729d-dfe9-4cb2-aaf2-6668b90da3cd","year":1984},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The edge-coloring of complete hypergraphs","work_id":"d6940c19-40f9-4f07-a68e-f85c6b922aa6","year":1979},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Brouwer and Willem H","work_id":"e4e67ed7-952e-435f-af5e-4fbc32de8d50","year":2012}],"snapshot_sha256":"4eecf4c1f7c845274d1077b0b0e1c1e513d301f21f74ef7808fa87e21e3c7900"},"source":{"id":"2605.16722","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:40:42.261773Z","id":"3d292230-632a-4a96-8c20-3c43aacebd24","model_set":{"reader":"grok-4.3"},"one_line_summary":"The authors present two constructions of Hadamard hypercubes: one derived from conference matrices using association schemes on triples, and a recursive construction combining smaller Hadamard matrices or hypercubes with Latin hypercubes, yielding applications to higher-dimensional symmetric designs","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Two constructions produce Hadamard hypercubes from conference matrices and from recursive merges with Latin hypercubes.","strongest_claim":"We introduce two constructions of Hadamard hypercubes. The first construction is derived from conference matrices, while the second is recursive, combining Hadamard matrices (and hypercubes) of smaller order with Latin hypercubes.","weakest_assumption":"The defined Hadamard hypercubes satisfy the required higher-dimensional orthogonality or balance conditions, and the recursive combination with Latin hypercubes preserves these properties without introducing inconsistencies in the multi-dimensional setting."}},"verdict_id":"3d292230-632a-4a96-8c20-3c43aacebd24"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f647b965871b49e2989a593602d0ced206142237023e2d45c185ea857dc32667","target":"record","created_at":"2026-05-20T00:02:38Z","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":"61afcb9a369f3d53371dd4b7a304b02c91be1862abcce4d0ce3d5a860b4037fa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-16T00:11:19Z","title_canon_sha256":"47360971c3ee2af69f5611ac329674890adfbf08602bfd4c5258b5d1d9d61fb2"},"schema_version":"1.0","source":{"id":"2605.16722","kind":"arxiv","version":1}},"canonical_sha256":"203219dc91756fec378a1a59b14a08bbfd1f01045828d4005fff2d53f37f23b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"203219dc91756fec378a1a59b14a08bbfd1f01045828d4005fff2d53f37f23b4","first_computed_at":"2026-05-20T00:02:38.430628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:38.430628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o8/1rXbDoVOZBapqE3+zdqrystTJi7aqlinLq1KbaqrZAey7ThxebJ7JvNvWtI0Sjtnfnrm+0RzOCuZQOH1TDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:38.431532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f647b965871b49e2989a593602d0ced206142237023e2d45c185ea857dc32667","sha256:b9f42bd33b517935b5742d1155a530b4942d6e57161eb1e697a884a7d959e450"],"state_sha256":"a3705e636094d40e6bed3375912b648df5efec46fbd07aca54fe4a8ae0988c50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMp/eEp8K2xEQO7lpKZrs0rUJ8FXO9Tg0qEGXa4lFazdeI4ZwEntfmcEbnC/iAO8Y9phmeCaeV9WrjNU+l+QBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:18:37.946499Z","bundle_sha256":"df7e87ee7591273b8d3350b1d3c22ed288c8335bb7889e168a91cc48f99b5805"}}