Pith Number
pith:SQ57OHXL
pith:2015:SQ57OHXLLL6HQZGNERUZLBCR4T
not attested
not anchored
not stored
refs pending
An Ant Colony Optimization Algorithm for Partitioning Graphs with Supply and Demand
arxiv:1503.00899 v1 · 2015-03-03 · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{SQ57OHXLLL6HQZGNERUZLBCR4T}
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-18T01:21:41.862876Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
943bf71eeb5afc7864cd2469958451e4fc7c3f8823f63e7c23e0bfa60bcb267d
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/SQ57OHXLLL6HQZGNERUZLBCR4T \
| 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: 943bf71eeb5afc7864cd2469958451e4fc7c3f8823f63e7c23e0bfa60bcb267d
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "ed8f36d01a648a0cd9997023546948f91160c7804f42eec9b1c807491144e508",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.AI",
"submitted_at": "2015-03-03T11:26:02Z",
"title_canon_sha256": "148671ad57b06e93e45207f2e47a1cb50886e84960258c715e784824ea877299"
},
"schema_version": "1.0",
"source": {
"id": "1503.00899",
"kind": "arxiv",
"version": 1
}
}