{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AKUNOH3UE7JSDJRTBUOGWOVY7F","short_pith_number":"pith:AKUNOH3U","schema_version":"1.0","canonical_sha256":"02a8d71f7427d321a6330d1c6b3ab8f9455578b89e85bf0f3427e7a7f1f05286","source":{"kind":"arxiv","id":"1104.1738","version":5},"attestation_state":"computed","paper":{"title":"Reactive Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Bas Luttik, Jos C. M. Baeten, Paul van Tilburg","submitted_at":"2011-04-09T22:55:38Z","abstract_excerpt":"We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and that every effective transition system is simulated modulo the variant of branching bisimilarity that does not require divergence preservation. We conclude from these results that the parallel composition of (communicating) RTMs can be simulated b"},"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":"1104.1738","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-09T22:55:38Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"7271305a41d2fe2a5c94c50dfd16925623f9a84be638c51f24e57321a9895a29","abstract_canon_sha256":"04f525e8135956ccc78389f039c6563b0687e0468f3c4da5681ca112cbb34a48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:54.527701Z","signature_b64":"7yyIqiIOHjKmYmMEyQUV3Z6AW89A5LSveowNne5aBti2r842dBcr7915G0X5xBSaUeJRD5T+E2iz6n33SyNvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a8d71f7427d321a6330d1c6b3ab8f9455578b89e85bf0f3427e7a7f1f05286","last_reissued_at":"2026-05-18T03:31:54.527125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:54.527125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reactive Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Bas Luttik, Jos C. M. Baeten, Paul van Tilburg","submitted_at":"2011-04-09T22:55:38Z","abstract_excerpt":"We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and that every effective transition system is simulated modulo the variant of branching bisimilarity that does not require divergence preservation. We conclude from these results that the parallel composition of (communicating) RTMs can be simulated b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1738","kind":"arxiv","version":5},"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":"1104.1738","created_at":"2026-05-18T03:31:54.527209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1738v5","created_at":"2026-05-18T03:31:54.527209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1738","created_at":"2026-05-18T03:31:54.527209+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKUNOH3UE7JS","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKUNOH3UE7JSDJRT","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKUNOH3U","created_at":"2026-05-18T12:26:24.575870+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/AKUNOH3UE7JSDJRTBUOGWOVY7F","json":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F.json","graph_json":"https://pith.science/api/pith-number/AKUNOH3UE7JSDJRTBUOGWOVY7F/graph.json","events_json":"https://pith.science/api/pith-number/AKUNOH3UE7JSDJRTBUOGWOVY7F/events.json","paper":"https://pith.science/paper/AKUNOH3U"},"agent_actions":{"view_html":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F","download_json":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F.json","view_paper":"https://pith.science/paper/AKUNOH3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1738&json=true","fetch_graph":"https://pith.science/api/pith-number/AKUNOH3UE7JSDJRTBUOGWOVY7F/graph.json","fetch_events":"https://pith.science/api/pith-number/AKUNOH3UE7JSDJRTBUOGWOVY7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F/action/storage_attestation","attest_author":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F/action/author_attestation","sign_citation":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F/action/citation_signature","submit_replication":"https://pith.science/pith/AKUNOH3UE7JSDJRTBUOGWOVY7F/action/replication_record"}},"created_at":"2026-05-18T03:31:54.527209+00:00","updated_at":"2026-05-18T03:31:54.527209+00:00"}