{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SRIW4IQLXGZHTMPM62TFXGRMJ2","short_pith_number":"pith:SRIW4IQL","canonical_record":{"source":{"id":"1605.06697","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-21T20:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"96217abb8c3329c6066b95413aa8621dea6e6afc55a6598ab3aabdde0f71c785","abstract_canon_sha256":"a96123a324f2a2744d188907ba9217426df83ef4956f4bb880119c8298dc0415"},"schema_version":"1.0"},"canonical_sha256":"94516e220bb9b279b1ecf6a65b9a2c4ea7a0b2d584a2f713e5e42c6d702c1383","source":{"kind":"arxiv","id":"1605.06697","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06697","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06697v3","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06697","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"SRIW4IQLXGZH","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SRIW4IQLXGZHTMPM","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SRIW4IQL","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SRIW4IQLXGZHTMPM62TFXGRMJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06697","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-21T20:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"96217abb8c3329c6066b95413aa8621dea6e6afc55a6598ab3aabdde0f71c785","abstract_canon_sha256":"a96123a324f2a2744d188907ba9217426df83ef4956f4bb880119c8298dc0415"},"schema_version":"1.0"},"canonical_sha256":"94516e220bb9b279b1ecf6a65b9a2c4ea7a0b2d584a2f713e5e42c6d702c1383","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:57.513717Z","signature_b64":"SbPDoyi2CMyxX9if1BOO0kG9mPwJaw4p1cEs5blx1sy/2SRcIboh3F8LT53oAaDbcMvt8qnZ0ZWdGI5n7AJRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94516e220bb9b279b1ecf6a65b9a2c4ea7a0b2d584a2f713e5e42c6d702c1383","last_reissued_at":"2026-05-18T01:11:57.513345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:57.513345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06697","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:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0xocHmHSmgYIG2zamHcroX/wkmmkoUWl3MTXTdVgxB/vJ9f2p4OI2OUJMFGSL6gDxJn33BfygwO/SJU81gMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:03.730864Z"},"content_sha256":"111687d745ec90ae4262bf1b5ca31a1830f805591de7e30232a70d312ec6a24a","schema_version":"1.0","event_id":"sha256:111687d745ec90ae4262bf1b5ca31a1830f805591de7e30232a70d312ec6a24a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SRIW4IQLXGZHTMPM62TFXGRMJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Prefix-Convex Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Corwin Sinnamon, Janusz Brzozowski","submitted_at":"2016-05-21T20:19:17Z","abstract_excerpt":"A language $L$ over an alphabet $\\Sigma$ is prefix-convex if, for any words $x,y,z\\in\\Sigma^*$, whenever $x$ and $xyz$ are in $L$, then so is $xy$. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages. We study complexity properties of prefix-convex regular languages. In particular, we find the quotient/state complexity of boolean operations, product (concatenation), star, and reversal, the size of the syntactic semigroup, and the quotient complexity of atoms. For binary operations we use arguments with different alphabets when appropriate; this leads to higher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06697","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:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ypHBJLrGy+6JnGtA9NsqypX1X/Wrwaj7PUUVKv6QfAEGoQue+CFyauiMRwp9YgMbJIuCbeTDRI0egP96m60wCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:03.731234Z"},"content_sha256":"ff7cefb215974e731d5e81508f9b6fd409c196b9c80a33eedd13d8e1f8b3511c","schema_version":"1.0","event_id":"sha256:ff7cefb215974e731d5e81508f9b6fd409c196b9c80a33eedd13d8e1f8b3511c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRIW4IQLXGZHTMPM62TFXGRMJ2/bundle.json","state_url":"https://pith.science/pith/SRIW4IQLXGZHTMPM62TFXGRMJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRIW4IQLXGZHTMPM62TFXGRMJ2/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:17:03Z","links":{"resolver":"https://pith.science/pith/SRIW4IQLXGZHTMPM62TFXGRMJ2","bundle":"https://pith.science/pith/SRIW4IQLXGZHTMPM62TFXGRMJ2/bundle.json","state":"https://pith.science/pith/SRIW4IQLXGZHTMPM62TFXGRMJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRIW4IQLXGZHTMPM62TFXGRMJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SRIW4IQLXGZHTMPM62TFXGRMJ2","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":"a96123a324f2a2744d188907ba9217426df83ef4956f4bb880119c8298dc0415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-21T20:19:17Z","title_canon_sha256":"96217abb8c3329c6066b95413aa8621dea6e6afc55a6598ab3aabdde0f71c785"},"schema_version":"1.0","source":{"id":"1605.06697","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06697","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06697v3","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06697","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"SRIW4IQLXGZH","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SRIW4IQLXGZHTMPM","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SRIW4IQL","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:ff7cefb215974e731d5e81508f9b6fd409c196b9c80a33eedd13d8e1f8b3511c","target":"graph","created_at":"2026-05-18T01:11:57Z","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":"A language $L$ over an alphabet $\\Sigma$ is prefix-convex if, for any words $x,y,z\\in\\Sigma^*$, whenever $x$ and $xyz$ are in $L$, then so is $xy$. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages. We study complexity properties of prefix-convex regular languages. In particular, we find the quotient/state complexity of boolean operations, product (concatenation), star, and reversal, the size of the syntactic semigroup, and the quotient complexity of atoms. For binary operations we use arguments with different alphabets when appropriate; this leads to higher","authors_text":"Corwin Sinnamon, Janusz Brzozowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-21T20:19:17Z","title":"Complexity of Prefix-Convex Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06697","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:111687d745ec90ae4262bf1b5ca31a1830f805591de7e30232a70d312ec6a24a","target":"record","created_at":"2026-05-18T01:11:57Z","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":"a96123a324f2a2744d188907ba9217426df83ef4956f4bb880119c8298dc0415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-21T20:19:17Z","title_canon_sha256":"96217abb8c3329c6066b95413aa8621dea6e6afc55a6598ab3aabdde0f71c785"},"schema_version":"1.0","source":{"id":"1605.06697","kind":"arxiv","version":3}},"canonical_sha256":"94516e220bb9b279b1ecf6a65b9a2c4ea7a0b2d584a2f713e5e42c6d702c1383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94516e220bb9b279b1ecf6a65b9a2c4ea7a0b2d584a2f713e5e42c6d702c1383","first_computed_at":"2026-05-18T01:11:57.513345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:57.513345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SbPDoyi2CMyxX9if1BOO0kG9mPwJaw4p1cEs5blx1sy/2SRcIboh3F8LT53oAaDbcMvt8qnZ0ZWdGI5n7AJRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:57.513717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06697","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:111687d745ec90ae4262bf1b5ca31a1830f805591de7e30232a70d312ec6a24a","sha256:ff7cefb215974e731d5e81508f9b6fd409c196b9c80a33eedd13d8e1f8b3511c"],"state_sha256":"3eb179aeb03ab7fde93d875010be62274aa324286edd5109397efbe8da8ae32e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+kSncf15lUIXwxx2RqKylLZlcBgwGCDaHd5bsVuCxk/XJMo819oJ6vrm0ccksL8eqil58gg2z+2rHYxhP1LBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:17:03.733482Z","bundle_sha256":"6932e562288ebe5f38d48007ee63af8ebdd274c602ece9c108a6c455c8d4f815"}}