Pith Number
pith:YEP23X6O
pith:2014:YEP23X6O7H4GRWT75OSN7F57LA
not attested
not anchored
not stored
refs pending
A 3-factor approximation algorithm for a Maximum Acyclic Agreement Forest on k rooted, binary phylogenetic trees
arxiv:1407.7125 v2 · 2014-07-26 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{YEP23X6O7H4GRWT75OSN7F57LA}
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-18T01:05:46.547301Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
c11faddfcef9f868da7feba4df97bf580610260c9299da446012e77dd53463fd
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/YEP23X6O7H4GRWT75OSN7F57LA \
| 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: c11faddfcef9f868da7feba4df97bf580610260c9299da446012e77dd53463fd
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d7996bbb6c08826f6ce40e3319ebccee97193a57a23c93f1faf96fb2a3325f0d",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2014-07-26T12:40:11Z",
"title_canon_sha256": "f411a79b111e7c465f7056a919453c9ecee4a84520a313c6ed29b13a3ea74c43"
},
"schema_version": "1.0",
"source": {
"id": "1407.7125",
"kind": "arxiv",
"version": 2
}
}