{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:FFKM5KHQJOWAOGZE2VQIBEC7J6","short_pith_number":"pith:FFKM5KHQ","canonical_record":{"source":{"id":"2102.04664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-02-09T06:16:25Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"860be0ba9c5444e1c8b2bc4245a205e9d9c1e4bea18ae82f2556b8d32393d9c2","abstract_canon_sha256":"577000571d1832c71d8988455cd2943e664fd4fd9798e9932abb6058814ac2be"},"schema_version":"1.0"},"canonical_sha256":"2954cea8f04bac071b24d56080905f4f8157d97e96558f7a676ad31e51e54ecc","source":{"kind":"arxiv","id":"2102.04664","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.04664","created_at":"2026-05-17T23:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"2102.04664v2","created_at":"2026-05-17T23:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04664","created_at":"2026-05-17T23:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"FFKM5KHQJOWA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"FFKM5KHQJOWAOGZE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"FFKM5KHQ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:FFKM5KHQJOWAOGZE2VQIBEC7J6","target":"record","payload":{"canonical_record":{"source":{"id":"2102.04664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-02-09T06:16:25Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"860be0ba9c5444e1c8b2bc4245a205e9d9c1e4bea18ae82f2556b8d32393d9c2","abstract_canon_sha256":"577000571d1832c71d8988455cd2943e664fd4fd9798e9932abb6058814ac2be"},"schema_version":"1.0"},"canonical_sha256":"2954cea8f04bac071b24d56080905f4f8157d97e96558f7a676ad31e51e54ecc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:52.655016Z","signature_b64":"mtzjpJGFR/VM7D9mE7IlPGeqZialamVrX3CuJP09p/Kz/mo6QPuhwN9IMzOypbEq7IBMbJ4ck/Wy3dNBuf5BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2954cea8f04bac071b24d56080905f4f8157d97e96558f7a676ad31e51e54ecc","last_reissued_at":"2026-05-17T23:38:52.654437Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:52.654437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.04664","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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qL/y5cESXU57n5W+dN9JMmwN3AZzlDHqr3s4iuWvi6UKSf9dMVRCQDJLw0WgZHk1CnFnb1immsHHweTyrllDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:00:52.071701Z"},"content_sha256":"0df7cd3214527a434cd97dccdc831a197553b3c44f4520de87de13bd8a1a5ebb","schema_version":"1.0","event_id":"sha256:0df7cd3214527a434cd97dccdc831a197553b3c44f4520de87de13bd8a1a5ebb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:FFKM5KHQJOWAOGZE2VQIBEC7J6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"CodeXGLUE introduces a benchmark with 10 tasks across 14 datasets for code understanding and generation.","cross_cats":["cs.CL"],"primary_cat":"cs.SE","authors_text":"Alexey Svyatkovskiy, Ambrosio Blanco, Colin Clement, Dawn Drain, Daxin Jiang, Daya Guo, Duyu Tang, Ge Li, Junjie Huang, Lidong Zhou, Linjun Shou, Long Zhou, Michele Tufano, Ming Gong, Ming Zhou, Nan Duan, Neel Sundaresan, Shao Kun Deng, Shengyu Fu, Shuai Lu, Shujie Liu, Shuo Ren","submitted_at":"2021-02-09T06:16:25Z","abstract_excerpt":"Benchmark datasets have a significant impact on accelerating research in programming language tasks. In this paper, we introduce CodeXGLUE, a benchmark dataset to foster machine learning research for program understanding and generation. CodeXGLUE includes a collection of 10 tasks across 14 datasets and a platform for model evaluation and comparison. CodeXGLUE also features three baseline systems, including the BERT-style, GPT-style, and Encoder-Decoder models, to make it easy for researchers to use the platform. The availability of such data and baselines can help the development and validati"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"CodeXGLUE includes a collection of 10 tasks across 14 datasets and a platform for model evaluation and comparison.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The selected 10 tasks and 14 datasets are assumed to be representative of the broader space of program understanding and generation problems.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CodeXGLUE supplies a standardized collection of 10 code-related tasks, 14 datasets, an evaluation platform, and BERT-, GPT-, and encoder-decoder-style baselines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"CodeXGLUE introduces a benchmark with 10 tasks across 14 datasets for code understanding and generation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"52213557bf4deec84f17e8b355a20d8b4ae6cd4a8055bf71e79df8ed0ae7ab55"},"source":{"id":"2102.04664","kind":"arxiv","version":2},"verdict":{"id":"8627a318-fd9d-4346-966f-3ae52cfd3dd9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T11:35:59.404148Z","strongest_claim":"CodeXGLUE includes a collection of 10 tasks across 14 datasets and a platform for model evaluation and comparison.","one_line_summary":"CodeXGLUE supplies a standardized collection of 10 code-related tasks, 14 datasets, an evaluation platform, and BERT-, GPT-, and encoder-decoder-style baselines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The selected 10 tasks and 14 datasets are assumed to be representative of the broader space of program understanding and generation problems.","pith_extraction_headline":"CodeXGLUE introduces a benchmark with 10 tasks across 14 datasets for code understanding and generation."},"references":{"count":107,"sample":[{"doi":"10.1145/3212695","year":2018,"title":"T., Devanbu, P., and Sutton, C","work_id":"db061796-6810-4e22-9e85-3a1b70629115","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Learning to represent programs with graphs","work_id":"3a9d5702-9b14-4cf1-abe5-abec3d6bae13","ref_index":2,"cited_arxiv_id":"1711.00740","is_internal_anchor":true},{"doi":"","year":2016,"title":"Miltiadis Allamanis, Hao Peng, and Charles Sutton. 2016. A convolutional at- tention network for extreme summarization of source code. In International conference on machine learning . 2091–2100","work_id":"2883b1f0-64a1-4b7f-99f9-02165afecc7e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Miltiadis Allamanis and Charles Sutton. 2013. Mining Source Code Repositories at Massive Scale using Language Modeling. In 2013 10th Working Conference on Mining Software Repositories (MSR) . IEEE, 20","work_id":"fd3652df-9444-49be-8b7a-7abff7921ca4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Miltiadis Allamanis and Charles Sutton. 2014. Mining idioms from source code. In Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering. 472–483","work_id":"3fd64261-694f-4094-a41b-0c41147c3f74","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":107,"snapshot_sha256":"9542bd20c6eea5553e01e67f4b5cd75db0e3b58e44f1a2e8343ad23b3fa0e672","internal_anchors":20},"formal_canon":{"evidence_count":3,"snapshot_sha256":"5fa5712a9ec7732418156e7f6ca5c33e7572e96170866d783481f6650472e619"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"8627a318-fd9d-4346-966f-3ae52cfd3dd9"},"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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77zGJvHDb6maIlgb7DSq1/ArUe7Hdw2pjnFphsofynY1uoLGHCSIgTivp+N2xJ+PVhXPTaOyv8lIF0DQXe4WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:00:52.072798Z"},"content_sha256":"fd91e360e4e68bc84db08edbe8b5b1b24d9c1c1324923a3a0347ecc8847ff2f8","schema_version":"1.0","event_id":"sha256:fd91e360e4e68bc84db08edbe8b5b1b24d9c1c1324923a3a0347ecc8847ff2f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFKM5KHQJOWAOGZE2VQIBEC7J6/bundle.json","state_url":"https://pith.science/pith/FFKM5KHQJOWAOGZE2VQIBEC7J6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFKM5KHQJOWAOGZE2VQIBEC7J6/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-25T08:00:52Z","links":{"resolver":"https://pith.science/pith/FFKM5KHQJOWAOGZE2VQIBEC7J6","bundle":"https://pith.science/pith/FFKM5KHQJOWAOGZE2VQIBEC7J6/bundle.json","state":"https://pith.science/pith/FFKM5KHQJOWAOGZE2VQIBEC7J6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFKM5KHQJOWAOGZE2VQIBEC7J6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:FFKM5KHQJOWAOGZE2VQIBEC7J6","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":"577000571d1832c71d8988455cd2943e664fd4fd9798e9932abb6058814ac2be","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-02-09T06:16:25Z","title_canon_sha256":"860be0ba9c5444e1c8b2bc4245a205e9d9c1e4bea18ae82f2556b8d32393d9c2"},"schema_version":"1.0","source":{"id":"2102.04664","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.04664","created_at":"2026-05-17T23:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"2102.04664v2","created_at":"2026-05-17T23:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04664","created_at":"2026-05-17T23:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"FFKM5KHQJOWA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"FFKM5KHQJOWAOGZE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"FFKM5KHQ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fd91e360e4e68bc84db08edbe8b5b1b24d9c1c1324923a3a0347ecc8847ff2f8","target":"graph","created_at":"2026-05-17T23:38:52Z","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":"CodeXGLUE includes a collection of 10 tasks across 14 datasets and a platform for model evaluation and comparison."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The selected 10 tasks and 14 datasets are assumed to be representative of the broader space of program understanding and generation problems."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CodeXGLUE supplies a standardized collection of 10 code-related tasks, 14 datasets, an evaluation platform, and BERT-, GPT-, and encoder-decoder-style baselines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"CodeXGLUE introduces a benchmark with 10 tasks across 14 datasets for code understanding and generation."}],"snapshot_sha256":"52213557bf4deec84f17e8b355a20d8b4ae6cd4a8055bf71e79df8ed0ae7ab55"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"5fa5712a9ec7732418156e7f6ca5c33e7572e96170866d783481f6650472e619"},"paper":{"abstract_excerpt":"Benchmark datasets have a significant impact on accelerating research in programming language tasks. In this paper, we introduce CodeXGLUE, a benchmark dataset to foster machine learning research for program understanding and generation. CodeXGLUE includes a collection of 10 tasks across 14 datasets and a platform for model evaluation and comparison. CodeXGLUE also features three baseline systems, including the BERT-style, GPT-style, and Encoder-Decoder models, to make it easy for researchers to use the platform. The availability of such data and baselines can help the development and validati","authors_text":"Alexey Svyatkovskiy, Ambrosio Blanco, Colin Clement, Dawn Drain, Daxin Jiang, Daya Guo, Duyu Tang, Ge Li, Junjie Huang, Lidong Zhou, Linjun Shou, Long Zhou, Michele Tufano, Ming Gong, Ming Zhou, Nan Duan, Neel Sundaresan, Shao Kun Deng, Shengyu Fu, Shuai Lu, Shujie Liu, Shuo Ren","cross_cats":["cs.CL"],"headline":"CodeXGLUE introduces a benchmark with 10 tasks across 14 datasets for code understanding and generation.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-02-09T06:16:25Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation"},"references":{"count":107,"internal_anchors":20,"resolved_work":107,"sample":[{"cited_arxiv_id":"","doi":"10.1145/3212695","is_internal_anchor":false,"ref_index":1,"title":"T., Devanbu, P., and Sutton, C","work_id":"db061796-6810-4e22-9e85-3a1b70629115","year":2018},{"cited_arxiv_id":"1711.00740","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Learning to represent programs with graphs","work_id":"3a9d5702-9b14-4cf1-abe5-abec3d6bae13","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Miltiadis Allamanis, Hao Peng, and Charles Sutton. 2016. A convolutional at- tention network for extreme summarization of source code. In International conference on machine learning . 2091–2100","work_id":"2883b1f0-64a1-4b7f-99f9-02165afecc7e","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Miltiadis Allamanis and Charles Sutton. 2013. Mining Source Code Repositories at Massive Scale using Language Modeling. In 2013 10th Working Conference on Mining Software Repositories (MSR) . IEEE, 20","work_id":"fd3652df-9444-49be-8b7a-7abff7921ca4","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Miltiadis Allamanis and Charles Sutton. 2014. Mining idioms from source code. In Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering. 472–483","work_id":"3fd64261-694f-4094-a41b-0c41147c3f74","year":2014}],"snapshot_sha256":"9542bd20c6eea5553e01e67f4b5cd75db0e3b58e44f1a2e8343ad23b3fa0e672"},"source":{"id":"2102.04664","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T11:35:59.404148Z","id":"8627a318-fd9d-4346-966f-3ae52cfd3dd9","model_set":{"reader":"grok-4.3"},"one_line_summary":"CodeXGLUE supplies a standardized collection of 10 code-related tasks, 14 datasets, an evaluation platform, and BERT-, GPT-, and encoder-decoder-style baselines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"CodeXGLUE introduces a benchmark with 10 tasks across 14 datasets for code understanding and generation.","strongest_claim":"CodeXGLUE includes a collection of 10 tasks across 14 datasets and a platform for model evaluation and comparison.","weakest_assumption":"The selected 10 tasks and 14 datasets are assumed to be representative of the broader space of program understanding and generation problems."}},"verdict_id":"8627a318-fd9d-4346-966f-3ae52cfd3dd9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0df7cd3214527a434cd97dccdc831a197553b3c44f4520de87de13bd8a1a5ebb","target":"record","created_at":"2026-05-17T23:38:52Z","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":"577000571d1832c71d8988455cd2943e664fd4fd9798e9932abb6058814ac2be","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-02-09T06:16:25Z","title_canon_sha256":"860be0ba9c5444e1c8b2bc4245a205e9d9c1e4bea18ae82f2556b8d32393d9c2"},"schema_version":"1.0","source":{"id":"2102.04664","kind":"arxiv","version":2}},"canonical_sha256":"2954cea8f04bac071b24d56080905f4f8157d97e96558f7a676ad31e51e54ecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2954cea8f04bac071b24d56080905f4f8157d97e96558f7a676ad31e51e54ecc","first_computed_at":"2026-05-17T23:38:52.654437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:52.654437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtzjpJGFR/VM7D9mE7IlPGeqZialamVrX3CuJP09p/Kz/mo6QPuhwN9IMzOypbEq7IBMbJ4ck/Wy3dNBuf5BDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:52.655016Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.04664","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0df7cd3214527a434cd97dccdc831a197553b3c44f4520de87de13bd8a1a5ebb","sha256:fd91e360e4e68bc84db08edbe8b5b1b24d9c1c1324923a3a0347ecc8847ff2f8"],"state_sha256":"45eeefa6912db6052c39f568bbabda9ac6b4f030f96b17dbfca733f71250ceac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dP3RnT7LEuTkESVYSwXIaxupcV7iJc14e5idwOacTvJ2m6pxlMYflCFGY0XH1LQUKIuon3BsUckQQ0zkoph/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:00:52.076697Z","bundle_sha256":"1352df408edeb868dc6b4e09145a4eec9a5c9b707288e5eeae0b68d1a22188f4"}}