Pith Number
pith:IEQGYR2G
pith:2016:IEQGYR2GOCLQBL6JMKDBEK4ZW3
not attested
not anchored
not stored
refs pending
A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph
arxiv:1602.02129 v1 · 2016-02-05 · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{IEQGYR2GOCLQBL6JMKDBEK4ZW3}
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-18T01:21:14.441683Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
41206c4746709700afc96286122b99b6c44316fa89c833e606922175598dbbdf
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/IEQGYR2GOCLQBL6JMKDBEK4ZW3 \
| 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: 41206c4746709700afc96286122b99b6c44316fa89c833e606922175598dbbdf
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "cdcf312e93427fa8ecacdbc21fe1869f748d066e37ba5efd6ded597a944ecafa",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2016-02-05T19:31:09Z",
"title_canon_sha256": "3457ef343bc986ec4c9d14d77da7b9850a268f094e707ac66055f72d241056ef"
},
"schema_version": "1.0",
"source": {
"id": "1602.02129",
"kind": "arxiv",
"version": 1
}
}