Pith Number
pith:K5Z3GR3B
pith:2016:K5Z3GR3BBV2VO54LSEKYP54ZZT
not attested
not anchored
not stored
refs pending
An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming
arxiv:1604.01166 v1 · 2016-04-05 · cs.DB · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{K5Z3GR3BBV2VO54LSEKYP54ZZT}
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:17:44.571459Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
5773b347610d7557778b911587f799ccd2eb6720f5821414fa6257707cf8c115
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT \
| 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: 5773b347610d7557778b911587f799ccd2eb6720f5821414fa6257707cf8c115
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "6d96aad6f6135fc25368bb80671bbf7f33153107427b3c55ff2d49d4e50a9781",
"cross_cats_sorted": [
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DB",
"submitted_at": "2016-04-05T08:15:24Z",
"title_canon_sha256": "2fd349c053d01b3d407325d615de32ca4e1678201e89623d894b9f2b8967cebc"
},
"schema_version": "1.0",
"source": {
"id": "1604.01166",
"kind": "arxiv",
"version": 1
}
}