{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U5PLFTRKJIBFJRIUKT3PKEMAD5","short_pith_number":"pith:U5PLFTRK","schema_version":"1.0","canonical_sha256":"a75eb2ce2a4a0254c51454f6f511801f73e4464f616a1272fe408c88984d3294","source":{"kind":"arxiv","id":"1110.2230","version":1},"attestation_state":"computed","paper":{"title":"The complexity of small universal Turing machines: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Damien Woods, Turlough Neary","submitted_at":"2011-10-10T23:22:17Z","abstract_excerpt":"We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. In addition, another"},"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":"1110.2230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-10T23:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"bf8ffcab5256d2ed84e9ee9567cf10de77dcdf82e5656454b2c6160d673a40d8","abstract_canon_sha256":"a7474bd3d80b604ab98b870da58a7a6e45f28dc922907b625a54bad0e3ed1410"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:17.304072Z","signature_b64":"93eOQ0SbBhdnFnLRrcKnCP8vtgP2mreC7KExQ3NMBalBt/KlNteCtovmFwR6ObBYAQirLN9pMfP/AkOFAictBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a75eb2ce2a4a0254c51454f6f511801f73e4464f616a1272fe408c88984d3294","last_reissued_at":"2026-05-18T04:11:17.303536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:17.303536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of small universal Turing machines: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Damien Woods, Turlough Neary","submitted_at":"2011-10-10T23:22:17Z","abstract_excerpt":"We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. In addition, another"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2230","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":"1110.2230","created_at":"2026-05-18T04:11:17.303618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2230v1","created_at":"2026-05-18T04:11:17.303618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2230","created_at":"2026-05-18T04:11:17.303618+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5PLFTRKJIBF","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5PLFTRKJIBFJRIU","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5PLFTRK","created_at":"2026-05-18T12:26:42.757692+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/U5PLFTRKJIBFJRIUKT3PKEMAD5","json":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5.json","graph_json":"https://pith.science/api/pith-number/U5PLFTRKJIBFJRIUKT3PKEMAD5/graph.json","events_json":"https://pith.science/api/pith-number/U5PLFTRKJIBFJRIUKT3PKEMAD5/events.json","paper":"https://pith.science/paper/U5PLFTRK"},"agent_actions":{"view_html":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5","download_json":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5.json","view_paper":"https://pith.science/paper/U5PLFTRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2230&json=true","fetch_graph":"https://pith.science/api/pith-number/U5PLFTRKJIBFJRIUKT3PKEMAD5/graph.json","fetch_events":"https://pith.science/api/pith-number/U5PLFTRKJIBFJRIUKT3PKEMAD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5/action/storage_attestation","attest_author":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5/action/author_attestation","sign_citation":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5/action/citation_signature","submit_replication":"https://pith.science/pith/U5PLFTRKJIBFJRIUKT3PKEMAD5/action/replication_record"}},"created_at":"2026-05-18T04:11:17.303618+00:00","updated_at":"2026-05-18T04:11:17.303618+00:00"}