Pith Number
pith:NXR4QHXR
pith:2018:NXR4QHXR3WF4BJF4YPXQJQVWQF
not attested
not anchored
not stored
refs pending
How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?
arxiv:1811.02161 v2 · 2018-11-06 · cs.LG · stat.ML
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{NXR4QHXR3WF4BJF4YPXQJQVWQF}
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-17T23:54:15.782014Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF \
| 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: 6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d352ee4753349bc1c49a5010a1284810392d42ca9abdbd1e0c7a8cf29196e223",
"cross_cats_sorted": [
"stat.ML"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.LG",
"submitted_at": "2018-11-06T04:54:18Z",
"title_canon_sha256": "bfe4bffd2e2968a1c0b9b54ee1b87949b932ef3cd51d183c77d86609452dd02e"
},
"schema_version": "1.0",
"source": {
"id": "1811.02161",
"kind": "arxiv",
"version": 2
}
}