{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VIH5ZQMP46ZZTOPS7YHR5W5J2C","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":"fe785bbb0fb1c410713b2fd05662182eb4760129683a86cb819981d908c7d17a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T22:45:50Z","title_canon_sha256":"74e50c3c7075b76bd229ec7b6dbad98a6e26a9070faf4fc6ea7dfb65471eb466"},"schema_version":"1.0","source":{"id":"1512.07655","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07655","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07655v2","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07655","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"VIH5ZQMP46ZZ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VIH5ZQMP46ZZTOPS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VIH5ZQMP","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:5c743ff9f02219446f0fd37e548cf5f05743a0abbbbe54bf073e5f2bbcfe4d98","target":"graph","created_at":"2026-05-18T01:07:20Z","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":"A Hamilton cycle in a graph $\\Gamma$ is a cycle passing through every vertex of $\\Gamma$. A Hamiltonian decomposition of $\\Gamma$ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is Walecki's theorem from the 19th century, showing that a complete graph $K_n$ on an odd number of vertices $n$ has a Hamiltonian decomposition. This result was recently greatly extended by K\\\"{u}hn and Osthus. They proved that every $r$-regular $n$-vertex graph $\\Gamma$ with even degree $r=cn$ for some fixed $c>1/2$ has a Hamiltonian decomposition, provided $n=n","authors_text":"Benny Sudakov, Roman Glebov, Zur Luria","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T22:45:50Z","title":"The number of Hamiltonian decompositions of regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07655","kind":"arxiv","version":2},"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:da3b961b79ceb7a6fc950a59c9e7d052e21f6d9d9643f215fee3db1da1ec66b7","target":"record","created_at":"2026-05-18T01:07:20Z","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":"fe785bbb0fb1c410713b2fd05662182eb4760129683a86cb819981d908c7d17a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T22:45:50Z","title_canon_sha256":"74e50c3c7075b76bd229ec7b6dbad98a6e26a9070faf4fc6ea7dfb65471eb466"},"schema_version":"1.0","source":{"id":"1512.07655","kind":"arxiv","version":2}},"canonical_sha256":"aa0fdcc18fe7b399b9f2fe0f1edba9d0a05c145e1e4292568c48d6135494e790","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa0fdcc18fe7b399b9f2fe0f1edba9d0a05c145e1e4292568c48d6135494e790","first_computed_at":"2026-05-18T01:07:20.931794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:20.931794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K1q7rZ1OZ+VvStPZ7pyz7Yk+O97F9cwg1IaWj7WCAwVsFPYTf+RGtgn1tzXN5+D6FZtoPzaMeQF7PiN+utr2DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:20.932223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07655","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da3b961b79ceb7a6fc950a59c9e7d052e21f6d9d9643f215fee3db1da1ec66b7","sha256:5c743ff9f02219446f0fd37e548cf5f05743a0abbbbe54bf073e5f2bbcfe4d98"],"state_sha256":"90e06885ba952ae82db4d578d9cf36b807340c73f045c1df25f2fb48d8b60632"}