Pith Number
pith:4K35FJWG
pith:2018:4K35FJWGQSCT6GEKIEWGUJC3DO
not attested
not anchored
not stored
refs pending
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
arxiv:1804.09155 v1 · 2018-04-24 · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{4K35FJWGQSCT6GEKIEWGUJC3DO}
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-18T00:17:36.145706Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
e2b7d2a6c684853f188a412c6a245b1b8f38b5e4c7cf6d8a42f1390e54a74c9f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/4K35FJWGQSCT6GEKIEWGUJC3DO \
| 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: e2b7d2a6c684853f188a412c6a245b1b8f38b5e4c7cf6d8a42f1390e54a74c9f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d9065d328545a619ed9a97745642500ebced9f844522d65a60a3a39f0f37aa25",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2018-04-24T17:21:27Z",
"title_canon_sha256": "4ee7c7c92cc7976f2c315738b8e9efcef22518b143ed52b01e06d82710df7477"
},
"schema_version": "1.0",
"source": {
"id": "1804.09155",
"kind": "arxiv",
"version": 1
}
}