{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QN5VUKGEIUYBPB25TIRIJ4ELRO","short_pith_number":"pith:QN5VUKGE","canonical_record":{"source":{"id":"2605.15422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:11:32Z","cross_cats_sorted":[],"title_canon_sha256":"bcef22882ae0c0e12e2fa46db7c1ea5c84b611c710238209048bb404d247513d","abstract_canon_sha256":"ce139c5bf72a0fba8a5a24fc1bb0885710718a7981820315d4c5748c1cb754e2"},"schema_version":"1.0"},"canonical_sha256":"837b5a28c4453017875d9a2284f08b8ba0f258dbb11aa3cad223f918809633d5","source":{"kind":"arxiv","id":"2605.15422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15422","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15422v1","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15422","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_12","alias_value":"QN5VUKGEIUYB","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_16","alias_value":"QN5VUKGEIUYBPB25","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_8","alias_value":"QN5VUKGE","created_at":"2026-05-20T00:00:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QN5VUKGEIUYBPB25TIRIJ4ELRO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:11:32Z","cross_cats_sorted":[],"title_canon_sha256":"bcef22882ae0c0e12e2fa46db7c1ea5c84b611c710238209048bb404d247513d","abstract_canon_sha256":"ce139c5bf72a0fba8a5a24fc1bb0885710718a7981820315d4c5748c1cb754e2"},"schema_version":"1.0"},"canonical_sha256":"837b5a28c4453017875d9a2284f08b8ba0f258dbb11aa3cad223f918809633d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:57.755496Z","signature_b64":"JU8VH/eqfO+fWHmwPO1zIAg06ekEO2PcdkLtvqJsml7f9UNMkw9efwUtnR8DS3/qUMhyxfyJMo2Wi90rQBlYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837b5a28c4453017875d9a2284f08b8ba0f258dbb11aa3cad223f918809633d5","last_reissued_at":"2026-05-20T00:00:57.754659Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:57.754659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15422","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-20T00:00:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tul9l9BlZRQhALly/iQY2I1GWLsKZHQyPmHGbID8eG5mrKP1jomb1D0xzqEB9TbI49Ssy5gpcgyvVEHROJWsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:40:05.941178Z"},"content_sha256":"130aac1b663b424be68448f72e67206c312fe515b943dafe1074b975083f2f7a","schema_version":"1.0","event_id":"sha256:130aac1b663b424be68448f72e67206c312fe515b943dafe1074b975083f2f7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QN5VUKGEIUYBPB25TIRIJ4ELRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DualKV: Shared-Prompt Flash Attention for Efficient RL Training with Large Rollouts and Long Contexts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"DualKV processes shared prompts only once in FlashAttention for RL training by exploiting causal masking invariance, matching standard attention exactly.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bernie Wang, George Karypis, Jiading Gai, Shuai Zhang, Xiang Song","submitted_at":"2026-05-14T21:11:32Z","abstract_excerpt":"Modern RL post-training methods such as GRPO and DAPO train on $N$ response sequences of $R$ tokens sampled from a shared prompt of $P$ tokens, but standard FlashAttention replicates all $P$ prompt tokens $N$ times across both forward and backward passes -- duplicating compute and memory on identical hidden states. In large-rollout, long-context RL training ($N{\\geq}16$, $P{\\geq}8\\text{K}$), this redundancy dominates the policy update cost. We observe that in decoder-only models, causal masking makes prompt representations invariant across sequences at every layer, so all per-token operations "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"DualKV is mathematically equivalent to standard attention and introduces no approximation. On Qwen3-8B GRPO training with 8×H100 GPUs (N=32, 8K-context), DualKV achieves 1.63–2.09× policy-update speedup, enables 2× larger micro-batches, and raises MFU from 36% to 76%.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"In decoder-only models, causal masking makes prompt representations invariant across sequences at every layer, so all per-token operations and attention can process the prompt once (abstract, paragraph describing the observation).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DualKV is a new FlashAttention variant that shares prompt KV across multiple rollouts in RL training, delivering 1.63-3.82x speedups on 8B-30B models while remaining mathematically identical to standard attention.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"DualKV processes shared prompts only once in FlashAttention for RL training by exploiting causal masking invariance, matching standard attention exactly.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"31df40883e728bbb76b282d1ac88c204521e2fcf9bf4ed41ce5eb05dc5934d5b"},"source":{"id":"2605.15422","kind":"arxiv","version":1},"verdict":{"id":"68cda3a5-a1b4-482d-ac53-20dbd03651b4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:44:11.884822Z","strongest_claim":"DualKV is mathematically equivalent to standard attention and introduces no approximation. On Qwen3-8B GRPO training with 8×H100 GPUs (N=32, 8K-context), DualKV achieves 1.63–2.09× policy-update speedup, enables 2× larger micro-batches, and raises MFU from 36% to 76%.","one_line_summary":"DualKV is a new FlashAttention variant that shares prompt KV across multiple rollouts in RL training, delivering 1.63-3.82x speedups on 8B-30B models while remaining mathematically identical to standard attention.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"In decoder-only models, causal masking makes prompt representations invariant across sequences at every layer, so all per-token operations and attention can process the prompt once (abstract, paragraph describing the observation).","pith_extraction_headline":"DualKV processes shared prompts only once in FlashAttention for RL training by exploiting causal masking invariance, matching standard attention exactly."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15422/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T16:21:59.016600Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.989510Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:53:36.271500Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:41.500301Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.140747Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.702711Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8b2f9c16037f649a58266e651ce8d320f56d9acd0e1e4b55d323abe385ff8d55"},"references":{"count":25,"sample":[{"doi":"","year":2024,"title":"Bifurcated attention: Accelerating massively parallel decoding with shared prefixes in llms","work_id":"7353d30d-3132-48af-8070-2a40878f39a3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","ref_index":2,"cited_arxiv_id":"2110.14168","is_internal_anchor":true},{"doi":"","year":2024,"title":"Flash A ttention-2: Faster attention with better parallelism and work partitioning","work_id":"13dd723a-2982-4f98-8abe-4d295b2a8d9e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Fu, Stefano Ermon, Atri Rudra, and Christopher R \\'e","work_id":"b7c95fa2-0ee8-4a45-9b26-e6f825786a34","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"The Llama 3 Herd of Models","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","ref_index":5,"cited_arxiv_id":"2407.21783","is_internal_anchor":true}],"resolved_work":25,"snapshot_sha256":"d8172a818a0692673a06d2e4eb71a42a6ae956e6bfa52fbd5cadca376d54b6b5","internal_anchors":12},"formal_canon":{"evidence_count":1,"snapshot_sha256":"9b83cf7ec90d4109ae5b141933b7d94633d197cf0ba00669021597c9a3839401"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"68cda3a5-a1b4-482d-ac53-20dbd03651b4"},"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:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wl3Gbw2cNSQxcgpWQD0IFtncIp+hggVjty7TNmNLh1Tf9+1p7UXP0jFWkyiSFuC7LXyT+w5H2jjabIpRre3sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:40:05.942356Z"},"content_sha256":"1fd2298a58ebb21a7d6d2ff076bed60355e5d1f5883f6593473c69b90dfcbd3c","schema_version":"1.0","event_id":"sha256:1fd2298a58ebb21a7d6d2ff076bed60355e5d1f5883f6593473c69b90dfcbd3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN5VUKGEIUYBPB25TIRIJ4ELRO/bundle.json","state_url":"https://pith.science/pith/QN5VUKGEIUYBPB25TIRIJ4ELRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN5VUKGEIUYBPB25TIRIJ4ELRO/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-06-05T05:40:05Z","links":{"resolver":"https://pith.science/pith/QN5VUKGEIUYBPB25TIRIJ4ELRO","bundle":"https://pith.science/pith/QN5VUKGEIUYBPB25TIRIJ4ELRO/bundle.json","state":"https://pith.science/pith/QN5VUKGEIUYBPB25TIRIJ4ELRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN5VUKGEIUYBPB25TIRIJ4ELRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QN5VUKGEIUYBPB25TIRIJ4ELRO","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":"ce139c5bf72a0fba8a5a24fc1bb0885710718a7981820315d4c5748c1cb754e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:11:32Z","title_canon_sha256":"bcef22882ae0c0e12e2fa46db7c1ea5c84b611c710238209048bb404d247513d"},"schema_version":"1.0","source":{"id":"2605.15422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15422","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15422v1","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15422","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_12","alias_value":"QN5VUKGEIUYB","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_16","alias_value":"QN5VUKGEIUYBPB25","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_8","alias_value":"QN5VUKGE","created_at":"2026-05-20T00:00:57Z"}],"graph_snapshots":[{"event_id":"sha256:1fd2298a58ebb21a7d6d2ff076bed60355e5d1f5883f6593473c69b90dfcbd3c","target":"graph","created_at":"2026-05-20T00:00:57Z","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":"DualKV is mathematically equivalent to standard attention and introduces no approximation. On Qwen3-8B GRPO training with 8×H100 GPUs (N=32, 8K-context), DualKV achieves 1.63–2.09× policy-update speedup, enables 2× larger micro-batches, and raises MFU from 36% to 76%."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"In decoder-only models, causal masking makes prompt representations invariant across sequences at every layer, so all per-token operations and attention can process the prompt once (abstract, paragraph describing the observation)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"DualKV is a new FlashAttention variant that shares prompt KV across multiple rollouts in RL training, delivering 1.63-3.82x speedups on 8B-30B models while remaining mathematically identical to standard attention."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"DualKV processes shared prompts only once in FlashAttention for RL training by exploiting causal masking invariance, matching standard attention exactly."}],"snapshot_sha256":"31df40883e728bbb76b282d1ac88c204521e2fcf9bf4ed41ce5eb05dc5934d5b"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"9b83cf7ec90d4109ae5b141933b7d94633d197cf0ba00669021597c9a3839401"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T16:21:59.016600Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.989510Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:53:36.271500Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:41.500301Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.140747Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.702711Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15422/integrity.json","findings":[],"snapshot_sha256":"8b2f9c16037f649a58266e651ce8d320f56d9acd0e1e4b55d323abe385ff8d55","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modern RL post-training methods such as GRPO and DAPO train on $N$ response sequences of $R$ tokens sampled from a shared prompt of $P$ tokens, but standard FlashAttention replicates all $P$ prompt tokens $N$ times across both forward and backward passes -- duplicating compute and memory on identical hidden states. In large-rollout, long-context RL training ($N{\\geq}16$, $P{\\geq}8\\text{K}$), this redundancy dominates the policy update cost. We observe that in decoder-only models, causal masking makes prompt representations invariant across sequences at every layer, so all per-token operations ","authors_text":"Bernie Wang, George Karypis, Jiading Gai, Shuai Zhang, Xiang Song","cross_cats":[],"headline":"DualKV processes shared prompts only once in FlashAttention for RL training by exploiting causal masking invariance, matching standard attention exactly.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:11:32Z","title":"DualKV: Shared-Prompt Flash Attention for Efficient RL Training with Large Rollouts and Long Contexts"},"references":{"count":25,"internal_anchors":12,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Bifurcated attention: Accelerating massively parallel decoding with shared prefixes in llms","work_id":"7353d30d-3132-48af-8070-2a40878f39a3","year":2024},{"cited_arxiv_id":"2110.14168","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Flash A ttention-2: Faster attention with better parallelism and work partitioning","work_id":"13dd723a-2982-4f98-8abe-4d295b2a8d9e","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Fu, Stefano Ermon, Atri Rudra, and Christopher R \\'e","work_id":"b7c95fa2-0ee8-4a45-9b26-e6f825786a34","year":2022},{"cited_arxiv_id":"2407.21783","doi":"","is_internal_anchor":true,"ref_index":5,"title":"The Llama 3 Herd of Models","work_id":"1549a635-88af-4ac1-acfe-51ae7bb53345","year":2024}],"snapshot_sha256":"d8172a818a0692673a06d2e4eb71a42a6ae956e6bfa52fbd5cadca376d54b6b5"},"source":{"id":"2605.15422","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:44:11.884822Z","id":"68cda3a5-a1b4-482d-ac53-20dbd03651b4","model_set":{"reader":"grok-4.3"},"one_line_summary":"DualKV is a new FlashAttention variant that shares prompt KV across multiple rollouts in RL training, delivering 1.63-3.82x speedups on 8B-30B models while remaining mathematically identical to standard attention.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"DualKV processes shared prompts only once in FlashAttention for RL training by exploiting causal masking invariance, matching standard attention exactly.","strongest_claim":"DualKV is mathematically equivalent to standard attention and introduces no approximation. On Qwen3-8B GRPO training with 8×H100 GPUs (N=32, 8K-context), DualKV achieves 1.63–2.09× policy-update speedup, enables 2× larger micro-batches, and raises MFU from 36% to 76%.","weakest_assumption":"In decoder-only models, causal masking makes prompt representations invariant across sequences at every layer, so all per-token operations and attention can process the prompt once (abstract, paragraph describing the observation)."}},"verdict_id":"68cda3a5-a1b4-482d-ac53-20dbd03651b4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:130aac1b663b424be68448f72e67206c312fe515b943dafe1074b975083f2f7a","target":"record","created_at":"2026-05-20T00:00:57Z","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":"ce139c5bf72a0fba8a5a24fc1bb0885710718a7981820315d4c5748c1cb754e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:11:32Z","title_canon_sha256":"bcef22882ae0c0e12e2fa46db7c1ea5c84b611c710238209048bb404d247513d"},"schema_version":"1.0","source":{"id":"2605.15422","kind":"arxiv","version":1}},"canonical_sha256":"837b5a28c4453017875d9a2284f08b8ba0f258dbb11aa3cad223f918809633d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"837b5a28c4453017875d9a2284f08b8ba0f258dbb11aa3cad223f918809633d5","first_computed_at":"2026-05-20T00:00:57.754659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:57.754659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JU8VH/eqfO+fWHmwPO1zIAg06ekEO2PcdkLtvqJsml7f9UNMkw9efwUtnR8DS3/qUMhyxfyJMo2Wi90rQBlYBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:57.755496Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:130aac1b663b424be68448f72e67206c312fe515b943dafe1074b975083f2f7a","sha256:1fd2298a58ebb21a7d6d2ff076bed60355e5d1f5883f6593473c69b90dfcbd3c"],"state_sha256":"80ef2f6f9cc7b3b042c4506412e0b5e72c5c2de81b2e419b58446291b1c71fa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gDxejtxmru14BoJp/NWST1msC+yjWrmSVoXyMZyIusEfSd8qWwfj3xg9pTANEoF6pqzHrPLoLHLhezpBIP6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:40:05.948267Z","bundle_sha256":"c4f6c4e801026070366f9a065ace75035e9eb21e87cca4004cab3c761b1451f1"}}