Pith Number
pith:LYO2CUFU
pith:2022:LYO2CUFU7ICIRTO2REJVMVYJWR
not attested
not anchored
not stored
refs pending
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
arxiv:2201.06252 v1 · 2022-01-17 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{LYO2CUFU7ICIRTO2REJVMVYJWR}
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-05T03:48:56.294356Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
5e1da150b4fa0488cdda8913565709b444e0b380fe2282435f72a02f4d372e73
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/LYO2CUFU7ICIRTO2REJVMVYJWR \
| 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: 5e1da150b4fa0488cdda8913565709b444e0b380fe2282435f72a02f4d372e73
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "b8320d87a8a07f84a2ce7c57b18cb9d0765e547a0c5a2ec6665c140d921afd74",
"cross_cats_sorted": [],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2022-01-17T07:32:06Z",
"title_canon_sha256": "59184288fbd3783cfbfb6e00626896ef7e77a2746a1c8c94ab16cb9e99525fcf"
},
"schema_version": "1.0",
"source": {
"id": "2201.06252",
"kind": "arxiv",
"version": 1
}
}