{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GOUX65ATWYSD245QDK32HTN2FR","short_pith_number":"pith:GOUX65AT","schema_version":"1.0","canonical_sha256":"33a97f7413b6243d73b01ab7a3cdba2c7170a6e33dbc7d01f4dace065687eb59","source":{"kind":"arxiv","id":"1307.3693","version":2},"attestation_state":"computed","paper":{"title":"Minimum vertex degree threshold 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":"Jie Han, Yi Zhao","submitted_at":"2013-07-14T03:49:18Z","abstract_excerpt":"We show that for sufficiently large $n$, every 3-uniform hypergraph on $n$ vertices with minimum vertex degree at least $\\binom{n-1}2 - \\binom{\\lfloor\\frac34 n\\rfloor}2 + c$, where $c=2$ if $n\\in 4\\mathbb{N}$ and $c=1$ if $n\\in 2\\mathbb{N}\\setminus 4\\mathbb{N}$, contains a loose Hamilton cycle. This degree condition is best possible and improves on the work of Bu\\ss, H\\`an and Schacht who proved the corresponding asymptotical result."},"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":"1307.3693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-14T03:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"faa8412d1f5958ade9adf807865811e55a64221d41fea17b6157dbb33797d812","abstract_canon_sha256":"93df1a67e0795bcd59c39e0b4f987e3bad15cdadd44dddf4dfdbac32504b4c3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:42.759729Z","signature_b64":"YOBhA16L6OH8ildlg312IW8H/iVad5BUvAPBlbUXsQ1b15FWh90JcbbhN9CNKcaIr3+C19t84FypE7yRHl2tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33a97f7413b6243d73b01ab7a3cdba2c7170a6e33dbc7d01f4dace065687eb59","last_reissued_at":"2026-05-18T02:19:42.759288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:42.759288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum vertex degree threshold 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":"Jie Han, Yi Zhao","submitted_at":"2013-07-14T03:49:18Z","abstract_excerpt":"We show that for sufficiently large $n$, every 3-uniform hypergraph on $n$ vertices with minimum vertex degree at least $\\binom{n-1}2 - \\binom{\\lfloor\\frac34 n\\rfloor}2 + c$, where $c=2$ if $n\\in 4\\mathbb{N}$ and $c=1$ if $n\\in 2\\mathbb{N}\\setminus 4\\mathbb{N}$, contains a loose Hamilton cycle. This degree condition is best possible and improves on the work of Bu\\ss, H\\`an and Schacht who proved the corresponding asymptotical result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3693","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":"1307.3693","created_at":"2026-05-18T02:19:42.759359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3693v2","created_at":"2026-05-18T02:19:42.759359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3693","created_at":"2026-05-18T02:19:42.759359+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOUX65ATWYSD","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOUX65ATWYSD245Q","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOUX65AT","created_at":"2026-05-18T12:27:45.050594+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/GOUX65ATWYSD245QDK32HTN2FR","json":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR.json","graph_json":"https://pith.science/api/pith-number/GOUX65ATWYSD245QDK32HTN2FR/graph.json","events_json":"https://pith.science/api/pith-number/GOUX65ATWYSD245QDK32HTN2FR/events.json","paper":"https://pith.science/paper/GOUX65AT"},"agent_actions":{"view_html":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR","download_json":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR.json","view_paper":"https://pith.science/paper/GOUX65AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3693&json=true","fetch_graph":"https://pith.science/api/pith-number/GOUX65ATWYSD245QDK32HTN2FR/graph.json","fetch_events":"https://pith.science/api/pith-number/GOUX65ATWYSD245QDK32HTN2FR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR/action/storage_attestation","attest_author":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR/action/author_attestation","sign_citation":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR/action/citation_signature","submit_replication":"https://pith.science/pith/GOUX65ATWYSD245QDK32HTN2FR/action/replication_record"}},"created_at":"2026-05-18T02:19:42.759359+00:00","updated_at":"2026-05-18T02:19:42.759359+00:00"}