Pith Number
pith:FEBTN5GC
pith:2017:FEBTN5GCLK2CVCZI5O6JPWM7YM
not attested
not anchored
not stored
refs pending
Is there any polynomial upper bound for the universal labeling of graphs?
arxiv:1701.06685 v1 · 2017-01-23 · math.CO · cs.DM
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{FEBTN5GCLK2CVCZI5O6JPWM7YM}
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:51:29.894591Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/FEBTN5GCLK2CVCZI5O6JPWM7YM \
| 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: 290336f4c25ab42a8b28ebbc97d99fc3395737ade7a31edc42385900c6e065b2
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "65a6cc16d33732edbf36c37fbc8b84b6586aba1b354e2a961128b3b87ca70b82",
"cross_cats_sorted": [
"cs.DM"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.CO",
"submitted_at": "2017-01-23T23:49:48Z",
"title_canon_sha256": "92c9a3fa73364e959a9268f239ad40bf575fdf7714921062ece49883bf70999c"
},
"schema_version": "1.0",
"source": {
"id": "1701.06685",
"kind": "arxiv",
"version": 1
}
}