Pith Number
pith:3MLBDXFD
pith:2019:3MLBDXFDEVZ2FE3RNAVLQE27A4
not attested
not anchored
not stored
refs pending
A Non-repetitive Logic for Verification of Dynamic Memory with Explicit Heap Conjunction and Disjunction
arxiv:1905.12944 v1 · 2019-05-30 · cs.LO · cs.FL
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{3MLBDXFDEVZ2FE3RNAVLQE27A4}
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
· sign in to
claim
4
Citations
5
Replications
✓
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.
Receipt and verification
| First computed | 2026-05-17T23:44:39.284040Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
db1611dca32573a29371682ab8135f070f4a931f85669fdbf1ff7ccd840a5946
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/3MLBDXFDEVZ2FE3RNAVLQE27A4 \
| 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: db1611dca32573a29371682ab8135f070f4a931f85669fdbf1ff7ccd840a5946
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "63e5532b58b6a1296d2b96db320047bf06fbeba0b4c1438f7833e70a0c296b58",
"cross_cats_sorted": [
"cs.FL"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.LO",
"submitted_at": "2019-05-30T10:18:58Z",
"title_canon_sha256": "acb20279472c4c00b98784ba2413be05db57a4d6d0dbe31f909ffa3bd9975863"
},
"schema_version": "1.0",
"source": {
"id": "1905.12944",
"kind": "arxiv",
"version": 1
}
}