{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QKBIFHSLYL2DKHDO5AII2GHL3E","short_pith_number":"pith:QKBIFHSL","canonical_record":{"source":{"id":"2602.14814","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T15:07:51Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"44c9e4dba39c39d27e3e18c5b946737b5e3f5e0d261c15be2a6044475b9115c9","abstract_canon_sha256":"4f1957b2ee2225df17b2f6857f4c613ad67d87357f688904a44cc071b2ced8c7"},"schema_version":"1.0"},"canonical_sha256":"8282829e4bc2f4351c6ee8108d18ebd91d67e1977277a0116332e2557f69e4de","source":{"kind":"arxiv","id":"2602.14814","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.14814","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"2602.14814v3","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14814","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"QKBIFHSLYL2D","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"pith_short_16","alias_value":"QKBIFHSLYL2DKHDO","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"pith_short_8","alias_value":"QKBIFHSL","created_at":"2026-06-26T01:15:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QKBIFHSLYL2DKHDO5AII2GHL3E","target":"record","payload":{"canonical_record":{"source":{"id":"2602.14814","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T15:07:51Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"44c9e4dba39c39d27e3e18c5b946737b5e3f5e0d261c15be2a6044475b9115c9","abstract_canon_sha256":"4f1957b2ee2225df17b2f6857f4c613ad67d87357f688904a44cc071b2ced8c7"},"schema_version":"1.0"},"canonical_sha256":"8282829e4bc2f4351c6ee8108d18ebd91d67e1977277a0116332e2557f69e4de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:49.524122Z","signature_b64":"NQYjDgl9OZliEF1Shv64cXTOkHi5avIt3q5NH5tFCVJzrH8cWA7HQwoEFo6fVbtbyRRF5rVMWbavskbU+RYHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8282829e4bc2f4351c6ee8108d18ebd91d67e1977277a0116332e2557f69e4de","last_reissued_at":"2026-06-26T01:15:49.523626Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:49.523626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.14814","source_version":3,"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-06-26T01:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4XtTtjendlfCCu48wh7VXG5TWW+0Kyy7yPpQ7Jc1CSnb99KaZODY7zOd/3kNskFaV++KZi4vZBPgCubX6Q+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:35:25.622264Z"},"content_sha256":"757ef09d29e84b6a4862287b201318b314e21a008c02c4feaf372ea6ef59f9aa","schema_version":"1.0","event_id":"sha256:757ef09d29e84b6a4862287b201318b314e21a008c02c4feaf372ea6ef59f9aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QKBIFHSLYL2DKHDO5AII2GHL3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning State-Tracking from Code Using Linear RNNs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Linear RNNs track states from code traces of permutation compositions where Transformers fail.","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Babak Rahmani, Hitesh Ballani, Julien Siems, Kirill Kalinin, Korbinian P\\\"oppel, Riccardo Grazzi","submitted_at":"2026-02-16T15:07:51Z","abstract_excerpt":"Over the last years, state-tracking tasks, particularly permutation composition, have become a testbed to understand the limits of sequence models architectures like Transformers and RNNs (linear and non-linear). However, these are often sequence-to-sequence tasks: learning to map actions (permutations) to states, which is incompatible with the next-token prediction setting commonly used to train language models. We address this gap by converting permutation composition into code via REPL traces that interleave state-reveals through prints and variable transformations. We show that linear RNNs"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"linear RNNs capable of state-tracking excel also in this setting, while Transformers still fail","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the REPL trace conversion of permutation composition preserves the core state-tracking difficulty without introducing artifacts that favor linear RNNs over Transformers","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Linear RNNs track states from REPL code traces of permutations better than Transformers, but non-linear RNNs outperform them in partially observable probabilistic automata.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Linear RNNs track states from code traces of permutation compositions where Transformers fail.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"986ffa43995e33653ea64d3e58a5610c716a3f469ea9eda25c837b9c0f770727"},"source":{"id":"2602.14814","kind":"arxiv","version":3},"verdict":{"id":"67f84ff7-8d9f-4f1d-8d9c-349aa9324fc5","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T21:43:00.825735Z","strongest_claim":"linear RNNs capable of state-tracking excel also in this setting, while Transformers still fail","one_line_summary":"Linear RNNs track states from REPL code traces of permutations better than Transformers, but non-linear RNNs outperform them in partially observable probabilistic automata.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the REPL trace conversion of permutation composition preserves the core state-tracking difficulty without introducing artifacts that favor linear RNNs over Transformers","pith_extraction_headline":"Linear RNNs track states from code traces of permutation compositions where Transformers fail."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.14814/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":"67f84ff7-8d9f-4f1d-8d9c-349aa9324fc5"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-26T01:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhicGfrR5rxBCKScNjtDPDBa3WiwwCxBoCcTSYdGyiowOVQz9XSOyoRwrcgIcjABI0qhbR3ppLwbF6HWfS9lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:35:25.622688Z"},"content_sha256":"76c4528cb93d5565b279e30c777a531912f7dbe947ac6debf33e5c498b20869b","schema_version":"1.0","event_id":"sha256:76c4528cb93d5565b279e30c777a531912f7dbe947ac6debf33e5c498b20869b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKBIFHSLYL2DKHDO5AII2GHL3E/bundle.json","state_url":"https://pith.science/pith/QKBIFHSLYL2DKHDO5AII2GHL3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKBIFHSLYL2DKHDO5AII2GHL3E/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-14T10:35:25Z","links":{"resolver":"https://pith.science/pith/QKBIFHSLYL2DKHDO5AII2GHL3E","bundle":"https://pith.science/pith/QKBIFHSLYL2DKHDO5AII2GHL3E/bundle.json","state":"https://pith.science/pith/QKBIFHSLYL2DKHDO5AII2GHL3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKBIFHSLYL2DKHDO5AII2GHL3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QKBIFHSLYL2DKHDO5AII2GHL3E","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":"4f1957b2ee2225df17b2f6857f4c613ad67d87357f688904a44cc071b2ced8c7","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T15:07:51Z","title_canon_sha256":"44c9e4dba39c39d27e3e18c5b946737b5e3f5e0d261c15be2a6044475b9115c9"},"schema_version":"1.0","source":{"id":"2602.14814","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.14814","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"2602.14814v3","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14814","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"QKBIFHSLYL2D","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"pith_short_16","alias_value":"QKBIFHSLYL2DKHDO","created_at":"2026-06-26T01:15:49Z"},{"alias_kind":"pith_short_8","alias_value":"QKBIFHSL","created_at":"2026-06-26T01:15:49Z"}],"graph_snapshots":[{"event_id":"sha256:76c4528cb93d5565b279e30c777a531912f7dbe947ac6debf33e5c498b20869b","target":"graph","created_at":"2026-06-26T01:15:49Z","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":"linear RNNs capable of state-tracking excel also in this setting, while Transformers still fail"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the REPL trace conversion of permutation composition preserves the core state-tracking difficulty without introducing artifacts that favor linear RNNs over Transformers"},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Linear RNNs track states from REPL code traces of permutations better than Transformers, but non-linear RNNs outperform them in partially observable probabilistic automata."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Linear RNNs track states from code traces of permutation compositions where Transformers fail."}],"snapshot_sha256":"986ffa43995e33653ea64d3e58a5610c716a3f469ea9eda25c837b9c0f770727"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.14814/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Over the last years, state-tracking tasks, particularly permutation composition, have become a testbed to understand the limits of sequence models architectures like Transformers and RNNs (linear and non-linear). However, these are often sequence-to-sequence tasks: learning to map actions (permutations) to states, which is incompatible with the next-token prediction setting commonly used to train language models. We address this gap by converting permutation composition into code via REPL traces that interleave state-reveals through prints and variable transformations. We show that linear RNNs","authors_text":"Babak Rahmani, Hitesh Ballani, Julien Siems, Kirill Kalinin, Korbinian P\\\"oppel, Riccardo Grazzi","cross_cats":["cs.CL"],"headline":"Linear RNNs track states from code traces of permutation compositions where Transformers fail.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T15:07:51Z","title":"Learning State-Tracking from Code Using Linear RNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.14814","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-15T21:43:00.825735Z","id":"67f84ff7-8d9f-4f1d-8d9c-349aa9324fc5","model_set":{"reader":"grok-4.3"},"one_line_summary":"Linear RNNs track states from REPL code traces of permutations better than Transformers, but non-linear RNNs outperform them in partially observable probabilistic automata.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Linear RNNs track states from code traces of permutation compositions where Transformers fail.","strongest_claim":"linear RNNs capable of state-tracking excel also in this setting, while Transformers still fail","weakest_assumption":"That the REPL trace conversion of permutation composition preserves the core state-tracking difficulty without introducing artifacts that favor linear RNNs over Transformers"}},"verdict_id":"67f84ff7-8d9f-4f1d-8d9c-349aa9324fc5"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:757ef09d29e84b6a4862287b201318b314e21a008c02c4feaf372ea6ef59f9aa","target":"record","created_at":"2026-06-26T01:15:49Z","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":"4f1957b2ee2225df17b2f6857f4c613ad67d87357f688904a44cc071b2ced8c7","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-16T15:07:51Z","title_canon_sha256":"44c9e4dba39c39d27e3e18c5b946737b5e3f5e0d261c15be2a6044475b9115c9"},"schema_version":"1.0","source":{"id":"2602.14814","kind":"arxiv","version":3}},"canonical_sha256":"8282829e4bc2f4351c6ee8108d18ebd91d67e1977277a0116332e2557f69e4de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8282829e4bc2f4351c6ee8108d18ebd91d67e1977277a0116332e2557f69e4de","first_computed_at":"2026-06-26T01:15:49.523626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:15:49.523626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NQYjDgl9OZliEF1Shv64cXTOkHi5avIt3q5NH5tFCVJzrH8cWA7HQwoEFo6fVbtbyRRF5rVMWbavskbU+RYHDg==","signature_status":"signed_v1","signed_at":"2026-06-26T01:15:49.524122Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.14814","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:757ef09d29e84b6a4862287b201318b314e21a008c02c4feaf372ea6ef59f9aa","sha256:76c4528cb93d5565b279e30c777a531912f7dbe947ac6debf33e5c498b20869b"],"state_sha256":"9fac2749ad2ad354a18ae0a44e21b80ae5d05243f0d5a7ad4e556399b063ba88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WljRAyojzR6Zi9VtPYhJNIamd9juFN+bxpbFw6ATT8Yru+SrxIuxxJZv87mgEVbrKcoQbAXf3qKsHV/j9vvJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T10:35:25.625281Z","bundle_sha256":"a3519158fe72be6db6735a380072377d5d7f2e6a27dddc84988440ba2da06389"}}