Pith Number
pith:QMROEXLB
pith:2025:QMROEXLBZXWIBDSQX6IPFRZ7BA
not attested
not anchored
not stored
refs pending
A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint
arxiv:2508.07007 v1 · 2025-08-09 · quant-ph
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{QMROEXLBZXWIBDSQX6IPFRZ7BA}
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-07-05T11:51:39.158883Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
8322e25d61cdec808e50bf90f2c73f081bd33f28b91f916f8e08fb96ca6024de
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA \
| 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: 8322e25d61cdec808e50bf90f2c73f081bd33f28b91f916f8e08fb96ca6024de
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "521a55377a6a0bef62cd3047d7e99c64a99fd6de170a074c4448dea69a6edd13",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "quant-ph",
"submitted_at": "2025-08-09T14:59:47Z",
"title_canon_sha256": "11a2b990b65bb7791b1216d3a8ebb28cf9d9ab89451d52863d3437930ef29037"
},
"schema_version": "1.0",
"source": {
"id": "2508.07007",
"kind": "arxiv",
"version": 1
}
}