{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CSJCHJHJZA2CKIT4AIRF6Q2EJL","short_pith_number":"pith:CSJCHJHJ","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"},"canonical_sha256":"149223a4e9c83425227c02225f43444ae238e66ed7f109b0483af11f7dec297c","source":{"kind":"arxiv","id":"1911.08887","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08887","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08887v3","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08887","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"CSJCHJHJZA2C","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"pith_short_16","alias_value":"CSJCHJHJZA2CKIT4","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"pith_short_8","alias_value":"CSJCHJHJ","created_at":"2026-07-05T02:53:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CSJCHJHJZA2CKIT4AIRF6Q2EJL","target":"record","payload":{"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"},"canonical_sha256":"149223a4e9c83425227c02225f43444ae238e66ed7f109b0483af11f7dec297c","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"},"source_kind":"arxiv","source_id":"1911.08887","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pdGgaSZxHD51BPElas1oFfHb5FB8j6kQ3KamVllJWoCtMfYZsHNPc3O5CWqRHz3oFbBjlBkkpK0H7eOiIGtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:43:57.733281Z"},"content_sha256":"c3ab208940137a2193b6540e9e1e8461438cb79dcb4077d3077486aa636ccc38","schema_version":"1.0","event_id":"sha256:c3ab208940137a2193b6540e9e1e8461438cb79dcb4077d3077486aa636ccc38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CSJCHJHJZA2CKIT4AIRF6Q2EJL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0QgpPOXY+DNjTdQPzJLAjLU3B9+YtNR45r4s4czcD9lHF79wa8noy9VQBUPNf2rCHykTMpRIA1sRKiQRM0pAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:43:57.733656Z"},"content_sha256":"d2a4abda6e0ecfbb133a1630b78aa09821e5227c55e716bd9d37dd56b04d7dc9","schema_version":"1.0","event_id":"sha256:d2a4abda6e0ecfbb133a1630b78aa09821e5227c55e716bd9d37dd56b04d7dc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/bundle.json","state_url":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T18:43:57Z","links":{"resolver":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL","bundle":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/bundle.json","state":"https://pith.science/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSJCHJHJZA2CKIT4AIRF6Q2EJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CSJCHJHJZA2CKIT4AIRF6Q2EJL","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":"bcd09305ba0b0dea871e3ce7f9b62f5d1e9ebd993dd0643b910716951f82bcdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-20T13:24:09Z","title_canon_sha256":"3584fccdf73f9908466ea83af38d517a09beba69dc0da5424d556f6265050fda"},"schema_version":"1.0","source":{"id":"1911.08887","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08887","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08887v3","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08887","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"CSJCHJHJZA2C","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"pith_short_16","alias_value":"CSJCHJHJZA2CKIT4","created_at":"2026-07-05T02:53:50Z"},{"alias_kind":"pith_short_8","alias_value":"CSJCHJHJ","created_at":"2026-07-05T02:53:50Z"}],"graph_snapshots":[{"event_id":"sha256:d2a4abda6e0ecfbb133a1630b78aa09821e5227c55e716bd9d37dd56b04d7dc9","target":"graph","created_at":"2026-07-05T02:53:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.08887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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\\}$,","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Felix Joos, Stefan Glock, Stephen Gould","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-20T13:24:09Z","title":"Counting Hamilton cycles in Dirac hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08887","kind":"arxiv","version":3},"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:c3ab208940137a2193b6540e9e1e8461438cb79dcb4077d3077486aa636ccc38","target":"record","created_at":"2026-07-05T02:53:50Z","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":"bcd09305ba0b0dea871e3ce7f9b62f5d1e9ebd993dd0643b910716951f82bcdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-20T13:24:09Z","title_canon_sha256":"3584fccdf73f9908466ea83af38d517a09beba69dc0da5424d556f6265050fda"},"schema_version":"1.0","source":{"id":"1911.08887","kind":"arxiv","version":3}},"canonical_sha256":"149223a4e9c83425227c02225f43444ae238e66ed7f109b0483af11f7dec297c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"149223a4e9c83425227c02225f43444ae238e66ed7f109b0483af11f7dec297c","first_computed_at":"2026-07-05T02:53:50.517785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:53:50.517785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZlOGFAr0PDaR6cxp12CPeY2+dArXcRbsVP1EBh+/j/8QUfFZJ7SblIR6Wrn2sRaTqInjUe2DydjHjNin397eCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:53:50.518153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.08887","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3ab208940137a2193b6540e9e1e8461438cb79dcb4077d3077486aa636ccc38","sha256:d2a4abda6e0ecfbb133a1630b78aa09821e5227c55e716bd9d37dd56b04d7dc9"],"state_sha256":"6086b22704320d0c54b5c62831a3fdd892768c718d65d665855a7906f985faf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4Mo0vNBfgU+852Gw28Gd5cN4XrO2Mu2QkSRNyjq2/i9HTD3ndOyEK5hzVE0oxVJRXR2ZY6yEEUVyvENvZ4YDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:43:57.735742Z","bundle_sha256":"3e571b8849c1e46ec3123eeec91389a2dc2ad544200c3f57749c2b55a9f31865"}}