{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BHQN4XQ7GCYPRLU6KK6N363VHN","short_pith_number":"pith:BHQN4XQ7","schema_version":"1.0","canonical_sha256":"09e0de5e1f30b0f8ae9e52bcddfb753b5cc858ea008c8c06043b8e86f9e7a603","source":{"kind":"arxiv","id":"1606.03687","version":1},"attestation_state":"computed","paper":{"title":"A Simple Extension of Dirac's Theorem on Hamiltonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Didem G\\\"oz\\\"upek, Mordechai Shalom, Sibel \\\"Ozkan, Yasemin B\\\"uy\\\"uk\\c{c}olak","submitted_at":"2016-06-12T09:16:51Z","abstract_excerpt":"The classical Dirac theorem asserts that every graph $G$ on $n$ vertices with minimum degree $\\delta(G) \\ge \\lceil n/2 \\rceil$ is Hamiltonian. The lower bound of $\\lceil n/2 \\rceil$ on the minimum degree of a graph is tight. In this paper, we extend the classical Dirac theorem to the case where $\\delta(G) \\ge \\lfloor n/2 \\rfloor $ by identifying the only non-Hamiltonian graph families in this case. We first present a short and simple proof. We then provide an alternative proof that is constructive and self-contained. Consequently, we provide a polynomial-time algorithm that constructs a Hamilt"},"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":"1606.03687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-12T09:16:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"be1d92aacfd4711d0af4f211166c60d7ff0f702ec636dfef83f7c9bdc538c2c4","abstract_canon_sha256":"ea1cf840ecb112ac2dee029dba64a1cea7e164673ecd0fad69cdc8b87f8965c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:33.338002Z","signature_b64":"X00txJYMl63q7+0htnYGdG9R2FM0jff9jy58PFGfRKK9cPlrb3eSEu+67nhnYJO7Usky2Uecd/FznBPyaQlxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09e0de5e1f30b0f8ae9e52bcddfb753b5cc858ea008c8c06043b8e86f9e7a603","last_reissued_at":"2026-05-18T01:12:33.337625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:33.337625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Extension of Dirac's Theorem on Hamiltonicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Didem G\\\"oz\\\"upek, Mordechai Shalom, Sibel \\\"Ozkan, Yasemin B\\\"uy\\\"uk\\c{c}olak","submitted_at":"2016-06-12T09:16:51Z","abstract_excerpt":"The classical Dirac theorem asserts that every graph $G$ on $n$ vertices with minimum degree $\\delta(G) \\ge \\lceil n/2 \\rceil$ is Hamiltonian. The lower bound of $\\lceil n/2 \\rceil$ on the minimum degree of a graph is tight. In this paper, we extend the classical Dirac theorem to the case where $\\delta(G) \\ge \\lfloor n/2 \\rfloor $ by identifying the only non-Hamiltonian graph families in this case. We first present a short and simple proof. We then provide an alternative proof that is constructive and self-contained. Consequently, we provide a polynomial-time algorithm that constructs a Hamilt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03687","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":"1606.03687","created_at":"2026-05-18T01:12:33.337691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03687v1","created_at":"2026-05-18T01:12:33.337691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03687","created_at":"2026-05-18T01:12:33.337691+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHQN4XQ7GCYP","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHQN4XQ7GCYPRLU6","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHQN4XQ7","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/BHQN4XQ7GCYPRLU6KK6N363VHN","json":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN.json","graph_json":"https://pith.science/api/pith-number/BHQN4XQ7GCYPRLU6KK6N363VHN/graph.json","events_json":"https://pith.science/api/pith-number/BHQN4XQ7GCYPRLU6KK6N363VHN/events.json","paper":"https://pith.science/paper/BHQN4XQ7"},"agent_actions":{"view_html":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN","download_json":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN.json","view_paper":"https://pith.science/paper/BHQN4XQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03687&json=true","fetch_graph":"https://pith.science/api/pith-number/BHQN4XQ7GCYPRLU6KK6N363VHN/graph.json","fetch_events":"https://pith.science/api/pith-number/BHQN4XQ7GCYPRLU6KK6N363VHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/action/storage_attestation","attest_author":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/action/author_attestation","sign_citation":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/action/citation_signature","submit_replication":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/action/replication_record"}},"created_at":"2026-05-18T01:12:33.337691+00:00","updated_at":"2026-05-18T01:12:33.337691+00:00"}