{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QUL2G5ZTASZAQETKO236CL5BC3","short_pith_number":"pith:QUL2G5ZT","schema_version":"1.0","canonical_sha256":"8517a3773304b208126a76b7e12fa116d739d7a33139ea19e012f3a21ff7bc0a","source":{"kind":"arxiv","id":"1502.01462","version":2},"attestation_state":"computed","paper":{"title":"Unary probabilistic and quantum automata on promise problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Abuzer Yakaryilmaz, Aida Gainutdinova","submitted_at":"2015-02-05T08:53:07Z","abstract_excerpt":"We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentia"},"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":"1502.01462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-05T08:53:07Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"7b91dc8ecee74c53a43c68a372fc945f35b162c8a9aa2d9af9e0e8395627120e","abstract_canon_sha256":"f47a44c3f99cd0b3b3f521aa219a5738d5f5f4318ac6e071a5d4bcaa6d8d5129"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:04.434501Z","signature_b64":"ivsT73CQcXp+QtNZpwAchgcUAbEepvOCQFM9ifieVU9E2mG2Jc9gtMScpbG9gM+x3nDOD/+2eEn8qqA30cjQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8517a3773304b208126a76b7e12fa116d739d7a33139ea19e012f3a21ff7bc0a","last_reissued_at":"2026-05-18T02:25:04.434146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:04.434146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unary probabilistic and quantum automata on promise problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Abuzer Yakaryilmaz, Aida Gainutdinova","submitted_at":"2015-02-05T08:53:07Z","abstract_excerpt":"We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01462","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":"1502.01462","created_at":"2026-05-18T02:25:04.434200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01462v2","created_at":"2026-05-18T02:25:04.434200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01462","created_at":"2026-05-18T02:25:04.434200+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUL2G5ZTASZA","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUL2G5ZTASZAQETK","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUL2G5ZT","created_at":"2026-05-18T12:29:39.896362+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/QUL2G5ZTASZAQETKO236CL5BC3","json":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3.json","graph_json":"https://pith.science/api/pith-number/QUL2G5ZTASZAQETKO236CL5BC3/graph.json","events_json":"https://pith.science/api/pith-number/QUL2G5ZTASZAQETKO236CL5BC3/events.json","paper":"https://pith.science/paper/QUL2G5ZT"},"agent_actions":{"view_html":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3","download_json":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3.json","view_paper":"https://pith.science/paper/QUL2G5ZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01462&json=true","fetch_graph":"https://pith.science/api/pith-number/QUL2G5ZTASZAQETKO236CL5BC3/graph.json","fetch_events":"https://pith.science/api/pith-number/QUL2G5ZTASZAQETKO236CL5BC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3/action/storage_attestation","attest_author":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3/action/author_attestation","sign_citation":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3/action/citation_signature","submit_replication":"https://pith.science/pith/QUL2G5ZTASZAQETKO236CL5BC3/action/replication_record"}},"created_at":"2026-05-18T02:25:04.434200+00:00","updated_at":"2026-05-18T02:25:04.434200+00:00"}