{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SLOQUP34GUNX5IHU53ELKW63HD","short_pith_number":"pith:SLOQUP34","canonical_record":{"source":{"id":"2605.12901","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-13T02:25:09Z","cross_cats_sorted":["stat.AP","stat.CO"],"title_canon_sha256":"b5c8dba113ed6906ec1511f9090a0742ad2d68a18f6bb974dcbf0ddb96872153","abstract_canon_sha256":"fda8c4001440f57cbe9a8f61d25cc8caabed4cc26666d2eedeceb9ae7a90bcff"},"schema_version":"1.0"},"canonical_sha256":"92dd0a3f7c351b7ea0f4eec8b55bdb38ea563043e91744b22dd5ee8109ff67de","source":{"kind":"arxiv","id":"2605.12901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12901","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12901v1","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12901","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"SLOQUP34GUNX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"SLOQUP34GUNX5IHU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"SLOQUP34","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SLOQUP34GUNX5IHU53ELKW63HD","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12901","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-13T02:25:09Z","cross_cats_sorted":["stat.AP","stat.CO"],"title_canon_sha256":"b5c8dba113ed6906ec1511f9090a0742ad2d68a18f6bb974dcbf0ddb96872153","abstract_canon_sha256":"fda8c4001440f57cbe9a8f61d25cc8caabed4cc26666d2eedeceb9ae7a90bcff"},"schema_version":"1.0"},"canonical_sha256":"92dd0a3f7c351b7ea0f4eec8b55bdb38ea563043e91744b22dd5ee8109ff67de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:10.735330Z","signature_b64":"fXk2gf2Qnkuec0euhN172KIYD9ZnErkGTC8nsB0PzBiCO2ovOMy3XHZhmB9rmJibapwxCwfgdc4ic8o9BbJNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92dd0a3f7c351b7ea0f4eec8b55bdb38ea563043e91744b22dd5ee8109ff67de","last_reissued_at":"2026-05-18T03:09:10.734500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:10.734500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12901","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-18T03:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vceymGz55VBmX+JeISAc4EvwK6JSKGY+xAmmDcvasZ/NgzGw5WeuKNtRpJ0rNvDZZWxclL57BbGUy6KFZLtcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:43:19.048835Z"},"content_sha256":"ecfbc8ebad82726c8a3dba3aacb0ca3d58ea8f879ddee305afd4bf542b7ff170","schema_version":"1.0","event_id":"sha256:ecfbc8ebad82726c8a3dba3aacb0ca3d58ea8f879ddee305afd4bf542b7ff170"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SLOQUP34GUNX5IHU53ELKW63HD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian Adaptive Latent Mixture Model for Zero-Inflated Weighted Brain Connectome Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A Bayesian mixture model represents each brain network as a simplex mixture of shared low-rank latent templates while separating edge presence from strength.","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Hsin-Hsiung Huang, Teng Zhang, Yuh-Haur Chen","submitted_at":"2026-05-13T02:25:09Z","abstract_excerpt":"Replicated weighted networks often exhibit many structural zeros alongside heterogeneous non-zero edge strengths. In structural connectomics, this zero-inflation coincides with subjects expressing overlapping, rather than discrete, connectivity patterns. To address these features, we propose a Bayesian adaptive latent mixture model for zero-inflated weighted networks. Our approach represents each subject network as a simplex mixture of shared low-rank latent score matrices, integrated with a hurdle likelihood that separates edge existence from conditional edge strength. A sparsity-coupling par"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The model recovers stable latent score patterns and heterogeneous subject-level mixtures in Human Connectome Project data; posterior consistency, local asymptotic normality, Bernstein-von Mises approximation, and predictive consistency hold for an identifiable quotient-space estimand under fixed-template scenario.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That subject networks are well-represented as simplex mixtures of a small number of shared low-rank latent score matrices, with the sparsity-coupling parameter correctly capturing dependence between absent edges and latent structure, and that template count selection via predictive fit yields an identifiable model.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A Bayesian adaptive latent mixture model using simplex mixtures of low-rank latent score matrices and hurdle likelihoods for zero-inflated weighted brain connectomes, with posterior consistency and predictive consistency established.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A Bayesian mixture model represents each brain network as a simplex mixture of shared low-rank latent templates while separating edge presence from strength.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"987e5beae32d5ec205a9112c7bc021bae5bc1d7d4c9174b216cbebab019c8043"},"source":{"id":"2605.12901","kind":"arxiv","version":1},"verdict":{"id":"bfcd51a8-5a52-420a-94b1-eec970cac1b9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:53:26.257009Z","strongest_claim":"The model recovers stable latent score patterns and heterogeneous subject-level mixtures in Human Connectome Project data; posterior consistency, local asymptotic normality, Bernstein-von Mises approximation, and predictive consistency hold for an identifiable quotient-space estimand under fixed-template scenario.","one_line_summary":"A Bayesian adaptive latent mixture model using simplex mixtures of low-rank latent score matrices and hurdle likelihoods for zero-inflated weighted brain connectomes, with posterior consistency and predictive consistency established.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That subject networks are well-represented as simplex mixtures of a small number of shared low-rank latent score matrices, with the sparsity-coupling parameter correctly capturing dependence between absent edges and latent structure, and that template count selection via predictive fit yields an identifiable model.","pith_extraction_headline":"A Bayesian mixture model represents each brain network as a simplex mixture of shared low-rank latent templates while separating edge presence from strength."},"references":{"count":46,"sample":[{"doi":"","year":null,"title":"Journal of Machine Learning Research , year =","work_id":"ca28afaf-c19f-4888-b920-43fae2995da9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2007,"title":"Probabilistic diffusion tractography with multiple fibre orientations: What can we gain? , author=. NeuroImage , volume=. 2007 , publisher=","work_id":"152a855f-349a-478d-9055-b2e78136b5bc","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Journal of the American Statistical Association , volume=","work_id":"4c03529f-9353-4073-9a95-04fb93315601","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Accurate and robust brain image alignment using boundary-based registration , author=. NeuroImage , volume=. 2009 , publisher=","work_id":"99c460d8-ba8f-4dee-84da-eb8a138acb6d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Cai, Yuhua and Owen, Jonathan P. and Eriksson, M. and Reh, G. R. and Martin, L. and Irimia, A. and Davenport, N. D. and Mukherjee, P. and Mayer, A. R. , journal=. 2024 , doi=","work_id":"d8047f20-7077-43f1-96e8-4a352e4f49a2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":46,"snapshot_sha256":"69045fb31012f04d0f8633aea97d301d4147bb86d7e737475ce32970042ea274","internal_anchors":0},"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":"bfcd51a8-5a52-420a-94b1-eec970cac1b9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvTXn9dtotewZtI2h1sqGsdxqmcTXpjM8APrjyx4SCP7w5HJ31z89cnpEidK82sbGtQ5GurFzQSFD7rQlrJUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:43:19.049444Z"},"content_sha256":"a766fcb2fcd2992fd340c71329bc98869ea8938e9d341b25b8dc33b06faa472e","schema_version":"1.0","event_id":"sha256:a766fcb2fcd2992fd340c71329bc98869ea8938e9d341b25b8dc33b06faa472e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLOQUP34GUNX5IHU53ELKW63HD/bundle.json","state_url":"https://pith.science/pith/SLOQUP34GUNX5IHU53ELKW63HD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLOQUP34GUNX5IHU53ELKW63HD/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-22T09:43:19Z","links":{"resolver":"https://pith.science/pith/SLOQUP34GUNX5IHU53ELKW63HD","bundle":"https://pith.science/pith/SLOQUP34GUNX5IHU53ELKW63HD/bundle.json","state":"https://pith.science/pith/SLOQUP34GUNX5IHU53ELKW63HD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLOQUP34GUNX5IHU53ELKW63HD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SLOQUP34GUNX5IHU53ELKW63HD","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":"fda8c4001440f57cbe9a8f61d25cc8caabed4cc26666d2eedeceb9ae7a90bcff","cross_cats_sorted":["stat.AP","stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-13T02:25:09Z","title_canon_sha256":"b5c8dba113ed6906ec1511f9090a0742ad2d68a18f6bb974dcbf0ddb96872153"},"schema_version":"1.0","source":{"id":"2605.12901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12901","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12901v1","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12901","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"SLOQUP34GUNX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"SLOQUP34GUNX5IHU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"SLOQUP34","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:a766fcb2fcd2992fd340c71329bc98869ea8938e9d341b25b8dc33b06faa472e","target":"graph","created_at":"2026-05-18T03:09:10Z","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 model recovers stable latent score patterns and heterogeneous subject-level mixtures in Human Connectome Project data; posterior consistency, local asymptotic normality, Bernstein-von Mises approximation, and predictive consistency hold for an identifiable quotient-space estimand under fixed-template scenario."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That subject networks are well-represented as simplex mixtures of a small number of shared low-rank latent score matrices, with the sparsity-coupling parameter correctly capturing dependence between absent edges and latent structure, and that template count selection via predictive fit yields an identifiable model."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A Bayesian adaptive latent mixture model using simplex mixtures of low-rank latent score matrices and hurdle likelihoods for zero-inflated weighted brain connectomes, with posterior consistency and predictive consistency established."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A Bayesian mixture model represents each brain network as a simplex mixture of shared low-rank latent templates while separating edge presence from strength."}],"snapshot_sha256":"987e5beae32d5ec205a9112c7bc021bae5bc1d7d4c9174b216cbebab019c8043"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Replicated weighted networks often exhibit many structural zeros alongside heterogeneous non-zero edge strengths. In structural connectomics, this zero-inflation coincides with subjects expressing overlapping, rather than discrete, connectivity patterns. To address these features, we propose a Bayesian adaptive latent mixture model for zero-inflated weighted networks. Our approach represents each subject network as a simplex mixture of shared low-rank latent score matrices, integrated with a hurdle likelihood that separates edge existence from conditional edge strength. A sparsity-coupling par","authors_text":"Hsin-Hsiung Huang, Teng Zhang, Yuh-Haur Chen","cross_cats":["stat.AP","stat.CO"],"headline":"A Bayesian mixture model represents each brain network as a simplex mixture of shared low-rank latent templates while separating edge presence from strength.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-13T02:25:09Z","title":"A Bayesian Adaptive Latent Mixture Model for Zero-Inflated Weighted Brain Connectome Analysis"},"references":{"count":46,"internal_anchors":0,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Journal of Machine Learning Research , year =","work_id":"ca28afaf-c19f-4888-b920-43fae2995da9","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Probabilistic diffusion tractography with multiple fibre orientations: What can we gain? , author=. NeuroImage , volume=. 2007 , publisher=","work_id":"152a855f-349a-478d-9055-b2e78136b5bc","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Journal of the American Statistical Association , volume=","work_id":"4c03529f-9353-4073-9a95-04fb93315601","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Accurate and robust brain image alignment using boundary-based registration , author=. NeuroImage , volume=. 2009 , publisher=","work_id":"99c460d8-ba8f-4dee-84da-eb8a138acb6d","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Cai, Yuhua and Owen, Jonathan P. and Eriksson, M. and Reh, G. R. and Martin, L. and Irimia, A. and Davenport, N. D. and Mukherjee, P. and Mayer, A. R. , journal=. 2024 , doi=","work_id":"d8047f20-7077-43f1-96e8-4a352e4f49a2","year":2024}],"snapshot_sha256":"69045fb31012f04d0f8633aea97d301d4147bb86d7e737475ce32970042ea274"},"source":{"id":"2605.12901","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:53:26.257009Z","id":"bfcd51a8-5a52-420a-94b1-eec970cac1b9","model_set":{"reader":"grok-4.3"},"one_line_summary":"A Bayesian adaptive latent mixture model using simplex mixtures of low-rank latent score matrices and hurdle likelihoods for zero-inflated weighted brain connectomes, with posterior consistency and predictive consistency established.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A Bayesian mixture model represents each brain network as a simplex mixture of shared low-rank latent templates while separating edge presence from strength.","strongest_claim":"The model recovers stable latent score patterns and heterogeneous subject-level mixtures in Human Connectome Project data; posterior consistency, local asymptotic normality, Bernstein-von Mises approximation, and predictive consistency hold for an identifiable quotient-space estimand under fixed-template scenario.","weakest_assumption":"That subject networks are well-represented as simplex mixtures of a small number of shared low-rank latent score matrices, with the sparsity-coupling parameter correctly capturing dependence between absent edges and latent structure, and that template count selection via predictive fit yields an identifiable model."}},"verdict_id":"bfcd51a8-5a52-420a-94b1-eec970cac1b9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ecfbc8ebad82726c8a3dba3aacb0ca3d58ea8f879ddee305afd4bf542b7ff170","target":"record","created_at":"2026-05-18T03:09:10Z","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":"fda8c4001440f57cbe9a8f61d25cc8caabed4cc26666d2eedeceb9ae7a90bcff","cross_cats_sorted":["stat.AP","stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-13T02:25:09Z","title_canon_sha256":"b5c8dba113ed6906ec1511f9090a0742ad2d68a18f6bb974dcbf0ddb96872153"},"schema_version":"1.0","source":{"id":"2605.12901","kind":"arxiv","version":1}},"canonical_sha256":"92dd0a3f7c351b7ea0f4eec8b55bdb38ea563043e91744b22dd5ee8109ff67de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92dd0a3f7c351b7ea0f4eec8b55bdb38ea563043e91744b22dd5ee8109ff67de","first_computed_at":"2026-05-18T03:09:10.734500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:10.734500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fXk2gf2Qnkuec0euhN172KIYD9ZnErkGTC8nsB0PzBiCO2ovOMy3XHZhmB9rmJibapwxCwfgdc4ic8o9BbJNAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:10.735330Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecfbc8ebad82726c8a3dba3aacb0ca3d58ea8f879ddee305afd4bf542b7ff170","sha256:a766fcb2fcd2992fd340c71329bc98869ea8938e9d341b25b8dc33b06faa472e"],"state_sha256":"76a3a8b5f072aefed5ddddeeed1af2d23a9cabecbb302762cf00cb438881eefb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nI3P/Z+FEIojP589ATEXtSZQarRW39FWnk6IHP8RuRckzTLdwwKW70pjeSqD0dxj/rOFzZHT/d1Qw+epH3G2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T09:43:19.052716Z","bundle_sha256":"9feb29560a4ed3fc0af11a68371c9a86d9b4e75aadef66357e15ee0ab2b10fea"}}