Pith Number
pith:HBQNHF7W
pith:2019:HBQNHF7WAI5W5QOLXVMX3CSUJ6
not attested
not anchored
not stored
refs pending
The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks
arxiv:1902.01939 v1 · 2019-01-09 · cs.NI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{HBQNHF7WAI5W5QOLXVMX3CSUJ6}
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-17T23:54:38.284253Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
3860d397f6023b6ec1cbbd597d8a544f85206ea4df3a6a69e20e87200e5fdbec
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6 \
| 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: 3860d397f6023b6ec1cbbd597d8a544f85206ea4df3a6a69e20e87200e5fdbec
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "a2b60c4bb06bada3345e7779cd27502e891636c556603276781d08deae090e84",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.NI",
"submitted_at": "2019-01-09T01:00:28Z",
"title_canon_sha256": "652eb098539ab99b48a45fdce0d8e501ecaa58798c6f25f7a1576f6d3918739d"
},
"schema_version": "1.0",
"source": {
"id": "1902.01939",
"kind": "arxiv",
"version": 1
}
}