Pith Number
pith:IJSJMELM
pith:2010:IJSJMELMCXISDUFGDGHDFCNOMG
not attested
not anchored
not stored
refs pending
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
arxiv:1008.1975 v4 · 2010-08-11 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{IJSJMELMCXISDUFGDGHDFCNOMG}
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.
Cited by
Receipt and verification
| First computed | 2026-05-18T04:36:51.108277Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
426496116c15d121d0a6198e3289ae61a360f51986961742cb40e74a83f8c3fc
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/IJSJMELMCXISDUFGDGHDFCNOMG \
| 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: 426496116c15d121d0a6198e3289ae61a360f51986961742cb40e74a83f8c3fc
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "4794f7bb096714b4830153e54142d07dbcecc26cb358ba3ea93554a7dbfada86",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2010-08-11T19:35:38Z",
"title_canon_sha256": "8bc045e98f8deb13caa6cf7633a762096ad2dbdb28022edb1df9e1ba16cc8e2d"
},
"schema_version": "1.0",
"source": {
"id": "1008.1975",
"kind": "arxiv",
"version": 4
}
}