{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CSJCHJHJZA2CKIT4AIRF6Q2EJL","short_pith_number":"pith:CSJCHJHJ","schema_version":"1.0","canonical_sha256":"149223a4e9c83425227c02225f43444ae238e66ed7f109b0483af11f7dec297c","source":{"kind":"arxiv","id":"1911.08887","version":3},"attestation_state":"computed","paper":{"title":"Counting Hamilton cycles in Dirac hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Felix Joos, Stefan Glock, Stephen Gould","submitted_at":"2019-11-20T13:24:09Z","abstract_excerpt":"A tight Hamilton cycle in a $k$-uniform hypergraph ($k$-graph) $G$ is a cyclic ordering of the vertices of $G$ such that every set of $k$ consecutive vertices in the ordering forms an edge. R\\\"{o}dl, Ruci\\'{n}ski, and Szemer\\'{e}di proved that for $k\\geq 3$, every $k$-graph on $n$ vertices with minimum codegree at least $n/2+o(n)$ contains a tight Hamilton cycle. We show that the number of tight Hamilton cycles in such $k$-graphs is $\\exp(n\\ln n-\\Theta(n))$. As a corollary, we obtain a similar estimate on the number of Hamilton $\\ell$-cycles in such $k$-graphs for all $\\ell\\in\\{0,\\dots,k-1\\}$,"},"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":"1911.08887","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-20T13:24:09Z","cross_cats_sorted":[],"title_canon_sha256":"3584fccdf73f9908466ea83af38d517a09beba69dc0da5424d556f6265050fda","abstract_canon_sha256":"bcd09305ba0b0dea871e3ce7f9b62f5d1e9ebd993dd0643b910716951f82bcdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:53:50.518153Z","signature_b64":"ZlOGFAr0PDaR6cxp12CPeY2+dArXcRbsVP1EBh+/j/8QUfFZJ7SblIR6Wrn2sRaTqInjUe2DydjHjNin397eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149223a4e9c83425227c02225f43444ae238e66ed7f109b0483af11f7dec297c","last_reissued_at":"2026-07-05T02:53:50.517785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:53:50.517785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Hamilton cycles in Dirac hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Felix Joos, Stefan Glock, Stephen Gould","submitted_at":"2019-11-20T13:24:09Z","abstract_excerpt":"A tight Hamilton cycle in a $k$-uniform hypergraph ($k$-graph) $G$ is a cyclic ordering of the vertices of $G$ such that every set of $k$ consecutive vertices in the ordering forms an edge. R\\\"{o}dl, Ruci\\'{n}ski, and Szemer\\'{e}di proved that for $k\\geq 3$, every $k$-graph on $n$ vertices with minimum codegree at least $n/2+o(n)$ contains a tight Hamilton cycle. We show that the number of tight Hamilton cycles in such $k$-graphs is $\\exp(n\\ln n-\\Theta(n))$. As a corollary, we obtain a similar estimate on the number of Hamilton $\\ell$-cycles in such $k$-graphs for all $\\ell\\in\\{0,\\dots,k-1\\}$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08887","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.08887/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.08887","created_at":"2026-07-05T02:53:50.517838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.08887v3","created_at":"2026-07-05T02:53:50.517838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08887","created_at":"2026-07-05T02:53:50.517838+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSJCHJHJZA2C","created_at":"2026-07-05T02:53:50.517838+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSJCHJHJZA2CKIT4","created_at":"2026-07-05T02:53:50.517838+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSJCHJHJ","created_at":"2026-07-05T02:53:50.517838+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/CSJCHJHJZA2CKIT4AIRF6Q2EJL","json":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL.json","graph_json":"https://pith.science/api/pith-number/CSJCHJHJZA2CKIT4AIRF6Q2EJL/graph.json","events_json":"https://pith.science/api/pith-number/CSJCHJHJZA2CKIT4AIRF6Q2EJL/events.json","paper":"https://pith.science/paper/CSJCHJHJ"},"agent_actions":{"view_html":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL","download_json":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL.json","view_paper":"https://pith.science/paper/CSJCHJHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.08887&json=true","fetch_graph":"https://pith.science/api/pith-number/CSJCHJHJZA2CKIT4AIRF6Q2EJL/graph.json","fetch_events":"https://pith.science/api/pith-number/CSJCHJHJZA2CKIT4AIRF6Q2EJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/action/storage_attestation","attest_author":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/action/author_attestation","sign_citation":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/action/citation_signature","submit_replication":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/action/replication_record"}},"created_at":"2026-07-05T02:53:50.517838+00:00","updated_at":"2026-07-05T02:53:50.517838+00:00"}