Pith Number
pith:3D2ETQY5
pith:2010:3D2ETQY5M5BXDOGZY5YQEAVIZ4
not attested
not anchored
not stored
refs pending
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
arxiv:1012.0956 v3 · 2010-12-05 · cs.DS · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{3D2ETQY5M5BXDOGZY5YQEAVIZ4}
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-18T02:23:15.795693Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
d8f449c31d674371b8d9c7710202a8cf23f513b20a26c556bb56d864b458cfed
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/3D2ETQY5M5BXDOGZY5YQEAVIZ4 \
| 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: d8f449c31d674371b8d9c7710202a8cf23f513b20a26c556bb56d864b458cfed
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "6d6554b4e6d96db51612b1869f4596584824bfb974bbf056714c7a4758246f73",
"cross_cats_sorted": [
"cs.CC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2010-12-05T00:01:09Z",
"title_canon_sha256": "9d5f7b01e8ef5b430d31e0c7cf0a6a7fc0a2d2366fe11dccc683efcdadd8d2af"
},
"schema_version": "1.0",
"source": {
"id": "1012.0956",
"kind": "arxiv",
"version": 3
}
}