{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ONZGOQM42J6QA3OOYSABTUT3YR","short_pith_number":"pith:ONZGOQM4","canonical_record":{"source":{"id":"2605.13690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:43:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0a9d963a621e306dae82d111ae450d6fe7b193e3fe13a55a231a5130ff9d1c1d","abstract_canon_sha256":"115e16bca46a1d3feb9a42ff7f73d7b13f09e8168534881910127ab29e941cf1"},"schema_version":"1.0"},"canonical_sha256":"737267419cd27d006dcec48019d27bc442a195006f56a37d51bef15cf9a0cf51","source":{"kind":"arxiv","id":"2605.13690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13690","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13690v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13690","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"ONZGOQM42J6Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ONZGOQM42J6QA3OO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ONZGOQM4","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ONZGOQM42J6QA3OOYSABTUT3YR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:43:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0a9d963a621e306dae82d111ae450d6fe7b193e3fe13a55a231a5130ff9d1c1d","abstract_canon_sha256":"115e16bca46a1d3feb9a42ff7f73d7b13f09e8168534881910127ab29e941cf1"},"schema_version":"1.0"},"canonical_sha256":"737267419cd27d006dcec48019d27bc442a195006f56a37d51bef15cf9a0cf51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:16.958665Z","signature_b64":"pHjFeEk6JcTB4/UA6UAUzolI9m+7yc3Tc+5jXtJIjONXDdkHbNZeW3YCYQUmh0B4wWtOd9LU0qmkUMbID53cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737267419cd27d006dcec48019d27bc442a195006f56a37d51bef15cf9a0cf51","last_reissued_at":"2026-05-18T02:44:16.958155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:16.958155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13690","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-18T02:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQAT8Zn+wRwI4HNhwqt0ZJkxO0SOxveIQ/9ZWEhy7KZKduI7XXCy0sufBK230MwIOeXzM6u3aJHLASQKiqrHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:23:08.957530Z"},"content_sha256":"9a1bfadc79b8cdd9de2ba88b792afc3e4e209c25ec993e2af224333b7dbc0522","schema_version":"1.0","event_id":"sha256:9a1bfadc79b8cdd9de2ba88b792afc3e4e209c25ec993e2af224333b7dbc0522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ONZGOQM42J6QA3OOYSABTUT3YR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The WidthWall: A Strict Expressivity Hierarchy for Hypergraph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Hypergraph neural networks cannot represent invariants beyond a fixed hypertree width.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Basel Alomair, Bhaskar Ramasubramanian, Fengqing Jiang, Kaiyuan Zheng, Linda Bushnell, Luyao Niu, Radha Poovendran, Yichen Feng, Yuetai Li","submitted_at":"2026-05-13T15:43:31Z","abstract_excerpt":"Hypergraphs provide a natural framework to model higher-order interactions in scientific, social, and biological systems. Hypergraph neural networks (HGNNs) aim to learn from such data, yet it remains unclear which higher-order structures these models can represent. We show that hypergraph expressivity is governed by which small patterns an architecture can detect and count. We formalize this via homomorphism densities, which measure how often a structural motif appears in a hypergraph. Combining classical homomorphism-count completeness with invariant approximation, we show that homomorphism "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Combining classical homomorphism-count completeness with invariant approximation, we show that homomorphism densities generate all continuous hypergraph invariants and organize them into a strict hierarchy indexed by hypertree width. This yields a Width Wall: a fundamental architectural limit beyond which no hidden dimension, training procedure or fixed-depth HGNN can represent invariants requiring wider patterns.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That homomorphism densities together with invariant approximation fully capture the continuous invariants relevant to HGNN expressivity and that the resulting hierarchy is strict for every architecture considered.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Hypergraph neural networks obey a strict expressivity hierarchy indexed by hypertree width, creating a Width Wall that no fixed-depth model, hidden dimension, or training procedure can cross for wider patterns.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Hypergraph neural networks cannot represent invariants beyond a fixed hypertree width.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c910d969ef442e08b81dc521539943bf636f144365b3539207affa41a2281f57"},"source":{"id":"2605.13690","kind":"arxiv","version":1},"verdict":{"id":"3ff6ffca-e590-4fbd-a358-6db90ab420a2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:22:38.410398Z","strongest_claim":"Combining classical homomorphism-count completeness with invariant approximation, we show that homomorphism densities generate all continuous hypergraph invariants and organize them into a strict hierarchy indexed by hypertree width. This yields a Width Wall: a fundamental architectural limit beyond which no hidden dimension, training procedure or fixed-depth HGNN can represent invariants requiring wider patterns.","one_line_summary":"Hypergraph neural networks obey a strict expressivity hierarchy indexed by hypertree width, creating a Width Wall that no fixed-depth model, hidden dimension, or training procedure can cross for wider patterns.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That homomorphism densities together with invariant approximation fully capture the continuous invariants relevant to HGNN expressivity and that the resulting hierarchy is strict for every architecture considered.","pith_extraction_headline":"Hypergraph neural networks cannot represent invariants beyond a fixed hypertree width."},"references":{"count":72,"sample":[{"doi":"","year":2008,"title":"Absil, Robert Mahony, and Rodolphe Sepulchre.Optimization Algorithms on Matrix Manifolds","work_id":"12794602-3726-460a-92ca-c1963ed769cb","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1925,"title":"Ranking via sinkhorn propagation","work_id":"4e08ffd3-43dd-41fb-bc7f-7102299cbf0e","ref_index":2,"cited_arxiv_id":"1106.1925","is_internal_anchor":true},{"doi":"","year":2010,"title":"Gupta, Stevan Rudinac, and Marcel Worring","work_id":"0c6cd7f6-f624-4d82-a47d-e6e5817f8b15","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Parameter-free hypergraph neural network for few-shot node classification.Advances in Neural Information Processing Systems (NeurIPS), 2025","work_id":"8dcbce81-25e1-40ce-803c-c6603731adef","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Peter L. Bartlett, Dylan J. Foster, and Matus J. Telgarsky. Spectrally-normalized margin bounds for neural networks. InAdvances in Neural Information Processing Systems (NeurIPS), 2017","work_id":"b180bb14-f8fc-4ee8-baf1-9a71eba205cc","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":72,"snapshot_sha256":"e760137152eaa9aac6615221e50a73a8fbf5b09d2e464f4a6a20407f0070a3d1","internal_anchors":2},"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":"3ff6ffca-e590-4fbd-a358-6db90ab420a2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68tAjvPnEB/IqdJIurwctuS3g65VxU5Wy9DQeSiY6sSQA0yb6qXv06dnGjE/8WvbH1PprUwd2+DFSyH/WUmzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:23:08.958036Z"},"content_sha256":"6f768f9ee07c425a2b4aeeb0cb0ea4dc55f5118a06a200cab6caeea974691a57","schema_version":"1.0","event_id":"sha256:6f768f9ee07c425a2b4aeeb0cb0ea4dc55f5118a06a200cab6caeea974691a57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONZGOQM42J6QA3OOYSABTUT3YR/bundle.json","state_url":"https://pith.science/pith/ONZGOQM42J6QA3OOYSABTUT3YR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONZGOQM42J6QA3OOYSABTUT3YR/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-30T14:23:08Z","links":{"resolver":"https://pith.science/pith/ONZGOQM42J6QA3OOYSABTUT3YR","bundle":"https://pith.science/pith/ONZGOQM42J6QA3OOYSABTUT3YR/bundle.json","state":"https://pith.science/pith/ONZGOQM42J6QA3OOYSABTUT3YR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONZGOQM42J6QA3OOYSABTUT3YR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ONZGOQM42J6QA3OOYSABTUT3YR","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":"115e16bca46a1d3feb9a42ff7f73d7b13f09e8168534881910127ab29e941cf1","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:43:31Z","title_canon_sha256":"0a9d963a621e306dae82d111ae450d6fe7b193e3fe13a55a231a5130ff9d1c1d"},"schema_version":"1.0","source":{"id":"2605.13690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13690","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13690v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13690","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"ONZGOQM42J6Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ONZGOQM42J6QA3OO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ONZGOQM4","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:6f768f9ee07c425a2b4aeeb0cb0ea4dc55f5118a06a200cab6caeea974691a57","target":"graph","created_at":"2026-05-18T02:44:16Z","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":"Combining classical homomorphism-count completeness with invariant approximation, we show that homomorphism densities generate all continuous hypergraph invariants and organize them into a strict hierarchy indexed by hypertree width. This yields a Width Wall: a fundamental architectural limit beyond which no hidden dimension, training procedure or fixed-depth HGNN can represent invariants requiring wider patterns."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That homomorphism densities together with invariant approximation fully capture the continuous invariants relevant to HGNN expressivity and that the resulting hierarchy is strict for every architecture considered."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Hypergraph neural networks obey a strict expressivity hierarchy indexed by hypertree width, creating a Width Wall that no fixed-depth model, hidden dimension, or training procedure can cross for wider patterns."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Hypergraph neural networks cannot represent invariants beyond a fixed hypertree width."}],"snapshot_sha256":"c910d969ef442e08b81dc521539943bf636f144365b3539207affa41a2281f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Hypergraphs provide a natural framework to model higher-order interactions in scientific, social, and biological systems. Hypergraph neural networks (HGNNs) aim to learn from such data, yet it remains unclear which higher-order structures these models can represent. We show that hypergraph expressivity is governed by which small patterns an architecture can detect and count. We formalize this via homomorphism densities, which measure how often a structural motif appears in a hypergraph. Combining classical homomorphism-count completeness with invariant approximation, we show that homomorphism ","authors_text":"Basel Alomair, Bhaskar Ramasubramanian, Fengqing Jiang, Kaiyuan Zheng, Linda Bushnell, Luyao Niu, Radha Poovendran, Yichen Feng, Yuetai Li","cross_cats":["cs.AI"],"headline":"Hypergraph neural networks cannot represent invariants beyond a fixed hypertree width.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:43:31Z","title":"The WidthWall: A Strict Expressivity Hierarchy for Hypergraph Neural Networks"},"references":{"count":72,"internal_anchors":2,"resolved_work":72,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Absil, Robert Mahony, and Rodolphe Sepulchre.Optimization Algorithms on Matrix Manifolds","work_id":"12794602-3726-460a-92ca-c1963ed769cb","year":2008},{"cited_arxiv_id":"1106.1925","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Ranking via sinkhorn propagation","work_id":"4e08ffd3-43dd-41fb-bc7f-7102299cbf0e","year":1925},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Gupta, Stevan Rudinac, and Marcel Worring","work_id":"0c6cd7f6-f624-4d82-a47d-e6e5817f8b15","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Parameter-free hypergraph neural network for few-shot node classification.Advances in Neural Information Processing Systems (NeurIPS), 2025","work_id":"8dcbce81-25e1-40ce-803c-c6603731adef","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Peter L. Bartlett, Dylan J. Foster, and Matus J. Telgarsky. Spectrally-normalized margin bounds for neural networks. InAdvances in Neural Information Processing Systems (NeurIPS), 2017","work_id":"b180bb14-f8fc-4ee8-baf1-9a71eba205cc","year":2017}],"snapshot_sha256":"e760137152eaa9aac6615221e50a73a8fbf5b09d2e464f4a6a20407f0070a3d1"},"source":{"id":"2605.13690","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:22:38.410398Z","id":"3ff6ffca-e590-4fbd-a358-6db90ab420a2","model_set":{"reader":"grok-4.3"},"one_line_summary":"Hypergraph neural networks obey a strict expressivity hierarchy indexed by hypertree width, creating a Width Wall that no fixed-depth model, hidden dimension, or training procedure can cross for wider patterns.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Hypergraph neural networks cannot represent invariants beyond a fixed hypertree width.","strongest_claim":"Combining classical homomorphism-count completeness with invariant approximation, we show that homomorphism densities generate all continuous hypergraph invariants and organize them into a strict hierarchy indexed by hypertree width. This yields a Width Wall: a fundamental architectural limit beyond which no hidden dimension, training procedure or fixed-depth HGNN can represent invariants requiring wider patterns.","weakest_assumption":"That homomorphism densities together with invariant approximation fully capture the continuous invariants relevant to HGNN expressivity and that the resulting hierarchy is strict for every architecture considered."}},"verdict_id":"3ff6ffca-e590-4fbd-a358-6db90ab420a2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9a1bfadc79b8cdd9de2ba88b792afc3e4e209c25ec993e2af224333b7dbc0522","target":"record","created_at":"2026-05-18T02:44:16Z","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":"115e16bca46a1d3feb9a42ff7f73d7b13f09e8168534881910127ab29e941cf1","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:43:31Z","title_canon_sha256":"0a9d963a621e306dae82d111ae450d6fe7b193e3fe13a55a231a5130ff9d1c1d"},"schema_version":"1.0","source":{"id":"2605.13690","kind":"arxiv","version":1}},"canonical_sha256":"737267419cd27d006dcec48019d27bc442a195006f56a37d51bef15cf9a0cf51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"737267419cd27d006dcec48019d27bc442a195006f56a37d51bef15cf9a0cf51","first_computed_at":"2026-05-18T02:44:16.958155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:16.958155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pHjFeEk6JcTB4/UA6UAUzolI9m+7yc3Tc+5jXtJIjONXDdkHbNZeW3YCYQUmh0B4wWtOd9LU0qmkUMbID53cAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:16.958665Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a1bfadc79b8cdd9de2ba88b792afc3e4e209c25ec993e2af224333b7dbc0522","sha256:6f768f9ee07c425a2b4aeeb0cb0ea4dc55f5118a06a200cab6caeea974691a57"],"state_sha256":"5370e069674cfcd431f30f1c28cbeecd6f39d0733588a1c4af19dd81794949a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUn3HFKD4iAiecxp5HHJpcsv3MyzIpzVzxcOZumyopsWXIEDJg23QEFoi1e/cAxteA9JGetNNMbfUxhEX4cKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:23:08.960482Z","bundle_sha256":"08523880d56b8bbcf82b95d9b13f544c0c92854655ceab861091dec891317f25"}}