Pith Number
pith:XFKPNMXF
pith:2020:XFKPNMXFLXLJSK2II3MOILRRYY
not attested
not anchored
not stored
refs pending
An anytime tree search algorithm for two-dimensional two- and three-staged guillotine packing problems
arxiv:2004.02603 v2 · 2020-04-02 · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{XFKPNMXFLXLJSK2II3MOILRRYY}
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:56:04.418102Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
b954f6b2e55dd6992b4846d8e42e31c61a245f16b4e0494aa18beeb3158cc5d5
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/XFKPNMXFLXLJSK2II3MOILRRYY \
| 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: b954f6b2e55dd6992b4846d8e42e31c61a245f16b4e0494aa18beeb3158cc5d5
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "6c683d39a81e485e0f73dae91f988563a0beb6c79149abebeeb3a8923062cfe2",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.AI",
"submitted_at": "2020-04-02T13:41:07Z",
"title_canon_sha256": "85040e7aafc0e9c392c78d1fe3b3bc7b136201618adac815a3c82faf4c554b71"
},
"schema_version": "1.0",
"source": {
"id": "2004.02603",
"kind": "arxiv",
"version": 2
}
}