{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MXZGHPGLUO76FWK4IVGEUQMNTD","short_pith_number":"pith:MXZGHPGL","schema_version":"1.0","canonical_sha256":"65f263bccba3bfe2d95c454c4a418d98ea7290a0210c20b674738cb576e37a48","source":{"kind":"arxiv","id":"1704.07860","version":1},"attestation_state":"computed","paper":{"title":"Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Markus Kr\\\"otzsch, Tom\\'a\\v{s} Masopust","submitted_at":"2017-04-25T18:44:13Z","abstract_excerpt":"An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Straubing-Th\\'erien hierarchy. Level 3/2 is recognized by poNFAs, level 1 by confluent, self-loop deterministic poNFAs as well as by confluent poDFAs, and level 1/2 by saturated poNFAs. We study the universality problem for confluent, self-loop deterministic poNFAs. It asks whether an automaton accepts all words over its alphabet. Universality for both NFAs and poNFAs is a PSpace-complete problem. For confluent, self-loop"},"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":"1704.07860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-25T18:44:13Z","cross_cats_sorted":[],"title_canon_sha256":"92b5b663d7dba7982949f7a9cd706e68817ceb81410799aaf4fc9e0c5c46b8bd","abstract_canon_sha256":"194e20b00f67c7d80b8b2935ea9ee0839809c6accb6e4c148a93441e8e2f8428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:31.702664Z","signature_b64":"1bhDdwUrW1dEI8O6+kr2bhtklO9oVp5eQS3nRiw6Cfp3ABdJYHR/+KJCg0sQaQCefKcRqi4rim7m9XpN6aDSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f263bccba3bfe2d95c454c4a418d98ea7290a0210c20b674738cb576e37a48","last_reissued_at":"2026-05-18T00:45:31.702145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:31.702145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Markus Kr\\\"otzsch, Tom\\'a\\v{s} Masopust","submitted_at":"2017-04-25T18:44:13Z","abstract_excerpt":"An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Straubing-Th\\'erien hierarchy. Level 3/2 is recognized by poNFAs, level 1 by confluent, self-loop deterministic poNFAs as well as by confluent poDFAs, and level 1/2 by saturated poNFAs. We study the universality problem for confluent, self-loop deterministic poNFAs. It asks whether an automaton accepts all words over its alphabet. Universality for both NFAs and poNFAs is a PSpace-complete problem. For confluent, self-loop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07860","kind":"arxiv","version":1},"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":"1704.07860","created_at":"2026-05-18T00:45:31.702229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07860v1","created_at":"2026-05-18T00:45:31.702229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07860","created_at":"2026-05-18T00:45:31.702229+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXZGHPGLUO76","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXZGHPGLUO76FWK4","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXZGHPGL","created_at":"2026-05-18T12:31:31.346846+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/MXZGHPGLUO76FWK4IVGEUQMNTD","json":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD.json","graph_json":"https://pith.science/api/pith-number/MXZGHPGLUO76FWK4IVGEUQMNTD/graph.json","events_json":"https://pith.science/api/pith-number/MXZGHPGLUO76FWK4IVGEUQMNTD/events.json","paper":"https://pith.science/paper/MXZGHPGL"},"agent_actions":{"view_html":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD","download_json":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD.json","view_paper":"https://pith.science/paper/MXZGHPGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07860&json=true","fetch_graph":"https://pith.science/api/pith-number/MXZGHPGLUO76FWK4IVGEUQMNTD/graph.json","fetch_events":"https://pith.science/api/pith-number/MXZGHPGLUO76FWK4IVGEUQMNTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD/action/storage_attestation","attest_author":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD/action/author_attestation","sign_citation":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD/action/citation_signature","submit_replication":"https://pith.science/pith/MXZGHPGLUO76FWK4IVGEUQMNTD/action/replication_record"}},"created_at":"2026-05-18T00:45:31.702229+00:00","updated_at":"2026-05-18T00:45:31.702229+00:00"}