{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:F6FPFZRHQWE3ZETT6YXHOLKJIW","short_pith_number":"pith:F6FPFZRH","schema_version":"1.0","canonical_sha256":"2f8af2e6278589bc9273f62e772d4945a6f672a2151efeda150ec7c3738c568f","source":{"kind":"arxiv","id":"1006.4843","version":3},"attestation_state":"computed","paper":{"title":"Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Baiyu Li, Galina Jir\\'askov\\'a, Janusz Brzozowski, Joshua Smith","submitted_at":"2010-06-24T17:35:17Z","abstract_excerpt":"A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where \"subword\" means \"subsequence\". A language is bifix-free if it is both prefix- and suffix-free. We study the quotient complexity, more commonly known as state complexity, of operations in the classes of bifix-, factor-, and subword-free regular languages. We find tight upper bounds on the quotient complexity of intersection, union, difference, symmetric difference, concatenation, star, and reversal in these three classes of l"},"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":"1006.4843","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-06-24T17:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"53908e6dae4c858cebaaaf4cde76fac9cc75387de0e841fb5eba58b3eef23d48","abstract_canon_sha256":"d1d04e822ce429e3f2f2a7c37cd747dabaa0006c3cb7f3343e0b41aa6ebcf184"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:11.461489Z","signature_b64":"V3durz5LNwTXJwb2UuCJ7MmwSoHI86xOLOr+7htt8azA5ugZrKyd/lFYVLvdHeV8lbBsxleul6DF1Yrw1RKlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f8af2e6278589bc9273f62e772d4945a6f672a2151efeda150ec7c3738c568f","last_reissued_at":"2026-05-18T04:22:11.461095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:11.461095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Baiyu Li, Galina Jir\\'askov\\'a, Janusz Brzozowski, Joshua Smith","submitted_at":"2010-06-24T17:35:17Z","abstract_excerpt":"A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where \"subword\" means \"subsequence\". A language is bifix-free if it is both prefix- and suffix-free. We study the quotient complexity, more commonly known as state complexity, of operations in the classes of bifix-, factor-, and subword-free regular languages. We find tight upper bounds on the quotient complexity of intersection, union, difference, symmetric difference, concatenation, star, and reversal in these three classes of l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4843","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":"1006.4843","created_at":"2026-05-18T04:22:11.461155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.4843v3","created_at":"2026-05-18T04:22:11.461155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4843","created_at":"2026-05-18T04:22:11.461155+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6FPFZRHQWE3","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6FPFZRHQWE3ZETT","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6FPFZRH","created_at":"2026-05-18T12:26:06.534383+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/F6FPFZRHQWE3ZETT6YXHOLKJIW","json":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW.json","graph_json":"https://pith.science/api/pith-number/F6FPFZRHQWE3ZETT6YXHOLKJIW/graph.json","events_json":"https://pith.science/api/pith-number/F6FPFZRHQWE3ZETT6YXHOLKJIW/events.json","paper":"https://pith.science/paper/F6FPFZRH"},"agent_actions":{"view_html":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW","download_json":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW.json","view_paper":"https://pith.science/paper/F6FPFZRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.4843&json=true","fetch_graph":"https://pith.science/api/pith-number/F6FPFZRHQWE3ZETT6YXHOLKJIW/graph.json","fetch_events":"https://pith.science/api/pith-number/F6FPFZRHQWE3ZETT6YXHOLKJIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/action/storage_attestation","attest_author":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/action/author_attestation","sign_citation":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/action/citation_signature","submit_replication":"https://pith.science/pith/F6FPFZRHQWE3ZETT6YXHOLKJIW/action/replication_record"}},"created_at":"2026-05-18T04:22:11.461155+00:00","updated_at":"2026-05-18T04:22:11.461155+00:00"}