{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7JFBDIGFW2HBMRYG7VISW2CBTU","short_pith_number":"pith:7JFBDIGF","schema_version":"1.0","canonical_sha256":"fa4a11a0c5b68e164706fd512b68419d1bf6299d494d783eea9bbe47dbacb6ea","source":{"kind":"arxiv","id":"1508.05623","version":1},"attestation_state":"computed","paper":{"title":"Forbidding Hamilton cycles in 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":"2015-08-23T15:41:40Z","abstract_excerpt":"For $1\\le d\\le \\ell< k$, we give a new lower bound for the minimum $d$-degree threshold that guarantees a Hamilton $\\ell$-cycle in $k$-uniform hypergraphs. When $k\\ge 4$ and $d< \\ell=k-1$, this bound is larger than the conjectured minimum $d$-degree threshold for perfect matchings and thus disproves a well-known conjecture of R\\\"odl and Ruci\\'nski. Our (simple) construction generalizes a construction of Katona and Kierstead and the space barrier for Hamilton cycles."},"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":"1508.05623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-23T15:41:40Z","cross_cats_sorted":[],"title_canon_sha256":"a0560dc06418de8a73e844dc0d47be752f2b5c9fa5c6d4ef59de4d6d14be2815","abstract_canon_sha256":"03066df0062c00ad2d087f2d5b0a6c1668b782aff9037becd252c8d98e71285a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:52.068835Z","signature_b64":"tXSLmJhSoRPs6jtH6EhItTdqg7uZ8Rd3Jrdxmz4Ib16FSjm0wSuwIW/2LD4lJ0wFWISp8mR1hYr7NSlbcoZyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa4a11a0c5b68e164706fd512b68419d1bf6299d494d783eea9bbe47dbacb6ea","last_reissued_at":"2026-05-18T01:34:52.068310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:52.068310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidding Hamilton cycles in 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":"2015-08-23T15:41:40Z","abstract_excerpt":"For $1\\le d\\le \\ell< k$, we give a new lower bound for the minimum $d$-degree threshold that guarantees a Hamilton $\\ell$-cycle in $k$-uniform hypergraphs. When $k\\ge 4$ and $d< \\ell=k-1$, this bound is larger than the conjectured minimum $d$-degree threshold for perfect matchings and thus disproves a well-known conjecture of R\\\"odl and Ruci\\'nski. Our (simple) construction generalizes a construction of Katona and Kierstead and the space barrier for Hamilton cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05623","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":"1508.05623","created_at":"2026-05-18T01:34:52.068409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05623v1","created_at":"2026-05-18T01:34:52.068409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05623","created_at":"2026-05-18T01:34:52.068409+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JFBDIGFW2HB","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JFBDIGFW2HBMRYG","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JFBDIGF","created_at":"2026-05-18T12:29:10.953037+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/7JFBDIGFW2HBMRYG7VISW2CBTU","json":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU.json","graph_json":"https://pith.science/api/pith-number/7JFBDIGFW2HBMRYG7VISW2CBTU/graph.json","events_json":"https://pith.science/api/pith-number/7JFBDIGFW2HBMRYG7VISW2CBTU/events.json","paper":"https://pith.science/paper/7JFBDIGF"},"agent_actions":{"view_html":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU","download_json":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU.json","view_paper":"https://pith.science/paper/7JFBDIGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05623&json=true","fetch_graph":"https://pith.science/api/pith-number/7JFBDIGFW2HBMRYG7VISW2CBTU/graph.json","fetch_events":"https://pith.science/api/pith-number/7JFBDIGFW2HBMRYG7VISW2CBTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU/action/storage_attestation","attest_author":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU/action/author_attestation","sign_citation":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU/action/citation_signature","submit_replication":"https://pith.science/pith/7JFBDIGFW2HBMRYG7VISW2CBTU/action/replication_record"}},"created_at":"2026-05-18T01:34:52.068409+00:00","updated_at":"2026-05-18T01:34:52.068409+00:00"}