{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VTEKPBDZ235G7GHDXULFVHZJZ3","short_pith_number":"pith:VTEKPBDZ","canonical_record":{"source":{"id":"1508.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-31T16:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"1d82ee19b2ade051c5db50f12e1411eac66d528629ab00e5d3b48c7445fdecac","abstract_canon_sha256":"74e057415449cbb8eb64f06686cb1a1e8455f66dea4fbb42947e2138aa7cf95b"},"schema_version":"1.0"},"canonical_sha256":"acc8a78479d6fa6f98e3bd165a9f29cec6eb9cc9227abf4fb65ee6d33b315c3d","source":{"kind":"arxiv","id":"1508.07912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07912","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07912v1","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07912","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"VTEKPBDZ235G","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTEKPBDZ235G7GHD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTEKPBDZ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VTEKPBDZ235G7GHDXULFVHZJZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-31T16:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"1d82ee19b2ade051c5db50f12e1411eac66d528629ab00e5d3b48c7445fdecac","abstract_canon_sha256":"74e057415449cbb8eb64f06686cb1a1e8455f66dea4fbb42947e2138aa7cf95b"},"schema_version":"1.0"},"canonical_sha256":"acc8a78479d6fa6f98e3bd165a9f29cec6eb9cc9227abf4fb65ee6d33b315c3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:31.201085Z","signature_b64":"bMP7jQtgnh9DBK9tySrnRRDEoZQ3IworlRAZZQMzQc4kd5CoKnYjzl+VJH7DsfzkciDCIaz22rWPGR5TUfJMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acc8a78479d6fa6f98e3bd165a9f29cec6eb9cc9227abf4fb65ee6d33b315c3d","last_reissued_at":"2026-05-18T01:34:31.200666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:31.200666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07912","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4gYp4g0z4yZ35291ZAfOJwzjLUEUPGdPvMFb9j8NDp9VA8ix9jazcL6V5nn1iCbgjNSgEkEQmFGg4QPR9M9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:20:18.084509Z"},"content_sha256":"7015906c560c80ab45e4a1365e10305b3459aa15a3b3f61b8e2f3364e914405f","schema_version":"1.0","event_id":"sha256:7015906c560c80ab45e4a1365e10305b3459aa15a3b3f61b8e2f3364e914405f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VTEKPBDZ235G7GHDXULFVHZJZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle lengths and minimum degree of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Jie Ma","submitted_at":"2015-08-31T16:45:53Z","abstract_excerpt":"There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is bipartite, then there are $k$ cycles in $G$ whose lengths form an arithmetic progression with common difference two. For general graph $G$, we show that $G$ contains $\\lfloor k/2\\rfloor$ cycles with consecutive even lengths and $k-3$ cycles whose lengths form an arithmetic progression with common difference one or two. In addition, if $G$ is 2-connected and non-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07912","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6lz0FdcDKfEKdzFpMac8ids0aDFLxQsuVLEyLFYfc60gDyrnXVKNBfYKNlfzVWPPXwc/fFiCLrJgMFWIPqHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:20:18.084849Z"},"content_sha256":"6ce97ba844e7a46b87b6fdc90f4e8a654a50b6931cecc182e84199aff491c4c2","schema_version":"1.0","event_id":"sha256:6ce97ba844e7a46b87b6fdc90f4e8a654a50b6931cecc182e84199aff491c4c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTEKPBDZ235G7GHDXULFVHZJZ3/bundle.json","state_url":"https://pith.science/pith/VTEKPBDZ235G7GHDXULFVHZJZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTEKPBDZ235G7GHDXULFVHZJZ3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T18:20:18Z","links":{"resolver":"https://pith.science/pith/VTEKPBDZ235G7GHDXULFVHZJZ3","bundle":"https://pith.science/pith/VTEKPBDZ235G7GHDXULFVHZJZ3/bundle.json","state":"https://pith.science/pith/VTEKPBDZ235G7GHDXULFVHZJZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTEKPBDZ235G7GHDXULFVHZJZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VTEKPBDZ235G7GHDXULFVHZJZ3","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":"74e057415449cbb8eb64f06686cb1a1e8455f66dea4fbb42947e2138aa7cf95b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-31T16:45:53Z","title_canon_sha256":"1d82ee19b2ade051c5db50f12e1411eac66d528629ab00e5d3b48c7445fdecac"},"schema_version":"1.0","source":{"id":"1508.07912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07912","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07912v1","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07912","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"VTEKPBDZ235G","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VTEKPBDZ235G7GHD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VTEKPBDZ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:6ce97ba844e7a46b87b6fdc90f4e8a654a50b6931cecc182e84199aff491c4c2","target":"graph","created_at":"2026-05-18T01:34:31Z","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":"There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is bipartite, then there are $k$ cycles in $G$ whose lengths form an arithmetic progression with common difference two. For general graph $G$, we show that $G$ contains $\\lfloor k/2\\rfloor$ cycles with consecutive even lengths and $k-3$ cycles whose lengths form an arithmetic progression with common difference one or two. In addition, if $G$ is 2-connected and non-","authors_text":"Chun-Hung Liu, Jie Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-31T16:45:53Z","title":"Cycle lengths and minimum degree of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07912","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:7015906c560c80ab45e4a1365e10305b3459aa15a3b3f61b8e2f3364e914405f","target":"record","created_at":"2026-05-18T01:34:31Z","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":"74e057415449cbb8eb64f06686cb1a1e8455f66dea4fbb42947e2138aa7cf95b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-31T16:45:53Z","title_canon_sha256":"1d82ee19b2ade051c5db50f12e1411eac66d528629ab00e5d3b48c7445fdecac"},"schema_version":"1.0","source":{"id":"1508.07912","kind":"arxiv","version":1}},"canonical_sha256":"acc8a78479d6fa6f98e3bd165a9f29cec6eb9cc9227abf4fb65ee6d33b315c3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acc8a78479d6fa6f98e3bd165a9f29cec6eb9cc9227abf4fb65ee6d33b315c3d","first_computed_at":"2026-05-18T01:34:31.200666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:31.200666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bMP7jQtgnh9DBK9tySrnRRDEoZQ3IworlRAZZQMzQc4kd5CoKnYjzl+VJH7DsfzkciDCIaz22rWPGR5TUfJMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:31.201085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7015906c560c80ab45e4a1365e10305b3459aa15a3b3f61b8e2f3364e914405f","sha256:6ce97ba844e7a46b87b6fdc90f4e8a654a50b6931cecc182e84199aff491c4c2"],"state_sha256":"adbc9b79188ab5bde8f5739350c2556f7602d50114a6f2de518361a8ee279f69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fyaO9u3pxJwkkXb0sZH+j/Rmrx7MS6qrjG47e9E+AQL71fV4CgFbjiyMLzFU9q27AZt9pBZQt51PeaeF/9OBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:20:18.086844Z","bundle_sha256":"050e2d4adb287e7f19054210bde8f91481cb5bb8975d51eaec0c1e2b76f12cca"}}