{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5GDBVIO5WQIPOPAAB4QEZDBA5C","short_pith_number":"pith:5GDBVIO5","schema_version":"1.0","canonical_sha256":"e9861aa1ddb410f73c000f204c8c20e8b99563de1be3bcff5ba3163c4ebb2d10","source":{"kind":"arxiv","id":"2011.03619","version":5},"attestation_state":"computed","paper":{"title":"Algorithmic Extensions of Dirac's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2020-11-06T22:32:33Z","abstract_excerpt":"In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\\delta\\geq 2$ contains a cycle with at least $\\min\\{2\\delta,n\\}$ vertices. In particular, if $\\delta\\geq n/2$, then $G$ is Hamiltonian. The proof of Dirac's theorem is constructive, and it yields an algorithm computing the corresponding cycle in polynomial time. The combinatorial bound of Dirac's theorem is tight in the following sense. There are 2-connected graphs that do not contain cycles of length more than $2\\delta+"},"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":"2011.03619","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-06T22:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"48c7633bfc9a05793d342b84118d27b6653bc8754c24ef443c684466ecdedeeb","abstract_canon_sha256":"fa7b4903606adf34e45567d0be9e960ddb7c73fcac1ee78d9ae72170ef51a1ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:06.981970Z","signature_b64":"jcB+MVWPMMujasWCqrsWi9MzIblKJoka7w3UXKdBTUoP0ZhqLy7naZ4CnRpmZ0tA5tySGxp10MRuaiiWhrbaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9861aa1ddb410f73c000f204c8c20e8b99563de1be3bcff5ba3163c4ebb2d10","last_reissued_at":"2026-07-05T08:07:06.981596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:06.981596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Extensions of Dirac's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2020-11-06T22:32:33Z","abstract_excerpt":"In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\\delta\\geq 2$ contains a cycle with at least $\\min\\{2\\delta,n\\}$ vertices. In particular, if $\\delta\\geq n/2$, then $G$ is Hamiltonian. The proof of Dirac's theorem is constructive, and it yields an algorithm computing the corresponding cycle in polynomial time. The combinatorial bound of Dirac's theorem is tight in the following sense. There are 2-connected graphs that do not contain cycles of length more than $2\\delta+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03619","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.03619/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.03619","created_at":"2026-07-05T08:07:06.981658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.03619v5","created_at":"2026-07-05T08:07:06.981658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03619","created_at":"2026-07-05T08:07:06.981658+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GDBVIO5WQIP","created_at":"2026-07-05T08:07:06.981658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GDBVIO5WQIPOPAA","created_at":"2026-07-05T08:07:06.981658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GDBVIO5","created_at":"2026-07-05T08:07:06.981658+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/5GDBVIO5WQIPOPAAB4QEZDBA5C","json":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C.json","graph_json":"https://pith.science/api/pith-number/5GDBVIO5WQIPOPAAB4QEZDBA5C/graph.json","events_json":"https://pith.science/api/pith-number/5GDBVIO5WQIPOPAAB4QEZDBA5C/events.json","paper":"https://pith.science/paper/5GDBVIO5"},"agent_actions":{"view_html":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C","download_json":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C.json","view_paper":"https://pith.science/paper/5GDBVIO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.03619&json=true","fetch_graph":"https://pith.science/api/pith-number/5GDBVIO5WQIPOPAAB4QEZDBA5C/graph.json","fetch_events":"https://pith.science/api/pith-number/5GDBVIO5WQIPOPAAB4QEZDBA5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/action/storage_attestation","attest_author":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/action/author_attestation","sign_citation":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/action/citation_signature","submit_replication":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/action/replication_record"}},"created_at":"2026-07-05T08:07:06.981658+00:00","updated_at":"2026-07-05T08:07:06.981658+00:00"}