Pith Number
pith:C4XUKVG2
pith:2019:C4XUKVG26XQCOLCPPCQPSJNSBK
not attested
not anchored
not stored
refs pending
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
arxiv:1908.01029 v1 · 2019-08-02 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{C4XUKVG26XQCOLCPPCQPSJNSBK}
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-04T23:51:25.728782Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
172f4554daf5e0272c4f78a0f925b20abb58b003a539b9086f10bc8f8a5c89f0
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/C4XUKVG26XQCOLCPPCQPSJNSBK \
| 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: 172f4554daf5e0272c4f78a0f925b20abb58b003a539b9086f10bc8f8a5c89f0
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "8e8688ea527535d0c0061e4a0581b5b8ddd6964a14953228583e1647c19fae8a",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2019-08-02T19:46:33Z",
"title_canon_sha256": "5d287acf6eaf3e246d4920038b2bdbf52f235437e90324a0dfd0ad24701db6b9"
},
"schema_version": "1.0",
"source": {
"id": "1908.01029",
"kind": "arxiv",
"version": 1
}
}