{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P7AZWADZRO7PTGO5YSVFMWTENV","short_pith_number":"pith:P7AZWADZ","canonical_record":{"source":{"id":"1404.0545","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-02T13:25:43Z","cross_cats_sorted":[],"title_canon_sha256":"b603c588f882d1866223447c2dcec651d419841f14c8a92374f22a4662dcd182","abstract_canon_sha256":"178cf1b0f4c66342610c6b164ddac1f3a18d0b945daa6e21dabaaec23601c7b0"},"schema_version":"1.0"},"canonical_sha256":"7fc19b00798bbef999ddc4aa565a646d5d3c511d978aa42d5e8181d051e35c6f","source":{"kind":"arxiv","id":"1404.0545","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0545","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0545v4","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0545","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"P7AZWADZRO7P","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P7AZWADZRO7PTGO5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P7AZWADZ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P7AZWADZRO7PTGO5YSVFMWTENV","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0545","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-02T13:25:43Z","cross_cats_sorted":[],"title_canon_sha256":"b603c588f882d1866223447c2dcec651d419841f14c8a92374f22a4662dcd182","abstract_canon_sha256":"178cf1b0f4c66342610c6b164ddac1f3a18d0b945daa6e21dabaaec23601c7b0"},"schema_version":"1.0"},"canonical_sha256":"7fc19b00798bbef999ddc4aa565a646d5d3c511d978aa42d5e8181d051e35c6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:16.460957Z","signature_b64":"WisI+DjvRhdyQW34Vk5H0Ep76XrTWirX+d5mWec6GACoYVyDYx4lTvqrHPROcws18MvmrY3Wipa5YDLq6QkaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fc19b00798bbef999ddc4aa565a646d5d3c511d978aa42d5e8181d051e35c6f","last_reissued_at":"2026-05-18T02:39:16.460537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:16.460537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0545","source_version":4,"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:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n67+nTIXyT3+ms8AStftAWfsqo1ijrLDpA2WZ8Rv8pbhMFSKmBwcDjJZSbEqQp8ztHpM5YIT+4wRo2yb9q8JBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:58:57.959923Z"},"content_sha256":"f23360bd4252f11b3d852323590e293a8a6bd38d067409f850be8dba63db88a8","schema_version":"1.0","event_id":"sha256:f23360bd4252f11b3d852323590e293a8a6bd38d067409f850be8dba63db88a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P7AZWADZRO7PTGO5YSVFMWTENV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Intensional Concurrent Faithful Encoding of Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Saclay), Thomas Given-Wilson (INRIA","submitted_at":"2014-04-02T13:25:43Z","abstract_excerpt":"The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary computation. However, these encodings are usually by simulating the entire Turing Machine within the language, or by encoding a language that does an encoding or simulation itself. This second category is typical for process calculi that show an encoding of lambda-calculus (often with restrictions) that in turn simulates a Turing Machine. Such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0545","kind":"arxiv","version":4},"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:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcOgzdPH/H1B7eI7roUEFBDI3ObVJ3zMV/ukcIFkKIHhkvBKSGVJKdN7nJIKOul0pKmhF59YcuHouZQKN8HrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:58:57.960602Z"},"content_sha256":"9f4e3df45943b2eae7328b9d1cc91741f7ce77b5c141d91534329dc95f706551","schema_version":"1.0","event_id":"sha256:9f4e3df45943b2eae7328b9d1cc91741f7ce77b5c141d91534329dc95f706551"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7AZWADZRO7PTGO5YSVFMWTENV/bundle.json","state_url":"https://pith.science/pith/P7AZWADZRO7PTGO5YSVFMWTENV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7AZWADZRO7PTGO5YSVFMWTENV/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-11T04:58:57Z","links":{"resolver":"https://pith.science/pith/P7AZWADZRO7PTGO5YSVFMWTENV","bundle":"https://pith.science/pith/P7AZWADZRO7PTGO5YSVFMWTENV/bundle.json","state":"https://pith.science/pith/P7AZWADZRO7PTGO5YSVFMWTENV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7AZWADZRO7PTGO5YSVFMWTENV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P7AZWADZRO7PTGO5YSVFMWTENV","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":"178cf1b0f4c66342610c6b164ddac1f3a18d0b945daa6e21dabaaec23601c7b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-02T13:25:43Z","title_canon_sha256":"b603c588f882d1866223447c2dcec651d419841f14c8a92374f22a4662dcd182"},"schema_version":"1.0","source":{"id":"1404.0545","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0545","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0545v4","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0545","created_at":"2026-05-18T02:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"P7AZWADZRO7P","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P7AZWADZRO7PTGO5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P7AZWADZ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:9f4e3df45943b2eae7328b9d1cc91741f7ce77b5c141d91534329dc95f706551","target":"graph","created_at":"2026-05-18T02:39:16Z","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 benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary computation. However, these encodings are usually by simulating the entire Turing Machine within the language, or by encoding a language that does an encoding or simulation itself. This second category is typical for process calculi that show an encoding of lambda-calculus (often with restrictions) that in turn simulates a Turing Machine. Such ","authors_text":"Saclay), Thomas Given-Wilson (INRIA","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-02T13:25:43Z","title":"An Intensional Concurrent Faithful Encoding of Turing Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0545","kind":"arxiv","version":4},"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:f23360bd4252f11b3d852323590e293a8a6bd38d067409f850be8dba63db88a8","target":"record","created_at":"2026-05-18T02:39:16Z","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":"178cf1b0f4c66342610c6b164ddac1f3a18d0b945daa6e21dabaaec23601c7b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-02T13:25:43Z","title_canon_sha256":"b603c588f882d1866223447c2dcec651d419841f14c8a92374f22a4662dcd182"},"schema_version":"1.0","source":{"id":"1404.0545","kind":"arxiv","version":4}},"canonical_sha256":"7fc19b00798bbef999ddc4aa565a646d5d3c511d978aa42d5e8181d051e35c6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fc19b00798bbef999ddc4aa565a646d5d3c511d978aa42d5e8181d051e35c6f","first_computed_at":"2026-05-18T02:39:16.460537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:16.460537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WisI+DjvRhdyQW34Vk5H0Ep76XrTWirX+d5mWec6GACoYVyDYx4lTvqrHPROcws18MvmrY3Wipa5YDLq6QkaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:16.460957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0545","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f23360bd4252f11b3d852323590e293a8a6bd38d067409f850be8dba63db88a8","sha256:9f4e3df45943b2eae7328b9d1cc91741f7ce77b5c141d91534329dc95f706551"],"state_sha256":"a8884fba741d8f1d60624df830381b383f280e49fb17377380cce52ea7dd76a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taymYmovvudsy4BbvL0f8W8Q+s69GSltJTImFnVG/4Tj9s0cdLLZTrJH34vC9BrtMm5f5u8OkGunVP88xbzRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:58:57.964415Z","bundle_sha256":"e534dad5e2fb466abea925f9c53f777557ee52b45f3a1b575f517ccb6bc3bc0b"}}