Pith Number

pith:37HGZ426

pith:2026:37HGZ426XNDSOSN7HAHEQ2XOUF

not attested not anchored not stored refs resolved

The IsalProgram Programming Language

Ezequiel L\'opez-Rubio

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.

arxiv:2605.17008 v1 · 2026-05-16 · cs.PL · cs.AI · cs.CL

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{37HGZ426XNDSOSN7HAHEQ2XOUF}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

15 extracted · 15 resolved · 2 Pith anchors

[1] Introduction to Automata Theory, Languages, and Computation , author =

[2] Introduction to the Theory of Computation , author =

[3] The Art of Assembly Language , author =

[4] and Hennessy, John L

[5] Turing, Alan M. , journal =. On Computable Numbers, with an Application to the

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-20T00:03:35.709817Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

dfce6cf35ebb472749bf380e486aeea177efec128cb06cc9327cac11202e250e

Aliases

arxiv: 2605.17008 · arxiv_version: 2605.17008v1 · doi: 10.48550/arxiv.2605.17008 · pith_short_12: 37HGZ426XNDS · pith_short_16: 37HGZ426XNDSOSN7 · pith_short_8: 37HGZ426

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/37HGZ426XNDSOSN7HAHEQ2XOUF \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: dfce6cf35ebb472749bf380e486aeea177efec128cb06cc9327cac11202e250e

Canonical record JSON

{
  "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
  }
}