{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6JTZW62BKMI4PLCR5INK3OJDDU","short_pith_number":"pith:6JTZW62B","canonical_record":{"source":{"id":"1601.00335","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-03T20:11:06Z","cross_cats_sorted":["cs.FL","nlin.CG"],"title_canon_sha256":"47dc1c7c9df6ad118a9d7a9b5f62125212b9ad8049905c3364a178aacfbc464b","abstract_canon_sha256":"f20339cae31e0461307adfec32a5573f3b4a119973cd9534c6e6bc1264eaa645"},"schema_version":"1.0"},"canonical_sha256":"f2679b7b415311c7ac51ea1aadb9231d28c461e5544468cae316d9b6fa649d20","source":{"kind":"arxiv","id":"1601.00335","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00335","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00335v3","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00335","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"6JTZW62BKMI4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6JTZW62BKMI4PLCR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6JTZW62B","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6JTZW62BKMI4PLCR5INK3OJDDU","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00335","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-03T20:11:06Z","cross_cats_sorted":["cs.FL","nlin.CG"],"title_canon_sha256":"47dc1c7c9df6ad118a9d7a9b5f62125212b9ad8049905c3364a178aacfbc464b","abstract_canon_sha256":"f20339cae31e0461307adfec32a5573f3b4a119973cd9534c6e6bc1264eaa645"},"schema_version":"1.0"},"canonical_sha256":"f2679b7b415311c7ac51ea1aadb9231d28c461e5544468cae316d9b6fa649d20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:57.174193Z","signature_b64":"+ZPufRNrC6Ev3vC8UPd+Oirr104n434zW+BJw6gS8AM1CwnKubb/2QhORsuC8XrxrUzE2gzaLmBymy5nI6SyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2679b7b415311c7ac51ea1aadb9231d28c461e5544468cae316d9b6fa649d20","last_reissued_at":"2026-05-18T01:22:57.173638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:57.173638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00335","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-18T01:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LM/UE1PP/9+UDV1uiviPWnyZ0BGgT2CkfrLxIeQlUutAmk8xYvw9MHSjj5MENUzU9CMKqM0v+ANcQTY3H0TqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:23:47.627300Z"},"content_sha256":"913b2b8c43252f5b92521456a582595fbf506a8eddb64a1fd3520ab572981e15","schema_version":"1.0","event_id":"sha256:913b2b8c43252f5b92521456a582595fbf506a8eddb64a1fd3520ab572981e15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6JTZW62BKMI4PLCR5INK3OJDDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","nlin.CG"],"primary_cat":"cs.CC","authors_text":"Hector Zenil, J\\\"urgen Riedel","submitted_at":"2016-01-03T20:11:06Z","abstract_excerpt":"We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammability test and an investigation of the complex qualitative behaviour of computer programs. Our method may quantify the trust and confidence of the computing capabilities of natural and classical systems, and quantify computers by their degree of reprogrammability. We test the method to provide evidence in favour of a conjecture concerning the computing capabilities of Busy Beaver Turing machines as candidates for Turin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00335","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-18T01:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58mQAwZrrmRhCGeq7RsxZO9J8//UNgGXrsQS+EM+Dx5Fi6U7Qj5AO5faAHSNqRh35+lPSAaso4rKYf2zTjcXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:23:47.627675Z"},"content_sha256":"40279e56baed670be0cd776d95f569c89d63ddd429fd95c5ebf0f9517214f436","schema_version":"1.0","event_id":"sha256:40279e56baed670be0cd776d95f569c89d63ddd429fd95c5ebf0f9517214f436"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JTZW62BKMI4PLCR5INK3OJDDU/bundle.json","state_url":"https://pith.science/pith/6JTZW62BKMI4PLCR5INK3OJDDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JTZW62BKMI4PLCR5INK3OJDDU/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-06-08T11:23:47Z","links":{"resolver":"https://pith.science/pith/6JTZW62BKMI4PLCR5INK3OJDDU","bundle":"https://pith.science/pith/6JTZW62BKMI4PLCR5INK3OJDDU/bundle.json","state":"https://pith.science/pith/6JTZW62BKMI4PLCR5INK3OJDDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JTZW62BKMI4PLCR5INK3OJDDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6JTZW62BKMI4PLCR5INK3OJDDU","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":"f20339cae31e0461307adfec32a5573f3b4a119973cd9534c6e6bc1264eaa645","cross_cats_sorted":["cs.FL","nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-03T20:11:06Z","title_canon_sha256":"47dc1c7c9df6ad118a9d7a9b5f62125212b9ad8049905c3364a178aacfbc464b"},"schema_version":"1.0","source":{"id":"1601.00335","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00335","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00335v3","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00335","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"6JTZW62BKMI4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6JTZW62BKMI4PLCR","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6JTZW62B","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:40279e56baed670be0cd776d95f569c89d63ddd429fd95c5ebf0f9517214f436","target":"graph","created_at":"2026-05-18T01:22:57Z","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":"We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammability test and an investigation of the complex qualitative behaviour of computer programs. Our method may quantify the trust and confidence of the computing capabilities of natural and classical systems, and quantify computers by their degree of reprogrammability. We test the method to provide evidence in favour of a conjecture concerning the computing capabilities of Busy Beaver Turing machines as candidates for Turin","authors_text":"Hector Zenil, J\\\"urgen Riedel","cross_cats":["cs.FL","nlin.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-03T20:11:06Z","title":"Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00335","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:913b2b8c43252f5b92521456a582595fbf506a8eddb64a1fd3520ab572981e15","target":"record","created_at":"2026-05-18T01:22:57Z","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":"f20339cae31e0461307adfec32a5573f3b4a119973cd9534c6e6bc1264eaa645","cross_cats_sorted":["cs.FL","nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-03T20:11:06Z","title_canon_sha256":"47dc1c7c9df6ad118a9d7a9b5f62125212b9ad8049905c3364a178aacfbc464b"},"schema_version":"1.0","source":{"id":"1601.00335","kind":"arxiv","version":3}},"canonical_sha256":"f2679b7b415311c7ac51ea1aadb9231d28c461e5544468cae316d9b6fa649d20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2679b7b415311c7ac51ea1aadb9231d28c461e5544468cae316d9b6fa649d20","first_computed_at":"2026-05-18T01:22:57.173638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:57.173638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ZPufRNrC6Ev3vC8UPd+Oirr104n434zW+BJw6gS8AM1CwnKubb/2QhORsuC8XrxrUzE2gzaLmBymy5nI6SyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:57.174193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00335","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:913b2b8c43252f5b92521456a582595fbf506a8eddb64a1fd3520ab572981e15","sha256:40279e56baed670be0cd776d95f569c89d63ddd429fd95c5ebf0f9517214f436"],"state_sha256":"50829d1318356e043730abe44c689538ea05c55e9ffa99f3a17372bc1a7a0a28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Pbl63JMVcCSBSC817QSF6vc6h0ZpUdCiwGxwk6PgCTFPuA6G8wn3wmPVXWquzEi3Q1dmWGrqhjoPK/EK6I9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:23:47.629759Z","bundle_sha256":"f7e249ef5eb3c68a4a91b8bcb5dfea2e27b940c5f9616a67d7a882ac80755af6"}}