{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S5G3H3RO3Z45BDGPSOZRALBNSI","short_pith_number":"pith:S5G3H3RO","schema_version":"1.0","canonical_sha256":"974db3ee2ede79d08ccf93b3102c2d92177f4686e21369d0f38f41963eb00a6e","source":{"kind":"arxiv","id":"1604.00888","version":3},"attestation_state":"computed","paper":{"title":"Hamilton cycles, minimum degree and bipartite holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Nikola Yolov","submitted_at":"2016-04-04T14:54:47Z","abstract_excerpt":"We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large ``bipartite hole`` (two disjoint sets of vertices with no edges between them). This result extends Dirac's classical theorem, and is related to a theorem of Chv\\'atal and Erd\\H{o}s.\n  In detail, an $(s, t)$-bipartite-hole in a graph $G$ consists of two disjoint sets of vertices $S$ and $T$ with $|S|= s$ and $|T|=t$ such that there are no edges between $S$ and $T$; and $\\widetilde{\\alpha}(G)$ is the maximum integer $r$ such that $G$ contains an $(s, t)$-bipartite-ho"},"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":"1604.00888","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-04T14:54:47Z","cross_cats_sorted":[],"title_canon_sha256":"14478882ed88673f30b91d062bb9461c5b9cf6f463489e8408720e5e68ccb3ef","abstract_canon_sha256":"211ab95b98e6190ac5d20150fd26062b7c1d7007928429928b1b37a0c0b85554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:39.100269Z","signature_b64":"WyZSZNwYm9lxG/6oIKk3lZ2hArk317//i3io6UU1V12q0PY8jHW4/xZGZIZf73lRY4TUOH+90oPFxq9RSZ1VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974db3ee2ede79d08ccf93b3102c2d92177f4686e21369d0f38f41963eb00a6e","last_reissued_at":"2026-05-18T01:16:39.099583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:39.099583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton cycles, minimum degree and bipartite holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Nikola Yolov","submitted_at":"2016-04-04T14:54:47Z","abstract_excerpt":"We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large ``bipartite hole`` (two disjoint sets of vertices with no edges between them). This result extends Dirac's classical theorem, and is related to a theorem of Chv\\'atal and Erd\\H{o}s.\n  In detail, an $(s, t)$-bipartite-hole in a graph $G$ consists of two disjoint sets of vertices $S$ and $T$ with $|S|= s$ and $|T|=t$ such that there are no edges between $S$ and $T$; and $\\widetilde{\\alpha}(G)$ is the maximum integer $r$ such that $G$ contains an $(s, t)$-bipartite-ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00888","kind":"arxiv","version":3},"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":"1604.00888","created_at":"2026-05-18T01:16:39.099676+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00888v3","created_at":"2026-05-18T01:16:39.099676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00888","created_at":"2026-05-18T01:16:39.099676+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5G3H3RO3Z45","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5G3H3RO3Z45BDGP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5G3H3RO","created_at":"2026-05-18T12:30:41.710351+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/S5G3H3RO3Z45BDGPSOZRALBNSI","json":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI.json","graph_json":"https://pith.science/api/pith-number/S5G3H3RO3Z45BDGPSOZRALBNSI/graph.json","events_json":"https://pith.science/api/pith-number/S5G3H3RO3Z45BDGPSOZRALBNSI/events.json","paper":"https://pith.science/paper/S5G3H3RO"},"agent_actions":{"view_html":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI","download_json":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI.json","view_paper":"https://pith.science/paper/S5G3H3RO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00888&json=true","fetch_graph":"https://pith.science/api/pith-number/S5G3H3RO3Z45BDGPSOZRALBNSI/graph.json","fetch_events":"https://pith.science/api/pith-number/S5G3H3RO3Z45BDGPSOZRALBNSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI/action/storage_attestation","attest_author":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI/action/author_attestation","sign_citation":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI/action/citation_signature","submit_replication":"https://pith.science/pith/S5G3H3RO3Z45BDGPSOZRALBNSI/action/replication_record"}},"created_at":"2026-05-18T01:16:39.099676+00:00","updated_at":"2026-05-18T01:16:39.099676+00:00"}