{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VNZPCVWUHRC2ZSFMM64POBNEF2","short_pith_number":"pith:VNZPCVWU","schema_version":"1.0","canonical_sha256":"ab72f156d43c45acc8ac67b8f705a42e8515b7ffc16ffff39465a4fdcc68b436","source":{"kind":"arxiv","id":"1503.02208","version":2},"attestation_state":"computed","paper":{"title":"Quotient Complexities of Atoms in Regular Ideal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Sylvie Davies","submitted_at":"2015-03-07T20:04:22Z","abstract_excerpt":"A (left) quotient of a language $L$ by a word $w$ is the language $w^{-1}L=\\{x\\mid wx\\in L\\}$. The quotient complexity of a regular language $L$ is the number of quotients of $L$; it is equal to the state complexity of $L$, which is the number of states in a minimal deterministic finite automaton accepting $L$. An atom of $L$ is an equivalence class of the relation in which two words are equivalent if for each quotient, they either are both in the quotient or both not in it; hence it is a non-empty intersection of complemented and uncomplemented quotients of $L$. A right (respectively, left an"},"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":"1503.02208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-03-07T20:04:22Z","cross_cats_sorted":[],"title_canon_sha256":"60c0a58a370c5f92e78434a00ea7d0539d782aa02bb4e780c826149eaf915ab5","abstract_canon_sha256":"21279f48627ee8d0a989f88efc41ae3ab02be9d452e21f6de9ab58901b369ee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:48.022829Z","signature_b64":"PUqAOzeY3rVWZw1dDeNj6vlok4o+5YW5/cLTf4b9VR2Hsk0HVbJPFL1aaNw9FSa7ttW0CM7XwxCk8xk0VdmqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab72f156d43c45acc8ac67b8f705a42e8515b7ffc16ffff39465a4fdcc68b436","last_reissued_at":"2026-05-18T02:03:48.022428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:48.022428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quotient Complexities of Atoms in Regular Ideal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Sylvie Davies","submitted_at":"2015-03-07T20:04:22Z","abstract_excerpt":"A (left) quotient of a language $L$ by a word $w$ is the language $w^{-1}L=\\{x\\mid wx\\in L\\}$. The quotient complexity of a regular language $L$ is the number of quotients of $L$; it is equal to the state complexity of $L$, which is the number of states in a minimal deterministic finite automaton accepting $L$. An atom of $L$ is an equivalence class of the relation in which two words are equivalent if for each quotient, they either are both in the quotient or both not in it; hence it is a non-empty intersection of complemented and uncomplemented quotients of $L$. A right (respectively, left an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02208","kind":"arxiv","version":2},"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":"1503.02208","created_at":"2026-05-18T02:03:48.022490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02208v2","created_at":"2026-05-18T02:03:48.022490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02208","created_at":"2026-05-18T02:03:48.022490+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNZPCVWUHRC2","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNZPCVWUHRC2ZSFM","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNZPCVWU","created_at":"2026-05-18T12:29:47.479230+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/VNZPCVWUHRC2ZSFMM64POBNEF2","json":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2.json","graph_json":"https://pith.science/api/pith-number/VNZPCVWUHRC2ZSFMM64POBNEF2/graph.json","events_json":"https://pith.science/api/pith-number/VNZPCVWUHRC2ZSFMM64POBNEF2/events.json","paper":"https://pith.science/paper/VNZPCVWU"},"agent_actions":{"view_html":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2","download_json":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2.json","view_paper":"https://pith.science/paper/VNZPCVWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02208&json=true","fetch_graph":"https://pith.science/api/pith-number/VNZPCVWUHRC2ZSFMM64POBNEF2/graph.json","fetch_events":"https://pith.science/api/pith-number/VNZPCVWUHRC2ZSFMM64POBNEF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2/action/storage_attestation","attest_author":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2/action/author_attestation","sign_citation":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2/action/citation_signature","submit_replication":"https://pith.science/pith/VNZPCVWUHRC2ZSFMM64POBNEF2/action/replication_record"}},"created_at":"2026-05-18T02:03:48.022490+00:00","updated_at":"2026-05-18T02:03:48.022490+00:00"}