Pith Number
pith:KK72YKAR
pith:2018:KK72YKARYIZ4UTO3GEW7WI3K4E
not attested
not anchored
not stored
refs pending
On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms
arxiv:1810.06809 v3 · 2018-10-16 · cs.DS · cs.SI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{KK72YKARYIZ4UTO3GEW7WI3K4E}
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:01:37.553742Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E \
| 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: 52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "55a79a63b22dbcc2185c38a122d008a96351d8e5d24e40eb4da6973073cdf222",
"cross_cats_sorted": [
"cs.SI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2018-10-16T05:01:28Z",
"title_canon_sha256": "b65c96c69545fdc21d8f7b494ff05f8426b71448be9c363612021edd3f9e197f"
},
"schema_version": "1.0",
"source": {
"id": "1810.06809",
"kind": "arxiv",
"version": 3
}
}