{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AVC6SP4O3AUPSQHKRX3NHXMZLV","short_pith_number":"pith:AVC6SP4O","schema_version":"1.0","canonical_sha256":"0545e93f8ed828f940ea8df6d3dd995d60498411d8484017aea423c57a7868fd","source":{"kind":"arxiv","id":"1603.04462","version":1},"attestation_state":"computed","paper":{"title":"Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Bu\\ss, H. H\\`an, M. Schacht","submitted_at":"2016-03-14T20:41:33Z","abstract_excerpt":"We investigate minimum vertex degree conditions for $3$-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which only consecutive edges intersect and these intersections consist of precisely one vertex.\n  We prove that every $3$-uniform $n$-vertex ($n$ even) hypergraph $\\mathcal{H}$ with minimum vertex degree $\\delta_1(\\mathcal{H})\\geq \\left(\\frac7{16}+o(1)\\right)\\binom{n}{2}$ contains a loose Hamilton cycle. This bound is asymptotically best possible."},"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":"1603.04462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T20:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"cc09e626f33c44eccb59381db3344a5394ac36cff2835fbe248e59eb62db785e","abstract_canon_sha256":"d17145c8fe6cf2dddcb6e0b46b476b605d5ca7fec2d15fdeb9f18f100f224d73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.876893Z","signature_b64":"GRnL3UivHKqPGFEKevQ/ntnWz5p+zHujd6bZ4xXDis9SbHIqeIU9MDpfyE4wBFTNAe0sUVJi9Pjk6YCvK1c/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0545e93f8ed828f940ea8df6d3dd995d60498411d8484017aea423c57a7868fd","last_reissued_at":"2026-05-18T01:19:04.876240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.876240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Bu\\ss, H. H\\`an, M. Schacht","submitted_at":"2016-03-14T20:41:33Z","abstract_excerpt":"We investigate minimum vertex degree conditions for $3$-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which only consecutive edges intersect and these intersections consist of precisely one vertex.\n  We prove that every $3$-uniform $n$-vertex ($n$ even) hypergraph $\\mathcal{H}$ with minimum vertex degree $\\delta_1(\\mathcal{H})\\geq \\left(\\frac7{16}+o(1)\\right)\\binom{n}{2}$ contains a loose Hamilton cycle. This bound is asymptotically best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04462","kind":"arxiv","version":1},"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":"1603.04462","created_at":"2026-05-18T01:19:04.876341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04462v1","created_at":"2026-05-18T01:19:04.876341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04462","created_at":"2026-05-18T01:19:04.876341+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVC6SP4O3AUP","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVC6SP4O3AUPSQHK","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVC6SP4O","created_at":"2026-05-18T12:30:07.202191+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/AVC6SP4O3AUPSQHKRX3NHXMZLV","json":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV.json","graph_json":"https://pith.science/api/pith-number/AVC6SP4O3AUPSQHKRX3NHXMZLV/graph.json","events_json":"https://pith.science/api/pith-number/AVC6SP4O3AUPSQHKRX3NHXMZLV/events.json","paper":"https://pith.science/paper/AVC6SP4O"},"agent_actions":{"view_html":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV","download_json":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV.json","view_paper":"https://pith.science/paper/AVC6SP4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04462&json=true","fetch_graph":"https://pith.science/api/pith-number/AVC6SP4O3AUPSQHKRX3NHXMZLV/graph.json","fetch_events":"https://pith.science/api/pith-number/AVC6SP4O3AUPSQHKRX3NHXMZLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/action/storage_attestation","attest_author":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/action/author_attestation","sign_citation":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/action/citation_signature","submit_replication":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/action/replication_record"}},"created_at":"2026-05-18T01:19:04.876341+00:00","updated_at":"2026-05-18T01:19:04.876341+00:00"}