{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OPXDY4I77QZCOJIAYK7MZBA62N","short_pith_number":"pith:OPXDY4I7","canonical_record":{"source":{"id":"1604.06174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-21T04:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"09e011e37ca446694c16a9daae35de00bbd8cefc18f9a0e6f527cd1274393225","abstract_canon_sha256":"c787b38ba02754d98018eff0fb4fc2ae10b4a8b51e8bf91a93b9912c20a48fb4"},"schema_version":"1.0"},"canonical_sha256":"73ee3c711ffc32272500c2becc841ed34b1fd3e6c2e152b19cec9bc8ffd27284","source":{"kind":"arxiv","id":"1604.06174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06174","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06174v2","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06174","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"pith_short_12","alias_value":"OPXDY4I77QZC","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"pith_short_16","alias_value":"OPXDY4I77QZCOJIA","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"pith_short_8","alias_value":"OPXDY4I7","created_at":"2026-07-04T20:58:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OPXDY4I77QZCOJIAYK7MZBA62N","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-21T04:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"09e011e37ca446694c16a9daae35de00bbd8cefc18f9a0e6f527cd1274393225","abstract_canon_sha256":"c787b38ba02754d98018eff0fb4fc2ae10b4a8b51e8bf91a93b9912c20a48fb4"},"schema_version":"1.0"},"canonical_sha256":"73ee3c711ffc32272500c2becc841ed34b1fd3e6c2e152b19cec9bc8ffd27284","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T20:58:46.588195Z","signature_b64":"1acO1ffphUZGym1d38/nWMZLRyulfz9VduveIB+J3NEU2y4D4w0khVJgjAJqFwb0uq38PZHNFQu2oTSAlu7ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ee3c711ffc32272500c2becc841ed34b1fd3e6c2e152b19cec9bc8ffd27284","last_reissued_at":"2026-07-04T20:58:46.587642Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T20:58:46.587642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06174","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-07-04T20:58:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJwLLWpe5pAnMETC0PpGMztWaUAOUvXfp9BvDJTi2NBmke0rAZPKirX/vagJyx7lJ6KHrT1RwjYNTNXGszuCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:15:09.905670Z"},"content_sha256":"7b413a68a6bee7a24676adab8bb8f1f2f34f232c293d101de4e28d81912a37ba","schema_version":"1.0","event_id":"sha256:7b413a68a6bee7a24676adab8bb8f1f2f34f232c293d101de4e28d81912a37ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OPXDY4I77QZCOJIAYK7MZBA62N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training Deep Nets with Sublinear Memory Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An algorithm trains an n-layer deep network using O(sqrt(n)) memory at the cost of one extra forward pass.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bing Xu, Carlos Guestrin, Chiyuan Zhang, Tianqi Chen","submitted_at":"2016-04-21T04:15:27Z","abstract_excerpt":"We propose a systematic approach to reduce the memory consumption of deep neural network training. Specifically, we design an algorithm that costs O(sqrt(n)) memory to train a n layer network, with only the computational cost of an extra forward pass per mini-batch. As many of the state-of-the-art models hit the upper bound of the GPU memory, our algorithm allows deeper and more complex models to be explored, and helps advance the innovations in deep learning research. We focus on reducing the memory cost to store the intermediate feature maps and gradients during training. Computation graph a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we design an algorithm that costs O(sqrt(n)) memory to train a n layer network, with only the computational cost of an extra forward pass per mini-batch.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The computation graph can be cleanly segmented into sqrt(n) intervals where recomputing forward passes inside each interval is both correct and cheaper than storing all intermediate activations.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An algorithm trains n-layer networks with O(sqrt(n)) memory via selective recomputation of activations, at the cost of one extra forward pass.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An algorithm trains an n-layer deep network using O(sqrt(n)) memory at the cost of one extra forward pass.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"98958f2c83cbc1aca57783a43ec86b0e032b3df334bca54776e672a99b7bdeb5"},"source":{"id":"1604.06174","kind":"arxiv","version":2},"verdict":{"id":"54fd2481-e864-4ac0-b13a-338671298d71","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T03:37:54.105843Z","strongest_claim":"we design an algorithm that costs O(sqrt(n)) memory to train a n layer network, with only the computational cost of an extra forward pass per mini-batch.","one_line_summary":"An algorithm trains n-layer networks with O(sqrt(n)) memory via selective recomputation of activations, at the cost of one extra forward pass.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The computation graph can be cleanly segmented into sqrt(n) intervals where recomputing forward passes inside each interval is both correct and cheaper than storing all intermediate activations.","pith_extraction_headline":"An algorithm trains an n-layer deep network using O(sqrt(n)) memory at the cost of one extra forward pass."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1604.06174/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":19,"sample":[{"doi":"","year":2015,"title":"Mart ´ın Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Good- fellow, Andrew Harp, Geoffr","work_id":"88a19a08-50d4-45ca-9c7a-9ac7a1dcb85f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Seltzer, Malcolm Slaney, Andreas Stolcke, Yongqiang Wang, Huaming Wang, Kaisheng Yao, Dong Yu, Yu Zhang, and Geoffrey Zweig","work_id":"5f78b504-4380-4587-bb13-6cef5cc780a9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1986,"title":"Aho, Ravi Sethi, and Jeffrey D","work_id":"f7065209-a388-4299-9529-cdf786afe897","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Goodfellow, Arnaud Bergeron, Nicolas Bouchard, and Yoshua Bengio","work_id":"27872beb-9cb7-4732-8a63-c4c093f69c16","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Theano: a CPU and GPU math expression compiler","work_id":"f53ea14a-639c-4146-bfc1-9285b7c68e27","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":19,"snapshot_sha256":"8a616d8dad6b69a1d8b987f1f5920ef0dac33caabb71233394c28710fc4cec05","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c30732137fe599a7ae3e14eed67371afb49fe612ce9703b3de6cb41f429383bd"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"54fd2481-e864-4ac0-b13a-338671298d71"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T20:58:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbmp/9Kr5/Gh34YxaK4ylZKLldnNMyRmVulR88lxDpS3AVpIg/r4EgYdc3GPrJNbZeJ8+iXDjQMYnrMooPIZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:15:09.906443Z"},"content_sha256":"498b1892a7ef8f52f2954bf98cb293a22c1cb52c63dfc10b3a6860cfe63d26f7","schema_version":"1.0","event_id":"sha256:498b1892a7ef8f52f2954bf98cb293a22c1cb52c63dfc10b3a6860cfe63d26f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPXDY4I77QZCOJIAYK7MZBA62N/bundle.json","state_url":"https://pith.science/pith/OPXDY4I77QZCOJIAYK7MZBA62N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPXDY4I77QZCOJIAYK7MZBA62N/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-08-05T00:15:09Z","links":{"resolver":"https://pith.science/pith/OPXDY4I77QZCOJIAYK7MZBA62N","bundle":"https://pith.science/pith/OPXDY4I77QZCOJIAYK7MZBA62N/bundle.json","state":"https://pith.science/pith/OPXDY4I77QZCOJIAYK7MZBA62N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPXDY4I77QZCOJIAYK7MZBA62N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OPXDY4I77QZCOJIAYK7MZBA62N","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":"c787b38ba02754d98018eff0fb4fc2ae10b4a8b51e8bf91a93b9912c20a48fb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-21T04:15:27Z","title_canon_sha256":"09e011e37ca446694c16a9daae35de00bbd8cefc18f9a0e6f527cd1274393225"},"schema_version":"1.0","source":{"id":"1604.06174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06174","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06174v2","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06174","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"pith_short_12","alias_value":"OPXDY4I77QZC","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"pith_short_16","alias_value":"OPXDY4I77QZCOJIA","created_at":"2026-07-04T20:58:46Z"},{"alias_kind":"pith_short_8","alias_value":"OPXDY4I7","created_at":"2026-07-04T20:58:46Z"}],"graph_snapshots":[{"event_id":"sha256:498b1892a7ef8f52f2954bf98cb293a22c1cb52c63dfc10b3a6860cfe63d26f7","target":"graph","created_at":"2026-07-04T20:58:46Z","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 design an algorithm that costs O(sqrt(n)) memory to train a n layer network, with only the computational cost of an extra forward pass per mini-batch."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The computation graph can be cleanly segmented into sqrt(n) intervals where recomputing forward passes inside each interval is both correct and cheaper than storing all intermediate activations."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An algorithm trains n-layer networks with O(sqrt(n)) memory via selective recomputation of activations, at the cost of one extra forward pass."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An algorithm trains an n-layer deep network using O(sqrt(n)) memory at the cost of one extra forward pass."}],"snapshot_sha256":"98958f2c83cbc1aca57783a43ec86b0e032b3df334bca54776e672a99b7bdeb5"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c30732137fe599a7ae3e14eed67371afb49fe612ce9703b3de6cb41f429383bd"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1604.06174/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a systematic approach to reduce the memory consumption of deep neural network training. Specifically, we design an algorithm that costs O(sqrt(n)) memory to train a n layer network, with only the computational cost of an extra forward pass per mini-batch. As many of the state-of-the-art models hit the upper bound of the GPU memory, our algorithm allows deeper and more complex models to be explored, and helps advance the innovations in deep learning research. We focus on reducing the memory cost to store the intermediate feature maps and gradients during training. Computation graph a","authors_text":"Bing Xu, Carlos Guestrin, Chiyuan Zhang, Tianqi Chen","cross_cats":[],"headline":"An algorithm trains an n-layer deep network using O(sqrt(n)) memory at the cost of one extra forward pass.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-21T04:15:27Z","title":"Training Deep Nets with Sublinear Memory Cost"},"references":{"count":19,"internal_anchors":2,"resolved_work":19,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Mart ´ın Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Good- fellow, Andrew Harp, Geoffr","work_id":"88a19a08-50d4-45ca-9c7a-9ac7a1dcb85f","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Seltzer, Malcolm Slaney, Andreas Stolcke, Yongqiang Wang, Huaming Wang, Kaisheng Yao, Dong Yu, Yu Zhang, and Geoffrey Zweig","work_id":"5f78b504-4380-4587-bb13-6cef5cc780a9","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Aho, Ravi Sethi, and Jeffrey D","work_id":"f7065209-a388-4299-9529-cdf786afe897","year":1986},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Goodfellow, Arnaud Bergeron, Nicolas Bouchard, and Yoshua Bengio","work_id":"27872beb-9cb7-4732-8a63-c4c093f69c16","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Theano: a CPU and GPU math expression compiler","work_id":"f53ea14a-639c-4146-bfc1-9285b7c68e27","year":2010}],"snapshot_sha256":"8a616d8dad6b69a1d8b987f1f5920ef0dac33caabb71233394c28710fc4cec05"},"source":{"id":"1604.06174","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T03:37:54.105843Z","id":"54fd2481-e864-4ac0-b13a-338671298d71","model_set":{"reader":"grok-4.3"},"one_line_summary":"An algorithm trains n-layer networks with O(sqrt(n)) memory via selective recomputation of activations, at the cost of one extra forward pass.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An algorithm trains an n-layer deep network using O(sqrt(n)) memory at the cost of one extra forward pass.","strongest_claim":"we design an algorithm that costs O(sqrt(n)) memory to train a n layer network, with only the computational cost of an extra forward pass per mini-batch.","weakest_assumption":"The computation graph can be cleanly segmented into sqrt(n) intervals where recomputing forward passes inside each interval is both correct and cheaper than storing all intermediate activations."}},"verdict_id":"54fd2481-e864-4ac0-b13a-338671298d71"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7b413a68a6bee7a24676adab8bb8f1f2f34f232c293d101de4e28d81912a37ba","target":"record","created_at":"2026-07-04T20:58:46Z","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":"c787b38ba02754d98018eff0fb4fc2ae10b4a8b51e8bf91a93b9912c20a48fb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-21T04:15:27Z","title_canon_sha256":"09e011e37ca446694c16a9daae35de00bbd8cefc18f9a0e6f527cd1274393225"},"schema_version":"1.0","source":{"id":"1604.06174","kind":"arxiv","version":2}},"canonical_sha256":"73ee3c711ffc32272500c2becc841ed34b1fd3e6c2e152b19cec9bc8ffd27284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73ee3c711ffc32272500c2becc841ed34b1fd3e6c2e152b19cec9bc8ffd27284","first_computed_at":"2026-07-04T20:58:46.587642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T20:58:46.587642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1acO1ffphUZGym1d38/nWMZLRyulfz9VduveIB+J3NEU2y4D4w0khVJgjAJqFwb0uq38PZHNFQu2oTSAlu7ACw==","signature_status":"signed_v1","signed_at":"2026-07-04T20:58:46.588195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b413a68a6bee7a24676adab8bb8f1f2f34f232c293d101de4e28d81912a37ba","sha256:498b1892a7ef8f52f2954bf98cb293a22c1cb52c63dfc10b3a6860cfe63d26f7"],"state_sha256":"10fdfdce4dad1bdb1025c202e7d4408e9b00ad11c236004c2241a652e2e7defe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nB6Q110QYvoJ0n57dQTj1YMEyhbSQmd9n/Vid8z9iDamjqmGk0TmkOtpsS2N3Akv7XY0oN4PhTz2uUoazLSWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:15:09.910308Z","bundle_sha256":"c9c14fb7972bad2be95ea8577347d9bc49f7efa5a515bde52f64cffcfb14d5bd"}}