Pith Number
pith:JBSF6OZV
pith:2012:JBSF6OZVEYOPNUTURPK7QCVY7D
not attested
not anchored
not stored
refs pending
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
arxiv:1207.5466 v1 · 2012-07-23 · cs.DB
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{JBSF6OZVEYOPNUTURPK7QCVY7D}
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:50:23.358719Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
48645f3b35261cf6d2748bd5f80ab8f8cbea90e796368263159621417b8d272d
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/JBSF6OZVEYOPNUTURPK7QCVY7D \
| 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: 48645f3b35261cf6d2748bd5f80ab8f8cbea90e796368263159621417b8d272d
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "1c2072509dc5b25955d3eb504ae7c40405b95a215500b8e2cbb9324a943d6038",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DB",
"submitted_at": "2012-07-23T17:57:47Z",
"title_canon_sha256": "07b47042f4190c2ce67bb2dc3d35fc21a056bb3367d58ec371da2503b838991e"
},
"schema_version": "1.0",
"source": {
"id": "1207.5466",
"kind": "arxiv",
"version": 1
}
}