Pith Number
pith:W6KT3352
pith:2014:W6KT3352NJAERGTM6KENOIAIOK
not attested
not anchored
not stored
refs pending
A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
arxiv:1412.6062 v2 · 2014-12-18 · quant-ph
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{W6KT3352NJAERGTM6KENOIAIOK}
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.
Cited by
Receipt and verification
| First computed | 2026-05-18T01:38:54.003914Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
b7953defba6a40489a6cf288d7200872bc4dd917b9da21bc6b0d4cfad334fe70
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/W6KT3352NJAERGTM6KENOIAIOK \
| 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: b7953defba6a40489a6cf288d7200872bc4dd917b9da21bc6b0d4cfad334fe70
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d9062c7c5e715d6a6b5223098ec44845e1609b5b8df7a87c1159a6429aa6d791",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "quant-ph",
"submitted_at": "2014-12-18T20:38:18Z",
"title_canon_sha256": "a694b1ef0d926f095cfce90eb225da95b68b6128e73cff822e3397d0ecc0ceb7"
},
"schema_version": "1.0",
"source": {
"id": "1412.6062",
"kind": "arxiv",
"version": 2
}
}