{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7NH7VC5IJVQDP67TU5GSEZPLKV","short_pith_number":"pith:7NH7VC5I","canonical_record":{"source":{"id":"2512.20178","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-12-23T09:16:52Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"7b507e33d65dafa141601d7b49b33bf4cd00a1a9f0f98411add37bae730ce762","abstract_canon_sha256":"bdeca8ee6a43454ff0a015f230839c0ae3c281bc08782a7aae5bfc65bfe53338"},"schema_version":"1.0"},"canonical_sha256":"fb4ffa8ba84d6037fbf3a74d2265eb557d6e7c2dda2d47a9d7ba4cda05685854","source":{"kind":"arxiv","id":"2512.20178","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.20178","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.20178v2","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.20178","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"7NH7VC5IJVQD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7NH7VC5IJVQDP67T","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7NH7VC5I","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7NH7VC5IJVQDP67TU5GSEZPLKV","target":"record","payload":{"canonical_record":{"source":{"id":"2512.20178","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-12-23T09:16:52Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"7b507e33d65dafa141601d7b49b33bf4cd00a1a9f0f98411add37bae730ce762","abstract_canon_sha256":"bdeca8ee6a43454ff0a015f230839c0ae3c281bc08782a7aae5bfc65bfe53338"},"schema_version":"1.0"},"canonical_sha256":"fb4ffa8ba84d6037fbf3a74d2265eb557d6e7c2dda2d47a9d7ba4cda05685854","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:32.472604Z","signature_b64":"fxikS7MzAqnL38YTwk5yQVhhw8pIE7ZjNJnASPqI3VaA5ZLwQVbPj7jzofDBpESEW5FcYqg+7fdBPIDiaEuUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb4ffa8ba84d6037fbf3a74d2265eb557d6e7c2dda2d47a9d7ba4cda05685854","last_reissued_at":"2026-05-18T03:09:32.471914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:32.471914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.20178","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-18T03:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAnv+/4kb4uQ9X1YUQpjw+MdurbtVLkFY6FlsbWPj2h8lvEGcLb3JnfvG/i24lLRmhisp8e3MJeogoBoU2y1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:08:54.521915Z"},"content_sha256":"0ba940037a9813013da45364c2567ad1caecb56e42d6da10787eb640a8b4126c","schema_version":"1.0","event_id":"sha256:0ba940037a9813013da45364c2567ad1caecb56e42d6da10787eb640a8b4126c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7NH7VC5IJVQDP67TU5GSEZPLKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SHIRO: Near-Optimal Communication Strategies for Distributed Sparse Matrix Multiplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"SHIRO reduces distributed SpMM communication overhead by sending only the data needed for non-zero multiplications and prioritizing fast intra-node GPU links.","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Benjamin Brock, Chen Zhuang, Du Wu, Lingqi Zhang, Mohamed Wahib, Peng Chen, Satoshi Matsuoka, Toshio Endo","submitted_at":"2025-12-23T09:16:52Z","abstract_excerpt":"Distributed Sparse Matrix-Matrix Multiplication (SpMM) is a fundamental operation in high-performance computing and deep learning applications. The major performance bottleneck in distributed SpMM lies in substantial communication overhead, which limits both performance and scalability. In this paper, we identify two key sources of communication inefficiency in distributed SpMM: redundant data transfer due to sparsity unawareness, and suboptimal utilization of hierarchical network topology. To address these, we propose (1) a fine-grained, sparsity-aware communication strategy that reduces comm"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"SHIRO demonstrates strong scalability up to 128 GPUs, achieving geometric mean speedups of 221.5×, 56.0×, 23.4×, and 8.8× in SpMM over four state-of-the-art baselines (CAGNET, SPA, BCL, and CoLa, respectively) at this scale.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The sparsity patterns present in the evaluated real-world datasets allow the fine-grained strategy to eliminate most redundant transfers, and the target hardware uses a two-tier GPU network where intra-node links are substantially faster than inter-node links.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SHIRO achieves geometric mean speedups of 221.5x to 8.8x over four baselines in distributed SpMM on up to 128 GPUs by exploiting sparsity patterns and two-tier network topologies.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"SHIRO reduces distributed SpMM communication overhead by sending only the data needed for non-zero multiplications and prioritizing fast intra-node GPU links.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"172b18acd2dbf7e2b07515843dba91ebd1375ce863b1f454a0782918a6227802"},"source":{"id":"2512.20178","kind":"arxiv","version":2},"verdict":{"id":"7f7b0d37-8aea-4198-85d3-10488b637450","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T20:35:27.282934Z","strongest_claim":"SHIRO demonstrates strong scalability up to 128 GPUs, achieving geometric mean speedups of 221.5×, 56.0×, 23.4×, and 8.8× in SpMM over four state-of-the-art baselines (CAGNET, SPA, BCL, and CoLa, respectively) at this scale.","one_line_summary":"SHIRO achieves geometric mean speedups of 221.5x to 8.8x over four baselines in distributed SpMM on up to 128 GPUs by exploiting sparsity patterns and two-tier network topologies.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The sparsity patterns present in the evaluated real-world datasets allow the fine-grained strategy to eliminate most redundant transfers, and the target hardware uses a two-tier GPU network where intra-node links are substantially faster than inter-node links.","pith_extraction_headline":"SHIRO reduces distributed SpMM communication overhead by sending only the data needed for non-zero multiplications and prioritizing fast intra-node GPU links."},"references":{"count":49,"sample":[{"doi":"","year":2001,"title":"All-pairs shortest paths computation in the bsp model,","work_id":"be571a46-cc04-4231-8fb2-226916fd4250","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Rdma-based algorithms for sparse matrix multiplication on gpus,","work_id":"f7a89c9a-c7c2-44d7-ba2e-3039d4d459cf","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1980,"title":"The block conjugate gradient algorithm and related methods,","work_id":"b01ee875-9770-44e5-9138-9f3849d36fa6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1994,"title":"A shifted block lanczos algorithm for solving sparse symmetric generalized eigenproblems,","work_id":"b90319af-23b7-4e8b-9476-f8575f7b1c9f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"A block arnoldi-chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices,","work_id":"20f47329-88f8-4f08-b60e-07e4f7d9c3f3","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":49,"snapshot_sha256":"73684976639110c4cf0d3ce9e580fbf905aa9ea415567c53aec05ea41ddc186f","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"747bbf2e8f47c625171483426687090b03f97e95ce90560a5545c377083c1171"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7f7b0d37-8aea-4198-85d3-10488b637450"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zzac08r+f3KtMwlvdYhkNOxaqRLToicCocOOCoeZpFjzvU/6CIpEiie5CsB6vf2bRM3kzj29absWehouUI+oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:08:54.522784Z"},"content_sha256":"404a3102e7e6cfd6a1d3559663625f817fb0552367be1327169068d6f889672a","schema_version":"1.0","event_id":"sha256:404a3102e7e6cfd6a1d3559663625f817fb0552367be1327169068d6f889672a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NH7VC5IJVQDP67TU5GSEZPLKV/bundle.json","state_url":"https://pith.science/pith/7NH7VC5IJVQDP67TU5GSEZPLKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NH7VC5IJVQDP67TU5GSEZPLKV/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-24T23:08:54Z","links":{"resolver":"https://pith.science/pith/7NH7VC5IJVQDP67TU5GSEZPLKV","bundle":"https://pith.science/pith/7NH7VC5IJVQDP67TU5GSEZPLKV/bundle.json","state":"https://pith.science/pith/7NH7VC5IJVQDP67TU5GSEZPLKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NH7VC5IJVQDP67TU5GSEZPLKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7NH7VC5IJVQDP67TU5GSEZPLKV","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":"bdeca8ee6a43454ff0a015f230839c0ae3c281bc08782a7aae5bfc65bfe53338","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-12-23T09:16:52Z","title_canon_sha256":"7b507e33d65dafa141601d7b49b33bf4cd00a1a9f0f98411add37bae730ce762"},"schema_version":"1.0","source":{"id":"2512.20178","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.20178","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.20178v2","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.20178","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"7NH7VC5IJVQD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7NH7VC5IJVQDP67T","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7NH7VC5I","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:404a3102e7e6cfd6a1d3559663625f817fb0552367be1327169068d6f889672a","target":"graph","created_at":"2026-05-18T03:09:32Z","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":"SHIRO demonstrates strong scalability up to 128 GPUs, achieving geometric mean speedups of 221.5×, 56.0×, 23.4×, and 8.8× in SpMM over four state-of-the-art baselines (CAGNET, SPA, BCL, and CoLa, respectively) at this scale."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The sparsity patterns present in the evaluated real-world datasets allow the fine-grained strategy to eliminate most redundant transfers, and the target hardware uses a two-tier GPU network where intra-node links are substantially faster than inter-node links."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"SHIRO achieves geometric mean speedups of 221.5x to 8.8x over four baselines in distributed SpMM on up to 128 GPUs by exploiting sparsity patterns and two-tier network topologies."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"SHIRO reduces distributed SpMM communication overhead by sending only the data needed for non-zero multiplications and prioritizing fast intra-node GPU links."}],"snapshot_sha256":"172b18acd2dbf7e2b07515843dba91ebd1375ce863b1f454a0782918a6227802"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"747bbf2e8f47c625171483426687090b03f97e95ce90560a5545c377083c1171"},"paper":{"abstract_excerpt":"Distributed Sparse Matrix-Matrix Multiplication (SpMM) is a fundamental operation in high-performance computing and deep learning applications. The major performance bottleneck in distributed SpMM lies in substantial communication overhead, which limits both performance and scalability. In this paper, we identify two key sources of communication inefficiency in distributed SpMM: redundant data transfer due to sparsity unawareness, and suboptimal utilization of hierarchical network topology. To address these, we propose (1) a fine-grained, sparsity-aware communication strategy that reduces comm","authors_text":"Benjamin Brock, Chen Zhuang, Du Wu, Lingqi Zhang, Mohamed Wahib, Peng Chen, Satoshi Matsuoka, Toshio Endo","cross_cats":["cs.PF"],"headline":"SHIRO reduces distributed SpMM communication overhead by sending only the data needed for non-zero multiplications and prioritizing fast intra-node GPU links.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-12-23T09:16:52Z","title":"SHIRO: Near-Optimal Communication Strategies for Distributed Sparse Matrix Multiplication"},"references":{"count":49,"internal_anchors":2,"resolved_work":49,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"All-pairs shortest paths computation in the bsp model,","work_id":"be571a46-cc04-4231-8fb2-226916fd4250","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Rdma-based algorithms for sparse matrix multiplication on gpus,","work_id":"f7a89c9a-c7c2-44d7-ba2e-3039d4d459cf","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"The block conjugate gradient algorithm and related methods,","work_id":"b01ee875-9770-44e5-9138-9f3849d36fa6","year":1980},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A shifted block lanczos algorithm for solving sparse symmetric generalized eigenproblems,","work_id":"b90319af-23b7-4e8b-9476-f8575f7b1c9f","year":1994},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A block arnoldi-chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices,","work_id":"20f47329-88f8-4f08-b60e-07e4f7d9c3f3","year":1993}],"snapshot_sha256":"73684976639110c4cf0d3ce9e580fbf905aa9ea415567c53aec05ea41ddc186f"},"source":{"id":"2512.20178","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T20:35:27.282934Z","id":"7f7b0d37-8aea-4198-85d3-10488b637450","model_set":{"reader":"grok-4.3"},"one_line_summary":"SHIRO achieves geometric mean speedups of 221.5x to 8.8x over four baselines in distributed SpMM on up to 128 GPUs by exploiting sparsity patterns and two-tier network topologies.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"SHIRO reduces distributed SpMM communication overhead by sending only the data needed for non-zero multiplications and prioritizing fast intra-node GPU links.","strongest_claim":"SHIRO demonstrates strong scalability up to 128 GPUs, achieving geometric mean speedups of 221.5×, 56.0×, 23.4×, and 8.8× in SpMM over four state-of-the-art baselines (CAGNET, SPA, BCL, and CoLa, respectively) at this scale.","weakest_assumption":"The sparsity patterns present in the evaluated real-world datasets allow the fine-grained strategy to eliminate most redundant transfers, and the target hardware uses a two-tier GPU network where intra-node links are substantially faster than inter-node links."}},"verdict_id":"7f7b0d37-8aea-4198-85d3-10488b637450"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0ba940037a9813013da45364c2567ad1caecb56e42d6da10787eb640a8b4126c","target":"record","created_at":"2026-05-18T03:09:32Z","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":"bdeca8ee6a43454ff0a015f230839c0ae3c281bc08782a7aae5bfc65bfe53338","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-12-23T09:16:52Z","title_canon_sha256":"7b507e33d65dafa141601d7b49b33bf4cd00a1a9f0f98411add37bae730ce762"},"schema_version":"1.0","source":{"id":"2512.20178","kind":"arxiv","version":2}},"canonical_sha256":"fb4ffa8ba84d6037fbf3a74d2265eb557d6e7c2dda2d47a9d7ba4cda05685854","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb4ffa8ba84d6037fbf3a74d2265eb557d6e7c2dda2d47a9d7ba4cda05685854","first_computed_at":"2026-05-18T03:09:32.471914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:32.471914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fxikS7MzAqnL38YTwk5yQVhhw8pIE7ZjNJnASPqI3VaA5ZLwQVbPj7jzofDBpESEW5FcYqg+7fdBPIDiaEuUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:32.472604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.20178","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ba940037a9813013da45364c2567ad1caecb56e42d6da10787eb640a8b4126c","sha256:404a3102e7e6cfd6a1d3559663625f817fb0552367be1327169068d6f889672a"],"state_sha256":"59806be5004cfbfb7f94dbbfcad7a759a45b8938abc8acde12e78e7b2b84e62d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqI/erASXYYeXAAoHgdLvJJpAerKHwqgkjiF8I7QJM67i20zz+4agXKjjcPIFqUv0088Wa+dUQB+lJ41C4PZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:08:54.526345Z","bundle_sha256":"dfbb94d8127eb81122423aacb7a91a9443b74d21cf8894c9e7d500bba5eb5360"}}