Pith Number
pith:XRJXVRUY
pith:2021:XRJXVRUY7E33AWNI23KQV3YZIU
not attested
not anchored
not stored
refs pending
A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
arxiv:2110.15587 v2 · 2021-10-29 · quant-ph · cs.CC · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{XRJXVRUY7E33AWNI23KQV3YZIU}
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-07-05T07:40:48.205218Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
bc537ac698f937b059a8d6d50aef19453b1587eb89b5cf7cf371b4bc5ee5d43d
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU \
| 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: bc537ac698f937b059a8d6d50aef19453b1587eb89b5cf7cf371b4bc5ee5d43d
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "738eb0a5a0e034a1c3b508c11bc99afffe053b846842c70c2e753ce7919f38cc",
"cross_cats_sorted": [
"cs.CC",
"cs.DS"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "quant-ph",
"submitted_at": "2021-10-29T07:35:46Z",
"title_canon_sha256": "cdda9de295c9c45f682fb3f3dd021de22bee38f216055b919d5523b6d9a6a5de"
},
"schema_version": "1.0",
"source": {
"id": "2110.15587",
"kind": "arxiv",
"version": 2
}
}