{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GESDTMHHSXNHFVU3ZIFVCV4LE7","short_pith_number":"pith:GESDTMHH","schema_version":"1.0","canonical_sha256":"312439b0e795da72d69bca0b51578b27e231fef28125ff901358fa7bcb79ec41","source":{"kind":"arxiv","id":"1609.03101","version":2},"attestation_state":"computed","paper":{"title":"Hamilton cycles in hypergraphs below the Dirac threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frederik Garbe, Richard Mycroft","submitted_at":"2016-09-10T23:58:13Z","abstract_excerpt":"We establish a precise characterisation of $4$-uniform hypergraphs with minimum codegree close to $n/2$ which contain a Hamilton $2$-cycle. As an immediate corollary we identify the exact Dirac threshold for Hamilton $2$-cycles in $4$-uniform hypergraphs. Moreover, by derandomising the proof of our characterisation we provide a polynomial-time algorithm which, given a $4$-uniform hypergraph $H$ with minimum codegree close to $n/2$, either finds a Hamilton $2$-cycle in $H$ or provides a certificate that no such cycle exists. This surprising result stands in contrast to the graph setting, in whi"},"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":"1609.03101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-10T23:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"575f050c4aa36e90f3db797eba830bf1924247a0e179e7241569170c4d14f145","abstract_canon_sha256":"e9e353be094b8fcba26855a7e7896a773e542d0e38070eb3ee126fa35ac98475"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:27.299410Z","signature_b64":"7RO8FTF5/FMGbFifNKEHC2Sb1RG4njm36fKugoGCoYXkLsZzKTU/D7qnokXPcfZ/q7nMmDFzJZDudRAjB6NkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312439b0e795da72d69bca0b51578b27e231fef28125ff901358fa7bcb79ec41","last_reissued_at":"2026-05-18T00:17:27.298871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:27.298871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton cycles in hypergraphs below the Dirac threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frederik Garbe, Richard Mycroft","submitted_at":"2016-09-10T23:58:13Z","abstract_excerpt":"We establish a precise characterisation of $4$-uniform hypergraphs with minimum codegree close to $n/2$ which contain a Hamilton $2$-cycle. As an immediate corollary we identify the exact Dirac threshold for Hamilton $2$-cycles in $4$-uniform hypergraphs. Moreover, by derandomising the proof of our characterisation we provide a polynomial-time algorithm which, given a $4$-uniform hypergraph $H$ with minimum codegree close to $n/2$, either finds a Hamilton $2$-cycle in $H$ or provides a certificate that no such cycle exists. This surprising result stands in contrast to the graph setting, in whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03101","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":"1609.03101","created_at":"2026-05-18T00:17:27.298960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03101v2","created_at":"2026-05-18T00:17:27.298960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03101","created_at":"2026-05-18T00:17:27.298960+00:00"},{"alias_kind":"pith_short_12","alias_value":"GESDTMHHSXNH","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GESDTMHHSXNHFVU3","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GESDTMHH","created_at":"2026-05-18T12:30:19.053100+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/GESDTMHHSXNHFVU3ZIFVCV4LE7","json":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7.json","graph_json":"https://pith.science/api/pith-number/GESDTMHHSXNHFVU3ZIFVCV4LE7/graph.json","events_json":"https://pith.science/api/pith-number/GESDTMHHSXNHFVU3ZIFVCV4LE7/events.json","paper":"https://pith.science/paper/GESDTMHH"},"agent_actions":{"view_html":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7","download_json":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7.json","view_paper":"https://pith.science/paper/GESDTMHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03101&json=true","fetch_graph":"https://pith.science/api/pith-number/GESDTMHHSXNHFVU3ZIFVCV4LE7/graph.json","fetch_events":"https://pith.science/api/pith-number/GESDTMHHSXNHFVU3ZIFVCV4LE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/action/storage_attestation","attest_author":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/action/author_attestation","sign_citation":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/action/citation_signature","submit_replication":"https://pith.science/pith/GESDTMHHSXNHFVU3ZIFVCV4LE7/action/replication_record"}},"created_at":"2026-05-18T00:17:27.298960+00:00","updated_at":"2026-05-18T00:17:27.298960+00:00"}