{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:B6V3D5GUS4CF3TKN3JEMLBC7CY","short_pith_number":"pith:B6V3D5GU","canonical_record":{"source":{"id":"2601.08929","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-13T19:09:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f1484ceff67644f2fe001cef2f926c4a94c0a13fcd71ee32ed1e023b45a1795","abstract_canon_sha256":"76cb0e1841cf9733024256918b40c680caa7ba07b955a674a95f70c6b049b040"},"schema_version":"1.0"},"canonical_sha256":"0fabb1f4d497045dcd4dda48c5845f163e99b9d05254cc2b05e35a70e436fc8f","source":{"kind":"arxiv","id":"2601.08929","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.08929","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2601.08929v3","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.08929","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"B6V3D5GUS4CF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"B6V3D5GUS4CF3TKN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"B6V3D5GU","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:B6V3D5GUS4CF3TKN3JEMLBC7CY","target":"record","payload":{"canonical_record":{"source":{"id":"2601.08929","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-13T19:09:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f1484ceff67644f2fe001cef2f926c4a94c0a13fcd71ee32ed1e023b45a1795","abstract_canon_sha256":"76cb0e1841cf9733024256918b40c680caa7ba07b955a674a95f70c6b049b040"},"schema_version":"1.0"},"canonical_sha256":"0fabb1f4d497045dcd4dda48c5845f163e99b9d05254cc2b05e35a70e436fc8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:00.248936Z","signature_b64":"ormb7Ztrr9NkIVPWJzzb2km3bATR/FdGRI6PVH06MaH1wsYWoj2CXJqBm1m4ab5v9oVezz/2MO1Y4CsR/Or1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fabb1f4d497045dcd4dda48c5845f163e99b9d05254cc2b05e35a70e436fc8f","last_reissued_at":"2026-05-17T23:39:00.248211Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:00.248211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.08929","source_version":3,"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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLtQoXwAtPnJ4tD5UfvkZlwjBPpHGIE+y8UFDThkMsaoougGZP9BEruOLycyHlbe3nI+P2k+xgA8YXhMK9LdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:06:41.198772Z"},"content_sha256":"29adfdc473cc71facdf35bd190b8fe092eb718504a4cadc9e4f507ddf4439296","schema_version":"1.0","event_id":"sha256:29adfdc473cc71facdf35bd190b8fe092eb718504a4cadc9e4f507ddf4439296"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:B6V3D5GUS4CF3TKN3JEMLBC7CY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Global Characterization of $f$-Divergences Yielding PSD Mutual-Information Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Mutual-information matrices from f-divergences are positive semidefinite for all finite alphabets precisely when the normalized generator expands as a power series with nonnegative coefficients that converges on all positive reals.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Zachary Robertson","submitted_at":"2026-01-13T19:09:19Z","abstract_excerpt":"Given $n$ random variables, when does the matrix of pairwise $f$-mutual informations define a PSD kernel over variables? For convex finite generators $f:(0,\\infty)\\to\\mathbb{R}$ with $f(1)=0$ and finite boundary value $f(0)$, we give a closed characterization up to linear transformation $f\\sim f+c(t-1)$, which leaves every $f$-divergence and every $f$-mutual-information matrix unchanged. The matrix $M^{(f)}_{ij}:=I_f(X_i;X_j)$ is PSD for every finite-alphabet family if and only if the normalized representative has a globally convergent expansion $\\bar f(t)=\\sum_{m\\ge2}a_m(t-1)^m$, with $a_m\\ge"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The matrix M^{(f)}_{ij}:=I_f(X_i;X_j) is PSD for every finite-alphabet family if and only if the normalized representative has a globally convergent expansion bar f(t)=sum_{m>=2} a_m (t-1)^m, with a_m >=0, on all of (0,infty).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the local positivity condition at t=1, extracted via biased three-point kernels and the BGKP theorem, extends to global analyticity and holds for all finite alphabets without additional restrictions on the divergence.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Pairwise f-mutual information matrices are positive semi-definite for all finite-alphabet distributions exactly when the f generator has a power series with all nonnegative coefficients that converges on the positive reals.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Mutual-information matrices from f-divergences are positive semidefinite for all finite alphabets precisely when the normalized generator expands as a power series with nonnegative coefficients that converges on all positive reals.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"36331d8bbc5663bf801ff50a529b67cdf3a5bfe52d44b6c1ea131f258c778c73"},"source":{"id":"2601.08929","kind":"arxiv","version":3},"verdict":{"id":"995b01ac-db5b-467b-9b40-ee43b482cacd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T14:19:49.410149Z","strongest_claim":"The matrix M^{(f)}_{ij}:=I_f(X_i;X_j) is PSD for every finite-alphabet family if and only if the normalized representative has a globally convergent expansion bar f(t)=sum_{m>=2} a_m (t-1)^m, with a_m >=0, on all of (0,infty).","one_line_summary":"Pairwise f-mutual information matrices are positive semi-definite for all finite-alphabet distributions exactly when the f generator has a power series with all nonnegative coefficients that converges on the positive reals.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the local positivity condition at t=1, extracted via biased three-point kernels and the BGKP theorem, extends to global analyticity and holds for all finite alphabets without additional restrictions on the divergence.","pith_extraction_headline":"Mutual-information matrices from f-divergences are positive semidefinite for all finite alphabets precisely when the normalized generator expands as a power series with nonnegative coefficients that converges on all positive reals."},"references":{"count":15,"sample":[{"doi":"","year":2002,"title":"The mutual information: detecting and evaluating dependencies between variables,","work_id":"fea514a5-c474-40a4-8191-09cb088b6324","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"Detecting novel associations in large data sets,","work_id":"2a29cb7f-f51c-4e07-9aaa-8f1c8b20f120","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"G. Ver Steeg and A. Galstyan, “The information sieve,” inInternational Conference on Machine Learning. PMLR, 2015, pp. 164–172","work_id":"4e6194ae-cd5c-40d0-a24d-0c71dbf85498","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"How transformers learn causal structure with gradient descent","work_id":"15b3610a-8bd8-4edd-9296-a4ad1ee0cbaf","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Mutual information matrices are not always positive semidefinite,","work_id":"e1cede26-bd45-4e22-9829-14606a05006e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"bde82dbe5d38aa658d2913bdc2b1bcb600aa6d2d561b5adcc8088e589eb7196c","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5f66a16c9e181e8738c401ff9bc9cc1d217565dcb9d3d95330702f1659fe1abc"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"995b01ac-db5b-467b-9b40-ee43b482cacd"},"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:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOohf3+SUxChjmZvWo0ZC4VA7jLzgixJmf7LCjiLmqptHWRAp8KtA/eY5VS9wcdhJypL/X9wZ42ZH7Parq+KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:06:41.199428Z"},"content_sha256":"4c7e49472ac6853c52998215a13dbf2c49d65147c48ad90e239b85677ef84ba7","schema_version":"1.0","event_id":"sha256:4c7e49472ac6853c52998215a13dbf2c49d65147c48ad90e239b85677ef84ba7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6V3D5GUS4CF3TKN3JEMLBC7CY/bundle.json","state_url":"https://pith.science/pith/B6V3D5GUS4CF3TKN3JEMLBC7CY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6V3D5GUS4CF3TKN3JEMLBC7CY/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-28T11:06:41Z","links":{"resolver":"https://pith.science/pith/B6V3D5GUS4CF3TKN3JEMLBC7CY","bundle":"https://pith.science/pith/B6V3D5GUS4CF3TKN3JEMLBC7CY/bundle.json","state":"https://pith.science/pith/B6V3D5GUS4CF3TKN3JEMLBC7CY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6V3D5GUS4CF3TKN3JEMLBC7CY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B6V3D5GUS4CF3TKN3JEMLBC7CY","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":"76cb0e1841cf9733024256918b40c680caa7ba07b955a674a95f70c6b049b040","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-13T19:09:19Z","title_canon_sha256":"9f1484ceff67644f2fe001cef2f926c4a94c0a13fcd71ee32ed1e023b45a1795"},"schema_version":"1.0","source":{"id":"2601.08929","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.08929","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2601.08929v3","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.08929","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"B6V3D5GUS4CF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"B6V3D5GUS4CF3TKN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"B6V3D5GU","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4c7e49472ac6853c52998215a13dbf2c49d65147c48ad90e239b85677ef84ba7","target":"graph","created_at":"2026-05-17T23:39:00Z","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":"The matrix M^{(f)}_{ij}:=I_f(X_i;X_j) is PSD for every finite-alphabet family if and only if the normalized representative has a globally convergent expansion bar f(t)=sum_{m>=2} a_m (t-1)^m, with a_m >=0, on all of (0,infty)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the local positivity condition at t=1, extracted via biased three-point kernels and the BGKP theorem, extends to global analyticity and holds for all finite alphabets without additional restrictions on the divergence."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Pairwise f-mutual information matrices are positive semi-definite for all finite-alphabet distributions exactly when the f generator has a power series with all nonnegative coefficients that converges on the positive reals."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Mutual-information matrices from f-divergences are positive semidefinite for all finite alphabets precisely when the normalized generator expands as a power series with nonnegative coefficients that converges on all positive reals."}],"snapshot_sha256":"36331d8bbc5663bf801ff50a529b67cdf3a5bfe52d44b6c1ea131f258c778c73"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5f66a16c9e181e8738c401ff9bc9cc1d217565dcb9d3d95330702f1659fe1abc"},"paper":{"abstract_excerpt":"Given $n$ random variables, when does the matrix of pairwise $f$-mutual informations define a PSD kernel over variables? For convex finite generators $f:(0,\\infty)\\to\\mathbb{R}$ with $f(1)=0$ and finite boundary value $f(0)$, we give a closed characterization up to linear transformation $f\\sim f+c(t-1)$, which leaves every $f$-divergence and every $f$-mutual-information matrix unchanged. The matrix $M^{(f)}_{ij}:=I_f(X_i;X_j)$ is PSD for every finite-alphabet family if and only if the normalized representative has a globally convergent expansion $\\bar f(t)=\\sum_{m\\ge2}a_m(t-1)^m$, with $a_m\\ge","authors_text":"Zachary Robertson","cross_cats":["math.IT"],"headline":"Mutual-information matrices from f-divergences are positive semidefinite for all finite alphabets precisely when the normalized generator expands as a power series with nonnegative coefficients that converges on all positive reals.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-13T19:09:19Z","title":"A Global Characterization of $f$-Divergences Yielding PSD Mutual-Information Matrices"},"references":{"count":15,"internal_anchors":0,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"The mutual information: detecting and evaluating dependencies between variables,","work_id":"fea514a5-c474-40a4-8191-09cb088b6324","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Detecting novel associations in large data sets,","work_id":"2a29cb7f-f51c-4e07-9aaa-8f1c8b20f120","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"G. Ver Steeg and A. Galstyan, “The information sieve,” inInternational Conference on Machine Learning. PMLR, 2015, pp. 164–172","work_id":"4e6194ae-cd5c-40d0-a24d-0c71dbf85498","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"How transformers learn causal structure with gradient descent","work_id":"15b3610a-8bd8-4edd-9296-a4ad1ee0cbaf","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Mutual information matrices are not always positive semidefinite,","work_id":"e1cede26-bd45-4e22-9829-14606a05006e","year":2014}],"snapshot_sha256":"bde82dbe5d38aa658d2913bdc2b1bcb600aa6d2d561b5adcc8088e589eb7196c"},"source":{"id":"2601.08929","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T14:19:49.410149Z","id":"995b01ac-db5b-467b-9b40-ee43b482cacd","model_set":{"reader":"grok-4.3"},"one_line_summary":"Pairwise f-mutual information matrices are positive semi-definite for all finite-alphabet distributions exactly when the f generator has a power series with all nonnegative coefficients that converges on the positive reals.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Mutual-information matrices from f-divergences are positive semidefinite for all finite alphabets precisely when the normalized generator expands as a power series with nonnegative coefficients that converges on all positive reals.","strongest_claim":"The matrix M^{(f)}_{ij}:=I_f(X_i;X_j) is PSD for every finite-alphabet family if and only if the normalized representative has a globally convergent expansion bar f(t)=sum_{m>=2} a_m (t-1)^m, with a_m >=0, on all of (0,infty).","weakest_assumption":"That the local positivity condition at t=1, extracted via biased three-point kernels and the BGKP theorem, extends to global analyticity and holds for all finite alphabets without additional restrictions on the divergence."}},"verdict_id":"995b01ac-db5b-467b-9b40-ee43b482cacd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:29adfdc473cc71facdf35bd190b8fe092eb718504a4cadc9e4f507ddf4439296","target":"record","created_at":"2026-05-17T23:39:00Z","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":"76cb0e1841cf9733024256918b40c680caa7ba07b955a674a95f70c6b049b040","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-01-13T19:09:19Z","title_canon_sha256":"9f1484ceff67644f2fe001cef2f926c4a94c0a13fcd71ee32ed1e023b45a1795"},"schema_version":"1.0","source":{"id":"2601.08929","kind":"arxiv","version":3}},"canonical_sha256":"0fabb1f4d497045dcd4dda48c5845f163e99b9d05254cc2b05e35a70e436fc8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fabb1f4d497045dcd4dda48c5845f163e99b9d05254cc2b05e35a70e436fc8f","first_computed_at":"2026-05-17T23:39:00.248211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:00.248211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ormb7Ztrr9NkIVPWJzzb2km3bATR/FdGRI6PVH06MaH1wsYWoj2CXJqBm1m4ab5v9oVezz/2MO1Y4CsR/Or1Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:00.248936Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.08929","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29adfdc473cc71facdf35bd190b8fe092eb718504a4cadc9e4f507ddf4439296","sha256:4c7e49472ac6853c52998215a13dbf2c49d65147c48ad90e239b85677ef84ba7"],"state_sha256":"3e69f950aafe231271015ea3d6640db5a61d4443f7e687e37c5e07acc230edd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lifqupp8xPhWB9v6OLlOqPjIpAqn2YSM7eftkkIiq+LT6VlRJBf7GmDWDT6apHvQhdoxzgEeGy9rYBQBbmAzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:06:41.202429Z","bundle_sha256":"48c6fe3bede36578f70d309f258e40d1e5f819d66315494e45497be4632cd551"}}