Pith Number
pith:RTH22O6P
pith:2019:RTH22O6PJBA2AAE24IGXSXAEJG
not attested
not anchored
not stored
refs pending
An efficient branch-and-cut algorithm for approximately submodular function maximization
arxiv:1904.12682 v1 · 2019-04-26 · cs.DS · cs.LG · math.OC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{RTH22O6PJBA2AAE24IGXSXAEJG}
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-17T23:47:34.363403Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
8ccfad3bcf4841a0009ae20d795c0449b5cd1e668b80d31c653cdcf0f4e4ebcb
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/RTH22O6PJBA2AAE24IGXSXAEJG \
| 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: 8ccfad3bcf4841a0009ae20d795c0449b5cd1e668b80d31c653cdcf0f4e4ebcb
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "11575e4a7e22146b578731a6b83a861c51312ad3fc15ceb25928fb795344c48d",
"cross_cats_sorted": [
"cs.LG",
"math.OC"
],
"license": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2019-04-26T05:44:00Z",
"title_canon_sha256": "50e8bbe3b956e429b1625e3833f834c0671b615c88ebe263274f8807bedebcbc"
},
"schema_version": "1.0",
"source": {
"id": "1904.12682",
"kind": "arxiv",
"version": 1
}
}