Pith Number
pith:B5BWO2IW
pith:2012:B5BWO2IW4DGUZA5RL6RB4ICSYF
not attested
not anchored
not stored
refs pending
An Efficient Algorithm for Mining Multilevel Association Rule Based on Pincer Search
arxiv:1209.6297 v1 · 2012-09-27 · cs.DB
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{B5BWO2IW4DGUZA5RL6RB4ICSYF}
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-18T03:44:34.691578Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
0f43676916e0cd4c83b15fa21e2052c1469d0aef43e23f2edb2aaa673cad6fc9
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF \
| 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: 0f43676916e0cd4c83b15fa21e2052c1469d0aef43e23f2edb2aaa673cad6fc9
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "0021aef536f8233ab72c042a9e57d850a4611bca2aa0e1f7980453540fb14b33",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DB",
"submitted_at": "2012-09-27T17:29:58Z",
"title_canon_sha256": "a3894aff5eb4d7f1b3641449db9b9373e84115d77c9b977d49384142fd7e1180"
},
"schema_version": "1.0",
"source": {
"id": "1209.6297",
"kind": "arxiv",
"version": 1
}
}