{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OU3PPLUZPACVOS46EXPSVGG3SC","short_pith_number":"pith:OU3PPLUZ","schema_version":"1.0","canonical_sha256":"7536f7ae997805574b9e25df2a98db909b900c2a1151c371a5176a51fbe07684","source":{"kind":"arxiv","id":"1707.03892","version":1},"attestation_state":"computed","paper":{"title":"A sharp Dirac-Erd\\H{o}s type bound for large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Andrew McConvey, Henry A. Kierstead","submitted_at":"2017-07-12T20:07:08Z","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"},"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":"1707.03892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-12T20:07:08Z","cross_cats_sorted":[],"title_canon_sha256":"002ee6cbf343a8eaaead61a5279c568b8001645fa9508b2329c3a24cfb27ebd1","abstract_canon_sha256":"bcd153949a3803de631508443a96be338d9f5dad28e583eba1d8f73888594a28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:23.240585Z","signature_b64":"a2uG3aAZYmtVfSiTCfyPKLERnjUx6kLjOgvpo+Tr13P1RZttAiQXrCytFYUegE2v3plKMjpgnIpH+sKJFPvvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7536f7ae997805574b9e25df2a98db909b900c2a1151c371a5176a51fbe07684","last_reissued_at":"2026-05-18T00:40:23.240004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:23.240004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sharp Dirac-Erd\\H{o}s type bound for large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Andrew McConvey, Henry A. Kierstead","submitted_at":"2017-07-12T20:07:08Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03892","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":"1707.03892","created_at":"2026-05-18T00:40:23.240084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03892v1","created_at":"2026-05-18T00:40:23.240084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03892","created_at":"2026-05-18T00:40:23.240084+00:00"},{"alias_kind":"pith_short_12","alias_value":"OU3PPLUZPACV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OU3PPLUZPACVOS46","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OU3PPLUZ","created_at":"2026-05-18T12:31:34.259226+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/OU3PPLUZPACVOS46EXPSVGG3SC","json":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC.json","graph_json":"https://pith.science/api/pith-number/OU3PPLUZPACVOS46EXPSVGG3SC/graph.json","events_json":"https://pith.science/api/pith-number/OU3PPLUZPACVOS46EXPSVGG3SC/events.json","paper":"https://pith.science/paper/OU3PPLUZ"},"agent_actions":{"view_html":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC","download_json":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC.json","view_paper":"https://pith.science/paper/OU3PPLUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03892&json=true","fetch_graph":"https://pith.science/api/pith-number/OU3PPLUZPACVOS46EXPSVGG3SC/graph.json","fetch_events":"https://pith.science/api/pith-number/OU3PPLUZPACVOS46EXPSVGG3SC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC/action/storage_attestation","attest_author":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC/action/author_attestation","sign_citation":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC/action/citation_signature","submit_replication":"https://pith.science/pith/OU3PPLUZPACVOS46EXPSVGG3SC/action/replication_record"}},"created_at":"2026-05-18T00:40:23.240084+00:00","updated_at":"2026-05-18T00:40:23.240084+00:00"}