Pith Number
pith:FNK5SI7G
pith:2017:FNK5SI7GL3QVSA7OJXHUTXQ4R4
not attested
not anchored
not stored
refs pending
Improved Methods for Computing Distances between Unordered Trees Using Integer Programming
arxiv:1706.03473 v1 · 2017-06-12 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{FNK5SI7GL3QVSA7OJXHUTXQ4R4}
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-18T00:42:34.621968Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
2b55d923e65ee15903ee4dcf49de1c8f0e6076002102ad7b69bd7b5dfa1fb1c7
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/FNK5SI7GL3QVSA7OJXHUTXQ4R4 \
| 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: 2b55d923e65ee15903ee4dcf49de1c8f0e6076002102ad7b69bd7b5dfa1fb1c7
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "cf8b499cf8742f84a5afe018a07a1edf6e1a77b4480edd98695d08c03adcd3f8",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-06-12T05:47:23Z",
"title_canon_sha256": "cd61d2ee93e623e39bb7983c198adbe78e9804b573590b3c4276ae1cfc7d2e0d"
},
"schema_version": "1.0",
"source": {
"id": "1706.03473",
"kind": "arxiv",
"version": 1
}
}