{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GHABKQ577I3U34WD4AUYXG43X5","short_pith_number":"pith:GHABKQ57","schema_version":"1.0","canonical_sha256":"31c01543bffa374df2c3e0298b9b9bbf5316714c4bf2e819dafefc7bfa850530","source":{"kind":"arxiv","id":"1102.5389","version":2},"attestation_state":"computed","paper":{"title":"Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Joost J. Joosten","submitted_at":"2011-02-26T05:23:17Z","abstract_excerpt":"The aim of this paper is to undertake an experimental investigation of the trade-offs between program-size and time computational complexity. The investigation includes an exhaustive exploration and systematic study of the functions computed by the set of all 2-color Turing machines with 2, 3 and 4 states--denoted by (n,2) with n the number of states--with particular attention to the runtimes and space usages when the machines have access to larger resources (more states). We report that the average runtime of Turing machines computing a function almost surely increases as a function of the nu"},"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":"1102.5389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T05:23:17Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"79cd54cff11bfd65e3ae961d577a8559a3acd2164ca282958f7c5d322680e53c","abstract_canon_sha256":"a260b8b7ac97eb69177aa4297951ab54a6824585fe4b4984f9d2f92c49683a8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.068860Z","signature_b64":"DArg93sQ2wMyxTwdTpK2nPHcNkVpxinkvNnjWBTxR6DUYLvsbVB/1yf2XMEFSyfDFRl9TsgIWiU7xVO+4qvQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31c01543bffa374df2c3e0298b9b9bbf5316714c4bf2e819dafefc7bfa850530","last_reissued_at":"2026-05-18T02:22:31.068364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.068364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Joost J. Joosten","submitted_at":"2011-02-26T05:23:17Z","abstract_excerpt":"The aim of this paper is to undertake an experimental investigation of the trade-offs between program-size and time computational complexity. The investigation includes an exhaustive exploration and systematic study of the functions computed by the set of all 2-color Turing machines with 2, 3 and 4 states--denoted by (n,2) with n the number of states--with particular attention to the runtimes and space usages when the machines have access to larger resources (more states). We report that the average runtime of Turing machines computing a function almost surely increases as a function of the nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5389","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":"1102.5389","created_at":"2026-05-18T02:22:31.068439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5389v2","created_at":"2026-05-18T02:22:31.068439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5389","created_at":"2026-05-18T02:22:31.068439+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHABKQ577I3U","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHABKQ577I3U34WD","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHABKQ57","created_at":"2026-05-18T12:26:28.662955+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/GHABKQ577I3U34WD4AUYXG43X5","json":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5.json","graph_json":"https://pith.science/api/pith-number/GHABKQ577I3U34WD4AUYXG43X5/graph.json","events_json":"https://pith.science/api/pith-number/GHABKQ577I3U34WD4AUYXG43X5/events.json","paper":"https://pith.science/paper/GHABKQ57"},"agent_actions":{"view_html":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5","download_json":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5.json","view_paper":"https://pith.science/paper/GHABKQ57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5389&json=true","fetch_graph":"https://pith.science/api/pith-number/GHABKQ577I3U34WD4AUYXG43X5/graph.json","fetch_events":"https://pith.science/api/pith-number/GHABKQ577I3U34WD4AUYXG43X5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/action/storage_attestation","attest_author":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/action/author_attestation","sign_citation":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/action/citation_signature","submit_replication":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/action/replication_record"}},"created_at":"2026-05-18T02:22:31.068439+00:00","updated_at":"2026-05-18T02:22:31.068439+00:00"}