{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DVE343FNGNDT2LOJVFGR7GDGDZ","short_pith_number":"pith:DVE343FN","schema_version":"1.0","canonical_sha256":"1d49be6cad33473d2dc9a94d1f98661e522be7ea6e9c4a6355284b3c6e1e9c22","source":{"kind":"arxiv","id":"1904.08126","version":3},"attestation_state":"computed","paper":{"title":"A unified proof of conjectures on cycle lengths in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Jie Ma, Jun Gao, Qingyi Huo","submitted_at":"2019-04-17T08:25:36Z","abstract_excerpt":"In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain a number of exact and optimal results on cycle lengths in graphs of given minimum degree, connectivity or chromatic number.\n  More precisely, we prove the following statements by a unified approach. (1) Every graph $G$ with minimum degree at least $k+1$ contains cycles of all even lengths modulo $k$; in addition, if $G$ is 2-connected and non-bipartite, then"},"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":"1904.08126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-17T08:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"ed5836939ae2ccf93caa425aa657ee44dbce78ca29893a6448c3e1dda36b8473","abstract_canon_sha256":"73c5c6e1f956cf6b5307425467eb4fae51b893958945109b37f198c747fe2883"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:34.472033Z","signature_b64":"padde1OC9/lE+QAuf8sJNykjcQj614fsp+EaEJ4fOv1b1MAGwj2MsRT7cbg4MsJqPIoN5JCxkAa0O0cAjTPfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d49be6cad33473d2dc9a94d1f98661e522be7ea6e9c4a6355284b3c6e1e9c22","last_reissued_at":"2026-07-05T02:09:34.471618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:34.471618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified proof of conjectures on cycle lengths in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Jie Ma, Jun Gao, Qingyi Huo","submitted_at":"2019-04-17T08:25:36Z","abstract_excerpt":"In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain a number of exact and optimal results on cycle lengths in graphs of given minimum degree, connectivity or chromatic number.\n  More precisely, we prove the following statements by a unified approach. (1) Every graph $G$ with minimum degree at least $k+1$ contains cycles of all even lengths modulo $k$; in addition, if $G$ is 2-connected and non-bipartite, then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08126","kind":"arxiv","version":3},"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/1904.08126/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":"1904.08126","created_at":"2026-07-05T02:09:34.471674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08126v3","created_at":"2026-07-05T02:09:34.471674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08126","created_at":"2026-07-05T02:09:34.471674+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVE343FNGNDT","created_at":"2026-07-05T02:09:34.471674+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVE343FNGNDT2LOJ","created_at":"2026-07-05T02:09:34.471674+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVE343FN","created_at":"2026-07-05T02:09:34.471674+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/DVE343FNGNDT2LOJVFGR7GDGDZ","json":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ.json","graph_json":"https://pith.science/api/pith-number/DVE343FNGNDT2LOJVFGR7GDGDZ/graph.json","events_json":"https://pith.science/api/pith-number/DVE343FNGNDT2LOJVFGR7GDGDZ/events.json","paper":"https://pith.science/paper/DVE343FN"},"agent_actions":{"view_html":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ","download_json":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ.json","view_paper":"https://pith.science/paper/DVE343FN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08126&json=true","fetch_graph":"https://pith.science/api/pith-number/DVE343FNGNDT2LOJVFGR7GDGDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DVE343FNGNDT2LOJVFGR7GDGDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ/action/storage_attestation","attest_author":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ/action/author_attestation","sign_citation":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ/action/citation_signature","submit_replication":"https://pith.science/pith/DVE343FNGNDT2LOJVFGR7GDGDZ/action/replication_record"}},"created_at":"2026-07-05T02:09:34.471674+00:00","updated_at":"2026-07-05T02:09:34.471674+00:00"}