{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:L7J4X3YRCMD5XL6VEMZ7KNTNS4","short_pith_number":"pith:L7J4X3YR","canonical_record":{"source":{"id":"2605.06017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T11:12:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3c943ca4d616f4547e3e7f674fb2b2d2d87fbf47e53ca5cc2ad2ca252ff6a284","abstract_canon_sha256":"a094d5c80fd5286647a73ce97f06c953cf00e0c65e4845ad8f29780b521ab35d"},"schema_version":"1.0"},"canonical_sha256":"5fd3cbef111307dbafd52333f5366d9703651ef387605453fd0f7b08b9b136b0","source":{"kind":"arxiv","id":"2605.06017","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06017","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06017v2","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06017","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"pith_short_12","alias_value":"L7J4X3YRCMD5","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7J4X3YRCMD5XL6V","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7J4X3YR","created_at":"2026-05-20T00:03:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:L7J4X3YRCMD5XL6VEMZ7KNTNS4","target":"record","payload":{"canonical_record":{"source":{"id":"2605.06017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T11:12:59Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3c943ca4d616f4547e3e7f674fb2b2d2d87fbf47e53ca5cc2ad2ca252ff6a284","abstract_canon_sha256":"a094d5c80fd5286647a73ce97f06c953cf00e0c65e4845ad8f29780b521ab35d"},"schema_version":"1.0"},"canonical_sha256":"5fd3cbef111307dbafd52333f5366d9703651ef387605453fd0f7b08b9b136b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:14.398438Z","signature_b64":"X8WybKab8jBmLJ36C/Bs5Q7kfaw2hzIsh5ixvrLRWn8GjRJjL7RwKy/KDxTNYR2Zl0t4qCRYuFfG8nUoHzSSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fd3cbef111307dbafd52333f5366d9703651ef387605453fd0f7b08b9b136b0","last_reissued_at":"2026-05-20T00:03:14.397270Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:14.397270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.06017","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-20T00:03:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5IYBd+32MWPZ+/KYP/uzXAulvIniqEnSWehJbtPvR7hCYBdpU8soMY3dEKunR9hmyHCTovCyseHMrtBS9qPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:23.780395Z"},"content_sha256":"0ddf93b1e451958f3ae3e581676c4c137972a9f0d5ea52fa2e188196c425ee8a","schema_version":"1.0","event_id":"sha256:0ddf93b1e451958f3ae3e581676c4c137972a9f0d5ea52fa2e188196c425ee8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:L7J4X3YRCMD5XL6VEMZ7KNTNS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix-Decoupled Concentration for Autoregressive Sequences: Dimension-Free Guarantees for Sparse Long-Context Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Matrix decoupling of causal dependencies yields dimension-free O(1) variance bounds for sparse rewards in autoregressive sequences.","cross_cats":["math.PR"],"primary_cat":"cs.LG","authors_text":"Pei-Sen Li","submitted_at":"2026-05-07T11:12:59Z","abstract_excerpt":"Sequence-level evaluations in autoregressive Large Language Models (LLMs) rely on highly dependent token generation. Establishing tight concentration bounds for these processes remains a challenge due to two fundamental bottlenecks in existing frameworks: (i) classical inequalities typically separate dependency structures from target sensitivities, leading to a scalar collapse that inflates the variance proxy to a suboptimal $\\mathcal{O}(N)$ for sparse terminal rewards; (ii) conversely, while certain spatial methods achieve tighter bounds, they lack the strictly causal filtration required by s"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we establish a sharp McDiarmid-type inequality for dependent sequences, governed strictly by the exact matrix-vector multiplication of the causal dependency resolvent and the target sensitivity vector. This Matrix-Decoupled Concentration (MDC) framework natively recovers optimal constants for Markov chains and exploits directed d-separation to yield order-optimal bounds for causal trees. Crucially, by exactly preserving the coordinate-wise sparsity of rewards within a strictly causal framework, MDC mathematically prevents scalar collapse, guaranteeing a dimension-free O(1) variance proxy","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The process admits a strictly causal filtration whose dependency structure can be represented by a well-defined resolvent matrix that exactly decouples the target sensitivity vector while preserving coordinate-wise sparsity of the reward.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Matrix-Decoupled Concentration achieves dimension-free O(1) variance bounds for sparse rewards in strictly causal autoregressive sequences by decoupling via the exact matrix-vector product of the dependency resolvent and sensitivity vector.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Matrix decoupling of causal dependencies yields dimension-free O(1) variance bounds for sparse rewards in autoregressive sequences.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1ccd6b49ab1f01a6acc238b2471dece2cf0e70f3bef4fabf17f18324ac40db77"},"source":{"id":"2605.06017","kind":"arxiv","version":2},"verdict":{"id":"eebf5833-054d-45b5-8d30-c01ed6847db6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T15:26:29.067015Z","strongest_claim":"we establish a sharp McDiarmid-type inequality for dependent sequences, governed strictly by the exact matrix-vector multiplication of the causal dependency resolvent and the target sensitivity vector. This Matrix-Decoupled Concentration (MDC) framework natively recovers optimal constants for Markov chains and exploits directed d-separation to yield order-optimal bounds for causal trees. Crucially, by exactly preserving the coordinate-wise sparsity of rewards within a strictly causal framework, MDC mathematically prevents scalar collapse, guaranteeing a dimension-free O(1) variance proxy","one_line_summary":"Matrix-Decoupled Concentration achieves dimension-free O(1) variance bounds for sparse rewards in strictly causal autoregressive sequences by decoupling via the exact matrix-vector product of the dependency resolvent and sensitivity vector.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The process admits a strictly causal filtration whose dependency structure can be represented by a well-defined resolvent matrix that exactly decouples the target sensitivity vector while preserving coordinate-wise sparsity of the reward.","pith_extraction_headline":"Matrix decoupling of causal dependencies yields dimension-free O(1) variance bounds for sparse rewards in autoregressive sequences."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.06017/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.185866Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T13:04:19.359377Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"022b29305ce0177b831f76e52e1947c57d2010d1e7e605dfed21c5849bdf4990"},"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":"eebf5833-054d-45b5-8d30-c01ed6847db6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/238EIdc94GHMh96ZGmqLJbw51U/YZZWRwfqA6G0jF/27VwFP0mQCzOO6ccwh7l7xXm1uFYj34kSkJBO3ZKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:23.781353Z"},"content_sha256":"278149319273e792908a8fb6d9ae1a3781bcc8dacc745b8cf8deac08d3928935","schema_version":"1.0","event_id":"sha256:278149319273e792908a8fb6d9ae1a3781bcc8dacc745b8cf8deac08d3928935"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7J4X3YRCMD5XL6VEMZ7KNTNS4/bundle.json","state_url":"https://pith.science/pith/L7J4X3YRCMD5XL6VEMZ7KNTNS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7J4X3YRCMD5XL6VEMZ7KNTNS4/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-06T03:57:23Z","links":{"resolver":"https://pith.science/pith/L7J4X3YRCMD5XL6VEMZ7KNTNS4","bundle":"https://pith.science/pith/L7J4X3YRCMD5XL6VEMZ7KNTNS4/bundle.json","state":"https://pith.science/pith/L7J4X3YRCMD5XL6VEMZ7KNTNS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7J4X3YRCMD5XL6VEMZ7KNTNS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L7J4X3YRCMD5XL6VEMZ7KNTNS4","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":"a094d5c80fd5286647a73ce97f06c953cf00e0c65e4845ad8f29780b521ab35d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T11:12:59Z","title_canon_sha256":"3c943ca4d616f4547e3e7f674fb2b2d2d87fbf47e53ca5cc2ad2ca252ff6a284"},"schema_version":"1.0","source":{"id":"2605.06017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06017","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06017v2","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06017","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"pith_short_12","alias_value":"L7J4X3YRCMD5","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7J4X3YRCMD5XL6V","created_at":"2026-05-20T00:03:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7J4X3YR","created_at":"2026-05-20T00:03:14Z"}],"graph_snapshots":[{"event_id":"sha256:278149319273e792908a8fb6d9ae1a3781bcc8dacc745b8cf8deac08d3928935","target":"graph","created_at":"2026-05-20T00:03:14Z","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 establish a sharp McDiarmid-type inequality for dependent sequences, governed strictly by the exact matrix-vector multiplication of the causal dependency resolvent and the target sensitivity vector. This Matrix-Decoupled Concentration (MDC) framework natively recovers optimal constants for Markov chains and exploits directed d-separation to yield order-optimal bounds for causal trees. Crucially, by exactly preserving the coordinate-wise sparsity of rewards within a strictly causal framework, MDC mathematically prevents scalar collapse, guaranteeing a dimension-free O(1) variance proxy"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The process admits a strictly causal filtration whose dependency structure can be represented by a well-defined resolvent matrix that exactly decouples the target sensitivity vector while preserving coordinate-wise sparsity of the reward."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Matrix-Decoupled Concentration achieves dimension-free O(1) variance bounds for sparse rewards in strictly causal autoregressive sequences by decoupling via the exact matrix-vector product of the dependency resolvent and sensitivity vector."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Matrix decoupling of causal dependencies yields dimension-free O(1) variance bounds for sparse rewards in autoregressive sequences."}],"snapshot_sha256":"1ccd6b49ab1f01a6acc238b2471dece2cf0e70f3bef4fabf17f18324ac40db77"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.185866Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T13:04:19.359377Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.06017/integrity.json","findings":[],"snapshot_sha256":"022b29305ce0177b831f76e52e1947c57d2010d1e7e605dfed21c5849bdf4990","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sequence-level evaluations in autoregressive Large Language Models (LLMs) rely on highly dependent token generation. Establishing tight concentration bounds for these processes remains a challenge due to two fundamental bottlenecks in existing frameworks: (i) classical inequalities typically separate dependency structures from target sensitivities, leading to a scalar collapse that inflates the variance proxy to a suboptimal $\\mathcal{O}(N)$ for sparse terminal rewards; (ii) conversely, while certain spatial methods achieve tighter bounds, they lack the strictly causal filtration required by s","authors_text":"Pei-Sen Li","cross_cats":["math.PR"],"headline":"Matrix decoupling of causal dependencies yields dimension-free O(1) variance bounds for sparse rewards in autoregressive sequences.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T11:12:59Z","title":"Matrix-Decoupled Concentration for Autoregressive Sequences: Dimension-Free Guarantees for Sparse Long-Context Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.06017","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T15:26:29.067015Z","id":"eebf5833-054d-45b5-8d30-c01ed6847db6","model_set":{"reader":"grok-4.3"},"one_line_summary":"Matrix-Decoupled Concentration achieves dimension-free O(1) variance bounds for sparse rewards in strictly causal autoregressive sequences by decoupling via the exact matrix-vector product of the dependency resolvent and sensitivity vector.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Matrix decoupling of causal dependencies yields dimension-free O(1) variance bounds for sparse rewards in autoregressive sequences.","strongest_claim":"we establish a sharp McDiarmid-type inequality for dependent sequences, governed strictly by the exact matrix-vector multiplication of the causal dependency resolvent and the target sensitivity vector. This Matrix-Decoupled Concentration (MDC) framework natively recovers optimal constants for Markov chains and exploits directed d-separation to yield order-optimal bounds for causal trees. Crucially, by exactly preserving the coordinate-wise sparsity of rewards within a strictly causal framework, MDC mathematically prevents scalar collapse, guaranteeing a dimension-free O(1) variance proxy","weakest_assumption":"The process admits a strictly causal filtration whose dependency structure can be represented by a well-defined resolvent matrix that exactly decouples the target sensitivity vector while preserving coordinate-wise sparsity of the reward."}},"verdict_id":"eebf5833-054d-45b5-8d30-c01ed6847db6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0ddf93b1e451958f3ae3e581676c4c137972a9f0d5ea52fa2e188196c425ee8a","target":"record","created_at":"2026-05-20T00:03:14Z","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":"a094d5c80fd5286647a73ce97f06c953cf00e0c65e4845ad8f29780b521ab35d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-07T11:12:59Z","title_canon_sha256":"3c943ca4d616f4547e3e7f674fb2b2d2d87fbf47e53ca5cc2ad2ca252ff6a284"},"schema_version":"1.0","source":{"id":"2605.06017","kind":"arxiv","version":2}},"canonical_sha256":"5fd3cbef111307dbafd52333f5366d9703651ef387605453fd0f7b08b9b136b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fd3cbef111307dbafd52333f5366d9703651ef387605453fd0f7b08b9b136b0","first_computed_at":"2026-05-20T00:03:14.397270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:14.397270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8WybKab8jBmLJ36C/Bs5Q7kfaw2hzIsh5ixvrLRWn8GjRJjL7RwKy/KDxTNYR2Zl0t4qCRYuFfG8nUoHzSSAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:14.398438Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ddf93b1e451958f3ae3e581676c4c137972a9f0d5ea52fa2e188196c425ee8a","sha256:278149319273e792908a8fb6d9ae1a3781bcc8dacc745b8cf8deac08d3928935"],"state_sha256":"264894f9df6a2da97873b34092c354cdec029e5d6dd60a1eae1e5366981d9747"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wsormlyG84W2lSqI3vh7dCEAZspfAIHJiCM0WePHjQkp06R4mlXg7QNQerbhJ6ih+COI7DrE5ImMZRA2MyZRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:57:23.785880Z","bundle_sha256":"b1bb032bb13dd2131878b2f0c36249a4da596e02e1ceb82edf9fcc21fd5e1bef"}}