Pith Number
pith:PB42DOZ3
pith:2025:PB42DOZ3VJHWVB6SSLCUC2CRIO
not attested
not anchored
not stored
refs pending
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching
arxiv:2505.24643 v1 · 2025-05-30 · cs.CL
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{PB42DOZ3VJHWVB6SSLCUC2CRIO}
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.
Cited by
Receipt and verification
| First computed | 2026-07-05T11:12:53.812876Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
7879a1bb3baa4f6a87d292c541685143979d0a879feec12d7b275f9c72578c89
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/PB42DOZ3VJHWVB6SSLCUC2CRIO \
| 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: 7879a1bb3baa4f6a87d292c541685143979d0a879feec12d7b275f9c72578c89
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "1b6274f29c12b254a6a720bb15022efc30ee266884ae2c63b4fc6f10d5130839",
"cross_cats_sorted": [],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.CL",
"submitted_at": "2025-05-30T14:29:55Z",
"title_canon_sha256": "26b7afdf879ff18eb2c8e14a42a49d12677e21f5ece60e8320a610f11982fc0e"
},
"schema_version": "1.0",
"source": {
"id": "2505.24643",
"kind": "arxiv",
"version": 1
}
}