Pith Number
pith:5UG4BS5G
pith:2017:5UG4BS5GBL45OFH5NKER5GY46U
not attested
not anchored
not stored
refs pending
Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments
arxiv:1701.00679 v2 · 2017-01-03 · cs.CG
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{5UG4BS5GBL45OFH5NKER5GY46U}
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:46:55.246414Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ed0dc0cba60af9d714fd6a891e9b1cf51f28c265f03d8ed417f1c39dfd8ad09f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U \
| 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: ed0dc0cba60af9d714fd6a891e9b1cf51f28c265f03d8ed417f1c39dfd8ad09f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "7bcfa72eab9f7e0dbf1bf61e412aaad42e4fcf02706bc018dfa33ec65880ab32",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CG",
"submitted_at": "2017-01-03T12:41:18Z",
"title_canon_sha256": "5535abe47a183cf336d529b9f3c0feae198ecf54682e43e6e5a48be2a16860ba"
},
"schema_version": "1.0",
"source": {
"id": "1701.00679",
"kind": "arxiv",
"version": 2
}
}