{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:F3S7D3S2LGFTZR57JK3HJGXIDN","short_pith_number":"pith:F3S7D3S2","canonical_record":{"source":{"id":"2505.20998","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-05-27T10:32:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"15cb4f447117a71d2bfa9707d90b126afc1cb903041258a40aa062823f6d019d","abstract_canon_sha256":"7962139064d6661bc146cac80da839e920c8199bcee5fccf93700600ffe2c3f9"},"schema_version":"1.0"},"canonical_sha256":"2ee5f1ee5a598b3cc7bf4ab6749ae81b6d629d6cd8801fad23e66cd111e1bc98","source":{"kind":"arxiv","id":"2505.20998","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.20998","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"2505.20998v2","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20998","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"F3S7D3S2LGFT","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3S7D3S2LGFTZR57","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3S7D3S2","created_at":"2026-07-23T01:24:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:F3S7D3S2LGFTZR57JK3HJGXIDN","target":"record","payload":{"canonical_record":{"source":{"id":"2505.20998","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-05-27T10:32:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"15cb4f447117a71d2bfa9707d90b126afc1cb903041258a40aa062823f6d019d","abstract_canon_sha256":"7962139064d6661bc146cac80da839e920c8199bcee5fccf93700600ffe2c3f9"},"schema_version":"1.0"},"canonical_sha256":"2ee5f1ee5a598b3cc7bf4ab6749ae81b6d629d6cd8801fad23e66cd111e1bc98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:15.514844Z","signature_b64":"guZA63CG3TPp3Bf5fNR22qJiH8dyekxu8AQGuVet7YTWce0yfgrcOwhplklN2iAd1KIRzzq8ZYttxVWDt37lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee5f1ee5a598b3cc7bf4ab6749ae81b6d629d6cd8801fad23e66cd111e1bc98","last_reissued_at":"2026-07-23T01:24:15.513961Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:15.513961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.20998","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-07-23T01:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dABI9YDvzJU7yl5WXg+fy8n7oKcSvRyPn6fjsMQRhIEkN4WsNd8JwAF52EhFc9BjxbeGp3rB3Fn4z8VdGQDeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:45:38.590476Z"},"content_sha256":"b661155817c2fb773c916de0d7eab31faa959dfe0193a44dbf3ec051bc3a0a83","schema_version":"1.0","event_id":"sha256:b661155817c2fb773c916de0d7eab31faa959dfe0193a44dbf3ec051bc3a0a83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:F3S7D3S2LGFTZR57JK3HJGXIDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compression and complexity for sumset sizes in additive number theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For h-fold sumsets with large diameter, there is a compression algorithm to construct sets with the same sumset size but small diameter.","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Melvyn B. Nathanson","submitted_at":"2025-05-27T10:32:11Z","abstract_excerpt":"The study of sums of finite sets of integers has mostly concentrated on sets with small sumsets (Freiman's theorem and related work) and on sets with large sumsets (Sidon sets and $B_h$-sets). This paper considers the sets ${\\mathcal R}_{\\mathbf Z}(h,k)$ and ${\\mathcal R}_{{\\mathbf Z}^n}(h,k)$ of \\emph{all} sizes of $h$-fold sums of sets of $k$ integers or of $k$ lattice points, and the geometric and computational complexity of the sets ${\\mathcal R}_{\\mathbf Z}(h,k)$ and ${\\mathcal R}_{{\\mathbf Z}^n}(h,k)$. For sumsets $hA$ with large diameter, there is a compression algorithm to construct se"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For sumsets hA with large diameter, there is a compression algorithm to construct sets A' with |hA'| = |hA| and small diameter.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The claim that a compression procedure exists and works for arbitrary finite sets A subset of Z or Z^n whose h-fold sumset has large diameter, without additional restrictions on the structure of A or on the value of h and k (abstract, final paragraph).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper introduces the sets R_Z(h,k) and R_{Z^n}(h,k) collecting all possible cardinalities of hA for |A|=k, studies their complexity, and supplies a diameter-compression algorithm that preserves |hA|.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For h-fold sumsets with large diameter, there is a compression algorithm to construct sets with the same sumset size but small diameter.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"dcd221cdca9dd58ff514b5c95c22b4950cd083477d08b4a9578e5478112a12d4"},"source":{"id":"2505.20998","kind":"arxiv","version":2},"verdict":{"id":"9245ed35-0be9-4fe3-8f88-efc6aa13bfc6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T13:30:53.726208Z","strongest_claim":"For sumsets hA with large diameter, there is a compression algorithm to construct sets A' with |hA'| = |hA| and small diameter.","one_line_summary":"The paper introduces the sets R_Z(h,k) and R_{Z^n}(h,k) collecting all possible cardinalities of hA for |A|=k, studies their complexity, and supplies a diameter-compression algorithm that preserves |hA|.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The claim that a compression procedure exists and works for arbitrary finite sets A subset of Z or Z^n whose h-fold sumset has large diameter, without additional restrictions on the structure of A or on the value of h and k (abstract, final paragraph).","pith_extraction_headline":"For h-fold sumsets with large diameter, there is a compression algorithm to construct sets with the same sumset size but small diameter."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.20998/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":12,"sample":[{"doi":"","year":1983,"title":"Erd˝ os and E","work_id":"c677a85c-3fa1-4fc2-a03b-70c633cfb51c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"J. Fox, N. Kravitz, and S. Zhang, Finer control on relative sizes of iterated susmets, preprint, 2025","work_id":"88a3af5a-b0d8-42fb-9585-21c83b210cc4","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1973,"title":"G. A. Freiman,Foundations of a Structural Theory of Set Addition, American Mathematical Society, Providence, R.I., 1973","work_id":"655e554e-c0d7-490e-98b6-0e8b5de058cb","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"G. A. Freiman, What is the structure ofKifK+Kis small?, in:Number Theory, New York 1984–85, Springer-Verlag, New York, 1987, pages 109–134","work_id":"6d0ebcaa-7f99-4b4a-bce7-2dbfbf9e3b9d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"Hegyv´ ari, On representation problems in the additive number theory, Acta Math","work_id":"3988a53d-29df-47d0-bb92-a270cdeb2518","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"2f977480c921717f958f52f55c64eaf77cace2d12b6009c3a2bc89b9d8a4e4f9","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0b31956016071212881602d8563e552552140437769824550df9d64c1d32445c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9245ed35-0be9-4fe3-8f88-efc6aa13bfc6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-23T01:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"astGDWQ3fflGjfR7kePU8xN1SS1o5Cy7nBWODXPCUaGrYZOstcLGcQjWez1nhsRzRklRQUveFYQSIPxc6HaQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:45:38.592090Z"},"content_sha256":"957a884171ec7b18ebbc1288fa0dc4e5c042ecb95b3cb4f91e870a52eebb53d3","schema_version":"1.0","event_id":"sha256:957a884171ec7b18ebbc1288fa0dc4e5c042ecb95b3cb4f91e870a52eebb53d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3S7D3S2LGFTZR57JK3HJGXIDN/bundle.json","state_url":"https://pith.science/pith/F3S7D3S2LGFTZR57JK3HJGXIDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3S7D3S2LGFTZR57JK3HJGXIDN/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-08-09T15:45:38Z","links":{"resolver":"https://pith.science/pith/F3S7D3S2LGFTZR57JK3HJGXIDN","bundle":"https://pith.science/pith/F3S7D3S2LGFTZR57JK3HJGXIDN/bundle.json","state":"https://pith.science/pith/F3S7D3S2LGFTZR57JK3HJGXIDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3S7D3S2LGFTZR57JK3HJGXIDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:F3S7D3S2LGFTZR57JK3HJGXIDN","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":"7962139064d6661bc146cac80da839e920c8199bcee5fccf93700600ffe2c3f9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-05-27T10:32:11Z","title_canon_sha256":"15cb4f447117a71d2bfa9707d90b126afc1cb903041258a40aa062823f6d019d"},"schema_version":"1.0","source":{"id":"2505.20998","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.20998","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"2505.20998v2","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20998","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"F3S7D3S2LGFT","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3S7D3S2LGFTZR57","created_at":"2026-07-23T01:24:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3S7D3S2","created_at":"2026-07-23T01:24:15Z"}],"graph_snapshots":[{"event_id":"sha256:957a884171ec7b18ebbc1288fa0dc4e5c042ecb95b3cb4f91e870a52eebb53d3","target":"graph","created_at":"2026-07-23T01:24:15Z","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":"For sumsets hA with large diameter, there is a compression algorithm to construct sets A' with |hA'| = |hA| and small diameter."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The claim that a compression procedure exists and works for arbitrary finite sets A subset of Z or Z^n whose h-fold sumset has large diameter, without additional restrictions on the structure of A or on the value of h and k (abstract, final paragraph)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper introduces the sets R_Z(h,k) and R_{Z^n}(h,k) collecting all possible cardinalities of hA for |A|=k, studies their complexity, and supplies a diameter-compression algorithm that preserves |hA|."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For h-fold sumsets with large diameter, there is a compression algorithm to construct sets with the same sumset size but small diameter."}],"snapshot_sha256":"dcd221cdca9dd58ff514b5c95c22b4950cd083477d08b4a9578e5478112a12d4"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0b31956016071212881602d8563e552552140437769824550df9d64c1d32445c"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.20998/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The study of sums of finite sets of integers has mostly concentrated on sets with small sumsets (Freiman's theorem and related work) and on sets with large sumsets (Sidon sets and $B_h$-sets). This paper considers the sets ${\\mathcal R}_{\\mathbf Z}(h,k)$ and ${\\mathcal R}_{{\\mathbf Z}^n}(h,k)$ of \\emph{all} sizes of $h$-fold sums of sets of $k$ integers or of $k$ lattice points, and the geometric and computational complexity of the sets ${\\mathcal R}_{\\mathbf Z}(h,k)$ and ${\\mathcal R}_{{\\mathbf Z}^n}(h,k)$. For sumsets $hA$ with large diameter, there is a compression algorithm to construct se","authors_text":"Melvyn B. Nathanson","cross_cats":["math.CO"],"headline":"For h-fold sumsets with large diameter, there is a compression algorithm to construct sets with the same sumset size but small diameter.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-05-27T10:32:11Z","title":"Compression and complexity for sumset sizes in additive number theory"},"references":{"count":12,"internal_anchors":1,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Erd˝ os and E","work_id":"c677a85c-3fa1-4fc2-a03b-70c633cfb51c","year":1983},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"J. Fox, N. Kravitz, and S. Zhang, Finer control on relative sizes of iterated susmets, preprint, 2025","work_id":"88a3af5a-b0d8-42fb-9585-21c83b210cc4","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"G. A. Freiman,Foundations of a Structural Theory of Set Addition, American Mathematical Society, Providence, R.I., 1973","work_id":"655e554e-c0d7-490e-98b6-0e8b5de058cb","year":1973},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"G. A. Freiman, What is the structure ofKifK+Kis small?, in:Number Theory, New York 1984–85, Springer-Verlag, New York, 1987, pages 109–134","work_id":"6d0ebcaa-7f99-4b4a-bce7-2dbfbf9e3b9d","year":1984},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Hegyv´ ari, On representation problems in the additive number theory, Acta Math","work_id":"3988a53d-29df-47d0-bb92-a270cdeb2518","year":1996}],"snapshot_sha256":"2f977480c921717f958f52f55c64eaf77cace2d12b6009c3a2bc89b9d8a4e4f9"},"source":{"id":"2505.20998","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-19T13:30:53.726208Z","id":"9245ed35-0be9-4fe3-8f88-efc6aa13bfc6","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper introduces the sets R_Z(h,k) and R_{Z^n}(h,k) collecting all possible cardinalities of hA for |A|=k, studies their complexity, and supplies a diameter-compression algorithm that preserves |hA|.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For h-fold sumsets with large diameter, there is a compression algorithm to construct sets with the same sumset size but small diameter.","strongest_claim":"For sumsets hA with large diameter, there is a compression algorithm to construct sets A' with |hA'| = |hA| and small diameter.","weakest_assumption":"The claim that a compression procedure exists and works for arbitrary finite sets A subset of Z or Z^n whose h-fold sumset has large diameter, without additional restrictions on the structure of A or on the value of h and k (abstract, final paragraph)."}},"verdict_id":"9245ed35-0be9-4fe3-8f88-efc6aa13bfc6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b661155817c2fb773c916de0d7eab31faa959dfe0193a44dbf3ec051bc3a0a83","target":"record","created_at":"2026-07-23T01:24:15Z","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":"7962139064d6661bc146cac80da839e920c8199bcee5fccf93700600ffe2c3f9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-05-27T10:32:11Z","title_canon_sha256":"15cb4f447117a71d2bfa9707d90b126afc1cb903041258a40aa062823f6d019d"},"schema_version":"1.0","source":{"id":"2505.20998","kind":"arxiv","version":2}},"canonical_sha256":"2ee5f1ee5a598b3cc7bf4ab6749ae81b6d629d6cd8801fad23e66cd111e1bc98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ee5f1ee5a598b3cc7bf4ab6749ae81b6d629d6cd8801fad23e66cd111e1bc98","first_computed_at":"2026-07-23T01:24:15.513961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:24:15.513961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"guZA63CG3TPp3Bf5fNR22qJiH8dyekxu8AQGuVet7YTWce0yfgrcOwhplklN2iAd1KIRzzq8ZYttxVWDt37lCQ==","signature_status":"signed_v1","signed_at":"2026-07-23T01:24:15.514844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.20998","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b661155817c2fb773c916de0d7eab31faa959dfe0193a44dbf3ec051bc3a0a83","sha256:957a884171ec7b18ebbc1288fa0dc4e5c042ecb95b3cb4f91e870a52eebb53d3"],"state_sha256":"76b32cfb6dc447ae22c80d2839cb3de98361a7befb672e0fc07e62b8c30cf7c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDIK8D0df4AFrdHFVQEutT3XILsSClP4niiasGIbMKIvtKeHSq6XFigl+yWZmlOQTAZkLOZ2feqqpSUBgQtnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:45:38.600702Z","bundle_sha256":"b6991f2636f325cbb2eb77d7c30570c4e70964c8a8a166b2d80bfbabb531a655"}}