Pith Number
pith:3JHSCWTJ
pith:2020:3JHSCWTJS6DD5F67K7LRXB2H6E
not attested
not anchored
not stored
refs pending
Improving the Iterative Closest Point Algorithm using Lie Algebra
arxiv:2010.11160 v1 · 2020-10-21 · cs.RO
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{3JHSCWTJS6DD5F67K7LRXB2H6E}
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-07-05T01:44:59.843949Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
da4f215a6997863e97df57d71b8747f1296c2ee06c8ed2bda601f7fcedb32668
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/3JHSCWTJS6DD5F67K7LRXB2H6E \
| 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: da4f215a6997863e97df57d71b8747f1296c2ee06c8ed2bda601f7fcedb32668
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "7c994b195a965edc6d0d1ce097937bd03a630b3d56818a92bb9a02aa7f324e90",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.RO",
"submitted_at": "2020-10-21T17:27:54Z",
"title_canon_sha256": "3d82e7a89e5e5af9a30597b79a89bec7a249f59d111653cdd86a3f694727585a"
},
"schema_version": "1.0",
"source": {
"id": "2010.11160",
"kind": "arxiv",
"version": 1
}
}