Pith Number
pith:KGAD5YYK
pith:2016:KGAD5YYKVT7OCXAPHZGURGO5IP
not attested
not anchored
not stored
refs pending
Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
arxiv:1609.00694 v4 · 2016-09-02 · math.OC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{KGAD5YYKVT7OCXAPHZGURGO5IP}
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:22:16.382086Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
51803ee30aacfee15c0f3e4d4899dd43f4788aefbb0187e90cc32c6f5a2b1358
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/KGAD5YYKVT7OCXAPHZGURGO5IP \
| 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: 51803ee30aacfee15c0f3e4d4899dd43f4788aefbb0187e90cc32c6f5a2b1358
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "c75d44bddfb2bba0c823aa30b69b27814732ad5e9de486de05bbfdd1dc276634",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.OC",
"submitted_at": "2016-09-02T18:39:37Z",
"title_canon_sha256": "e44b04ed4621221da3923bca7913d321d18bf960a4f63356faf3c17684f94b10"
},
"schema_version": "1.0",
"source": {
"id": "1609.00694",
"kind": "arxiv",
"version": 4
}
}