{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TNG767DFN7B55HCR32PORNT6GL","short_pith_number":"pith:TNG767DF","schema_version":"1.0","canonical_sha256":"9b4dff7c656fc3de9c51de9ee8b67e32fea9b41b8174140b22b340b09e9f9ace","source":{"kind":"arxiv","id":"1512.01187","version":3},"attestation_state":"computed","paper":{"title":"On the State Complexity of the Shuffle of Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Aayush Rajasekaran, Bo Liu, Galina Jir\\'askov\\'a, Janusz Brzozowski, Marek Szyku{\\l}a","submitted_at":"2015-12-03T18:51:56Z","abstract_excerpt":"We investigate the shuffle operation on regular languages represented by complete deterministic finite automata. We prove that $f(m,n)=2^{mn-1} + 2^{(m-1)(n-1)}(2^{m-1}-1)(2^{n-1}-1)$ is an upper bound on the state complexity of the shuffle of two regular languages having state complexities $m$ and $n$, respectively. We also state partial results about the tightness of this bound. We show that there exist witness languages meeting the bound if $2\\le m\\le 5$ and $n\\ge2$, and also if $m=n=6$. Moreover, we prove that in the subset automaton of the NFA accepting the shuffle, all $2^{mn}$ states ca"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.01187","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-12-03T18:51:56Z","cross_cats_sorted":[],"title_canon_sha256":"f61caa041937ff9e0f5044f158ae235592e58e1a6f58d4fe73bd80428a97550d","abstract_canon_sha256":"b0bb6363d864e71ce0ad73301d48e81cd93c941125c243846322f589ee9a9475"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:03.388527Z","signature_b64":"cNU0mpjehLEzFQYzL5LnzKdU0DQ1G/Y0LUcYeBGFHpGM3SbPmU/MUkfOPUk9Tc3qnrnzW3454T6eT1c5YxuFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b4dff7c656fc3de9c51de9ee8b67e32fea9b41b8174140b22b340b09e9f9ace","last_reissued_at":"2026-05-18T01:11:03.388141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:03.388141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the State Complexity of the Shuffle of Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Aayush Rajasekaran, Bo Liu, Galina Jir\\'askov\\'a, Janusz Brzozowski, Marek Szyku{\\l}a","submitted_at":"2015-12-03T18:51:56Z","abstract_excerpt":"We investigate the shuffle operation on regular languages represented by complete deterministic finite automata. We prove that $f(m,n)=2^{mn-1} + 2^{(m-1)(n-1)}(2^{m-1}-1)(2^{n-1}-1)$ is an upper bound on the state complexity of the shuffle of two regular languages having state complexities $m$ and $n$, respectively. We also state partial results about the tightness of this bound. We show that there exist witness languages meeting the bound if $2\\le m\\le 5$ and $n\\ge2$, and also if $m=n=6$. Moreover, we prove that in the subset automaton of the NFA accepting the shuffle, all $2^{mn}$ states ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01187","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.01187","created_at":"2026-05-18T01:11:03.388209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01187v3","created_at":"2026-05-18T01:11:03.388209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01187","created_at":"2026-05-18T01:11:03.388209+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNG767DFN7B5","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNG767DFN7B55HCR","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNG767DF","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL","json":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL.json","graph_json":"https://pith.science/api/pith-number/TNG767DFN7B55HCR32PORNT6GL/graph.json","events_json":"https://pith.science/api/pith-number/TNG767DFN7B55HCR32PORNT6GL/events.json","paper":"https://pith.science/paper/TNG767DF"},"agent_actions":{"view_html":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL","download_json":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL.json","view_paper":"https://pith.science/paper/TNG767DF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01187&json=true","fetch_graph":"https://pith.science/api/pith-number/TNG767DFN7B55HCR32PORNT6GL/graph.json","fetch_events":"https://pith.science/api/pith-number/TNG767DFN7B55HCR32PORNT6GL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/action/storage_attestation","attest_author":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/action/author_attestation","sign_citation":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/action/citation_signature","submit_replication":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/action/replication_record"}},"created_at":"2026-05-18T01:11:03.388209+00:00","updated_at":"2026-05-18T01:11:03.388209+00:00"}