{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VIH5ZQMP46ZZTOPS7YHR5W5J2C","short_pith_number":"pith:VIH5ZQMP","schema_version":"1.0","canonical_sha256":"aa0fdcc18fe7b399b9f2fe0f1edba9d0a05c145e1e4292568c48d6135494e790","source":{"kind":"arxiv","id":"1512.07655","version":2},"attestation_state":"computed","paper":{"title":"The number of Hamiltonian decompositions of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Roman Glebov, Zur Luria","submitted_at":"2015-12-23T22:45:50Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.07655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T22:45:50Z","cross_cats_sorted":[],"title_canon_sha256":"74e50c3c7075b76bd229ec7b6dbad98a6e26a9070faf4fc6ea7dfb65471eb466","abstract_canon_sha256":"fe785bbb0fb1c410713b2fd05662182eb4760129683a86cb819981d908c7d17a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:20.932223Z","signature_b64":"K1q7rZ1OZ+VvStPZ7pyz7Yk+O97F9cwg1IaWj7WCAwVsFPYTf+RGtgn1tzXN5+D6FZtoPzaMeQF7PiN+utr2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0fdcc18fe7b399b9f2fe0f1edba9d0a05c145e1e4292568c48d6135494e790","last_reissued_at":"2026-05-18T01:07:20.931794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:20.931794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of Hamiltonian decompositions of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Roman Glebov, Zur Luria","submitted_at":"2015-12-23T22:45:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07655","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.07655","created_at":"2026-05-18T01:07:20.931865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07655v2","created_at":"2026-05-18T01:07:20.931865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07655","created_at":"2026-05-18T01:07:20.931865+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIH5ZQMP46ZZ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIH5ZQMP46ZZTOPS","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIH5ZQMP","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C","json":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C.json","graph_json":"https://pith.science/api/pith-number/VIH5ZQMP46ZZTOPS7YHR5W5J2C/graph.json","events_json":"https://pith.science/api/pith-number/VIH5ZQMP46ZZTOPS7YHR5W5J2C/events.json","paper":"https://pith.science/paper/VIH5ZQMP"},"agent_actions":{"view_html":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C","download_json":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C.json","view_paper":"https://pith.science/paper/VIH5ZQMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07655&json=true","fetch_graph":"https://pith.science/api/pith-number/VIH5ZQMP46ZZTOPS7YHR5W5J2C/graph.json","fetch_events":"https://pith.science/api/pith-number/VIH5ZQMP46ZZTOPS7YHR5W5J2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C/action/storage_attestation","attest_author":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C/action/author_attestation","sign_citation":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C/action/citation_signature","submit_replication":"https://pith.science/pith/VIH5ZQMP46ZZTOPS7YHR5W5J2C/action/replication_record"}},"created_at":"2026-05-18T01:07:20.931865+00:00","updated_at":"2026-05-18T01:07:20.931865+00:00"}