{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:37HGZ426XNDSOSN7HAHEQ2XOUF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"344e413b3968b8369fed48bb4944ad6c0d76ee54fd18fe23c62751953c450458","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-16T14:08:32Z","title_canon_sha256":"78be102b7bc2c14fa0760a28853d12d82ecb05a5bdf0d446077627d338733ed2"},"schema_version":"1.0","source":{"id":"2605.17008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17008","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17008v1","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17008","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"37HGZ426XNDS","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"pith_short_16","alias_value":"37HGZ426XNDSOSN7","created_at":"2026-05-20T00:03:35Z"},{"alias_kind":"pith_short_8","alias_value":"37HGZ426","created_at":"2026-05-20T00:03:35Z"}],"graph_snapshots":[{"event_id":"sha256:5d4f5a4ed1271c37cea08e5d9d92fa6d8db449b9be13af873fc4e2f630baddcb","target":"graph","created_at":"2026-05-20T00:03:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"de7b0adecd4e15bdb2ac3561779fae6cb4af4cdb9ce1f8b7dab5b355af4ca9df"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f81356fc87179477982b4174d6cf263e2f9d59e3775038a48eeca7deae2126ac"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.17008/integrity.json","findings":[],"snapshot_sha256":"2def2b4af17e12ce9acd618d2b02e8c8e03e79d20b88c9eb34a2ee4be6f22d7f","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ezequiel L\\'opez-Rubio","cross_cats":["cs.AI","cs.CL"],"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.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-16T14:08:32Z","title":"The IsalProgram Programming Language"},"references":{"count":15,"internal_anchors":2,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Introduction to Automata Theory, Languages, and Computation , author =","work_id":"f61fb846-b6b7-4f37-bad2-1b47e7eb60ee","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Introduction to the Theory of Computation , author =","work_id":"7cd08fdc-fa7d-4f29-b730-378144e51b0b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"The Art of Assembly Language , author =","work_id":"7195a3eb-5e99-440b-9bb2-9b8d1417d78b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"and Hennessy, John L","work_id":"9dc37c46-f279-4302-9725-2683d3d13244","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Turing, Alan M. , journal =. On Computable Numbers, with an Application to the","work_id":"7b7c0fe5-68e5-45d3-96ab-f401406528e5","year":null}],"snapshot_sha256":"64ccf80213ace3d43c36ac5a2b2fa52d1052c206c7deb2e409ace6f05bb7de3b"},"source":{"id":"2605.17008","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:43:42.547269Z","id":"d4e2463a-4e1d-4dd5-9bd0-6b804fc37a15","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"d4e2463a-4e1d-4dd5-9bd0-6b804fc37a15"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:274b2d0b3c923d673b339013a2f490521c1800c67287ba8eab0b048b09086adc","target":"record","created_at":"2026-05-20T00:03:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"344e413b3968b8369fed48bb4944ad6c0d76ee54fd18fe23c62751953c450458","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-16T14:08:32Z","title_canon_sha256":"78be102b7bc2c14fa0760a28853d12d82ecb05a5bdf0d446077627d338733ed2"},"schema_version":"1.0","source":{"id":"2605.17008","kind":"arxiv","version":1}},"canonical_sha256":"dfce6cf35ebb472749bf380e486aeea177efec128cb06cc9327cac11202e250e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfce6cf35ebb472749bf380e486aeea177efec128cb06cc9327cac11202e250e","first_computed_at":"2026-05-20T00:03:35.709817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:35.709817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4CcT4oPWdwH88sPkJUZzDMO5CAGQtPo3Z8IWL+ZJ3KICZn9CBZEPXtlxF28yDYwg70uy9dqmyXn+h9XmNPZfAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:35.710677Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:274b2d0b3c923d673b339013a2f490521c1800c67287ba8eab0b048b09086adc","sha256:5d4f5a4ed1271c37cea08e5d9d92fa6d8db449b9be13af873fc4e2f630baddcb"],"state_sha256":"f00d85544a1fa8e3f601793357615894ac01549f4acc721624c9e50949151147"}