{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AVKUGJMSXTI5G6AJ6WNYSMWGSE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1838225bea591d696afc67f21abc2dca3af8d1627ca455f4a78ee60ecb785f90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-30T20:36:47Z","title_canon_sha256":"d5a174979ec3e5ddeb96c4efcb8514a9ca80198e965859a76f8c97a4b83dd2ad"},"schema_version":"1.0","source":{"id":"1905.13292","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13292","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13292v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13292","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"AVKUGJMSXTI5","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AVKUGJMSXTI5G6AJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AVKUGJMS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:4bfe2d652c15c6ad8f7f3563d3a940056f018cf7befce5d6aa77864090f0d65a","target":"graph","created_at":"2026-05-17T23:44:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $L(G)$ denote the maximum number of leaves in any spanning tree of a connected graph $G$. We show the (known) result that for the $n$-cube $Q_n$, $L(Q_n) \\sim 2^n = |V(Q_n)|$ as $n\\rightarrow \\infty$. Examining this more carefully, consider the minimum size of a connected dominating set of vertices $\\gamma_c(Q_n)$, which is $2^n-L(Q_n)$ for $n\\ge2$. We show that $\\gamma_c(Q_n)\\sim 2^n/n$. We use Hamming codes and an \"expansion\" method to construct leafy spanning trees in $Q_n$.","authors_text":"Jerrold R. Griggs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-30T20:36:47Z","title":"Spanning Trees and Domination in Hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13292","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a8a291f45df1269786495163bc7ef7672f7967ecc11bc17361eee3be37928bc","target":"record","created_at":"2026-05-17T23:44:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1838225bea591d696afc67f21abc2dca3af8d1627ca455f4a78ee60ecb785f90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-30T20:36:47Z","title_canon_sha256":"d5a174979ec3e5ddeb96c4efcb8514a9ca80198e965859a76f8c97a4b83dd2ad"},"schema_version":"1.0","source":{"id":"1905.13292","kind":"arxiv","version":1}},"canonical_sha256":"0555432592bcd1d37809f59b8932c69103927a9c922d8639dd05942a7e2dd19f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0555432592bcd1d37809f59b8932c69103927a9c922d8639dd05942a7e2dd19f","first_computed_at":"2026-05-17T23:44:35.397038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.397038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AOLHJWJGXhbjCA8uiMAQemyBo5oAtbInZqfNtjxstiOF7ijY82MjavbLOtAAtBG768BDQxdyQEOZO0WMJWZKDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.397709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13292","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a8a291f45df1269786495163bc7ef7672f7967ecc11bc17361eee3be37928bc","sha256:4bfe2d652c15c6ad8f7f3563d3a940056f018cf7befce5d6aa77864090f0d65a"],"state_sha256":"1a4b861d005cdb8223da00029b624d0bddef4fb0d52292274701e2e49d5da09a"}