{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LNQRTXUT7Q65NM727VK5ZUNSQU","short_pith_number":"pith:LNQRTXUT","canonical_record":{"source":{"id":"2601.03192","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-01-06T17:14:50Z","cross_cats_sorted":[],"title_canon_sha256":"7c0d923c805c5962930c5be752a0132fb50d7d08ae5af3d34834efb6f32e8be9","abstract_canon_sha256":"98800090d44f2319db13e55805d7efe6cc27f3ff670f39182c63929a21cc8709"},"schema_version":"1.0"},"canonical_sha256":"5b6119de93fc3dd6b3fafd55dcd1b2852a4c3fd3b1e23ce8a5f4f19bb91e18af","source":{"kind":"arxiv","id":"2601.03192","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.03192","created_at":"2026-05-17T23:38:13Z"},{"alias_kind":"arxiv_version","alias_value":"2601.03192v2","created_at":"2026-05-17T23:38:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03192","created_at":"2026-05-17T23:38:13Z"},{"alias_kind":"pith_short_12","alias_value":"LNQRTXUT7Q65","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"LNQRTXUT7Q65NM72","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"LNQRTXUT","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LNQRTXUT7Q65NM727VK5ZUNSQU","target":"record","payload":{"canonical_record":{"source":{"id":"2601.03192","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-01-06T17:14:50Z","cross_cats_sorted":[],"title_canon_sha256":"7c0d923c805c5962930c5be752a0132fb50d7d08ae5af3d34834efb6f32e8be9","abstract_canon_sha256":"98800090d44f2319db13e55805d7efe6cc27f3ff670f39182c63929a21cc8709"},"schema_version":"1.0"},"canonical_sha256":"5b6119de93fc3dd6b3fafd55dcd1b2852a4c3fd3b1e23ce8a5f4f19bb91e18af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:13.779779Z","signature_b64":"6w4zSTvoQeJ4L6HeG36QZWq9FA2tgsGcT8FCyqEvlh6pPuCUxmTDWmNVThgWOJZ7sDmLZRnnn29FnNqi7yo+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6119de93fc3dd6b3fafd55dcd1b2852a4c3fd3b1e23ce8a5f4f19bb91e18af","last_reissued_at":"2026-05-17T23:38:13.779113Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:13.779113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.03192","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-05-17T23:38:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMpu5BNYsWQceaRLLm6uFeOdglCGKHbsQOOUQ8SbwdpL/2aewplVaedFD361XEK90X4DdM0R5wouBJDdum3rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:08:08.664047Z"},"content_sha256":"6e4965fe2f25e44faa1a080c738a38b6c6a46a7825e0ccbd086f49b685465248","schema_version":"1.0","event_id":"sha256:6e4965fe2f25e44faa1a080c738a38b6c6a46a7825e0ccbd086f49b685465248"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LNQRTXUT7Q65NM727VK5ZUNSQU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MemRL: Self-Evolving Agents via Runtime Reinforcement Learning on Episodic Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"MemRL enables AI agents to self-evolve at runtime by applying reinforcement learning to episodic memory without updating model weights.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bo Tang, Feiyu Xiong, Jiaqian Wang, Junwei Liao, Muning Wen, Ruiwen Zhou, Shengtao Zhang, Weinan Zhang, Ying Wen, Yuchen Feng, Yujie Zheng, Yutao Qi, Zhiyu Li, Zhuo Li","submitted_at":"2026-01-06T17:14:50Z","abstract_excerpt":"The hallmark of human intelligence is the self-evolving ability to master new skills by learning from past experiences. However, current AI agents struggle to emulate this self-evolution: fine-tuning is computationally expensive and prone to catastrophic forgetting, while existing memory-based methods rely on passive semantic matching that often retrieves noise. To address these challenges, we propose MemRL, a non-parametric approach that evolves via reinforcement learning on episodic memory. By decoupling stable reasoning from plastic memory, MemRL employs a Two-Phase Retrieval mechanism to f"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"MemRL significantly outperforms state-of-the-art baselines, confirming that MemRL effectively reconciles the stability-plasticity dilemma, enabling continuous runtime improvement without weight updates.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the two-phase retrieval reliably filters noise and that environmental feedback can accurately identify high-utility strategies without introducing selection bias or requiring extensive tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MemRL enables self-evolving AI agents through reinforcement learning on episodic memory with a two-phase retrieval process that filters noise and selects high-utility strategies based on environmental feedback.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"MemRL enables AI agents to self-evolve at runtime by applying reinforcement learning to episodic memory without updating model weights.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a989832a4b16c996a5919ac40d6575b1bb1617b8f077a05593f0a7e06512a655"},"source":{"id":"2601.03192","kind":"arxiv","version":2},"verdict":{"id":"edb763ff-1e22-47a3-930f-3c22e2d09a44","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T14:44:15.915908Z","strongest_claim":"MemRL significantly outperforms state-of-the-art baselines, confirming that MemRL effectively reconciles the stability-plasticity dilemma, enabling continuous runtime improvement without weight updates.","one_line_summary":"MemRL enables self-evolving AI agents through reinforcement learning on episodic memory with a two-phase retrieval process that filters noise and selects high-utility strategies based on environmental feedback.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the two-phase retrieval reliably filters noise and that environmental feedback can accurately identify high-utility strategies without introducing selection bias or requiring extensive tuning.","pith_extraction_headline":"MemRL enables AI agents to self-evolve at runtime by applying reinforcement learning to episodic memory without updating model weights."},"references":{"count":40,"sample":[{"doi":"","year":1972,"title":"Tent: Fully Test-time Adaptation by Entropy Minimization","work_id":"7f343a70-32a2-42dc-945a-66a6feb179fb","ref_index":1,"cited_arxiv_id":"2006.10726","is_internal_anchor":true},{"doi":"","year":2025,"title":"URL https://openreview.net/forum? id=WE_vluYUL-X. Ye, Y . Task memory engine: Spatial memory for robust multi-step llm agents.arXiv preprint arXiv:2505.19436, 2025. Yu, Q., Zhang, Z., Zhu, R., Yuan, Y","work_id":"4269cc49-de04-4151-8df1-df25352cfd7a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"2.Update Rule.The utility is updated via the linear EMA rule with learning rateα∈(0,1): Qt+1 = (1−α)Q t +αr t","work_id":"8dfa888f-f032-4d1f-813f-8e3312e32afb","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Trust Region:It constrains the policy to the support set S, preventing the agent from retrieving high-Q but semantically irrelevant memories (out-of-distribution errors). 2.Regularization:It stabilize","work_id":"11e0fa7f-c133-4ec5-aae6-f78cb76ae650","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"What to avoid next time Provide a brief reflection: Stored memory content templates. # Successful memory Task: {task_description} SCRIPT: {script} TRAJECTORY: {trajectory} # Failure memory TASK REFLEC","work_id":"975c4be0-3442-446a-b22a-ca2516f543a0","ref_index":10,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":40,"snapshot_sha256":"9979a5d8b06300da9ef9208d4895227ae822b83c1c22c2a7f18db87ed2c38673","internal_anchors":1},"formal_canon":{"evidence_count":3,"snapshot_sha256":"19a9b335965da908121168f49927af6b41af446e956716af6ed659c1a58edee0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"edb763ff-1e22-47a3-930f-3c22e2d09a44"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0+1umTueMSHRVeR+LwjodoPGgA4+wy3okvLFxW638siiNilSN4c2CLFX0OUpWL/JBvUWqsovRUFhzF9xjqBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:08:08.664760Z"},"content_sha256":"f03769705a18e1981939f3f6a7e23959d89210a12c1b9da1dfc10f5bd19cd8a8","schema_version":"1.0","event_id":"sha256:f03769705a18e1981939f3f6a7e23959d89210a12c1b9da1dfc10f5bd19cd8a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNQRTXUT7Q65NM727VK5ZUNSQU/bundle.json","state_url":"https://pith.science/pith/LNQRTXUT7Q65NM727VK5ZUNSQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNQRTXUT7Q65NM727VK5ZUNSQU/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-28T10:08:08Z","links":{"resolver":"https://pith.science/pith/LNQRTXUT7Q65NM727VK5ZUNSQU","bundle":"https://pith.science/pith/LNQRTXUT7Q65NM727VK5ZUNSQU/bundle.json","state":"https://pith.science/pith/LNQRTXUT7Q65NM727VK5ZUNSQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNQRTXUT7Q65NM727VK5ZUNSQU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LNQRTXUT7Q65NM727VK5ZUNSQU","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":"98800090d44f2319db13e55805d7efe6cc27f3ff670f39182c63929a21cc8709","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-01-06T17:14:50Z","title_canon_sha256":"7c0d923c805c5962930c5be752a0132fb50d7d08ae5af3d34834efb6f32e8be9"},"schema_version":"1.0","source":{"id":"2601.03192","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.03192","created_at":"2026-05-17T23:38:13Z"},{"alias_kind":"arxiv_version","alias_value":"2601.03192v2","created_at":"2026-05-17T23:38:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.03192","created_at":"2026-05-17T23:38:13Z"},{"alias_kind":"pith_short_12","alias_value":"LNQRTXUT7Q65","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"LNQRTXUT7Q65NM72","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"LNQRTXUT","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f03769705a18e1981939f3f6a7e23959d89210a12c1b9da1dfc10f5bd19cd8a8","target":"graph","created_at":"2026-05-17T23:38:13Z","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":"MemRL significantly outperforms state-of-the-art baselines, confirming that MemRL effectively reconciles the stability-plasticity dilemma, enabling continuous runtime improvement without weight updates."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the two-phase retrieval reliably filters noise and that environmental feedback can accurately identify high-utility strategies without introducing selection bias or requiring extensive tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MemRL enables self-evolving AI agents through reinforcement learning on episodic memory with a two-phase retrieval process that filters noise and selects high-utility strategies based on environmental feedback."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MemRL enables AI agents to self-evolve at runtime by applying reinforcement learning to episodic memory without updating model weights."}],"snapshot_sha256":"a989832a4b16c996a5919ac40d6575b1bb1617b8f077a05593f0a7e06512a655"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"19a9b335965da908121168f49927af6b41af446e956716af6ed659c1a58edee0"},"paper":{"abstract_excerpt":"The hallmark of human intelligence is the self-evolving ability to master new skills by learning from past experiences. However, current AI agents struggle to emulate this self-evolution: fine-tuning is computationally expensive and prone to catastrophic forgetting, while existing memory-based methods rely on passive semantic matching that often retrieves noise. To address these challenges, we propose MemRL, a non-parametric approach that evolves via reinforcement learning on episodic memory. By decoupling stable reasoning from plastic memory, MemRL employs a Two-Phase Retrieval mechanism to f","authors_text":"Bo Tang, Feiyu Xiong, Jiaqian Wang, Junwei Liao, Muning Wen, Ruiwen Zhou, Shengtao Zhang, Weinan Zhang, Ying Wen, Yuchen Feng, Yujie Zheng, Yutao Qi, Zhiyu Li, Zhuo Li","cross_cats":[],"headline":"MemRL enables AI agents to self-evolve at runtime by applying reinforcement learning to episodic memory without updating model weights.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-01-06T17:14:50Z","title":"MemRL: Self-Evolving Agents via Runtime Reinforcement Learning on Episodic Memory"},"references":{"count":40,"internal_anchors":1,"resolved_work":40,"sample":[{"cited_arxiv_id":"2006.10726","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Tent: Fully Test-time Adaptation by Entropy Minimization","work_id":"7f343a70-32a2-42dc-945a-66a6feb179fb","year":1972},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"URL https://openreview.net/forum? id=WE_vluYUL-X. Ye, Y . Task memory engine: Spatial memory for robust multi-step llm agents.arXiv preprint arXiv:2505.19436, 2025. Yu, Q., Zhang, Z., Zhu, R., Yuan, Y","work_id":"4269cc49-de04-4151-8df1-df25352cfd7a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"2.Update Rule.The utility is updated via the linear EMA rule with learning rateα∈(0,1): Qt+1 = (1−α)Q t +αr t","work_id":"8dfa888f-f032-4d1f-813f-8e3312e32afb","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Trust Region:It constrains the policy to the support set S, preventing the agent from retrieving high-Q but semantically irrelevant memories (out-of-distribution errors). 2.Regularization:It stabilize","work_id":"11e0fa7f-c133-4ec5-aae6-f78cb76ae650","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":10,"title":"What to avoid next time Provide a brief reflection: Stored memory content templates. # Successful memory Task: {task_description} SCRIPT: {script} TRAJECTORY: {trajectory} # Failure memory TASK REFLEC","work_id":"975c4be0-3442-446a-b22a-ca2516f543a0","year":null}],"snapshot_sha256":"9979a5d8b06300da9ef9208d4895227ae822b83c1c22c2a7f18db87ed2c38673"},"source":{"id":"2601.03192","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-17T14:44:15.915908Z","id":"edb763ff-1e22-47a3-930f-3c22e2d09a44","model_set":{"reader":"grok-4.3"},"one_line_summary":"MemRL enables self-evolving AI agents through reinforcement learning on episodic memory with a two-phase retrieval process that filters noise and selects high-utility strategies based on environmental feedback.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"MemRL enables AI agents to self-evolve at runtime by applying reinforcement learning to episodic memory without updating model weights.","strongest_claim":"MemRL significantly outperforms state-of-the-art baselines, confirming that MemRL effectively reconciles the stability-plasticity dilemma, enabling continuous runtime improvement without weight updates.","weakest_assumption":"That the two-phase retrieval reliably filters noise and that environmental feedback can accurately identify high-utility strategies without introducing selection bias or requiring extensive tuning."}},"verdict_id":"edb763ff-1e22-47a3-930f-3c22e2d09a44"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e4965fe2f25e44faa1a080c738a38b6c6a46a7825e0ccbd086f49b685465248","target":"record","created_at":"2026-05-17T23:38:13Z","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":"98800090d44f2319db13e55805d7efe6cc27f3ff670f39182c63929a21cc8709","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-01-06T17:14:50Z","title_canon_sha256":"7c0d923c805c5962930c5be752a0132fb50d7d08ae5af3d34834efb6f32e8be9"},"schema_version":"1.0","source":{"id":"2601.03192","kind":"arxiv","version":2}},"canonical_sha256":"5b6119de93fc3dd6b3fafd55dcd1b2852a4c3fd3b1e23ce8a5f4f19bb91e18af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b6119de93fc3dd6b3fafd55dcd1b2852a4c3fd3b1e23ce8a5f4f19bb91e18af","first_computed_at":"2026-05-17T23:38:13.779113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:13.779113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6w4zSTvoQeJ4L6HeG36QZWq9FA2tgsGcT8FCyqEvlh6pPuCUxmTDWmNVThgWOJZ7sDmLZRnnn29FnNqi7yo+Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:13.779779Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.03192","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e4965fe2f25e44faa1a080c738a38b6c6a46a7825e0ccbd086f49b685465248","sha256:f03769705a18e1981939f3f6a7e23959d89210a12c1b9da1dfc10f5bd19cd8a8"],"state_sha256":"0c23c36aeb1b566849b62d091a49cb7608da4e449e584262d9589f8df8599bdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60f+cW3m8VOMTdh0z0A8oY/mfeAg73ip6sguhw4Mk0UOHph4Pz2ZV3QPUe0al1cj6cC5BeYJLxczf+rHyO1KCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:08:08.667417Z","bundle_sha256":"53f4d560e497daf269626af9702ca89d34a68d5c604e04f1426c39c85d6faed1"}}