{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RRAHKHQCJ35WICXCK556J2DEKZ","short_pith_number":"pith:RRAHKHQC","canonical_record":{"source":{"id":"2506.05229","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-05T16:43:48Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"e169c9a11ac171b0468e1ad0d70a6d53d171afb1dac1a9708e2410e75e61f441","abstract_canon_sha256":"c83403386dc944aa45ba081da92bcea94d71ee80ad0667ba730d715583aa6385"},"schema_version":"1.0"},"canonical_sha256":"8c40751e024efb640ae2577be4e8645655febf360dd70346591d800ebea80f69","source":{"kind":"arxiv","id":"2506.05229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05229","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05229v1","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05229","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"RRAHKHQCJ35W","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"pith_short_16","alias_value":"RRAHKHQCJ35WICXC","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"pith_short_8","alias_value":"RRAHKHQC","created_at":"2026-07-05T11:16:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RRAHKHQCJ35WICXCK556J2DEKZ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.05229","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-05T16:43:48Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"e169c9a11ac171b0468e1ad0d70a6d53d171afb1dac1a9708e2410e75e61f441","abstract_canon_sha256":"c83403386dc944aa45ba081da92bcea94d71ee80ad0667ba730d715583aa6385"},"schema_version":"1.0"},"canonical_sha256":"8c40751e024efb640ae2577be4e8645655febf360dd70346591d800ebea80f69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:44.453618Z","signature_b64":"LhjwFy+cfWJzPet0uiLkHOEzIogPd5iRosAbBjXn2zqdCWtbpOAwsMOZhMJwfwKM2IfhxSNfHBP3gQkM0UiWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c40751e024efb640ae2577be4e8645655febf360dd70346591d800ebea80f69","last_reissued_at":"2026-07-05T11:16:44.453057Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:44.453057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.05229","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-07-05T11:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cagcmggWEbwp4R1RQNViIiTTwZ6/hSpQUu3TD+Y24FlT902yYSn0a1QhznuPYU+hyxJChKrX6COEhc/AzALOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:31:46.629901Z"},"content_sha256":"cdc29bc1a54fc8c0d839baf9b6b12f6ba125f6194b76c15af5cc6ebd3e0bc2a9","schema_version":"1.0","event_id":"sha256:cdc29bc1a54fc8c0d839baf9b6b12f6ba125f6194b76c15af5cc6ebd3e0bc2a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RRAHKHQCJ35WICXCK556J2DEKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diagonal Batching Unlocks Parallelism in Recurrent Memory Transformers for Long Contexts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Danil Sivtsov, Gleb Kuzmin, Ivan Oseledets, Ivan Rodkin, Yuri Kuratov","submitted_at":"2025-06-05T16:43:48Z","abstract_excerpt":"Transformer models struggle with long-context inference due to their quadratic time and linear memory complexity. Recurrent Memory Transformers (RMTs) offer a solution by reducing the asymptotic cost to linear time and constant memory usage. However, their memory update mechanism leads to sequential execution, causing a performance bottleneck.\n  We introduce Diagonal Batching, a scheduling scheme that unlocks parallelism across segments in RMTs while preserving exact recurrence. This approach eliminates the sequential constraint, enabling efficient GPU inference even for single long-context in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05229","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWZ331i4troyvFbrghRJq6SxsYHKSJ10Gi63ayMSE0OgID8d3yx9ZQZQPfX/UFWCXKMz3lmT2LuMckvY172oAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:31:46.630410Z"},"content_sha256":"7e0343eac6620b3fe8d5711243dfb019d57a27af462cb6459ce187b773c6fc77","schema_version":"1.0","event_id":"sha256:7e0343eac6620b3fe8d5711243dfb019d57a27af462cb6459ce187b773c6fc77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRAHKHQCJ35WICXCK556J2DEKZ/bundle.json","state_url":"https://pith.science/pith/RRAHKHQCJ35WICXCK556J2DEKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRAHKHQCJ35WICXCK556J2DEKZ/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-10T23:31:46Z","links":{"resolver":"https://pith.science/pith/RRAHKHQCJ35WICXCK556J2DEKZ","bundle":"https://pith.science/pith/RRAHKHQCJ35WICXCK556J2DEKZ/bundle.json","state":"https://pith.science/pith/RRAHKHQCJ35WICXCK556J2DEKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRAHKHQCJ35WICXCK556J2DEKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RRAHKHQCJ35WICXCK556J2DEKZ","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":"c83403386dc944aa45ba081da92bcea94d71ee80ad0667ba730d715583aa6385","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-05T16:43:48Z","title_canon_sha256":"e169c9a11ac171b0468e1ad0d70a6d53d171afb1dac1a9708e2410e75e61f441"},"schema_version":"1.0","source":{"id":"2506.05229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05229","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05229v1","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05229","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"RRAHKHQCJ35W","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"pith_short_16","alias_value":"RRAHKHQCJ35WICXC","created_at":"2026-07-05T11:16:44Z"},{"alias_kind":"pith_short_8","alias_value":"RRAHKHQC","created_at":"2026-07-05T11:16:44Z"}],"graph_snapshots":[{"event_id":"sha256:7e0343eac6620b3fe8d5711243dfb019d57a27af462cb6459ce187b773c6fc77","target":"graph","created_at":"2026-07-05T11:16:44Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.05229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Transformer models struggle with long-context inference due to their quadratic time and linear memory complexity. Recurrent Memory Transformers (RMTs) offer a solution by reducing the asymptotic cost to linear time and constant memory usage. However, their memory update mechanism leads to sequential execution, causing a performance bottleneck.\n  We introduce Diagonal Batching, a scheduling scheme that unlocks parallelism across segments in RMTs while preserving exact recurrence. This approach eliminates the sequential constraint, enabling efficient GPU inference even for single long-context in","authors_text":"Danil Sivtsov, Gleb Kuzmin, Ivan Oseledets, Ivan Rodkin, Yuri Kuratov","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-05T16:43:48Z","title":"Diagonal Batching Unlocks Parallelism in Recurrent Memory Transformers for Long Contexts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05229","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cdc29bc1a54fc8c0d839baf9b6b12f6ba125f6194b76c15af5cc6ebd3e0bc2a9","target":"record","created_at":"2026-07-05T11:16:44Z","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":"c83403386dc944aa45ba081da92bcea94d71ee80ad0667ba730d715583aa6385","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-05T16:43:48Z","title_canon_sha256":"e169c9a11ac171b0468e1ad0d70a6d53d171afb1dac1a9708e2410e75e61f441"},"schema_version":"1.0","source":{"id":"2506.05229","kind":"arxiv","version":1}},"canonical_sha256":"8c40751e024efb640ae2577be4e8645655febf360dd70346591d800ebea80f69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c40751e024efb640ae2577be4e8645655febf360dd70346591d800ebea80f69","first_computed_at":"2026-07-05T11:16:44.453057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:44.453057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LhjwFy+cfWJzPet0uiLkHOEzIogPd5iRosAbBjXn2zqdCWtbpOAwsMOZhMJwfwKM2IfhxSNfHBP3gQkM0UiWBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:44.453618Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdc29bc1a54fc8c0d839baf9b6b12f6ba125f6194b76c15af5cc6ebd3e0bc2a9","sha256:7e0343eac6620b3fe8d5711243dfb019d57a27af462cb6459ce187b773c6fc77"],"state_sha256":"65d6dd523605f1f70864b90cb1ab0e55cc35c11c3251041d40fe05e2a7a5df57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrW51eurZciExzc+NJfO3X4YOxixKrWo/T4tndtfcDKokZn/GJv7r/lZSfqUKPOkBlOohuXcRPcaN6TKWkXaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T23:31:46.634196Z","bundle_sha256":"c275f331454cd8c41ddcf28aff6aa915b2586a0d00202f0f33ff189b9ff4f1b8"}}