{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IPAQLX7TC4DO3TA5RX2DXWDANC","short_pith_number":"pith:IPAQLX7T","canonical_record":{"source":{"id":"2605.14030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-13T18:42:31Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"cc86a128c343ee4d001e143b12a237aaf857c47900d16d3c97acadeaf81fffa0","abstract_canon_sha256":"63e144a2cf2b6e266b9d39f7578b9a26a9e21e52bc6fc6666052efcc672c0b4d"},"schema_version":"1.0"},"canonical_sha256":"43c105dff31706edcc1d8df43bd86068b28b7b40740cb9f4ea5326a56d8f6898","source":{"kind":"arxiv","id":"2605.14030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14030","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14030v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14030","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"IPAQLX7TC4DO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IPAQLX7TC4DO3TA5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IPAQLX7T","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IPAQLX7TC4DO3TA5RX2DXWDANC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-13T18:42:31Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"cc86a128c343ee4d001e143b12a237aaf857c47900d16d3c97acadeaf81fffa0","abstract_canon_sha256":"63e144a2cf2b6e266b9d39f7578b9a26a9e21e52bc6fc6666052efcc672c0b4d"},"schema_version":"1.0"},"canonical_sha256":"43c105dff31706edcc1d8df43bd86068b28b7b40740cb9f4ea5326a56d8f6898","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.855536Z","signature_b64":"N2vbquJ0oy6HPjstpJEzhd7xjVJJBeKi3BA93yixq016EaMyQbTewIt5UzIzxZ8iO0CxMPOuWxkj3QTF93w7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c105dff31706edcc1d8df43bd86068b28b7b40740cb9f4ea5326a56d8f6898","last_reissued_at":"2026-05-17T23:39:12.855019Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.855019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14030","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-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sjn+E0+MEzH8gFo10HCyGLsPsk4S6Osihd/wMS194jzGxGLd8GW56c6rTkRZ3CF3Mfn8b6vU919tc594Dh5uAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:20:55.225958Z"},"content_sha256":"dcd2d859d2734670aa11280c28cc94c7b92c6faf8f1a984ac00ade98ccd3a8eb","schema_version":"1.0","event_id":"sha256:dcd2d859d2734670aa11280c28cc94c7b92c6faf8f1a984ac00ade98ccd3a8eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IPAQLX7TC4DO3TA5RX2DXWDANC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Billiards in Polygons Associated to Hyperbolic $(p,q)$-Tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Billiard languages in hyperbolic (p,q)-polygons have explicit exponential growth rates for even q and complete grammar rules for realizable words.","cross_cats":["math.GT"],"primary_cat":"math.DS","authors_text":"Jane Wang, Sunrose T. Shrestha","submitted_at":"2026-05-13T18:42:31Z","abstract_excerpt":"The complexity of the billiard language of regular polygons in the hyperbolic plane with $p$ sides and $2\\pi/q$ internal angles is known to grow exponentially and the exponential growth rate is known to equal the topological entropy of the billiard system. In this paper we compute these exponential growth rates explicitly when $q$ is even and give bounds when $q$ is odd. Additionally, for the $q$ even case, we give complete grammar rules that establish when a word (finite, infinite or bi-infinite) in $p$ letters is realized by a billiard path. This latter result is roughly stated and not rigor"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we compute these exponential growth rates explicitly when q is even and give bounds when q is odd. Additionally, for the q even case, we give complete grammar rules that establish when a word (finite, infinite or bi-infinite) in p letters is realized by a billiard path.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the new methods relating to minimal tiling paths suffice to give a complete, rigorous characterization of realizable words, and that the previously known equality between language growth rate and topological entropy continues to hold for these specific polygons.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Explicit growth rates for billiard word complexity in hyperbolic (p,q)-polygons for even q, plus complete grammar rules for realizable paths using minimal tiling paths.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Billiard languages in hyperbolic (p,q)-polygons have explicit exponential growth rates for even q and complete grammar rules for realizable words.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b5e39f89c80fdc3efa526dd560c02fa7bb6f10b5bd7829fd1bfb091394d51778"},"source":{"id":"2605.14030","kind":"arxiv","version":1},"verdict":{"id":"c647230e-70f3-4435-add0-a9abdb1ba9fa","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:46:54.370698Z","strongest_claim":"we compute these exponential growth rates explicitly when q is even and give bounds when q is odd. Additionally, for the q even case, we give complete grammar rules that establish when a word (finite, infinite or bi-infinite) in p letters is realized by a billiard path.","one_line_summary":"Explicit growth rates for billiard word complexity in hyperbolic (p,q)-polygons for even q, plus complete grammar rules for realizable paths using minimal tiling paths.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the new methods relating to minimal tiling paths suffice to give a complete, rigorous characterization of realizable words, and that the previously known equality between language growth rate and topological entropy continues to hold for these specific polygons.","pith_extraction_headline":"Billiard languages in hyperbolic (p,q)-polygons have explicit exponential growth rates for even q and complete grammar rules for realizable words."},"references":{"count":92,"sample":[{"doi":"","year":1987,"title":"Katok, A. , TITLE =. Comm. Math. Phys. , FJOURNAL =. 1987 , NUMBER =","work_id":"883666ff-1884-4c6e-8ec4-1a712b220670","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1017/s1446788723000174","year":2024,"title":"Nagar, Anima and Singh, Pradeep , TITLE =. J. Aust. Math. Soc. , FJOURNAL =. 2024 , NUMBER =. doi:10.1017/S1446788723000174 , URL =","work_id":"c7ce1123-d8e6-43ef-8b5a-b8886147b530","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1063/1.166301","year":1998,"title":"Troubetzkoy, S. , TITLE =. Chaos , FJOURNAL =. 1998 , NUMBER =. doi:10.1063/1.166301 , URL =","work_id":"d40c0b74-5786-433a-85f7-c96434ad0148","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Davis, Diana , TITLE =. New York J. Math. , FJOURNAL =. 2014 , PAGES =","work_id":"71c26d46-e0a1-4625-b0a4-dfac1354e1de","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1112/plms/pdq018","year":2011,"title":"Smillie, John and Ulcigrai, Corinna , TITLE =. Proc. Lond. Math. Soc. (3) , FJOURNAL =. 2011 , NUMBER =. doi:10.1112/plms/pdq018 , URL =","work_id":"81f2d831-f3d4-4775-89dd-3d317e55c688","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":92,"snapshot_sha256":"733811a3bb919e37a9102ff497c28c8dc9c2e39e8f4a478c3e03323b04bd5cf1","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"703bde908f2326216801e4297abe283aa40630d2628b36a83da2cbc79e72c1ac"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"c647230e-70f3-4435-add0-a9abdb1ba9fa"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AE4lL4HTkVlFFqTQDFDXyc2suLpK/dwB/W4li2k9R17GfGr72rmNTP9zlzYilSTdXkJZ3sJMgjQsVnZbLRAuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:20:55.226803Z"},"content_sha256":"76a302c0fea15061e1575893896e66c996e0cf3627258bdbad4bcd1f54cc0446","schema_version":"1.0","event_id":"sha256:76a302c0fea15061e1575893896e66c996e0cf3627258bdbad4bcd1f54cc0446"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPAQLX7TC4DO3TA5RX2DXWDANC/bundle.json","state_url":"https://pith.science/pith/IPAQLX7TC4DO3TA5RX2DXWDANC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPAQLX7TC4DO3TA5RX2DXWDANC/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-24T21:20:55Z","links":{"resolver":"https://pith.science/pith/IPAQLX7TC4DO3TA5RX2DXWDANC","bundle":"https://pith.science/pith/IPAQLX7TC4DO3TA5RX2DXWDANC/bundle.json","state":"https://pith.science/pith/IPAQLX7TC4DO3TA5RX2DXWDANC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPAQLX7TC4DO3TA5RX2DXWDANC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IPAQLX7TC4DO3TA5RX2DXWDANC","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":"63e144a2cf2b6e266b9d39f7578b9a26a9e21e52bc6fc6666052efcc672c0b4d","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-13T18:42:31Z","title_canon_sha256":"cc86a128c343ee4d001e143b12a237aaf857c47900d16d3c97acadeaf81fffa0"},"schema_version":"1.0","source":{"id":"2605.14030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14030","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14030v1","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14030","created_at":"2026-05-17T23:39:12Z"},{"alias_kind":"pith_short_12","alias_value":"IPAQLX7TC4DO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IPAQLX7TC4DO3TA5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IPAQLX7T","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:76a302c0fea15061e1575893896e66c996e0cf3627258bdbad4bcd1f54cc0446","target":"graph","created_at":"2026-05-17T23:39:12Z","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 compute these exponential growth rates explicitly when q is even and give bounds when q is odd. Additionally, for the q even case, we give complete grammar rules that establish when a word (finite, infinite or bi-infinite) in p letters is realized by a billiard path."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the new methods relating to minimal tiling paths suffice to give a complete, rigorous characterization of realizable words, and that the previously known equality between language growth rate and topological entropy continues to hold for these specific polygons."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Explicit growth rates for billiard word complexity in hyperbolic (p,q)-polygons for even q, plus complete grammar rules for realizable paths using minimal tiling paths."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Billiard languages in hyperbolic (p,q)-polygons have explicit exponential growth rates for even q and complete grammar rules for realizable words."}],"snapshot_sha256":"b5e39f89c80fdc3efa526dd560c02fa7bb6f10b5bd7829fd1bfb091394d51778"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"703bde908f2326216801e4297abe283aa40630d2628b36a83da2cbc79e72c1ac"},"paper":{"abstract_excerpt":"The complexity of the billiard language of regular polygons in the hyperbolic plane with $p$ sides and $2\\pi/q$ internal angles is known to grow exponentially and the exponential growth rate is known to equal the topological entropy of the billiard system. In this paper we compute these exponential growth rates explicitly when $q$ is even and give bounds when $q$ is odd. Additionally, for the $q$ even case, we give complete grammar rules that establish when a word (finite, infinite or bi-infinite) in $p$ letters is realized by a billiard path. This latter result is roughly stated and not rigor","authors_text":"Jane Wang, Sunrose T. Shrestha","cross_cats":["math.GT"],"headline":"Billiard languages in hyperbolic (p,q)-polygons have explicit exponential growth rates for even q and complete grammar rules for realizable words.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-13T18:42:31Z","title":"Complexity of Billiards in Polygons Associated to Hyperbolic $(p,q)$-Tilings"},"references":{"count":92,"internal_anchors":2,"resolved_work":92,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Katok, A. , TITLE =. Comm. Math. Phys. , FJOURNAL =. 1987 , NUMBER =","work_id":"883666ff-1884-4c6e-8ec4-1a712b220670","year":1987},{"cited_arxiv_id":"","doi":"10.1017/s1446788723000174","is_internal_anchor":false,"ref_index":2,"title":"Nagar, Anima and Singh, Pradeep , TITLE =. J. Aust. Math. Soc. , FJOURNAL =. 2024 , NUMBER =. doi:10.1017/S1446788723000174 , URL =","work_id":"c7ce1123-d8e6-43ef-8b5a-b8886147b530","year":2024},{"cited_arxiv_id":"","doi":"10.1063/1.166301","is_internal_anchor":false,"ref_index":3,"title":"Troubetzkoy, S. , TITLE =. Chaos , FJOURNAL =. 1998 , NUMBER =. doi:10.1063/1.166301 , URL =","work_id":"d40c0b74-5786-433a-85f7-c96434ad0148","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Davis, Diana , TITLE =. New York J. Math. , FJOURNAL =. 2014 , PAGES =","work_id":"71c26d46-e0a1-4625-b0a4-dfac1354e1de","year":2014},{"cited_arxiv_id":"","doi":"10.1112/plms/pdq018","is_internal_anchor":false,"ref_index":5,"title":"Smillie, John and Ulcigrai, Corinna , TITLE =. Proc. Lond. Math. Soc. (3) , FJOURNAL =. 2011 , NUMBER =. doi:10.1112/plms/pdq018 , URL =","work_id":"81f2d831-f3d4-4775-89dd-3d317e55c688","year":2011}],"snapshot_sha256":"733811a3bb919e37a9102ff497c28c8dc9c2e39e8f4a478c3e03323b04bd5cf1"},"source":{"id":"2605.14030","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:46:54.370698Z","id":"c647230e-70f3-4435-add0-a9abdb1ba9fa","model_set":{"reader":"grok-4.3"},"one_line_summary":"Explicit growth rates for billiard word complexity in hyperbolic (p,q)-polygons for even q, plus complete grammar rules for realizable paths using minimal tiling paths.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Billiard languages in hyperbolic (p,q)-polygons have explicit exponential growth rates for even q and complete grammar rules for realizable words.","strongest_claim":"we compute these exponential growth rates explicitly when q is even and give bounds when q is odd. Additionally, for the q even case, we give complete grammar rules that establish when a word (finite, infinite or bi-infinite) in p letters is realized by a billiard path.","weakest_assumption":"That the new methods relating to minimal tiling paths suffice to give a complete, rigorous characterization of realizable words, and that the previously known equality between language growth rate and topological entropy continues to hold for these specific polygons."}},"verdict_id":"c647230e-70f3-4435-add0-a9abdb1ba9fa"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dcd2d859d2734670aa11280c28cc94c7b92c6faf8f1a984ac00ade98ccd3a8eb","target":"record","created_at":"2026-05-17T23:39:12Z","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":"63e144a2cf2b6e266b9d39f7578b9a26a9e21e52bc6fc6666052efcc672c0b4d","cross_cats_sorted":["math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-13T18:42:31Z","title_canon_sha256":"cc86a128c343ee4d001e143b12a237aaf857c47900d16d3c97acadeaf81fffa0"},"schema_version":"1.0","source":{"id":"2605.14030","kind":"arxiv","version":1}},"canonical_sha256":"43c105dff31706edcc1d8df43bd86068b28b7b40740cb9f4ea5326a56d8f6898","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43c105dff31706edcc1d8df43bd86068b28b7b40740cb9f4ea5326a56d8f6898","first_computed_at":"2026-05-17T23:39:12.855019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:12.855019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N2vbquJ0oy6HPjstpJEzhd7xjVJJBeKi3BA93yixq016EaMyQbTewIt5UzIzxZ8iO0CxMPOuWxkj3QTF93w7Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:12.855536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcd2d859d2734670aa11280c28cc94c7b92c6faf8f1a984ac00ade98ccd3a8eb","sha256:76a302c0fea15061e1575893896e66c996e0cf3627258bdbad4bcd1f54cc0446"],"state_sha256":"8394dd572888e6b888f2e10959ecda9cde37d9a3686d0086532be018fd200f20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/Yvh0wfGLat5/AIWvvlXCLQs7AepIVl5QHkb3ThULQWmZ8GiCqQFj+MgzgCZeyWPvVYslauE3wRa7kYVLFTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:20:55.229568Z","bundle_sha256":"d6c345c95f488912cb711eae146a6cdf1a7d3e793d7ad44042b07f404fc7f41c"}}