{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LS6LU542X65SNTRUHVZ63EUEK3","short_pith_number":"pith:LS6LU542","canonical_record":{"source":{"id":"2603.25101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-26T07:15:52Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"0d6749575af62ce1a5fd509ddadbd977bcd7fe603c1c7d60bb7a84beb1c7fef6","abstract_canon_sha256":"f5a7fe276e35defb85a043f13ab4af9a8fc463302f162368d5264438d0621bbe"},"schema_version":"1.0"},"canonical_sha256":"5cbcba779abfbb26ce343d73ed928456eacdee1bdd0b06bca6b3ca05f2b2805f","source":{"kind":"arxiv","id":"2603.25101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.25101","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"2603.25101v2","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.25101","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"LS6LU542X65S","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_16","alias_value":"LS6LU542X65SNTRU","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_8","alias_value":"LS6LU542","created_at":"2026-05-20T00:00:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LS6LU542X65SNTRUHVZ63EUEK3","target":"record","payload":{"canonical_record":{"source":{"id":"2603.25101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-26T07:15:52Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"0d6749575af62ce1a5fd509ddadbd977bcd7fe603c1c7d60bb7a84beb1c7fef6","abstract_canon_sha256":"f5a7fe276e35defb85a043f13ab4af9a8fc463302f162368d5264438d0621bbe"},"schema_version":"1.0"},"canonical_sha256":"5cbcba779abfbb26ce343d73ed928456eacdee1bdd0b06bca6b3ca05f2b2805f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:37.084020Z","signature_b64":"NwM0auSspxvWLaeO7WO6g/+9CwjPPszepb03g1XLG8Yh0cdhRjj9FnjvbN+JKB42gbeszMzoS/RBWRR7x4UOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cbcba779abfbb26ce343d73ed928456eacdee1bdd0b06bca6b3ca05f2b2805f","last_reissued_at":"2026-05-20T00:00:37.083222Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:37.083222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.25101","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-20T00:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IMUwTmyPjMfWiBLcSxplGg+cVfPSmOKHeBzLs/x4DZ7nHx27PECKRcEZgj2XAFAMjwaWUGf/u70BtW8tFxRPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:10:06.536851Z"},"content_sha256":"38314cfb72cb301246185d1241808fee803d4ac21fe776e41fe439d1969eaf3d","schema_version":"1.0","event_id":"sha256:38314cfb72cb301246185d1241808fee803d4ac21fe776e41fe439d1969eaf3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LS6LU542X65SNTRUHVZ63EUEK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"T Count as a Numerically Solvable Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The minimal T-count for implementing a unitary is found by binary search over continuous minimization problems that prove solvable in practice.","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dirk Englund, Ed Younis, Hyeongrak Choi, Marc Grau Davis, Mathias Weiden","submitted_at":"2026-03-26T07:15:52Z","abstract_excerpt":"We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically solvable in practice. We reproduce best-known results for synthesis of circuits with a small number of qubits, and push the bounds of the largest circuits that can be solved for in this way. Additionally, we show that circuit partitioning can be used to adapt this technique to be used to optimize the T -Count of circuits with large numbers of qubits by breaking"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We demonstrate that these problems are numerically solvable in practice.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The continuous relaxation and numerical minimization accurately detect the existence of a discrete T-count circuit without being trapped in local minima that would produce false negatives on feasible counts.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The minimal T-count for implementing a unitary is found by binary search over continuous minimization problems that prove solvable in practice.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a456bf4fd875d3cc014e445f6e245b3e09085b658775130b8ba162129b347f2e"},"source":{"id":"2603.25101","kind":"arxiv","version":2},"verdict":{"id":"92c7d4b8-8029-4219-86c9-128644435a19","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T17:24:48.696412Z","strongest_claim":"We demonstrate that these problems are numerically solvable in practice.","one_line_summary":"T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The continuous relaxation and numerical minimization accurately detect the existence of a discrete T-count circuit without being trapped in local minima that would produce false negatives on feasible counts.","pith_extraction_headline":"The minimal T-count for implementing a unitary is found by binary search over continuous minimization problems that prove solvable in practice."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.25101/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":33,"sample":[{"doi":"","year":2048,"title":"This procedure of carefully choosing starting points using the results of other optimization problems turned out to be roughly a 30% speedup and in some cases im- proved the quality of results. IV. NU","work_id":"2257c0ce-6102-4e6e-9a96-bf9c6ae82b39","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Matthew Amy, Dmitri Maslov, Michele Mosca, and Mar- tin Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits.IEEE Transactions on Computer-Aided Design of Int","work_id":"11b27374-cfb3-47f5-8a3a-77483077b573","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Alex Bocharov, Martin Roetteler, and Krysta M. Svore. Efficient synthesis of universal repeat-until-success quan- tum circuits.Phys. Rev. Lett., 114:080502, Feb 2015","work_id":"24730528-9cdb-46f3-b320-442e6c7349fb","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Childs, Dmitri Maslov, Yunseong Nam, Neil J","work_id":"0d45d54e-35a5-4300-814d-6ab34d3db289","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Fault tolerant non-clifford state preparation for arbitrary rotations.arXiv preprint arXiv:2303.17380, 2023","work_id":"1ae448fd-f4c8-4086-877f-0dc024cbb1f2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":33,"snapshot_sha256":"1187b9dd72b150b02d7a88f148132b023b8e0e2f12d970f7fb1e35694c5d22c5","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2cbc3b58d02935b450f4c956084769679a64db3e24a8ab125612610869d64196"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"92c7d4b8-8029-4219-86c9-128644435a19"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6gP60DXLu3mEydx++OMXaDkmwRzDD/lVhleWuIFXQF7pWZcvWafuq5UaehHMXOyVHbFW4AnvwMu6zg9K+2qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:10:06.537915Z"},"content_sha256":"9b22455918a4d1ed4c926b8ad6ffcd741b98da6008c961634d30bb6c6a6b37fb","schema_version":"1.0","event_id":"sha256:9b22455918a4d1ed4c926b8ad6ffcd741b98da6008c961634d30bb6c6a6b37fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LS6LU542X65SNTRUHVZ63EUEK3/bundle.json","state_url":"https://pith.science/pith/LS6LU542X65SNTRUHVZ63EUEK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LS6LU542X65SNTRUHVZ63EUEK3/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-25T16:10:06Z","links":{"resolver":"https://pith.science/pith/LS6LU542X65SNTRUHVZ63EUEK3","bundle":"https://pith.science/pith/LS6LU542X65SNTRUHVZ63EUEK3/bundle.json","state":"https://pith.science/pith/LS6LU542X65SNTRUHVZ63EUEK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LS6LU542X65SNTRUHVZ63EUEK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LS6LU542X65SNTRUHVZ63EUEK3","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":"f5a7fe276e35defb85a043f13ab4af9a8fc463302f162368d5264438d0621bbe","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-26T07:15:52Z","title_canon_sha256":"0d6749575af62ce1a5fd509ddadbd977bcd7fe603c1c7d60bb7a84beb1c7fef6"},"schema_version":"1.0","source":{"id":"2603.25101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.25101","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"2603.25101v2","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.25101","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"LS6LU542X65S","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_16","alias_value":"LS6LU542X65SNTRU","created_at":"2026-05-20T00:00:37Z"},{"alias_kind":"pith_short_8","alias_value":"LS6LU542","created_at":"2026-05-20T00:00:37Z"}],"graph_snapshots":[{"event_id":"sha256:9b22455918a4d1ed4c926b8ad6ffcd741b98da6008c961634d30bb6c6a6b37fb","target":"graph","created_at":"2026-05-20T00:00:37Z","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 demonstrate that these problems are numerically solvable in practice."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The continuous relaxation and numerical minimization accurately detect the existence of a discrete T-count circuit without being trapped in local minima that would produce false negatives on feasible counts."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The minimal T-count for implementing a unitary is found by binary search over continuous minimization problems that prove solvable in practice."}],"snapshot_sha256":"a456bf4fd875d3cc014e445f6e245b3e09085b658775130b8ba162129b347f2e"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2cbc3b58d02935b450f4c956084769679a64db3e24a8ab125612610869d64196"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.25101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically solvable in practice. We reproduce best-known results for synthesis of circuits with a small number of qubits, and push the bounds of the largest circuits that can be solved for in this way. Additionally, we show that circuit partitioning can be used to adapt this technique to be used to optimize the T -Count of circuits with large numbers of qubits by breaking","authors_text":"Dirk Englund, Ed Younis, Hyeongrak Choi, Marc Grau Davis, Mathias Weiden","cross_cats":["cs.ET"],"headline":"The minimal T-count for implementing a unitary is found by binary search over continuous minimization problems that prove solvable in practice.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-26T07:15:52Z","title":"T Count as a Numerically Solvable Minimization Problem"},"references":{"count":33,"internal_anchors":0,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"This procedure of carefully choosing starting points using the results of other optimization problems turned out to be roughly a 30% speedup and in some cases im- proved the quality of results. IV. NU","work_id":"2257c0ce-6102-4e6e-9a96-bf9c6ae82b39","year":2048},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Matthew Amy, Dmitri Maslov, Michele Mosca, and Mar- tin Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits.IEEE Transactions on Computer-Aided Design of Int","work_id":"11b27374-cfb3-47f5-8a3a-77483077b573","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Alex Bocharov, Martin Roetteler, and Krysta M. Svore. Efficient synthesis of universal repeat-until-success quan- tum circuits.Phys. Rev. Lett., 114:080502, Feb 2015","work_id":"24730528-9cdb-46f3-b320-442e6c7349fb","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Childs, Dmitri Maslov, Yunseong Nam, Neil J","work_id":"0d45d54e-35a5-4300-814d-6ab34d3db289","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Fault tolerant non-clifford state preparation for arbitrary rotations.arXiv preprint arXiv:2303.17380, 2023","work_id":"1ae448fd-f4c8-4086-877f-0dc024cbb1f2","year":2023}],"snapshot_sha256":"1187b9dd72b150b02d7a88f148132b023b8e0e2f12d970f7fb1e35694c5d22c5"},"source":{"id":"2603.25101","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-19T17:24:48.696412Z","id":"92c7d4b8-8029-4219-86c9-128644435a19","model_set":{"reader":"grok-4.3"},"one_line_summary":"T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The minimal T-count for implementing a unitary is found by binary search over continuous minimization problems that prove solvable in practice.","strongest_claim":"We demonstrate that these problems are numerically solvable in practice.","weakest_assumption":"The continuous relaxation and numerical minimization accurately detect the existence of a discrete T-count circuit without being trapped in local minima that would produce false negatives on feasible counts."}},"verdict_id":"92c7d4b8-8029-4219-86c9-128644435a19"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:38314cfb72cb301246185d1241808fee803d4ac21fe776e41fe439d1969eaf3d","target":"record","created_at":"2026-05-20T00:00:37Z","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":"f5a7fe276e35defb85a043f13ab4af9a8fc463302f162368d5264438d0621bbe","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-26T07:15:52Z","title_canon_sha256":"0d6749575af62ce1a5fd509ddadbd977bcd7fe603c1c7d60bb7a84beb1c7fef6"},"schema_version":"1.0","source":{"id":"2603.25101","kind":"arxiv","version":2}},"canonical_sha256":"5cbcba779abfbb26ce343d73ed928456eacdee1bdd0b06bca6b3ca05f2b2805f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cbcba779abfbb26ce343d73ed928456eacdee1bdd0b06bca6b3ca05f2b2805f","first_computed_at":"2026-05-20T00:00:37.083222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:37.083222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NwM0auSspxvWLaeO7WO6g/+9CwjPPszepb03g1XLG8Yh0cdhRjj9FnjvbN+JKB42gbeszMzoS/RBWRR7x4UOBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:37.084020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.25101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38314cfb72cb301246185d1241808fee803d4ac21fe776e41fe439d1969eaf3d","sha256:9b22455918a4d1ed4c926b8ad6ffcd741b98da6008c961634d30bb6c6a6b37fb"],"state_sha256":"b097ce78a24be0ad84a6d3a0b7d9dfa762f60292170d22034183ea67cf9f0526"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QmkqgdDiGmV9kCFDiC7h/VMoRGnbQ96UQSHEhEHcVOHIkRhRbKPysMypiilIPOi2gD2MX807thUS5QewqQ4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:10:06.541833Z","bundle_sha256":"83bc8564680388872e3757edf8a2ab0c8c6bdc48640f097165f2df6152b29038"}}