{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MKDJ3LEO5IPGKLR5KIHRR62VY7","short_pith_number":"pith:MKDJ3LEO","schema_version":"1.0","canonical_sha256":"62869dac8eea1e652e3d520f18fb55c7f4eaf036dae7b06a725f6a4cb3803b86","source":{"kind":"arxiv","id":"2502.02872","version":1},"attestation_state":"computed","paper":{"title":"Achieving Operational Universality through a Turing Complete Chemputer","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniel Gahler, Dean Thomas, Leroy Cronin, Slawomir Lach","submitted_at":"2025-02-05T04:06:32Z","abstract_excerpt":"The most fundamental abstraction underlying all modern computers is the Turing Machine, that is if any modern computer can simulate a Turing Machine, an equivalence which is called Turing completeness, it is theoretically possible to achieve any task that can be algorithmically described by executing a series of discrete unit operations. In chemistry, the ability to program chemical processes is demanding because it is hard to ensure that the process can be understood at a high level of abstraction, and then reduced to practice. Herein we exploit the concept of Turing completeness applied to r"},"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":"2502.02872","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2025-02-05T04:06:32Z","cross_cats_sorted":[],"title_canon_sha256":"3c77dd8ac68f45c5ff3a7167afa9cf7d2b558d3f4f30a2eab0353db7f6131641","abstract_canon_sha256":"618d4d4db7fa01dcc3edd51f1681af76f168755174e22ce53ba7cf78f3ab3e1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:56.178918Z","signature_b64":"CfcLqBguEfq/nX5Uuafxl7WJ7hmeEwENn3oLHfrNOAKs6my4E2cqt9oxx9oZlPoIMWt0zuF/RbBeNl/sKC/RAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62869dac8eea1e652e3d520f18fb55c7f4eaf036dae7b06a725f6a4cb3803b86","last_reissued_at":"2026-07-05T10:09:56.178491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:56.178491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Operational Universality through a Turing Complete Chemputer","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniel Gahler, Dean Thomas, Leroy Cronin, Slawomir Lach","submitted_at":"2025-02-05T04:06:32Z","abstract_excerpt":"The most fundamental abstraction underlying all modern computers is the Turing Machine, that is if any modern computer can simulate a Turing Machine, an equivalence which is called Turing completeness, it is theoretically possible to achieve any task that can be algorithmically described by executing a series of discrete unit operations. In chemistry, the ability to program chemical processes is demanding because it is hard to ensure that the process can be understood at a high level of abstraction, and then reduced to practice. Herein we exploit the concept of Turing completeness applied to r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02872","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.02872/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.02872","created_at":"2026-07-05T10:09:56.178538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02872v1","created_at":"2026-07-05T10:09:56.178538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02872","created_at":"2026-07-05T10:09:56.178538+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKDJ3LEO5IPG","created_at":"2026-07-05T10:09:56.178538+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKDJ3LEO5IPGKLR5","created_at":"2026-07-05T10:09:56.178538+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKDJ3LEO","created_at":"2026-07-05T10:09:56.178538+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/MKDJ3LEO5IPGKLR5KIHRR62VY7","json":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7.json","graph_json":"https://pith.science/api/pith-number/MKDJ3LEO5IPGKLR5KIHRR62VY7/graph.json","events_json":"https://pith.science/api/pith-number/MKDJ3LEO5IPGKLR5KIHRR62VY7/events.json","paper":"https://pith.science/paper/MKDJ3LEO"},"agent_actions":{"view_html":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7","download_json":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7.json","view_paper":"https://pith.science/paper/MKDJ3LEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02872&json=true","fetch_graph":"https://pith.science/api/pith-number/MKDJ3LEO5IPGKLR5KIHRR62VY7/graph.json","fetch_events":"https://pith.science/api/pith-number/MKDJ3LEO5IPGKLR5KIHRR62VY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7/action/storage_attestation","attest_author":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7/action/author_attestation","sign_citation":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7/action/citation_signature","submit_replication":"https://pith.science/pith/MKDJ3LEO5IPGKLR5KIHRR62VY7/action/replication_record"}},"created_at":"2026-07-05T10:09:56.178538+00:00","updated_at":"2026-07-05T10:09:56.178538+00:00"}