{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NKAY3YMSYUYKRN5XD6OTOSUTGE","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":"848c4881b0351132e8fe45c39bf83a557c5e5080fdfd7488fce63d4164ec19de","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-03-27T08:25:56Z","title_canon_sha256":"44d232c44adbe35c18b55e9bdb3d9a3d70782647e1907e17a10ba59520b92ff5"},"schema_version":"1.0","source":{"id":"2603.26162","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.26162","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2603.26162v2","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.26162","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"NKAY3YMSYUYK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NKAY3YMSYUYKRN5X","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NKAY3YMS","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3c8489569f07d72e07b9fece412967e57bd846ed4b7dc5428f77162d18fb77c6","target":"graph","created_at":"2026-05-18T03:10:03Z","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":"This paper provides a robust toolset to show that a given trajectory would always shuffle two nonregular CFLs into a nonCFL. In the case of deterministic CFLs (DCFLs), a salient trichotomy of trajectories depending on how they shuffle DCFLs is provided."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The lemmata on how pushdown automata invoke the stack for nonregular CFLs or DCFLs hold, and the cited result of Jančar and Šima (MFCS'2021) applies without generalization issues to the DCFL case."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Regular trajectories are classified for their effect on shuffles of context-free languages, with tools to prove non-closure for nonregular CFLs and a trichotomy for DCFLs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Regular trajectories can force the shuffle of any two nonregular context-free languages to leave the context-free class."}],"snapshot_sha256":"b7ff896dd927c0d76d97ab6df6a4437958e63dfbc65fd9b345a1166dcc966ea9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In single-core processors, concurrency requires that multiple processes be interleaved into a single thread of execution by a scheduler. The language-theoretic operation that corresponds to this is the shuffle of two languages: the set of words obtained by interleaving a word from each language in an arbitrary, letter-wise fashion. It is well known that regular languages are closed under shuffles, while context-free languages (CFLs) are not. Following an established line of research, this paper considers shuffles according to regular ``trajectories,'' that is, subject to scheduling constraints","authors_text":"Corentin Barloy, Kyle Ockerlund, Micha\\\"el Cadilhac","cross_cats":[],"headline":"Regular trajectories can force the shuffle of any two nonregular context-free languages to leave the context-free class.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-03-27T08:25:56Z","title":"Shuffles of Context-Free Languages along Regular Trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.26162","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-14T23:23:18.890085Z","id":"33c68ae1-09c8-44ee-8817-81fe2913f989","model_set":{"reader":"grok-4.3"},"one_line_summary":"Regular trajectories are classified for their effect on shuffles of context-free languages, with tools to prove non-closure for nonregular CFLs and a trichotomy for DCFLs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Regular trajectories can force the shuffle of any two nonregular context-free languages to leave the context-free class.","strongest_claim":"This paper provides a robust toolset to show that a given trajectory would always shuffle two nonregular CFLs into a nonCFL. In the case of deterministic CFLs (DCFLs), a salient trichotomy of trajectories depending on how they shuffle DCFLs is provided.","weakest_assumption":"The lemmata on how pushdown automata invoke the stack for nonregular CFLs or DCFLs hold, and the cited result of Jančar and Šima (MFCS'2021) applies without generalization issues to the DCFL case."}},"verdict_id":"33c68ae1-09c8-44ee-8817-81fe2913f989"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6fb518168122186b941313f41ee5a9ef56489b90fc3d899a1a44072d46f9653e","target":"record","created_at":"2026-05-18T03:10:03Z","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":"848c4881b0351132e8fe45c39bf83a557c5e5080fdfd7488fce63d4164ec19de","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-03-27T08:25:56Z","title_canon_sha256":"44d232c44adbe35c18b55e9bdb3d9a3d70782647e1907e17a10ba59520b92ff5"},"schema_version":"1.0","source":{"id":"2603.26162","kind":"arxiv","version":2}},"canonical_sha256":"6a818de192c530a8b7b71f9d374a933122ead8c81361f307ddf6d6177577f546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a818de192c530a8b7b71f9d374a933122ead8c81361f307ddf6d6177577f546","first_computed_at":"2026-05-18T03:10:03.382147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:03.382147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6MvFYBIrREIPS9c+08Bn53Ae8IptT+vq+3JkXI27Of1d5Hu6bptE2qpuYnVQxEQPXjePUsMIkIgYHCLYnzlfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:03.382642Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.26162","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fb518168122186b941313f41ee5a9ef56489b90fc3d899a1a44072d46f9653e","sha256:3c8489569f07d72e07b9fece412967e57bd846ed4b7dc5428f77162d18fb77c6"],"state_sha256":"b0c70b1e93628c5cb051ca243054a6cb82cf62d122a186d4aa9ba0e6c72d59a9"}