Pith Number
pith:GDZYRTP5
pith:2020:GDZYRTP5P6S34BHUGNYGDBGAYX
not attested
not anchored
not stored
refs pending
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
arxiv:2004.00963 v1 · 2020-04-02 · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{GDZYRTP5P6S34BHUGNYGDBGAYX}
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-05T00:52:22.144828Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
30f388cdfd7fa5be04f433706184c0c5cb429f52de5d6c9b5f2a6ea6d5e0f806
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/GDZYRTP5P6S34BHUGNYGDBGAYX \
| 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: 30f388cdfd7fa5be04f433706184c0c5cb429f52de5d6c9b5f2a6ea6d5e0f806
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "1a71e846d09943c7c646d7984bd68af9a72d5c6c8912f2514bdc1f7eb445e572",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.AI",
"submitted_at": "2020-04-02T12:51:26Z",
"title_canon_sha256": "9963157b0c0fbf297445bb46aa4c663d1e87ced9fcec6e9285019ad627ce4d72"
},
"schema_version": "1.0",
"source": {
"id": "2004.00963",
"kind": "arxiv",
"version": 1
}
}