Pith Number
pith:MXWBS2SV
pith:2011:MXWBS2SVVEB56YZ6XJW4SAD55C
not attested
not anchored
not stored
refs pending
K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!
arxiv:1107.3622 v1 · 2011-07-19 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{MXWBS2SVVEB56YZ6XJW4SAD55C}
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-18T04:17:24.396458Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
65ec196a55a903df633eba6dc9007de895150645f3315d831d71f4353d4dabd9
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/MXWBS2SVVEB56YZ6XJW4SAD55C \
| 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: 65ec196a55a903df633eba6dc9007de895150645f3315d831d71f4353d4dabd9
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "453a3b11d5002f2f1679d2f5de7890f80c80a5b91c017c28f7d7fa5cd02a6e90",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2011-07-19T04:21:58Z",
"title_canon_sha256": "82a2f4a52b7fdc2e2c6ffe2f6a376577497e5bd50c4cc18bb3ded50c29db6575"
},
"schema_version": "1.0",
"source": {
"id": "1107.3622",
"kind": "arxiv",
"version": 1
}
}