{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OU3PPLUZPACVOS46EXPSVGG3SC","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":"bcd153949a3803de631508443a96be338d9f5dad28e583eba1d8f73888594a28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T20:07:08Z","title_canon_sha256":"002ee6cbf343a8eaaead61a5279c568b8001645fa9508b2329c3a24cfb27ebd1"},"schema_version":"1.0","source":{"id":"1707.03892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03892","created_at":"2026-05-18T00:40:23Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03892v1","created_at":"2026-05-18T00:40:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03892","created_at":"2026-05-18T00:40:23Z"},{"alias_kind":"pith_short_12","alias_value":"OU3PPLUZPACV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OU3PPLUZPACVOS46","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OU3PPLUZ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:a42aabdf2c9c6d627f5733f286cc3691181932576cdd244734a4cfb60e757b73","target":"graph","created_at":"2026-05-18T00:40:23Z","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":"Let $k \\geq 3$ be an integer, $h_{k}(G)$ be the number of vertices of degree at least $2k$ in a graph $G$, and $\\ell_{k}(G)$ be the number of vertices of degree at most $2k-2$ in $G$. Dirac and Erd\\H{o}s proved in 1963 that if $h_{k}(G) - \\ell_{k}(G) \\geq k^{2} + 2k - 4$, then $G$ contains $k$ vertex-disjoint cycles. For each $k\\geq 2$, they also showed an infinite sequence of graphs $G_k(n)$ with $h_{k}(G_k(n)) - \\ell_{k}(G_k(n)) = 2k-1$ such that $G_k(n)$ does not have $k$ disjoint cycles. Recently, the authors proved that, for $k \\geq 2$, a bound of $3k$ is sufficient to guarantee the exist","authors_text":"Alexandr V. Kostochka, Andrew McConvey, Henry A. Kierstead","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T20:07:08Z","title":"A sharp Dirac-Erd\\H{o}s type bound for large graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03892","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:6e6329384dd26bc9d6f94a7c85c569d63745ec7714ce485c173245bac3c2f4f0","target":"record","created_at":"2026-05-18T00:40:23Z","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":"bcd153949a3803de631508443a96be338d9f5dad28e583eba1d8f73888594a28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T20:07:08Z","title_canon_sha256":"002ee6cbf343a8eaaead61a5279c568b8001645fa9508b2329c3a24cfb27ebd1"},"schema_version":"1.0","source":{"id":"1707.03892","kind":"arxiv","version":1}},"canonical_sha256":"7536f7ae997805574b9e25df2a98db909b900c2a1151c371a5176a51fbe07684","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7536f7ae997805574b9e25df2a98db909b900c2a1151c371a5176a51fbe07684","first_computed_at":"2026-05-18T00:40:23.240004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:23.240004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2uG3aAZYmtVfSiTCfyPKLERnjUx6kLjOgvpo+Tr13P1RZttAiQXrCytFYUegE2v3plKMjpgnIpH+sKJFPvvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:23.240585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e6329384dd26bc9d6f94a7c85c569d63745ec7714ce485c173245bac3c2f4f0","sha256:a42aabdf2c9c6d627f5733f286cc3691181932576cdd244734a4cfb60e757b73"],"state_sha256":"13b7d57580ec11af60276ca79b39a517e450e9d2ffa4a06423ce95b0e256a7ba"}