{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VCC3OXQVCSK2YK4UQH4V2MMWNM","short_pith_number":"pith:VCC3OXQV","schema_version":"1.0","canonical_sha256":"a885b75e151495ac2b9481f95d31966b1a892f6f4d31c8f1bafc66cec8452a9f","source":{"kind":"arxiv","id":"1809.08664","version":1},"attestation_state":"computed","paper":{"title":"Computing with P Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Apostolos Syropoulos, Konstantinos T. Sotiriades, Stratos Doumanis","submitted_at":"2018-09-23T19:33:35Z","abstract_excerpt":"P systems are computing conceptual computing devices that are at least as powerful as Turing machines. However, until recently it was not known how one can encode any recursive function as a P~system. Here we propose a new encoding of recursive as P~systems with graph-like structure, which is the main difference with previous documented attempts. The consequence of this and other such efforts is that they provide a solid ground for the implementation of real programming languages in existing hardware."},"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":"1809.08664","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-09-23T19:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"7e8409307fc024eb49189893b37dbb0da9083f520f891449216a904c7378a009","abstract_canon_sha256":"edd8659cfe523ef5ea4761155358d62f1d288cd6de5b417d1f79f358fa22d4a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.832640Z","signature_b64":"RuIcdYHitQxkmaVbUnpysSq+vNbvnI9uzZGNqGbCMJuQlT+oLMaDK5u3MeQhfKDR6ouPk2iU2wJTr1x4x3W/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a885b75e151495ac2b9481f95d31966b1a892f6f4d31c8f1bafc66cec8452a9f","last_reissued_at":"2026-05-18T00:05:03.832013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.832013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing with P Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Apostolos Syropoulos, Konstantinos T. Sotiriades, Stratos Doumanis","submitted_at":"2018-09-23T19:33:35Z","abstract_excerpt":"P systems are computing conceptual computing devices that are at least as powerful as Turing machines. However, until recently it was not known how one can encode any recursive function as a P~system. Here we propose a new encoding of recursive as P~systems with graph-like structure, which is the main difference with previous documented attempts. The consequence of this and other such efforts is that they provide a solid ground for the implementation of real programming languages in existing hardware."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08664","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":""},"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":"1809.08664","created_at":"2026-05-18T00:05:03.832100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08664v1","created_at":"2026-05-18T00:05:03.832100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08664","created_at":"2026-05-18T00:05:03.832100+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCC3OXQVCSK2","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCC3OXQVCSK2YK4U","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCC3OXQV","created_at":"2026-05-18T12:32:59.047623+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/VCC3OXQVCSK2YK4UQH4V2MMWNM","json":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM.json","graph_json":"https://pith.science/api/pith-number/VCC3OXQVCSK2YK4UQH4V2MMWNM/graph.json","events_json":"https://pith.science/api/pith-number/VCC3OXQVCSK2YK4UQH4V2MMWNM/events.json","paper":"https://pith.science/paper/VCC3OXQV"},"agent_actions":{"view_html":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM","download_json":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM.json","view_paper":"https://pith.science/paper/VCC3OXQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08664&json=true","fetch_graph":"https://pith.science/api/pith-number/VCC3OXQVCSK2YK4UQH4V2MMWNM/graph.json","fetch_events":"https://pith.science/api/pith-number/VCC3OXQVCSK2YK4UQH4V2MMWNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM/action/storage_attestation","attest_author":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM/action/author_attestation","sign_citation":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM/action/citation_signature","submit_replication":"https://pith.science/pith/VCC3OXQVCSK2YK4UQH4V2MMWNM/action/replication_record"}},"created_at":"2026-05-18T00:05:03.832100+00:00","updated_at":"2026-05-18T00:05:03.832100+00:00"}