{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AAK3WQIVR7UC4MH546SWIXGCO7","short_pith_number":"pith:AAK3WQIV","canonical_record":{"source":{"id":"1104.3421","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-18T10:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"16375f0825de1d02141ca8dc79bbebeb61ca46d03c24f55a3fd65b0c86250a38","abstract_canon_sha256":"2eeb4cd7151ac9e56aba6818fba4087def52cffc7f8ff4d5e402428ad19b88e0"},"schema_version":"1.0"},"canonical_sha256":"0015bb41158fe82e30fde7a5645cc277e38fbe4b44303789dff4d9b73e584094","source":{"kind":"arxiv","id":"1104.3421","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3421","created_at":"2026-05-18T04:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3421v3","created_at":"2026-05-18T04:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3421","created_at":"2026-05-18T04:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"AAK3WQIVR7UC","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AAK3WQIVR7UC4MH5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AAK3WQIV","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AAK3WQIVR7UC4MH546SWIXGCO7","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3421","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-18T10:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"16375f0825de1d02141ca8dc79bbebeb61ca46d03c24f55a3fd65b0c86250a38","abstract_canon_sha256":"2eeb4cd7151ac9e56aba6818fba4087def52cffc7f8ff4d5e402428ad19b88e0"},"schema_version":"1.0"},"canonical_sha256":"0015bb41158fe82e30fde7a5645cc277e38fbe4b44303789dff4d9b73e584094","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:31.926422Z","signature_b64":"sKVBsjWjeW3VYJ1YDpofxrDihfI6ekIFw2Az17BPXkPClfhvp7JeNez6oTcC+2zkOwy2qBplnsP8zP72N3H8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0015bb41158fe82e30fde7a5645cc277e38fbe4b44303789dff4d9b73e584094","last_reissued_at":"2026-05-18T04:19:31.925971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:31.925971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3421","source_version":3,"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-18T04:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19OEAOvmcJFcttNas68unQMau4+Y00qJlBSlX98w/covtX+g/EUox6OKUty7/cy0FHqScNTipzcvZkTz6WroAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:24:01.701444Z"},"content_sha256":"d7561ea2fea4671d6b94646f7c9f81d76802356b5a5981104a7ef1be662d168d","schema_version":"1.0","event_id":"sha256:d7561ea2fea4671d6b94646f7c9f81d76802356b5a5981104a7ef1be662d168d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AAK3WQIVR7UC4MH546SWIXGCO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Empirical Encounters with Computational Irreducibility and Unpredictability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Joost J. Joosten","submitted_at":"2011-04-18T10:00:45Z","abstract_excerpt":"There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up and slowdown phenomena in small Turing machines. We present the results of a test that may spur experimental approaches to the notion of computational irreducibility. The test involves a systematic attempt to outrun the computation of a large number of small Turing machines (all 3 and 4 state, 2 symbol) by means of integer sequence prediction using a specializ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3421","kind":"arxiv","version":3},"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-18T04:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31bAhss0eRMgCFO3U1po2WXitY4rgwMNbzAGcriEq4sZ6WGq4Tjb6unXHB1RRvZgRa0je9SuG5v3jLRXPkKmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:24:01.702059Z"},"content_sha256":"095654cc7d941eb9a26946c39e0d29dd7474c61de392ac7db194beccc1d207ed","schema_version":"1.0","event_id":"sha256:095654cc7d941eb9a26946c39e0d29dd7474c61de392ac7db194beccc1d207ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAK3WQIVR7UC4MH546SWIXGCO7/bundle.json","state_url":"https://pith.science/pith/AAK3WQIVR7UC4MH546SWIXGCO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAK3WQIVR7UC4MH546SWIXGCO7/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-25T13:24:01Z","links":{"resolver":"https://pith.science/pith/AAK3WQIVR7UC4MH546SWIXGCO7","bundle":"https://pith.science/pith/AAK3WQIVR7UC4MH546SWIXGCO7/bundle.json","state":"https://pith.science/pith/AAK3WQIVR7UC4MH546SWIXGCO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAK3WQIVR7UC4MH546SWIXGCO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AAK3WQIVR7UC4MH546SWIXGCO7","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":"2eeb4cd7151ac9e56aba6818fba4087def52cffc7f8ff4d5e402428ad19b88e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-18T10:00:45Z","title_canon_sha256":"16375f0825de1d02141ca8dc79bbebeb61ca46d03c24f55a3fd65b0c86250a38"},"schema_version":"1.0","source":{"id":"1104.3421","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3421","created_at":"2026-05-18T04:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3421v3","created_at":"2026-05-18T04:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3421","created_at":"2026-05-18T04:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"AAK3WQIVR7UC","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AAK3WQIVR7UC4MH5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AAK3WQIV","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:095654cc7d941eb9a26946c39e0d29dd7474c61de392ac7db194beccc1d207ed","target":"graph","created_at":"2026-05-18T04:19: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":"There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up and slowdown phenomena in small Turing machines. We present the results of a test that may spur experimental approaches to the notion of computational irreducibility. The test involves a systematic attempt to outrun the computation of a large number of small Turing machines (all 3 and 4 state, 2 symbol) by means of integer sequence prediction using a specializ","authors_text":"Fernando Soler-Toscano, Hector Zenil, Joost J. Joosten","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-18T10:00:45Z","title":"Empirical Encounters with Computational Irreducibility and Unpredictability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3421","kind":"arxiv","version":3},"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:d7561ea2fea4671d6b94646f7c9f81d76802356b5a5981104a7ef1be662d168d","target":"record","created_at":"2026-05-18T04:19: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":"2eeb4cd7151ac9e56aba6818fba4087def52cffc7f8ff4d5e402428ad19b88e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-18T10:00:45Z","title_canon_sha256":"16375f0825de1d02141ca8dc79bbebeb61ca46d03c24f55a3fd65b0c86250a38"},"schema_version":"1.0","source":{"id":"1104.3421","kind":"arxiv","version":3}},"canonical_sha256":"0015bb41158fe82e30fde7a5645cc277e38fbe4b44303789dff4d9b73e584094","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0015bb41158fe82e30fde7a5645cc277e38fbe4b44303789dff4d9b73e584094","first_computed_at":"2026-05-18T04:19:31.925971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:31.925971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sKVBsjWjeW3VYJ1YDpofxrDihfI6ekIFw2Az17BPXkPClfhvp7JeNez6oTcC+2zkOwy2qBplnsP8zP72N3H8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:31.926422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3421","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7561ea2fea4671d6b94646f7c9f81d76802356b5a5981104a7ef1be662d168d","sha256:095654cc7d941eb9a26946c39e0d29dd7474c61de392ac7db194beccc1d207ed"],"state_sha256":"983df9bde3e87a77f16b6aa6c5115cdb403fcd5fd3d454b154603ad56411398c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9c4rQREDrSX5Z2/Zg64AXqw8MTz13Sv6HA5LwMBZ64DxJLzFDQuYj6AN1RWGtu9v2CBnG5If98KBVN+ROn3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:24:01.705620Z","bundle_sha256":"ab3f0f27c61edf07c9362fdfd6f36bcf7f350087a725d0da462058ce85a3d50a"}}