{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GHABKQ577I3U34WD4AUYXG43X5","short_pith_number":"pith:GHABKQ57","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"},"canonical_sha256":"31c01543bffa374df2c3e0298b9b9bbf5316714c4bf2e819dafefc7bfa850530","source":{"kind":"arxiv","id":"1102.5389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5389","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5389v2","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5389","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"GHABKQ577I3U","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GHABKQ577I3U34WD","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GHABKQ57","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GHABKQ577I3U34WD4AUYXG43X5","target":"record","payload":{"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"},"canonical_sha256":"31c01543bffa374df2c3e0298b9b9bbf5316714c4bf2e819dafefc7bfa850530","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"},"source_kind":"arxiv","source_id":"1102.5389","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIzm1Eo+iDrwPYnAJrBLioc0pk35uktWI93Rlla1PE6pQkAMWw+9qHzGjRXWlFYDYafsLP6UfW0vgzE7WtL3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:22:51.084766Z"},"content_sha256":"e081ffc8419750d5ea8fb67141f5ab3b2bafd08ca2938762424a17c8ab76e1b8","schema_version":"1.0","event_id":"sha256:e081ffc8419750d5ea8fb67141f5ab3b2bafd08ca2938762424a17c8ab76e1b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GHABKQ577I3U34WD4AUYXG43X5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMomCJ3Pxdm/PqA6oC3B5DnOcmdZdyHWm+J9taYdrDYIr+dZ7eGevBUuLOrFPC33OzUwUy6wGCn30LMnZZ4ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:22:51.085260Z"},"content_sha256":"d93e0d88fc4245934b5d84d632e6b5ee9af8a40594b3d065f4e196fec954c8c2","schema_version":"1.0","event_id":"sha256:d93e0d88fc4245934b5d84d632e6b5ee9af8a40594b3d065f4e196fec954c8c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/bundle.json","state_url":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHABKQ577I3U34WD4AUYXG43X5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T23:22:51Z","links":{"resolver":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5","bundle":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/bundle.json","state":"https://pith.science/pith/GHABKQ577I3U34WD4AUYXG43X5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHABKQ577I3U34WD4AUYXG43X5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GHABKQ577I3U34WD4AUYXG43X5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a260b8b7ac97eb69177aa4297951ab54a6824585fe4b4984f9d2f92c49683a8c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T05:23:17Z","title_canon_sha256":"79cd54cff11bfd65e3ae961d577a8559a3acd2164ca282958f7c5d322680e53c"},"schema_version":"1.0","source":{"id":"1102.5389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5389","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5389v2","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5389","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"GHABKQ577I3U","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GHABKQ577I3U34WD","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GHABKQ57","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:d93e0d88fc4245934b5d84d632e6b5ee9af8a40594b3d065f4e196fec954c8c2","target":"graph","created_at":"2026-05-18T02:22:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fernando Soler-Toscano, Hector Zenil, Joost J. Joosten","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T05:23:17Z","title":"Program-Size Versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5389","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e081ffc8419750d5ea8fb67141f5ab3b2bafd08ca2938762424a17c8ab76e1b8","target":"record","created_at":"2026-05-18T02:22:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a260b8b7ac97eb69177aa4297951ab54a6824585fe4b4984f9d2f92c49683a8c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-26T05:23:17Z","title_canon_sha256":"79cd54cff11bfd65e3ae961d577a8559a3acd2164ca282958f7c5d322680e53c"},"schema_version":"1.0","source":{"id":"1102.5389","kind":"arxiv","version":2}},"canonical_sha256":"31c01543bffa374df2c3e0298b9b9bbf5316714c4bf2e819dafefc7bfa850530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31c01543bffa374df2c3e0298b9b9bbf5316714c4bf2e819dafefc7bfa850530","first_computed_at":"2026-05-18T02:22:31.068364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:31.068364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DArg93sQ2wMyxTwdTpK2nPHcNkVpxinkvNnjWBTxR6DUYLvsbVB/1yf2XMEFSyfDFRl9TsgIWiU7xVO+4qvQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:31.068860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e081ffc8419750d5ea8fb67141f5ab3b2bafd08ca2938762424a17c8ab76e1b8","sha256:d93e0d88fc4245934b5d84d632e6b5ee9af8a40594b3d065f4e196fec954c8c2"],"state_sha256":"6d43247b54d92b480c0f03c9c0b6f0bc8f1035d90fcc6a1c9d3b94b5a44961bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syC5ciDt8EDgHm6691f1NFObwJxmtcRg8JHiSdaLNxgA18+G4U52+AbZgHv1EDJ6zxxzelqHIUIfavCOn3lBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:22:51.088700Z","bundle_sha256":"0dbf1fff2f13876c9fea4a32f00262858e67484a18667d97f18947b8a7de8028"}}