Pith Number
pith:SRZG72MZ
pith:2019:SRZG72MZG5AWNTKUFY2NT5ZYEC
not attested
not anchored
not stored
refs pending
On the maximum number of minimal connected dominating sets in convex bipartite graphs
arxiv:1908.02174 v1 · 2019-08-06 · cs.DS · cs.DM · math.CO
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{SRZG72MZG5AWNTKUFY2NT5ZYEC}
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-04T23:51:51.806752Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
94726fe999374166cd542e34d9f738208440205d137073be9b5e7cdf48eead28
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/SRZG72MZG5AWNTKUFY2NT5ZYEC \
| 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: 94726fe999374166cd542e34d9f738208440205d137073be9b5e7cdf48eead28
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "7cd6487bdeee9bc39b844e5eee3933a36f5e6f033f473fd5a1cef0fb3949a003",
"cross_cats_sorted": [
"cs.DM",
"math.CO"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2019-08-06T14:13:50Z",
"title_canon_sha256": "0016f38c27427f04d6a7a724fd774d6d11d748e124e27c9d6caf221c1025c577"
},
"schema_version": "1.0",
"source": {
"id": "1908.02174",
"kind": "arxiv",
"version": 1
}
}