{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PL44IKJKM3ED5JPRWURXHPLA6Y","short_pith_number":"pith:PL44IKJK","canonical_record":{"source":{"id":"2511.03085","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-05T00:21:31Z","cross_cats_sorted":[],"title_canon_sha256":"777de52eb1e24fe0f5ef128d4d2795ab71932836109760850496c3e6814c3729","abstract_canon_sha256":"fb5ff66e5d2d13e5725a8b1230d0336f87a683ac3f72a4f078e5a6240023bf2d"},"schema_version":"1.0"},"canonical_sha256":"7af9c4292a66c83ea5f1b52373bd60f63a6895a6892bcdbdd0b6f0089d2a74c7","source":{"kind":"arxiv","id":"2511.03085","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.03085","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"2511.03085v2","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.03085","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"PL44IKJKM3ED","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"PL44IKJKM3ED5JPR","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"PL44IKJK","created_at":"2026-07-10T01:19:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PL44IKJKM3ED5JPRWURXHPLA6Y","target":"record","payload":{"canonical_record":{"source":{"id":"2511.03085","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-05T00:21:31Z","cross_cats_sorted":[],"title_canon_sha256":"777de52eb1e24fe0f5ef128d4d2795ab71932836109760850496c3e6814c3729","abstract_canon_sha256":"fb5ff66e5d2d13e5725a8b1230d0336f87a683ac3f72a4f078e5a6240023bf2d"},"schema_version":"1.0"},"canonical_sha256":"7af9c4292a66c83ea5f1b52373bd60f63a6895a6892bcdbdd0b6f0089d2a74c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:40.442460Z","signature_b64":"i0woeY6tRdCPS6zZb4AObGywOMjzKnN0cmXenNbDQrG6BVFY3/xFbYmvKQC3E27rjj+B3CYLIybqgy4/GC0/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af9c4292a66c83ea5f1b52373bd60f63a6895a6892bcdbdd0b6f0089d2a74c7","last_reissued_at":"2026-07-10T01:19:40.441945Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:40.441945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.03085","source_version":2,"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-07-10T01:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LMpWoOrnxPl8dRamTJWvTprx3EazKdc2KxdQ68YTgLlyE8W5AMiYXj9eeplFTtkbPLuA+8st2qNVU8uOG1jfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:40:29.645948Z"},"content_sha256":"592600167aa9d0f034316a010eef38f52ccb5eebfed46a10309220314ad1e40f","schema_version":"1.0","event_id":"sha256:592600167aa9d0f034316a010eef38f52ccb5eebfed46a10309220314ad1e40f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PL44IKJKM3ED5JPRWURXHPLA6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle lengths in graphs of given minimum degree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Grzesik, Binlong Li, Magdalena Prorok, Yandong Bai","submitted_at":"2025-11-05T00:21:31Z","abstract_excerpt":"We prove that if $G$ is a 2-connected graph with minimum degree at least $k\\geqslant 4$, then\n  (1) $G$ contains $k$ cycles whose lengths form an arithmetic progression with common difference one or two, unless $G\\cong K_{k+1}$ or $K_{k,n-k}$;\n  (2) $G$ contains cycles of lengths $\\ell$ modulo $k$ for all even $\\ell$, unless $G\\cong K_{k+1}$ or $K_{k,n-k}$;\n  (3) $G$ contains cycles of lengths $\\ell$ modulo $k$ for all $\\ell$, unless $G\\cong K_{k+1}$ or $G$ is bipartite.\n  In addition, we show that if $k$ is even and $G$ is 2-connected with minimum degree at least $k-1$ and order at least $k+2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.03085","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/2511.03085/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"},"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-07-10T01:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alp0Z+vqQTmJvNK+WDi6fQzC1B68k5aAtNNh51xfML28I5+OQQSC0Ye5XsGYpBWok5yDZbjpxpvi3wvrWOrfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:40:29.646469Z"},"content_sha256":"24556e3b3e512bfea5a32a2283fe16e5a09eb156ca478e23a816ebaefaea3471","schema_version":"1.0","event_id":"sha256:24556e3b3e512bfea5a32a2283fe16e5a09eb156ca478e23a816ebaefaea3471"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PL44IKJKM3ED5JPRWURXHPLA6Y/bundle.json","state_url":"https://pith.science/pith/PL44IKJKM3ED5JPRWURXHPLA6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PL44IKJKM3ED5JPRWURXHPLA6Y/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-08-19T07:40:29Z","links":{"resolver":"https://pith.science/pith/PL44IKJKM3ED5JPRWURXHPLA6Y","bundle":"https://pith.science/pith/PL44IKJKM3ED5JPRWURXHPLA6Y/bundle.json","state":"https://pith.science/pith/PL44IKJKM3ED5JPRWURXHPLA6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PL44IKJKM3ED5JPRWURXHPLA6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PL44IKJKM3ED5JPRWURXHPLA6Y","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":"fb5ff66e5d2d13e5725a8b1230d0336f87a683ac3f72a4f078e5a6240023bf2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-05T00:21:31Z","title_canon_sha256":"777de52eb1e24fe0f5ef128d4d2795ab71932836109760850496c3e6814c3729"},"schema_version":"1.0","source":{"id":"2511.03085","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.03085","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"2511.03085v2","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.03085","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"PL44IKJKM3ED","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"PL44IKJKM3ED5JPR","created_at":"2026-07-10T01:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"PL44IKJK","created_at":"2026-07-10T01:19:40Z"}],"graph_snapshots":[{"event_id":"sha256:24556e3b3e512bfea5a32a2283fe16e5a09eb156ca478e23a816ebaefaea3471","target":"graph","created_at":"2026-07-10T01:19:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.03085/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that if $G$ is a 2-connected graph with minimum degree at least $k\\geqslant 4$, then\n  (1) $G$ contains $k$ cycles whose lengths form an arithmetic progression with common difference one or two, unless $G\\cong K_{k+1}$ or $K_{k,n-k}$;\n  (2) $G$ contains cycles of lengths $\\ell$ modulo $k$ for all even $\\ell$, unless $G\\cong K_{k+1}$ or $K_{k,n-k}$;\n  (3) $G$ contains cycles of lengths $\\ell$ modulo $k$ for all $\\ell$, unless $G\\cong K_{k+1}$ or $G$ is bipartite.\n  In addition, we show that if $k$ is even and $G$ is 2-connected with minimum degree at least $k-1$ and order at least $k+2","authors_text":"Andrzej Grzesik, Binlong Li, Magdalena Prorok, Yandong Bai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-05T00:21:31Z","title":"Cycle lengths in graphs of given minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.03085","kind":"arxiv","version":2},"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:592600167aa9d0f034316a010eef38f52ccb5eebfed46a10309220314ad1e40f","target":"record","created_at":"2026-07-10T01:19:40Z","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":"fb5ff66e5d2d13e5725a8b1230d0336f87a683ac3f72a4f078e5a6240023bf2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-11-05T00:21:31Z","title_canon_sha256":"777de52eb1e24fe0f5ef128d4d2795ab71932836109760850496c3e6814c3729"},"schema_version":"1.0","source":{"id":"2511.03085","kind":"arxiv","version":2}},"canonical_sha256":"7af9c4292a66c83ea5f1b52373bd60f63a6895a6892bcdbdd0b6f0089d2a74c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7af9c4292a66c83ea5f1b52373bd60f63a6895a6892bcdbdd0b6f0089d2a74c7","first_computed_at":"2026-07-10T01:19:40.441945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T01:19:40.441945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i0woeY6tRdCPS6zZb4AObGywOMjzKnN0cmXenNbDQrG6BVFY3/xFbYmvKQC3E27rjj+B3CYLIybqgy4/GC0/Bw==","signature_status":"signed_v1","signed_at":"2026-07-10T01:19:40.442460Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.03085","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:592600167aa9d0f034316a010eef38f52ccb5eebfed46a10309220314ad1e40f","sha256:24556e3b3e512bfea5a32a2283fe16e5a09eb156ca478e23a816ebaefaea3471"],"state_sha256":"ed0fa2b04229415aa45b389ff0cd013fde1613dab5c4812925b7ec486e717f59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GoGVDgkPueYUewwpSdUl6T6DXB6j+r5NGkUeY3iYMF4HFVntg5y3QQJgd1f3T4pWF2sivvugh5VQrg1SxtvUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T07:40:29.651579Z","bundle_sha256":"827fda3622ce38d714d9f370aa334e47820651ebd3c4c88ae5db37766ff41212"}}