{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:5JX4RFMJFJDXQTFE72WWOY2QZ6","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":"25a24c56c4cef28ea865e85a0de36f8bf7ddd1e8554e0263d82e9678097bda08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-12T18:58:59Z","title_canon_sha256":"2049b37a7f33b4321e8d16fc900878f67d3b1d304dc5fcbcc8fc6a2b7810e258"},"schema_version":"1.0","source":{"id":"0808.1713","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.1713","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"arxiv_version","alias_value":"0808.1713v2","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.1713","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"pith_short_12","alias_value":"5JX4RFMJFJDX","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"5JX4RFMJFJDXQTFE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"5JX4RFMJ","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:35cab5dad99e3dc37f833d17668905acc51c79b45bf78c52794171dc67b95b96","target":"graph","created_at":"2026-05-18T01:33:17Z","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":"We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/(2(k-1))+o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K\\\"uhn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Peter Keevash, Richard Mycroft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-12T18:58:59Z","title":"Loose Hamilton cycles in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.1713","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:34d08841fa27325e30250547cde982ece1b1089617856bc0e51911dd19604c5d","target":"record","created_at":"2026-05-18T01:33:17Z","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":"25a24c56c4cef28ea865e85a0de36f8bf7ddd1e8554e0263d82e9678097bda08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-08-12T18:58:59Z","title_canon_sha256":"2049b37a7f33b4321e8d16fc900878f67d3b1d304dc5fcbcc8fc6a2b7810e258"},"schema_version":"1.0","source":{"id":"0808.1713","kind":"arxiv","version":2}},"canonical_sha256":"ea6fc895892a47784ca4fead676350cf8a53f0d4ee9a4beea7b7c026223fe450","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea6fc895892a47784ca4fead676350cf8a53f0d4ee9a4beea7b7c026223fe450","first_computed_at":"2026-05-18T01:33:17.261033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:17.261033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uy6c4MeYQGB3CXt3Zg4Tqdddkh3gAXrPgVxdFmv15lwIm4FhFLx+awlpcoUoCbSnlKZIqBmvecCi1fPTbCyzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:17.261587Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.1713","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34d08841fa27325e30250547cde982ece1b1089617856bc0e51911dd19604c5d","sha256:35cab5dad99e3dc37f833d17668905acc51c79b45bf78c52794171dc67b95b96"],"state_sha256":"f9b19add13bcaeda9ebbf06ee083feb238a9733951fe50152520ced0e25aa0b9"}