{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QG3NDQALNYKLTRFDHFBCG7ZZIY","short_pith_number":"pith:QG3NDQAL","schema_version":"1.0","canonical_sha256":"81b6d1c00b6e14b9c4a33942237f39463af18446c812357d0806f26cb5d16f82","source":{"kind":"arxiv","id":"1308.2970","version":1},"attestation_state":"computed","paper":{"title":"Gap Theorems for the Delay of Circuits Simulating Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger","submitted_at":"2013-08-13T20:09:06Z","abstract_excerpt":"We study the delay (also known as depth) of circuits that simulate finite automata, showing that only certain growth rates (as a function of the number $n$ of steps simulated) are possible. A classic result due to Ofman (rediscovered and popularized by Ladner and Fischer) says that delay $O(\\log n)$ is always sufficient. We show that if the automaton is \"generalized definite\", then delay O(1) is sufficient, but otherwise delay $\\Omega(\\log n)$ is necessary; there are no intermediate growth rates. We also consider \"physical\" (rather than \"logical\") delay, whereby we consider the lengths of wire"},"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":"1308.2970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-13T20:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"59ee9809404204195d4ccae3abf1812d2cfb959ab0d421040b302e3078096a50","abstract_canon_sha256":"fd147cfcc00d5ca1e09f82af1413bc4d7b19468910b15e9768efad16cdaeb1e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:57.061025Z","signature_b64":"KT12W7/QAM6QQd4puF17WQkBGx/7f3Ycqtxqb7C0CPQCJBg0oChyZxK7m3uvPReG6y0pzY9RMg84pflzqK7NCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81b6d1c00b6e14b9c4a33942237f39463af18446c812357d0806f26cb5d16f82","last_reissued_at":"2026-05-18T03:15:57.060508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:57.060508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gap Theorems for the Delay of Circuits Simulating Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger","submitted_at":"2013-08-13T20:09:06Z","abstract_excerpt":"We study the delay (also known as depth) of circuits that simulate finite automata, showing that only certain growth rates (as a function of the number $n$ of steps simulated) are possible. A classic result due to Ofman (rediscovered and popularized by Ladner and Fischer) says that delay $O(\\log n)$ is always sufficient. We show that if the automaton is \"generalized definite\", then delay O(1) is sufficient, but otherwise delay $\\Omega(\\log n)$ is necessary; there are no intermediate growth rates. We also consider \"physical\" (rather than \"logical\") delay, whereby we consider the lengths of wire"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2970","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":"1308.2970","created_at":"2026-05-18T03:15:57.060581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2970v1","created_at":"2026-05-18T03:15:57.060581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2970","created_at":"2026-05-18T03:15:57.060581+00:00"},{"alias_kind":"pith_short_12","alias_value":"QG3NDQALNYKL","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QG3NDQALNYKLTRFD","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QG3NDQAL","created_at":"2026-05-18T12:27:57.521954+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/QG3NDQALNYKLTRFDHFBCG7ZZIY","json":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY.json","graph_json":"https://pith.science/api/pith-number/QG3NDQALNYKLTRFDHFBCG7ZZIY/graph.json","events_json":"https://pith.science/api/pith-number/QG3NDQALNYKLTRFDHFBCG7ZZIY/events.json","paper":"https://pith.science/paper/QG3NDQAL"},"agent_actions":{"view_html":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY","download_json":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY.json","view_paper":"https://pith.science/paper/QG3NDQAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2970&json=true","fetch_graph":"https://pith.science/api/pith-number/QG3NDQALNYKLTRFDHFBCG7ZZIY/graph.json","fetch_events":"https://pith.science/api/pith-number/QG3NDQALNYKLTRFDHFBCG7ZZIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY/action/storage_attestation","attest_author":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY/action/author_attestation","sign_citation":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY/action/citation_signature","submit_replication":"https://pith.science/pith/QG3NDQALNYKLTRFDHFBCG7ZZIY/action/replication_record"}},"created_at":"2026-05-18T03:15:57.060581+00:00","updated_at":"2026-05-18T03:15:57.060581+00:00"}