{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TNG767DFN7B55HCR32PORNT6GL","short_pith_number":"pith:TNG767DF","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"},"canonical_sha256":"9b4dff7c656fc3de9c51de9ee8b67e32fea9b41b8174140b22b340b09e9f9ace","source":{"kind":"arxiv","id":"1512.01187","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01187","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01187v3","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01187","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"TNG767DFN7B5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TNG767DFN7B55HCR","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TNG767DF","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TNG767DFN7B55HCR32PORNT6GL","target":"record","payload":{"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"},"canonical_sha256":"9b4dff7c656fc3de9c51de9ee8b67e32fea9b41b8174140b22b340b09e9f9ace","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"},"source_kind":"arxiv","source_id":"1512.01187","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-05-18T01:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1m4Ll6AbUKzx48VajoTLbkUnK7bZpYBPfHMcuvIb17E9tkX8L5FROtBSnWzRdcIjAt73BBHYNTbaPCLT9TAGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:25:38.889612Z"},"content_sha256":"3ae30fb6bd02751cb54c7afc804b68130870edbd2bb4146737c9d65e5759dde3","schema_version":"1.0","event_id":"sha256:3ae30fb6bd02751cb54c7afc804b68130870edbd2bb4146737c9d65e5759dde3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TNG767DFN7B55HCR32PORNT6GL","target":"graph","payload":{"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"},"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-05-18T01:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZPy8bmMQzILclOGFT4d4FizuCLH4s4iXzx8G54FUFqMdOibX7WJmc6U0RKOMa71Mp5/6EOld2Nf8SAHtyGMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:25:38.890836Z"},"content_sha256":"9abdeba7bd93f0d67271c7716a0512b1ea830d41c1d380c1752fb099e2467b53","schema_version":"1.0","event_id":"sha256:9abdeba7bd93f0d67271c7716a0512b1ea830d41c1d380c1752fb099e2467b53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/bundle.json","state_url":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNG767DFN7B55HCR32PORNT6GL/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-05-31T22:25:38Z","links":{"resolver":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL","bundle":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/bundle.json","state":"https://pith.science/pith/TNG767DFN7B55HCR32PORNT6GL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNG767DFN7B55HCR32PORNT6GL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TNG767DFN7B55HCR32PORNT6GL","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":"b0bb6363d864e71ce0ad73301d48e81cd93c941125c243846322f589ee9a9475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-12-03T18:51:56Z","title_canon_sha256":"f61caa041937ff9e0f5044f158ae235592e58e1a6f58d4fe73bd80428a97550d"},"schema_version":"1.0","source":{"id":"1512.01187","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01187","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01187v3","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01187","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"TNG767DFN7B5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TNG767DFN7B55HCR","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TNG767DF","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:9abdeba7bd93f0d67271c7716a0512b1ea830d41c1d380c1752fb099e2467b53","target":"graph","created_at":"2026-05-18T01:11: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aayush Rajasekaran, Bo Liu, Galina Jir\\'askov\\'a, Janusz Brzozowski, Marek Szyku{\\l}a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-12-03T18:51:56Z","title":"On the State Complexity of the Shuffle of Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01187","kind":"arxiv","version":3},"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:3ae30fb6bd02751cb54c7afc804b68130870edbd2bb4146737c9d65e5759dde3","target":"record","created_at":"2026-05-18T01:11: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":"b0bb6363d864e71ce0ad73301d48e81cd93c941125c243846322f589ee9a9475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-12-03T18:51:56Z","title_canon_sha256":"f61caa041937ff9e0f5044f158ae235592e58e1a6f58d4fe73bd80428a97550d"},"schema_version":"1.0","source":{"id":"1512.01187","kind":"arxiv","version":3}},"canonical_sha256":"9b4dff7c656fc3de9c51de9ee8b67e32fea9b41b8174140b22b340b09e9f9ace","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b4dff7c656fc3de9c51de9ee8b67e32fea9b41b8174140b22b340b09e9f9ace","first_computed_at":"2026-05-18T01:11:03.388141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:03.388141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cNU0mpjehLEzFQYzL5LnzKdU0DQ1G/Y0LUcYeBGFHpGM3SbPmU/MUkfOPUk9Tc3qnrnzW3454T6eT1c5YxuFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:03.388527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01187","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae30fb6bd02751cb54c7afc804b68130870edbd2bb4146737c9d65e5759dde3","sha256:9abdeba7bd93f0d67271c7716a0512b1ea830d41c1d380c1752fb099e2467b53"],"state_sha256":"6f5f3616b3d37127277b494d5ee1e3b230491571e2f13872d7085323afe25a1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T20jidkVJsdMQ/F2hId//UlICTofsPM4L8brXbAczy0APDwLrlWkcxs0Dhix6522iJUWtYZblq4jJvD1C7CzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:25:38.894164Z","bundle_sha256":"88e7a941871149a0d3afc3dbcd21c0d79acfb02498194b02390aaa069ce36ad0"}}