Pith Number
pith:RUVJFZQX
pith:2014:RUVJFZQXIPYHIZBEJNFF3CTUDE
not attested
not anchored
not stored
refs pending
An improved, easily computable combinatorial lower bound for weighted graph bipartitioning
arxiv:1410.0462 v1 · 2014-10-02 · cs.DS · cs.DC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{RUVJFZQXIPYHIZBEJNFF3CTUDE}
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-18T02:41:11.049504Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
8d2a92e61743f07464244b4a5d8a74192bb959e728d01d0fc8f3548b45b0c371
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/RUVJFZQXIPYHIZBEJNFF3CTUDE \
| 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: 8d2a92e61743f07464244b4a5d8a74192bb959e728d01d0fc8f3548b45b0c371
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "09c736358456c6068951dc97f9c1368d5a1c1dd088d41eaaaf135aca6c358e7b",
"cross_cats_sorted": [
"cs.DC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2014-10-02T07:32:12Z",
"title_canon_sha256": "3e52b8c8a67c660f23b7af11dc208c5dfd1ee14c74d3ea2508be7407bba35524"
},
"schema_version": "1.0",
"source": {
"id": "1410.0462",
"kind": "arxiv",
"version": 1
}
}