{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RLAOV7KDI34JRVLNT3OMJVWRKD","short_pith_number":"pith:RLAOV7KD","schema_version":"1.0","canonical_sha256":"8ac0eafd4346f898d56d9edcc4d6d150f4000a3db676e3f8b10c33130d807570","source":{"kind":"arxiv","id":"2410.00648","version":2},"attestation_state":"computed","paper":{"title":"A strengthening on consecutive odd cycles in graphs of given minimum degree","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hao Lin, Wenling Zhou","submitted_at":"2024-10-01T13:01:17Z","abstract_excerpt":"Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\\lceil k/2\\rceil $ cycles with consecutive odd lengths. In particular, they showed that this conjecture holds when $k$ is even. In this paper, we confirm this conjecture for any $k\\in \\mathbb N$. Moreover, we also improve some previous results about cycles of consecutive lengths."},"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":"2410.00648","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-01T13:01:17Z","cross_cats_sorted":[],"title_canon_sha256":"b2a367b18efdf8419491109e0512d1972542d4811997656007b13e9f58f36b10","abstract_canon_sha256":"056b762265e742821bb1ff5c9cfeec0e774121ec9561fe07ba8393dcdf971445"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:02.189352Z","signature_b64":"kDRCddH9cVoEh3vpkyAyfIQ5T9wJkDouRqTvOk7Ow4em1FtbjHoFWZIDXTpO4g7fsnbHhOD/83FjekZ8GZ7FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac0eafd4346f898d56d9edcc4d6d150f4000a3db676e3f8b10c33130d807570","last_reissued_at":"2026-07-05T11:29:02.188764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:02.188764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A strengthening on consecutive odd cycles in graphs of given minimum degree","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hao Lin, Wenling Zhou","submitted_at":"2024-10-01T13:01:17Z","abstract_excerpt":"Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\\lceil k/2\\rceil $ cycles with consecutive odd lengths. In particular, they showed that this conjecture holds when $k$ is even. In this paper, we confirm this conjecture for any $k\\in \\mathbb N$. Moreover, we also improve some previous results about cycles of consecutive lengths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.00648","kind":"arxiv","version":2},"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/2410.00648/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":"2410.00648","created_at":"2026-07-05T11:29:02.188827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.00648v2","created_at":"2026-07-05T11:29:02.188827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.00648","created_at":"2026-07-05T11:29:02.188827+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLAOV7KDI34J","created_at":"2026-07-05T11:29:02.188827+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLAOV7KDI34JRVLN","created_at":"2026-07-05T11:29:02.188827+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLAOV7KD","created_at":"2026-07-05T11:29:02.188827+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09576","citing_title":"Interpolating chromatic and homomorphism thresholds","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD","json":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD.json","graph_json":"https://pith.science/api/pith-number/RLAOV7KDI34JRVLNT3OMJVWRKD/graph.json","events_json":"https://pith.science/api/pith-number/RLAOV7KDI34JRVLNT3OMJVWRKD/events.json","paper":"https://pith.science/paper/RLAOV7KD"},"agent_actions":{"view_html":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD","download_json":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD.json","view_paper":"https://pith.science/paper/RLAOV7KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.00648&json=true","fetch_graph":"https://pith.science/api/pith-number/RLAOV7KDI34JRVLNT3OMJVWRKD/graph.json","fetch_events":"https://pith.science/api/pith-number/RLAOV7KDI34JRVLNT3OMJVWRKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD/action/storage_attestation","attest_author":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD/action/author_attestation","sign_citation":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD/action/citation_signature","submit_replication":"https://pith.science/pith/RLAOV7KDI34JRVLNT3OMJVWRKD/action/replication_record"}},"created_at":"2026-07-05T11:29:02.188827+00:00","updated_at":"2026-07-05T11:29:02.188827+00:00"}