{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BHQN4XQ7GCYPRLU6KK6N363VHN","short_pith_number":"pith:BHQN4XQ7","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"},"canonical_sha256":"09e0de5e1f30b0f8ae9e52bcddfb753b5cc858ea008c8c06043b8e86f9e7a603","source":{"kind":"arxiv","id":"1606.03687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03687","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03687v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03687","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"BHQN4XQ7GCYP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BHQN4XQ7GCYPRLU6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BHQN4XQ7","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BHQN4XQ7GCYPRLU6KK6N363VHN","target":"record","payload":{"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"},"canonical_sha256":"09e0de5e1f30b0f8ae9e52bcddfb753b5cc858ea008c8c06043b8e86f9e7a603","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"},"source_kind":"arxiv","source_id":"1606.03687","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBi448UIK8FCTdRZSkXD9u0q9ZYkocscEQquKej0UtLnfJ9KXtgc1/AeyHzG4BpspxjtQBn/FZjSTrOeVEQkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:16:04.940781Z"},"content_sha256":"58a00ae1375f7d515ebb3da9cc77957711cc811894920856dffe60ca286340b9","schema_version":"1.0","event_id":"sha256:58a00ae1375f7d515ebb3da9cc77957711cc811894920856dffe60ca286340b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BHQN4XQ7GCYPRLU6KK6N363VHN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5sLd6eL2y+3r4f9mOq3a+REGuy/4H5viY/ul3x93Yq51ncwlcKDOaOMzdb7B+I993kGutqYfvbrT+YPf/70YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:16:04.941169Z"},"content_sha256":"644a0d986295d69f5a4b41c76eaf2abb1f86697b25c4032df718bae9e46b8316","schema_version":"1.0","event_id":"sha256:644a0d986295d69f5a4b41c76eaf2abb1f86697b25c4032df718bae9e46b8316"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/bundle.json","state_url":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T21:16:04Z","links":{"resolver":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN","bundle":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/bundle.json","state":"https://pith.science/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHQN4XQ7GCYPRLU6KK6N363VHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BHQN4XQ7GCYPRLU6KK6N363VHN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ea1cf840ecb112ac2dee029dba64a1cea7e164673ecd0fad69cdc8b87f8965c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-12T09:16:51Z","title_canon_sha256":"be1d92aacfd4711d0af4f211166c60d7ff0f702ec636dfef83f7c9bdc538c2c4"},"schema_version":"1.0","source":{"id":"1606.03687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03687","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03687v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03687","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"BHQN4XQ7GCYP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BHQN4XQ7GCYPRLU6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BHQN4XQ7","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:644a0d986295d69f5a4b41c76eaf2abb1f86697b25c4032df718bae9e46b8316","target":"graph","created_at":"2026-05-18T01:12:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Didem G\\\"oz\\\"upek, Mordechai Shalom, Sibel \\\"Ozkan, Yasemin B\\\"uy\\\"uk\\c{c}olak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-12T09:16:51Z","title":"A Simple Extension of Dirac's Theorem on Hamiltonicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03687","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:58a00ae1375f7d515ebb3da9cc77957711cc811894920856dffe60ca286340b9","target":"record","created_at":"2026-05-18T01:12:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ea1cf840ecb112ac2dee029dba64a1cea7e164673ecd0fad69cdc8b87f8965c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-12T09:16:51Z","title_canon_sha256":"be1d92aacfd4711d0af4f211166c60d7ff0f702ec636dfef83f7c9bdc538c2c4"},"schema_version":"1.0","source":{"id":"1606.03687","kind":"arxiv","version":1}},"canonical_sha256":"09e0de5e1f30b0f8ae9e52bcddfb753b5cc858ea008c8c06043b8e86f9e7a603","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09e0de5e1f30b0f8ae9e52bcddfb753b5cc858ea008c8c06043b8e86f9e7a603","first_computed_at":"2026-05-18T01:12:33.337625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:33.337625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X00txJYMl63q7+0htnYGdG9R2FM0jff9jy58PFGfRKK9cPlrb3eSEu+67nhnYJO7Usky2Uecd/FznBPyaQlxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:33.338002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58a00ae1375f7d515ebb3da9cc77957711cc811894920856dffe60ca286340b9","sha256:644a0d986295d69f5a4b41c76eaf2abb1f86697b25c4032df718bae9e46b8316"],"state_sha256":"ab95fb5e5c551d86e306da9882d0d32101ceb2fb001542b1a16ed1dc9923106f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQE3aHBW5mxb5W/0Y7O8cnyYpX+fK37x9GrOMReaoRJ+mOEu/7lPGlPsziqIGERThP4ZegtpmNYMD3icgqN0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:16:04.943184Z","bundle_sha256":"43e694762779bcbd03411eb28b9178f48fd3fa42f620b083f8efff0e9c7a0671"}}