{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NA2NWNPLTSL7WPBL6PVSFHKFIE","short_pith_number":"pith:NA2NWNPL","canonical_record":{"source":{"id":"2605.13704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2026-05-13T15:53:14Z","cross_cats_sorted":[],"title_canon_sha256":"b2e9e1f0aa9c0171381aa63482a50810f71a69e8668406749d2bfcc437aa7ac0","abstract_canon_sha256":"1681d58f4d377015115c2e1cd13dde24c122331fe1e27c7ccf601144072674ec"},"schema_version":"1.0"},"canonical_sha256":"6834db35eb9c97fb3c2bf3eb229d45413f864ef1b85f59831c15f8633bbc6472","source":{"kind":"arxiv","id":"2605.13704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13704","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13704v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13704","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"NA2NWNPLTSL7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NA2NWNPLTSL7WPBL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NA2NWNPL","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NA2NWNPLTSL7WPBL6PVSFHKFIE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2026-05-13T15:53:14Z","cross_cats_sorted":[],"title_canon_sha256":"b2e9e1f0aa9c0171381aa63482a50810f71a69e8668406749d2bfcc437aa7ac0","abstract_canon_sha256":"1681d58f4d377015115c2e1cd13dde24c122331fe1e27c7ccf601144072674ec"},"schema_version":"1.0"},"canonical_sha256":"6834db35eb9c97fb3c2bf3eb229d45413f864ef1b85f59831c15f8633bbc6472","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:16.822635Z","signature_b64":"/CDBHaRIwgtqds3jkZGvkbG6AWYCMsCzdZv4kliUxyujWQMt3A7W1GwybOjEu6xwoCLdfmdQ6EovWn1DgMbYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6834db35eb9c97fb3c2bf3eb229d45413f864ef1b85f59831c15f8633bbc6472","last_reissued_at":"2026-05-18T02:44:16.822045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:16.822045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13704","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":"t0Ljt8oWGj0ZPAAvxwvvAOFH6LXYwGaGkO4F8ApddBz06XQ+cZEqRI+TPXGxQf3Z6eGgloXDMfrrb6zETVMwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:28:34.688929Z"},"content_sha256":"841041584bb21b259a5559a3589b049baffafe95ece2f332ad027c81da38eba9","schema_version":"1.0","event_id":"sha256:841041584bb21b259a5559a3589b049baffafe95ece2f332ad027c81da38eba9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NA2NWNPLTSL7WPBL6PVSFHKFIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lax-Oleinik formula for nonautonomous Hamilton-Jacobi equations on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A Lax-Oleinik-type representation formula yields the unique solution to nonautonomous Hamilton-Jacobi equations on networks with loops and countably many arcs.","cross_cats":[],"primary_cat":"math.AP","authors_text":"Marco Pozza","submitted_at":"2026-05-13T15:53:14Z","abstract_excerpt":"We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. The networks may possess countably many arcs and allow for the presence of loops. We consider Hamiltonians that are convex and superlinear in the momentum variable, and satisfy a Lipschitz-type condition in the time variable. The representation formula is constructed via an overall Lagrangian that accounts for both the arc-specific dynamics and vertex-based constraints, called flux limiters, which ensure the well-posedness of the proble"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. [...] the formula yields the unique solution to the problem even when the flux limiters exceed standard upper bounds.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The Hamiltonians are convex and superlinear in the momentum variable and satisfy a Lipschitz-type condition in the time variable; the networks may possess countably many arcs and allow loops, with flux limiters at vertices ensuring well-posedness.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A Lax-Oleinik representation formula is established for nonautonomous Hamilton-Jacobi equations on general networks, yielding unique solutions via an action functional whose minimizers are Lipschitz continuous without excluding the Zeno phenomenon.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A Lax-Oleinik-type representation formula yields the unique solution to nonautonomous Hamilton-Jacobi equations on networks with loops and countably many arcs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"496c549bb1892730127815b5097179cdc3fb7dd3d3c90292f0b1064df4b78bf3"},"source":{"id":"2605.13704","kind":"arxiv","version":1},"verdict":{"id":"b8f709e0-5fae-499e-9503-4cb4b703a522","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:46:16.316378Z","strongest_claim":"We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. [...] the formula yields the unique solution to the problem even when the flux limiters exceed standard upper bounds.","one_line_summary":"A Lax-Oleinik representation formula is established for nonautonomous Hamilton-Jacobi equations on general networks, yielding unique solutions via an action functional whose minimizers are Lipschitz continuous without excluding the Zeno phenomenon.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The Hamiltonians are convex and superlinear in the momentum variable and satisfy a Lipschitz-type condition in the time variable; the networks may possess countably many arcs and allow loops, with flux limiters at vertices ensuring well-posedness.","pith_extraction_headline":"A Lax-Oleinik-type representation formula yields the unique solution to nonautonomous Hamilton-Jacobi equations on networks with loops and countably many arcs."},"references":{"count":25,"sample":[{"doi":"10.1137/23m1615073","year":2024,"title":"Deterministic mean field games on networks: a Lagrangian approach","work_id":"1a7c95ba-3400-47ea-9648-40af081f2987","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"M. Bardi and I. Capuzzo-Dolcetta.Optimal control and viscosity solutions of Hamilton- Jacobi-Bellman equations. Birkhäuser Boston, 1997.isbn: 978-0-8176-4755-1.doi:10.1007/ 978-0-8176-4755-1","work_id":"0dd386b6-2709-4787-95c0-ffc9c7b9861a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.ansens.2007.01.004","year":2007,"title":"Existence ofC1,1 critical sub-solutions of the Hamilton–Jacobi equation on compact manifolds","work_id":"b25989a2-aa1d-4690-a0b7-5be7ea4d55f1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1090/gsm/033","year":2001,"title":"2001 , PAGES =","work_id":"c06fd211-e110-4128-91da-5eacf4dd0316","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s42967-025-00527-w","year":2025,"title":"Error estimate for a semi-Lagrangian scheme for Hamilton-Jacobi equations on networks","work_id":"575790a0-b20f-40f7-b313-8cada6ff106f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"baf838164c246a232fe2759fc28630afa30e76ad52c588ac14a8445137ca73f0","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"63f0602094f6039a0498adec2aac3ffbd428733c153d4a1e235603abd6dd2baf"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"b8f709e0-5fae-499e-9503-4cb4b703a522"},"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":"VE492hbbhOdMCKIyUO0F39LoHXTNT1Een+APB+3N5JIquWXOyP2QWVuzbbGn1j0U7eWzI4hcz17RqCdf9+EKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:28:34.690072Z"},"content_sha256":"fb8af9acd386b5691fd25501af80b1e9f3d8b60195eccca89be8815035fe042e","schema_version":"1.0","event_id":"sha256:fb8af9acd386b5691fd25501af80b1e9f3d8b60195eccca89be8815035fe042e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NA2NWNPLTSL7WPBL6PVSFHKFIE/bundle.json","state_url":"https://pith.science/pith/NA2NWNPLTSL7WPBL6PVSFHKFIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NA2NWNPLTSL7WPBL6PVSFHKFIE/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-23T06:28:34Z","links":{"resolver":"https://pith.science/pith/NA2NWNPLTSL7WPBL6PVSFHKFIE","bundle":"https://pith.science/pith/NA2NWNPLTSL7WPBL6PVSFHKFIE/bundle.json","state":"https://pith.science/pith/NA2NWNPLTSL7WPBL6PVSFHKFIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NA2NWNPLTSL7WPBL6PVSFHKFIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NA2NWNPLTSL7WPBL6PVSFHKFIE","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":"1681d58f4d377015115c2e1cd13dde24c122331fe1e27c7ccf601144072674ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2026-05-13T15:53:14Z","title_canon_sha256":"b2e9e1f0aa9c0171381aa63482a50810f71a69e8668406749d2bfcc437aa7ac0"},"schema_version":"1.0","source":{"id":"2605.13704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13704","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13704v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13704","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"NA2NWNPLTSL7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NA2NWNPLTSL7WPBL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NA2NWNPL","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:fb8af9acd386b5691fd25501af80b1e9f3d8b60195eccca89be8815035fe042e","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":"We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. [...] the formula yields the unique solution to the problem even when the flux limiters exceed standard upper bounds."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The Hamiltonians are convex and superlinear in the momentum variable and satisfy a Lipschitz-type condition in the time variable; the networks may possess countably many arcs and allow loops, with flux limiters at vertices ensuring well-posedness."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A Lax-Oleinik representation formula is established for nonautonomous Hamilton-Jacobi equations on general networks, yielding unique solutions via an action functional whose minimizers are Lipschitz continuous without excluding the Zeno phenomenon."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A Lax-Oleinik-type representation formula yields the unique solution to nonautonomous Hamilton-Jacobi equations on networks with loops and countably many arcs."}],"snapshot_sha256":"496c549bb1892730127815b5097179cdc3fb7dd3d3c90292f0b1064df4b78bf3"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"63f0602094f6039a0498adec2aac3ffbd428733c153d4a1e235603abd6dd2baf"},"paper":{"abstract_excerpt":"We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. The networks may possess countably many arcs and allow for the presence of loops. We consider Hamiltonians that are convex and superlinear in the momentum variable, and satisfy a Lipschitz-type condition in the time variable. The representation formula is constructed via an overall Lagrangian that accounts for both the arc-specific dynamics and vertex-based constraints, called flux limiters, which ensure the well-posedness of the proble","authors_text":"Marco Pozza","cross_cats":[],"headline":"A Lax-Oleinik-type representation formula yields the unique solution to nonautonomous Hamilton-Jacobi equations on networks with loops and countably many arcs.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2026-05-13T15:53:14Z","title":"Lax-Oleinik formula for nonautonomous Hamilton-Jacobi equations on networks"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"10.1137/23m1615073","is_internal_anchor":false,"ref_index":1,"title":"Deterministic mean field games on networks: a Lagrangian approach","work_id":"1a7c95ba-3400-47ea-9648-40af081f2987","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"M. Bardi and I. Capuzzo-Dolcetta.Optimal control and viscosity solutions of Hamilton- Jacobi-Bellman equations. Birkhäuser Boston, 1997.isbn: 978-0-8176-4755-1.doi:10.1007/ 978-0-8176-4755-1","work_id":"0dd386b6-2709-4787-95c0-ffc9c7b9861a","year":1997},{"cited_arxiv_id":"","doi":"10.1016/j.ansens.2007.01.004","is_internal_anchor":false,"ref_index":3,"title":"Existence ofC1,1 critical sub-solutions of the Hamilton–Jacobi equation on compact manifolds","work_id":"b25989a2-aa1d-4690-a0b7-5be7ea4d55f1","year":2007},{"cited_arxiv_id":"","doi":"10.1090/gsm/033","is_internal_anchor":false,"ref_index":4,"title":"2001 , PAGES =","work_id":"c06fd211-e110-4128-91da-5eacf4dd0316","year":2001},{"cited_arxiv_id":"","doi":"10.1007/s42967-025-00527-w","is_internal_anchor":false,"ref_index":5,"title":"Error estimate for a semi-Lagrangian scheme for Hamilton-Jacobi equations on networks","work_id":"575790a0-b20f-40f7-b313-8cada6ff106f","year":2025}],"snapshot_sha256":"baf838164c246a232fe2759fc28630afa30e76ad52c588ac14a8445137ca73f0"},"source":{"id":"2605.13704","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:46:16.316378Z","id":"b8f709e0-5fae-499e-9503-4cb4b703a522","model_set":{"reader":"grok-4.3"},"one_line_summary":"A Lax-Oleinik representation formula is established for nonautonomous Hamilton-Jacobi equations on general networks, yielding unique solutions via an action functional whose minimizers are Lipschitz continuous without excluding the Zeno phenomenon.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A Lax-Oleinik-type representation formula yields the unique solution to nonautonomous Hamilton-Jacobi equations on networks with loops and countably many arcs.","strongest_claim":"We provide a Lax-Oleinik-type representation formula for solutions to nonautonomous Hamilton-Jacobi equations posed on networks with a rather general geometry. [...] the formula yields the unique solution to the problem even when the flux limiters exceed standard upper bounds.","weakest_assumption":"The Hamiltonians are convex and superlinear in the momentum variable and satisfy a Lipschitz-type condition in the time variable; the networks may possess countably many arcs and allow loops, with flux limiters at vertices ensuring well-posedness."}},"verdict_id":"b8f709e0-5fae-499e-9503-4cb4b703a522"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:841041584bb21b259a5559a3589b049baffafe95ece2f332ad027c81da38eba9","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":"1681d58f4d377015115c2e1cd13dde24c122331fe1e27c7ccf601144072674ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2026-05-13T15:53:14Z","title_canon_sha256":"b2e9e1f0aa9c0171381aa63482a50810f71a69e8668406749d2bfcc437aa7ac0"},"schema_version":"1.0","source":{"id":"2605.13704","kind":"arxiv","version":1}},"canonical_sha256":"6834db35eb9c97fb3c2bf3eb229d45413f864ef1b85f59831c15f8633bbc6472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6834db35eb9c97fb3c2bf3eb229d45413f864ef1b85f59831c15f8633bbc6472","first_computed_at":"2026-05-18T02:44:16.822045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:16.822045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/CDBHaRIwgtqds3jkZGvkbG6AWYCMsCzdZv4kliUxyujWQMt3A7W1GwybOjEu6xwoCLdfmdQ6EovWn1DgMbYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:16.822635Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:841041584bb21b259a5559a3589b049baffafe95ece2f332ad027c81da38eba9","sha256:fb8af9acd386b5691fd25501af80b1e9f3d8b60195eccca89be8815035fe042e"],"state_sha256":"c7a7d15e6642b42f7e64d075c610cb64c0fad3ee98425fe08fa738a4e5e46a6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aA41fsxHSkBYeymvdzT2QxwH2ClFbSECqxsRasyJmTGhWzb34YXLfSM/T/blzWKbiFrp2jPGuZMYKkTFRfmsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T06:28:34.695473Z","bundle_sha256":"9e9450490f415ace278948f90964aa8c0eeecf55ca9c3197733e750672c83d36"}}