Pith Number
pith:VUHBH2VM
pith:2017:VUHBH2VM2IPMM6FIXB7RKZUMXJ
not attested
not anchored
not stored
refs pending
A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
arxiv:1709.09767 v3 · 2017-09-28 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{VUHBH2VM2IPMM6FIXB7RKZUMXJ}
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-18T00:00:30.935226Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ \
| 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: ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "978aca65bd627cc30aa7e0eaded520604e518a96f75d45aa5c1a01e1a3dcacec",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-09-28T00:26:16Z",
"title_canon_sha256": "fe6a0efb6490a5820b96807738e915068f24f1401069ffd99a8a86f3716afc76"
},
"schema_version": "1.0",
"source": {
"id": "1709.09767",
"kind": "arxiv",
"version": 3
}
}