{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4RY6IOYKXZP3PMSDPHG3HE6G4Z","short_pith_number":"pith:4RY6IOYK","schema_version":"1.0","canonical_sha256":"e471e43b0abe5fb7b24379cdb393c6e646681f7816a9cf7002e663efa15bf566","source":{"kind":"arxiv","id":"1710.06000","version":4},"attestation_state":"computed","paper":{"title":"State Complexity of Overlap Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bai Li, Janusz Brzozowski, Lila Kari, Marek Szyku{\\l}a","submitted_at":"2017-10-16T20:58:17Z","abstract_excerpt":"The \\emph{state complexity} of a regular language $L_m$ is the number $m$ of states in a minimal deterministic finite automaton (DFA) accepting $L_m$. The state complexity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where the two operands range over all languages of state complexities $\\le m$ and $\\le n$, respectively. We find a tight upper bound on the state complexity of the binary operation \\emph{overlap assembly} on regular languages. This operation was introduced by Csuhaj-Varj\\'u, Petre, and Va"},"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":"1710.06000","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-16T20:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"6bd1a08d57201f40ed5afbf179f4c2ee576b486ee144b6f238f29c15d80d9067","abstract_canon_sha256":"d22d3fef6456b020fe3a4c23a5820190918fac18d45a53fcc66c6e05a57fa5b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.139172Z","signature_b64":"oJyvkuYqlt136aVy+/2Mut4C7mq7OeWJ0Bb2y+Y/LLeGrK9KYF75NGSQFZwKWQwCxmCI/kdlVmP5y0Msn6PfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e471e43b0abe5fb7b24379cdb393c6e646681f7816a9cf7002e663efa15bf566","last_reissued_at":"2026-05-17T23:58:31.138537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.138537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"State Complexity of Overlap Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bai Li, Janusz Brzozowski, Lila Kari, Marek Szyku{\\l}a","submitted_at":"2017-10-16T20:58:17Z","abstract_excerpt":"The \\emph{state complexity} of a regular language $L_m$ is the number $m$ of states in a minimal deterministic finite automaton (DFA) accepting $L_m$. The state complexity of a regularity-preserving binary operation on regular languages is defined as the maximal state complexity of the result of the operation where the two operands range over all languages of state complexities $\\le m$ and $\\le n$, respectively. We find a tight upper bound on the state complexity of the binary operation \\emph{overlap assembly} on regular languages. This operation was introduced by Csuhaj-Varj\\'u, Petre, and Va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06000","kind":"arxiv","version":4},"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":"1710.06000","created_at":"2026-05-17T23:58:31.138641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06000v4","created_at":"2026-05-17T23:58:31.138641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06000","created_at":"2026-05-17T23:58:31.138641+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RY6IOYKXZP3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RY6IOYKXZP3PMSD","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RY6IOYK","created_at":"2026-05-18T12:31:00.734936+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/4RY6IOYKXZP3PMSDPHG3HE6G4Z","json":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z.json","graph_json":"https://pith.science/api/pith-number/4RY6IOYKXZP3PMSDPHG3HE6G4Z/graph.json","events_json":"https://pith.science/api/pith-number/4RY6IOYKXZP3PMSDPHG3HE6G4Z/events.json","paper":"https://pith.science/paper/4RY6IOYK"},"agent_actions":{"view_html":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z","download_json":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z.json","view_paper":"https://pith.science/paper/4RY6IOYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06000&json=true","fetch_graph":"https://pith.science/api/pith-number/4RY6IOYKXZP3PMSDPHG3HE6G4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/4RY6IOYKXZP3PMSDPHG3HE6G4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/action/storage_attestation","attest_author":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/action/author_attestation","sign_citation":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/action/citation_signature","submit_replication":"https://pith.science/pith/4RY6IOYKXZP3PMSDPHG3HE6G4Z/action/replication_record"}},"created_at":"2026-05-17T23:58:31.138641+00:00","updated_at":"2026-05-17T23:58:31.138641+00:00"}