Pith Number
pith:3VSILOEA
pith:2016:3VSILOEAKL5VHBJHBMLIS5A3XF
not attested
not anchored
not stored
refs pending
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
arxiv:1611.03181 v1 · 2016-11-10 · math.CO
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{3VSILOEAKL5VHBJHBMLIS5A3XF}
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:59:41.083131Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/3VSILOEAKL5VHBJHBMLIS5A3XF \
| 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: dd6485b88052fb5385270b1689741bb94be7d86d412d01f89adedc782f8e3607
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "b2a59c1eef69213e7c5cae145af306319e0048e258244b860857b175ed1caf71",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.CO",
"submitted_at": "2016-11-10T04:07:03Z",
"title_canon_sha256": "7c5394eabd58a384f2745656140f4c96d62f1535c1e929ac727333f43b5054c3"
},
"schema_version": "1.0",
"source": {
"id": "1611.03181",
"kind": "arxiv",
"version": 1
}
}