{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YTUDTDDXIREZ7DV65BCFZODP63","short_pith_number":"pith:YTUDTDDX","canonical_record":{"source":{"id":"2604.19892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2026-04-21T18:13:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bde1c97dc103059e2974bf75d545c5cb4833d75bb70531c679cdf184a7932525","abstract_canon_sha256":"ee2767b3fc0423f8af1e7f5636a7d3a85ff7661c4bf9f0fdd023c105603e125e"},"schema_version":"1.0"},"canonical_sha256":"c4e8398c7744499f8ebee8445cb86ff6d150ff095de1707704e92dde7620d221","source":{"kind":"arxiv","id":"2604.19892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.19892","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"2604.19892v1","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.19892","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"YTUDTDDXIREZ","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_16","alias_value":"YTUDTDDXIREZ7DV6","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_8","alias_value":"YTUDTDDX","created_at":"2026-05-20T01:05:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YTUDTDDXIREZ7DV65BCFZODP63","target":"record","payload":{"canonical_record":{"source":{"id":"2604.19892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2026-04-21T18:13:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bde1c97dc103059e2974bf75d545c5cb4833d75bb70531c679cdf184a7932525","abstract_canon_sha256":"ee2767b3fc0423f8af1e7f5636a7d3a85ff7661c4bf9f0fdd023c105603e125e"},"schema_version":"1.0"},"canonical_sha256":"c4e8398c7744499f8ebee8445cb86ff6d150ff095de1707704e92dde7620d221","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:14.137884Z","signature_b64":"NqAftLZrXpZsPHOl8bht8ml0eBotD3Yaa2AKvo1SAE9f6XFRYyoGsXBlntoLu6jQR3OjxYZTJD+hBAc7A+FQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4e8398c7744499f8ebee8445cb86ff6d150ff095de1707704e92dde7620d221","last_reissued_at":"2026-05-20T01:05:14.137105Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:14.137105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.19892","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-20T01:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDjMDpV4v67vCul3s+or0elZ7RvjJDmFj0fR1Qtmbk8WrdsERZrPn+8MZ1VdyhgIS8sZQm0TIto8xERkJTEiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:31:07.448419Z"},"content_sha256":"82140975e20c6279dd3f982775861d893ac643b388e7e8802505dfaf8dd060f4","schema_version":"1.0","event_id":"sha256:82140975e20c6279dd3f982775861d893ac643b388e7e8802505dfaf8dd060f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YTUDTDDXIREZ7DV65BCFZODP63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Multilevel Preconditioned Nonlinear Conjugate Gradient Method for Incremental Potential Contact","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The MAS-PNCG method with a Sparse-Input Woodbury update adapts multilevel preconditioners to changing contacts, enabling faster nonlinear conjugate gradient solves than Newton's method while keeping simulations intersection-free.","cross_cats":["cs.AI"],"primary_cat":"cs.GR","authors_text":"Kemeng Huang, Taku Komura, Tiantian Liu, Wei Chen, Xingang Pan, Xing Shen, Yin Yang, Yu Zhang","submitted_at":"2026-04-21T18:13:52Z","abstract_excerpt":"Incremental Potential Contact (IPC) guarantees intersection-free simulation but suffers from high computational costs due to the expensive Hessian assembly and linear solves required by Newton's method. While Preconditioned Nonlinear Conjugate Gradient (PNCG) avoids Hessian assembly, it has historically struggled with poor convergence in stiff, contact-rich scenarios due to the lack of effective preconditioners; simple Jacobi preconditioners fail to capture the global coupling, while advanced hierarchy-based preconditioners like Multilevel Additive Schwarz (MAS) are computationally prohibitive"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments demonstrate that our MAS-PNCG outperforms state-of-the-art Newton-PCG solvers, GIPC and StiffGIPC, both preconditioned with MAS up to 5.66× and 2.07× respectively.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The Sparse-Input Woodbury update algorithm maintains effective spectral properties of the multilevel preconditioner for rapidly changing contact sets without requiring full rebuilds or introducing instability in the nonlinear iterations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MAS-PNCG accelerates IPC by incrementally updating multilevel MAS preconditioners via Sparse-Input Woodbury, adding Hessian-aware 2D subspace minimization and per-subdomain CCD, achieving up to 5.66x speedup over Newton-PCG baselines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The MAS-PNCG method with a Sparse-Input Woodbury update adapts multilevel preconditioners to changing contacts, enabling faster nonlinear conjugate gradient solves than Newton's method while keeping simulations intersection-free.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6ee2888bdef3c9d957caa419ee7ba91a397faec82c447e6a855eef2d04ebc8b7"},"source":{"id":"2604.19892","kind":"arxiv","version":1},"verdict":{"id":"b1d063e9-e590-46b0-a785-d0aa56b411cd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T00:27:53.796367Z","strongest_claim":"Experiments demonstrate that our MAS-PNCG outperforms state-of-the-art Newton-PCG solvers, GIPC and StiffGIPC, both preconditioned with MAS up to 5.66× and 2.07× respectively.","one_line_summary":"MAS-PNCG accelerates IPC by incrementally updating multilevel MAS preconditioners via Sparse-Input Woodbury, adding Hessian-aware 2D subspace minimization and per-subdomain CCD, achieving up to 5.66x speedup over Newton-PCG baselines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The Sparse-Input Woodbury update algorithm maintains effective spectral properties of the multilevel preconditioner for rapidly changing contact sets without requiring full rebuilds or introducing instability in the nonlinear iterations.","pith_extraction_headline":"The MAS-PNCG method with a Sparse-Input Woodbury update adapts multilevel preconditioners to changing contacts, enabling faster nonlinear conjugate gradient solves than Newton's method while keeping simulations intersection-free."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.19892/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":94,"sample":[{"doi":"","year":null,"title":"Proceedings of the Platform for Advanced Scientific Computing Conference , pages=","work_id":"","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"SIAM Journal on Optimization , volume=","work_id":"","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1983,"title":"Mathematical programming , volume=","work_id":"","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the 21st Pan-Hellenic Conference on Informatics , pages=","work_id":"","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"OPTIMIZATION LETTERS , volume=","work_id":"","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"6a685aef51f04550a5dd1e3dceedd1e8cf2ce4e7d5ac02a3989ab561e1e91d79","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":"b1d063e9-e590-46b0-a785-d0aa56b411cd"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMQw68ng/x32nZFHjEr3pe8DesTAgmSW0gXZ7STdWrh9UJXZis0wPvWe0IvDjEF2iJ0tu/eDgCEbgKgMtXvHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:31:07.449554Z"},"content_sha256":"627c64a372775453cbd6f91d790d8790ec6ca4eaef9167d3cc2824908c3ccdbd","schema_version":"1.0","event_id":"sha256:627c64a372775453cbd6f91d790d8790ec6ca4eaef9167d3cc2824908c3ccdbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTUDTDDXIREZ7DV65BCFZODP63/bundle.json","state_url":"https://pith.science/pith/YTUDTDDXIREZ7DV65BCFZODP63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTUDTDDXIREZ7DV65BCFZODP63/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-23T21:31:07Z","links":{"resolver":"https://pith.science/pith/YTUDTDDXIREZ7DV65BCFZODP63","bundle":"https://pith.science/pith/YTUDTDDXIREZ7DV65BCFZODP63/bundle.json","state":"https://pith.science/pith/YTUDTDDXIREZ7DV65BCFZODP63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTUDTDDXIREZ7DV65BCFZODP63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YTUDTDDXIREZ7DV65BCFZODP63","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":"ee2767b3fc0423f8af1e7f5636a7d3a85ff7661c4bf9f0fdd023c105603e125e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2026-04-21T18:13:52Z","title_canon_sha256":"bde1c97dc103059e2974bf75d545c5cb4833d75bb70531c679cdf184a7932525"},"schema_version":"1.0","source":{"id":"2604.19892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.19892","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"2604.19892v1","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.19892","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"YTUDTDDXIREZ","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_16","alias_value":"YTUDTDDXIREZ7DV6","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_8","alias_value":"YTUDTDDX","created_at":"2026-05-20T01:05:14Z"}],"graph_snapshots":[{"event_id":"sha256:627c64a372775453cbd6f91d790d8790ec6ca4eaef9167d3cc2824908c3ccdbd","target":"graph","created_at":"2026-05-20T01:05:14Z","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":"Experiments demonstrate that our MAS-PNCG outperforms state-of-the-art Newton-PCG solvers, GIPC and StiffGIPC, both preconditioned with MAS up to 5.66× and 2.07× respectively."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The Sparse-Input Woodbury update algorithm maintains effective spectral properties of the multilevel preconditioner for rapidly changing contact sets without requiring full rebuilds or introducing instability in the nonlinear iterations."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MAS-PNCG accelerates IPC by incrementally updating multilevel MAS preconditioners via Sparse-Input Woodbury, adding Hessian-aware 2D subspace minimization and per-subdomain CCD, achieving up to 5.66x speedup over Newton-PCG baselines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The MAS-PNCG method with a Sparse-Input Woodbury update adapts multilevel preconditioners to changing contacts, enabling faster nonlinear conjugate gradient solves than Newton's method while keeping simulations intersection-free."}],"snapshot_sha256":"6ee2888bdef3c9d957caa419ee7ba91a397faec82c447e6a855eef2d04ebc8b7"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.19892/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Incremental Potential Contact (IPC) guarantees intersection-free simulation but suffers from high computational costs due to the expensive Hessian assembly and linear solves required by Newton's method. While Preconditioned Nonlinear Conjugate Gradient (PNCG) avoids Hessian assembly, it has historically struggled with poor convergence in stiff, contact-rich scenarios due to the lack of effective preconditioners; simple Jacobi preconditioners fail to capture the global coupling, while advanced hierarchy-based preconditioners like Multilevel Additive Schwarz (MAS) are computationally prohibitive","authors_text":"Kemeng Huang, Taku Komura, Tiantian Liu, Wei Chen, Xingang Pan, Xing Shen, Yin Yang, Yu Zhang","cross_cats":["cs.AI"],"headline":"The MAS-PNCG method with a Sparse-Input Woodbury update adapts multilevel preconditioners to changing contacts, enabling faster nonlinear conjugate gradient solves than Newton's method while keeping simulations intersection-free.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2026-04-21T18:13:52Z","title":"An Efficient Multilevel Preconditioned Nonlinear Conjugate Gradient Method for Incremental Potential Contact"},"references":{"count":94,"internal_anchors":0,"resolved_work":6,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proceedings of the Platform for Advanced Scientific Computing Conference , pages=","work_id":"","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"SIAM Journal on Optimization , volume=","work_id":"","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Mathematical programming , volume=","work_id":"","year":1983},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Proceedings of the 21st Pan-Hellenic Conference on Informatics , pages=","work_id":"","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"OPTIMIZATION LETTERS , volume=","work_id":"","year":null}],"snapshot_sha256":"6a685aef51f04550a5dd1e3dceedd1e8cf2ce4e7d5ac02a3989ab561e1e91d79"},"source":{"id":"2604.19892","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-10T00:27:53.796367Z","id":"b1d063e9-e590-46b0-a785-d0aa56b411cd","model_set":{"reader":"grok-4.3"},"one_line_summary":"MAS-PNCG accelerates IPC by incrementally updating multilevel MAS preconditioners via Sparse-Input Woodbury, adding Hessian-aware 2D subspace minimization and per-subdomain CCD, achieving up to 5.66x speedup over Newton-PCG baselines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The MAS-PNCG method with a Sparse-Input Woodbury update adapts multilevel preconditioners to changing contacts, enabling faster nonlinear conjugate gradient solves than Newton's method while keeping simulations intersection-free.","strongest_claim":"Experiments demonstrate that our MAS-PNCG outperforms state-of-the-art Newton-PCG solvers, GIPC and StiffGIPC, both preconditioned with MAS up to 5.66× and 2.07× respectively.","weakest_assumption":"The Sparse-Input Woodbury update algorithm maintains effective spectral properties of the multilevel preconditioner for rapidly changing contact sets without requiring full rebuilds or introducing instability in the nonlinear iterations."}},"verdict_id":"b1d063e9-e590-46b0-a785-d0aa56b411cd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:82140975e20c6279dd3f982775861d893ac643b388e7e8802505dfaf8dd060f4","target":"record","created_at":"2026-05-20T01:05:14Z","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":"ee2767b3fc0423f8af1e7f5636a7d3a85ff7661c4bf9f0fdd023c105603e125e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2026-04-21T18:13:52Z","title_canon_sha256":"bde1c97dc103059e2974bf75d545c5cb4833d75bb70531c679cdf184a7932525"},"schema_version":"1.0","source":{"id":"2604.19892","kind":"arxiv","version":1}},"canonical_sha256":"c4e8398c7744499f8ebee8445cb86ff6d150ff095de1707704e92dde7620d221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4e8398c7744499f8ebee8445cb86ff6d150ff095de1707704e92dde7620d221","first_computed_at":"2026-05-20T01:05:14.137105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:14.137105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NqAftLZrXpZsPHOl8bht8ml0eBotD3Yaa2AKvo1SAE9f6XFRYyoGsXBlntoLu6jQR3OjxYZTJD+hBAc7A+FQBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:14.137884Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.19892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82140975e20c6279dd3f982775861d893ac643b388e7e8802505dfaf8dd060f4","sha256:627c64a372775453cbd6f91d790d8790ec6ca4eaef9167d3cc2824908c3ccdbd"],"state_sha256":"06654205cd679e904c9aabae68faab103ac4f98f7693ab913103538be100d52d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lj4Yq0R+k5LrFiOEqy+3Gz1cdUbVj1OESPmVxTgM299s29r0vOXQPvGdm0qn0XJfpi0TJJBhSeOWi6IqdrRgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:31:07.459175Z","bundle_sha256":"6ba02de2bc6c2f5fcc9b5447dad610a0e18c2832e7d4e4929dff5542b50e2d04"}}