Pith Number
pith:J2REM3II
pith:2012:J2REM3II5KYACGVNVGCLI3YIK4
not attested
not anchored
not stored
refs pending
How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
arxiv:1206.0717 v2 · 2012-06-04 · quant-ph
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{J2REM3II5KYACGVNVGCLI3YIK4}
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:30:02.768954Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
4ea2466d08eab0011aada984b46f08571d586b0b63dcdc26c5bd8b3b86a0c67e
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/J2REM3II5KYACGVNVGCLI3YIK4 \
| 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: 4ea2466d08eab0011aada984b46f08571d586b0b63dcdc26c5bd8b3b86a0c67e
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d000288f607c8a26edf297d4e0e5631d05aaa59c66453abab7c9a4c2b14e8bb0",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "quant-ph",
"submitted_at": "2012-06-04T19:34:19Z",
"title_canon_sha256": "0fd8bf23793229a89cb070ba9acf65531ecdaec7338abdeee07da5666d36623b"
},
"schema_version": "1.0",
"source": {
"id": "1206.0717",
"kind": "arxiv",
"version": 2
}
}