{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U6Y2KEGLYWAXXIFMLFTAJQKMPS","short_pith_number":"pith:U6Y2KEGL","canonical_record":{"source":{"id":"1602.01387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-03T17:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"1ab62c4cb68cc166f4f9bc5e56dc1a307e2ac2eb98dd33580b1367ed49199801","abstract_canon_sha256":"d79bbe8f83af08496f034c760743cac5bd90ec7244f01d1c0c1dc47a2f92ee9e"},"schema_version":"1.0"},"canonical_sha256":"a7b1a510cbc5817ba0ac596604c14c7c8a2bf7daf0131b5d61a9e4c2eea027db","source":{"kind":"arxiv","id":"1602.01387","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01387","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01387v3","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01387","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"U6Y2KEGLYWAX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6Y2KEGLYWAXXIFM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6Y2KEGL","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U6Y2KEGLYWAXXIFMLFTAJQKMPS","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-03T17:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"1ab62c4cb68cc166f4f9bc5e56dc1a307e2ac2eb98dd33580b1367ed49199801","abstract_canon_sha256":"d79bbe8f83af08496f034c760743cac5bd90ec7244f01d1c0c1dc47a2f92ee9e"},"schema_version":"1.0"},"canonical_sha256":"a7b1a510cbc5817ba0ac596604c14c7c8a2bf7daf0131b5d61a9e4c2eea027db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.528268Z","signature_b64":"YVfWN5H7UcKjxe372bcEIcK4D8WqYR4Wetl3hxzn3USojT6N0RqZLH6J+9Whxx1aNh8NjTocxYt31mxBGqmPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7b1a510cbc5817ba0ac596604c14c7c8a2bf7daf0131b5d61a9e4c2eea027db","last_reissued_at":"2026-05-18T01:12:34.527656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.527656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01387","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:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNh8oE5HOkj4nj/yR6RqBHXn5Jlb1fsW1dGyb/P3o6/zCpEo8Jwpuq5I5tXULMcE4+HCBMHktB1DuyPbJfW5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:19:51.743940Z"},"content_sha256":"164482dcc03095786ea869e5aa89b5ccca902bfb614106777e91dbd3d4575cc3","schema_version":"1.0","event_id":"sha256:164482dcc03095786ea869e5aa89b5ccca902bfb614106777e91dbd3d4575cc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U6Y2KEGLYWAXXIFMLFTAJQKMPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unrestricted State Complexity of Binary Operations on Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski","submitted_at":"2016-02-03T17:39:33Z","abstract_excerpt":"I study the state complexity of binary operations on regular languages over different alphabets. It is well known that if $L'_m$ and $L_n$ are languages restricted to be over the same alphabet, with $m$ and $n$ quotients, respectively, the state complexity of any binary boolean operation on $L'_m$ and $L_n$ is $mn$, and that of the product (concatenation) is $(m-1)2^n +2^{n-1}$. In contrast to this, I show that if $L'_m$ and $L_n$ are over their own different alphabets, the state complexity of union and symmetric difference is $mn+m+n+1$, that of intersection is $mn$, that of difference is $mn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01387","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:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buGd/FBVaz+svWqsmzh4fRtH2e9NtLEypHGc4I6C311MoO1aYRfi7LSzomtf5KxwxsgYd/DSf+afVV9fpQDFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:19:51.744622Z"},"content_sha256":"b5daf6683e9a6b082c76babf708761d68f61272605f0a334e137f4686f132f88","schema_version":"1.0","event_id":"sha256:b5daf6683e9a6b082c76babf708761d68f61272605f0a334e137f4686f132f88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6Y2KEGLYWAXXIFMLFTAJQKMPS/bundle.json","state_url":"https://pith.science/pith/U6Y2KEGLYWAXXIFMLFTAJQKMPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6Y2KEGLYWAXXIFMLFTAJQKMPS/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-30T07:19:51Z","links":{"resolver":"https://pith.science/pith/U6Y2KEGLYWAXXIFMLFTAJQKMPS","bundle":"https://pith.science/pith/U6Y2KEGLYWAXXIFMLFTAJQKMPS/bundle.json","state":"https://pith.science/pith/U6Y2KEGLYWAXXIFMLFTAJQKMPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6Y2KEGLYWAXXIFMLFTAJQKMPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U6Y2KEGLYWAXXIFMLFTAJQKMPS","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":"d79bbe8f83af08496f034c760743cac5bd90ec7244f01d1c0c1dc47a2f92ee9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-03T17:39:33Z","title_canon_sha256":"1ab62c4cb68cc166f4f9bc5e56dc1a307e2ac2eb98dd33580b1367ed49199801"},"schema_version":"1.0","source":{"id":"1602.01387","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01387","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01387v3","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01387","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"U6Y2KEGLYWAX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6Y2KEGLYWAXXIFM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6Y2KEGL","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:b5daf6683e9a6b082c76babf708761d68f61272605f0a334e137f4686f132f88","target":"graph","created_at":"2026-05-18T01:12:34Z","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":"I study the state complexity of binary operations on regular languages over different alphabets. It is well known that if $L'_m$ and $L_n$ are languages restricted to be over the same alphabet, with $m$ and $n$ quotients, respectively, the state complexity of any binary boolean operation on $L'_m$ and $L_n$ is $mn$, and that of the product (concatenation) is $(m-1)2^n +2^{n-1}$. In contrast to this, I show that if $L'_m$ and $L_n$ are over their own different alphabets, the state complexity of union and symmetric difference is $mn+m+n+1$, that of intersection is $mn$, that of difference is $mn","authors_text":"Janusz Brzozowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-03T17:39:33Z","title":"Unrestricted State Complexity of Binary Operations on Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01387","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:164482dcc03095786ea869e5aa89b5ccca902bfb614106777e91dbd3d4575cc3","target":"record","created_at":"2026-05-18T01:12:34Z","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":"d79bbe8f83af08496f034c760743cac5bd90ec7244f01d1c0c1dc47a2f92ee9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-03T17:39:33Z","title_canon_sha256":"1ab62c4cb68cc166f4f9bc5e56dc1a307e2ac2eb98dd33580b1367ed49199801"},"schema_version":"1.0","source":{"id":"1602.01387","kind":"arxiv","version":3}},"canonical_sha256":"a7b1a510cbc5817ba0ac596604c14c7c8a2bf7daf0131b5d61a9e4c2eea027db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7b1a510cbc5817ba0ac596604c14c7c8a2bf7daf0131b5d61a9e4c2eea027db","first_computed_at":"2026-05-18T01:12:34.527656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:34.527656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YVfWN5H7UcKjxe372bcEIcK4D8WqYR4Wetl3hxzn3USojT6N0RqZLH6J+9Whxx1aNh8NjTocxYt31mxBGqmPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:34.528268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01387","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:164482dcc03095786ea869e5aa89b5ccca902bfb614106777e91dbd3d4575cc3","sha256:b5daf6683e9a6b082c76babf708761d68f61272605f0a334e137f4686f132f88"],"state_sha256":"e4aa99fc8803f508cc83e785b44c7eea141d76a88846e72c2c4e0f3faaab7522"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHd0kYDfTtW3yy2I+e7lyHORUE0UlPGL7TfTBIfg1xNar1HiVS4JsiN/oPkphJ5dXdr2ajjKXW1yIu3M104NCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:19:51.748732Z","bundle_sha256":"9b71e31e6d58fb4edf2d6973b0decd91e14f1a80f2fad35a7e90ab090790b4d6"}}