Pith Number
pith:H6NHHQCX
pith:2025:H6NHHQCXGYDS5XL6DX4QLNKNFX
not attested
not anchored
not stored
refs pending
Optimized Path Planning for Logistics Robots Using Ant Colony Algorithm under Multiple Constraints
arxiv:2504.05339 v1 · 2025-04-06 · cs.RO
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{H6NHHQCXGYDS5XL6DX4QLNKNFX}
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.
Cited by
Receipt and verification
| First computed | 2026-07-05T10:45:40.780386Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
3f9a73c05736072edd7e1df905b54d2dfa98b2ea11646c0c9b082f6205d0bf08
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/H6NHHQCXGYDS5XL6DX4QLNKNFX \
| 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: 3f9a73c05736072edd7e1df905b54d2dfa98b2ea11646c0c9b082f6205d0bf08
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d237bf1114b1e959de5a05f7a094febce86d0ad31a5de97dabebeefc3df5f043",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.RO",
"submitted_at": "2025-04-06T01:11:02Z",
"title_canon_sha256": "63d5f5bcb45f346d9aea7a50f69723d293753c813582663cf1c2cda226c8a433"
},
"schema_version": "1.0",
"source": {
"id": "2504.05339",
"kind": "arxiv",
"version": 1
}
}