{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5EAGTJR5IM6HE7NR4D6WNDCX7L","short_pith_number":"pith:5EAGTJR5","schema_version":"1.0","canonical_sha256":"e90069a63d433c727db1e0fd668c57fac615b643e71b419d9c5165a8b31af9bd","source":{"kind":"arxiv","id":"1903.03504","version":1},"attestation_state":"computed","paper":{"title":"On counting functions and slenderness of languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bala Ravikumar, Ian McQuillan, Oscar H. Ibarra","submitted_at":"2019-03-08T15:31:31Z","abstract_excerpt":"We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$. We show that the languages accepted by unambiguous nondeterministic Turing machines with a one-way read-only input tape and a reversal-bounded worktape are counting-regular. Many one-way acceptors are a special case of this model, such as reversal-bounded deterministic pushdown automata, reversal-bounded deterministic queue automata, and many others, and therefore all languages accepted by these models "},"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":"1903.03504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-08T15:31:31Z","cross_cats_sorted":[],"title_canon_sha256":"95c17e5d6db4d7c31fd8f8e2eca5d03829b4eb75b9c434090f425f25b365c0f5","abstract_canon_sha256":"6e35e8b77e30df42b1e9f5c7a06491b2993d1dcb78f2ba85ad3c12ee493b0f40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:45.316734Z","signature_b64":"nfHwqqtK+yf4edmjMgJHaq3wqFgbJqnj+5ZRpPYLs1ROvPEgN0OTEG9ifHpres2zCbPSM+omyG0WRzkaW9fdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e90069a63d433c727db1e0fd668c57fac615b643e71b419d9c5165a8b31af9bd","last_reissued_at":"2026-05-17T23:51:45.316195Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:45.316195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On counting functions and slenderness of languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bala Ravikumar, Ian McQuillan, Oscar H. Ibarra","submitted_at":"2019-03-08T15:31:31Z","abstract_excerpt":"We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$. We show that the languages accepted by unambiguous nondeterministic Turing machines with a one-way read-only input tape and a reversal-bounded worktape are counting-regular. Many one-way acceptors are a special case of this model, such as reversal-bounded deterministic pushdown automata, reversal-bounded deterministic queue automata, and many others, and therefore all languages accepted by these models "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03504","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":"1903.03504","created_at":"2026-05-17T23:51:45.316285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03504v1","created_at":"2026-05-17T23:51:45.316285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03504","created_at":"2026-05-17T23:51:45.316285+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EAGTJR5IM6H","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EAGTJR5IM6HE7NR","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EAGTJR5","created_at":"2026-05-18T12:33:10.108867+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/5EAGTJR5IM6HE7NR4D6WNDCX7L","json":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L.json","graph_json":"https://pith.science/api/pith-number/5EAGTJR5IM6HE7NR4D6WNDCX7L/graph.json","events_json":"https://pith.science/api/pith-number/5EAGTJR5IM6HE7NR4D6WNDCX7L/events.json","paper":"https://pith.science/paper/5EAGTJR5"},"agent_actions":{"view_html":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L","download_json":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L.json","view_paper":"https://pith.science/paper/5EAGTJR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03504&json=true","fetch_graph":"https://pith.science/api/pith-number/5EAGTJR5IM6HE7NR4D6WNDCX7L/graph.json","fetch_events":"https://pith.science/api/pith-number/5EAGTJR5IM6HE7NR4D6WNDCX7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L/action/storage_attestation","attest_author":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L/action/author_attestation","sign_citation":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L/action/citation_signature","submit_replication":"https://pith.science/pith/5EAGTJR5IM6HE7NR4D6WNDCX7L/action/replication_record"}},"created_at":"2026-05-17T23:51:45.316285+00:00","updated_at":"2026-05-17T23:51:45.316285+00:00"}