Pith Number
pith:J6MWUTDB
pith:2010:J6MWUTDB7I5KYJIQ5FRP2COWKF
not attested
not anchored
not stored
refs pending
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
arxiv:1009.1381 v1 · 2010-09-07 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{J6MWUTDB7I5KYJIQ5FRP2COWKF}
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-18T04:41:15.611862Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
4f996a4c61fa3aac2510e962fd09d651678edd2317f38e7cba86a6d5442f83d4
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/J6MWUTDB7I5KYJIQ5FRP2COWKF \
| 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: 4f996a4c61fa3aac2510e962fd09d651678edd2317f38e7cba86a6d5442f83d4
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "aab451bfd2b9a4c63ab153c14245ae6fae3ae4161cd93dac16eaf0601b804c96",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2010-09-07T19:57:23Z",
"title_canon_sha256": "d06fc1a86c6d133122aa48bd59dbf0c778dea719b2b2e29a4e77a4bdd15c0c59"
},
"schema_version": "1.0",
"source": {
"id": "1009.1381",
"kind": "arxiv",
"version": 1
}
}