{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3EARWBKQZ7XJPHYUS6KMKRWGAK","short_pith_number":"pith:3EARWBKQ","schema_version":"1.0","canonical_sha256":"d9011b0550cfee979f149794c546c602aab955ba8e2be51b4f195e597ddd58c3","source":{"kind":"arxiv","id":"1203.4667","version":2},"attestation_state":"computed","paper":{"title":"Turing machines can be efficiently simulated by the General Purpose Analog Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amaury Pouly, Daniel S. Gra\\c{c}a, Olivier Bournez","submitted_at":"2012-03-21T07:48:23Z","abstract_excerpt":"The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions. However, the situation is less clear in what concerns models of computation using real numbers, and no analog of the Church-Turing thesis exists for this case. Recently it was shown that some models of computation with real numbers were equivalent from a computability perspective. In particula"},"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":"1203.4667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-21T07:48:23Z","cross_cats_sorted":[],"title_canon_sha256":"0f276556559f65be5316df6684aaab9a5f2540cb3eadde042d89ce41a8d8f7b4","abstract_canon_sha256":"5c6b9624cabe80c493bcf449009772d8dcbdc909d00565ac6b12a624318f810b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:42.227084Z","signature_b64":"iHmftXM/2eMScf9mYPI8XD/lJEceodo3uGAfWzZViUcChIMjeqHmSkwz2CB0j5hEYevCtsIT+OLjOCxU5UnyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9011b0550cfee979f149794c546c602aab955ba8e2be51b4f195e597ddd58c3","last_reissued_at":"2026-05-18T00:52:42.226596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:42.226596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turing machines can be efficiently simulated by the General Purpose Analog Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amaury Pouly, Daniel S. Gra\\c{c}a, Olivier Bournez","submitted_at":"2012-03-21T07:48:23Z","abstract_excerpt":"The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions. However, the situation is less clear in what concerns models of computation using real numbers, and no analog of the Church-Turing thesis exists for this case. Recently it was shown that some models of computation with real numbers were equivalent from a computability perspective. In particula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4667","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.4667","created_at":"2026-05-18T00:52:42.226667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4667v2","created_at":"2026-05-18T00:52:42.226667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4667","created_at":"2026-05-18T00:52:42.226667+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EARWBKQZ7XJ","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EARWBKQZ7XJPHYU","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EARWBKQ","created_at":"2026-05-18T12:26:50.516681+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/3EARWBKQZ7XJPHYUS6KMKRWGAK","json":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK.json","graph_json":"https://pith.science/api/pith-number/3EARWBKQZ7XJPHYUS6KMKRWGAK/graph.json","events_json":"https://pith.science/api/pith-number/3EARWBKQZ7XJPHYUS6KMKRWGAK/events.json","paper":"https://pith.science/paper/3EARWBKQ"},"agent_actions":{"view_html":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK","download_json":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK.json","view_paper":"https://pith.science/paper/3EARWBKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4667&json=true","fetch_graph":"https://pith.science/api/pith-number/3EARWBKQZ7XJPHYUS6KMKRWGAK/graph.json","fetch_events":"https://pith.science/api/pith-number/3EARWBKQZ7XJPHYUS6KMKRWGAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK/action/storage_attestation","attest_author":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK/action/author_attestation","sign_citation":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK/action/citation_signature","submit_replication":"https://pith.science/pith/3EARWBKQZ7XJPHYUS6KMKRWGAK/action/replication_record"}},"created_at":"2026-05-18T00:52:42.226667+00:00","updated_at":"2026-05-18T00:52:42.226667+00:00"}