{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:37HGZ426XNDSOSN7HAHEQ2XOUF","short_pith_number":"pith:37HGZ426","schema_version":"1.0","canonical_sha256":"dfce6cf35ebb472749bf380e486aeea177efec128cb06cc9327cac11202e250e","source":{"kind":"arxiv","id":"2605.17008","version":1},"attestation_state":"computed","paper":{"title":"The IsalProgram Programming Language","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"IsalProgram is an assembly-like language where every finite string is a valid program, it is regular, and it uses no memory addresses or variable names.","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.PL","authors_text":"Ezequiel L\\'opez-Rubio","submitted_at":"2026-05-16T14:08:32Z","abstract_excerpt":"We introduce IsalProgram (Instruction Set and Language for Programming), a novel assembly-like programming language with three distinctive theoretical properties: (1) it is a regular language in the sense of formal language theory, meaning its programs are accepted by a finite automaton; (2) every finite string over the instruction alphabet is a syntactically valid program; and (3) it makes no explicit use of memory addresses or variable names, absolute or relative. Programs are finite sequences of tokens drawn from a fixed instruction set, and are executed on a virtual machine whose sole data"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.17008","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-16T14:08:32Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"78be102b7bc2c14fa0760a28853d12d82ecb05a5bdf0d446077627d338733ed2","abstract_canon_sha256":"344e413b3968b8369fed48bb4944ad6c0d76ee54fd18fe23c62751953c450458"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:35.710677Z","signature_b64":"4CcT4oPWdwH88sPkJUZzDMO5CAGQtPo3Z8IWL+ZJ3KICZn9CBZEPXtlxF28yDYwg70uy9dqmyXn+h9XmNPZfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfce6cf35ebb472749bf380e486aeea177efec128cb06cc9327cac11202e250e","last_reissued_at":"2026-05-20T00:03:35.709817Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:35.709817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The IsalProgram Programming Language","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"IsalProgram is an assembly-like language where every finite string is a valid program, it is regular, and it uses no memory addresses or variable names.","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.PL","authors_text":"Ezequiel L\\'opez-Rubio","submitted_at":"2026-05-16T14:08:32Z","abstract_excerpt":"We introduce IsalProgram (Instruction Set and Language for Programming), a novel assembly-like programming language with three distinctive theoretical properties: (1) it is a regular language in the sense of formal language theory, meaning its programs are accepted by a finite automaton; (2) every finite string over the instruction alphabet is a syntactically valid program; and (3) it makes no explicit use of memory addresses or variable names, absolute or relative. Programs are finite sequences of tokens drawn from a fixed instruction set, and are executed on a virtual machine whose sole data"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We introduce IsalProgram ... a novel assembly-like programming language with three distinctive theoretical properties: (1) it is a regular language in the sense of formal language theory, meaning its programs are accepted by a finite automaton; (2) every finite string over the instruction alphabet is a syntactically valid program; and (3) it makes no explicit use of memory addresses or variable names, absolute or relative.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The virtual machine whose sole data structure is a circular doubly linked list navigated by three data pointers, with control flow governed by two code pointers, supports execution while preserving the three claimed properties including regularity and expressive power.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"IsalProgram is a regular assembly-like language where all instruction strings are valid programs executed on a circular doubly linked list VM without addresses or variable names.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"IsalProgram is an assembly-like language where every finite string is a valid program, it is regular, and it uses no memory addresses or variable names.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"de7b0adecd4e15bdb2ac3561779fae6cb4af4cdb9ce1f8b7dab5b355af4ca9df"},"source":{"id":"2605.17008","kind":"arxiv","version":1},"verdict":{"id":"d4e2463a-4e1d-4dd5-9bd0-6b804fc37a15","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:43:42.547269Z","strongest_claim":"We introduce IsalProgram ... a novel assembly-like programming language with three distinctive theoretical properties: (1) it is a regular language in the sense of formal language theory, meaning its programs are accepted by a finite automaton; (2) every finite string over the instruction alphabet is a syntactically valid program; and (3) it makes no explicit use of memory addresses or variable names, absolute or relative.","one_line_summary":"IsalProgram is a regular assembly-like language where all instruction strings are valid programs executed on a circular doubly linked list VM without addresses or variable names.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The virtual machine whose sole data structure is a circular doubly linked list navigated by three data pointers, with control flow governed by two code pointers, supports execution while preserving the three claimed properties including regularity and expressive power.","pith_extraction_headline":"IsalProgram is an assembly-like language where every finite string is a valid program, it is regular, and it uses no memory addresses or variable names."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17008/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"citation_quote_validity","ran_at":"2026-05-19T19:49:50.480806Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T19:21:56.586612Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.817941Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:50:41.449066Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.193241Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.282732Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2def2b4af17e12ce9acd618d2b02e8c8e03e79d20b88c9eb34a2ee4be6f22d7f"},"references":{"count":15,"sample":[{"doi":"","year":null,"title":"Introduction to Automata Theory, Languages, and Computation , author =","work_id":"f61fb846-b6b7-4f37-bad2-1b47e7eb60ee","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Introduction to the Theory of Computation , author =","work_id":"7cd08fdc-fa7d-4f29-b730-378144e51b0b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The Art of Assembly Language , author =","work_id":"7195a3eb-5e99-440b-9bb2-9b8d1417d78b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"and Hennessy, John L","work_id":"9dc37c46-f279-4302-9725-2683d3d13244","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Turing, Alan M. , journal =. On Computable Numbers, with an Application to the","work_id":"7b7c0fe5-68e5-45d3-96ab-f401406528e5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"64ccf80213ace3d43c36ac5a2b2fa52d1052c206c7deb2e409ace6f05bb7de3b","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f81356fc87179477982b4174d6cf263e2f9d59e3775038a48eeca7deae2126ac"},"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":"2605.17008","created_at":"2026-05-20T00:03:35.709967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17008v1","created_at":"2026-05-20T00:03:35.709967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17008","created_at":"2026-05-20T00:03:35.709967+00:00"},{"alias_kind":"pith_short_12","alias_value":"37HGZ426XNDS","created_at":"2026-05-20T00:03:35.709967+00:00"},{"alias_kind":"pith_short_16","alias_value":"37HGZ426XNDSOSN7","created_at":"2026-05-20T00:03:35.709967+00:00"},{"alias_kind":"pith_short_8","alias_value":"37HGZ426","created_at":"2026-05-20T00:03:35.709967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF","json":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF.json","graph_json":"https://pith.science/api/pith-number/37HGZ426XNDSOSN7HAHEQ2XOUF/graph.json","events_json":"https://pith.science/api/pith-number/37HGZ426XNDSOSN7HAHEQ2XOUF/events.json","paper":"https://pith.science/paper/37HGZ426"},"agent_actions":{"view_html":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF","download_json":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF.json","view_paper":"https://pith.science/paper/37HGZ426","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17008&json=true","fetch_graph":"https://pith.science/api/pith-number/37HGZ426XNDSOSN7HAHEQ2XOUF/graph.json","fetch_events":"https://pith.science/api/pith-number/37HGZ426XNDSOSN7HAHEQ2XOUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF/action/storage_attestation","attest_author":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF/action/author_attestation","sign_citation":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF/action/citation_signature","submit_replication":"https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF/action/replication_record"}},"created_at":"2026-05-20T00:03:35.709967+00:00","updated_at":"2026-05-20T00:03:35.709967+00:00"}