{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JFXGYDA7FDZJPRSJWXXWMXJRKX","short_pith_number":"pith:JFXGYDA7","canonical_record":{"source":{"id":"1906.03206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T16:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"428394d3d0c204091f5e76741bbb7aa5194a4adc5ad302a4132a0b594388511e","abstract_canon_sha256":"f301d0f9239b5b3277a11d8454bd1921cbc3ef0efc392bc02f924f2cc233b18a"},"schema_version":"1.0"},"canonical_sha256":"496e6c0c1f28f297c649b5ef665d3155e9d4f7c5fb5c1432c884a78d1715370d","source":{"kind":"arxiv","id":"1906.03206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03206","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03206v1","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03206","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"JFXGYDA7FDZJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JFXGYDA7FDZJPRSJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JFXGYDA7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JFXGYDA7FDZJPRSJWXXWMXJRKX","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T16:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"428394d3d0c204091f5e76741bbb7aa5194a4adc5ad302a4132a0b594388511e","abstract_canon_sha256":"f301d0f9239b5b3277a11d8454bd1921cbc3ef0efc392bc02f924f2cc233b18a"},"schema_version":"1.0"},"canonical_sha256":"496e6c0c1f28f297c649b5ef665d3155e9d4f7c5fb5c1432c884a78d1715370d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.687720Z","signature_b64":"62wo9kps4oWlgKk6tsZuyep4zh8aMf+BqTrkCg9SEWJotD81jqfz7auH9epkqmTUjLEUAuuVcuqBbw2dnsI/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"496e6c0c1f28f297c649b5ef665d3155e9d4f7c5fb5c1432c884a78d1715370d","last_reissued_at":"2026-05-17T23:43:54.687039Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.687039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03206","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-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Kx8NIasDxzE9wW4+2zipy3NBDoetKLMUdKhiszvBHbqO7fjZYvry9CAq3WM6a6kxxWY/P8ovKEyNmw6c1+kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:26:25.376612Z"},"content_sha256":"3b7f5ccba304aadba3f2f96b0d0cdaef94438a722b7374f3e5d03aa42e5308c7","schema_version":"1.0","event_id":"sha256:3b7f5ccba304aadba3f2f96b0d0cdaef94438a722b7374f3e5d03aa42e5308c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JFXGYDA7FDZJPRSJWXXWMXJRKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A conjecture of Verstra\\\"ete on vertex-disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Jun Gao","submitted_at":"2019-06-07T16:14:56Z","abstract_excerpt":"Answering a question of H\\\"aggkvist and Scott, Verstra\\\"ete proved that every sufficiently large graph with average degree at least $k^2+19k+10$ contains $k$ vertex-disjoint cycles of consecutive even lengths. He further conjectured that the same holds for every graph $G$ with average degree at least $k^2+3k+2$. In this paper we prove this conjecture for $k\\geq 19$ when $G$ is sufficiently large. We also show that for any $\\epsilon>0$ and large $k\\geq k_\\epsilon$, average degree at least $k^2+3k-2+\\epsilon$ suffices, which is asymptotically tight for infinitely many graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03206","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-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTDWjUUuBFuoBf6heSxQhxqxpRTiJChuYMiYl/KhaOJOQAE3i/UwbzEf8KyWlVWXTLHZDKDndLhKKRoUDjYsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:26:25.376953Z"},"content_sha256":"1dd9876c381d82a5643807d3aade7418a8a4deba718c1dff327f64213d0777ac","schema_version":"1.0","event_id":"sha256:1dd9876c381d82a5643807d3aade7418a8a4deba718c1dff327f64213d0777ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFXGYDA7FDZJPRSJWXXWMXJRKX/bundle.json","state_url":"https://pith.science/pith/JFXGYDA7FDZJPRSJWXXWMXJRKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFXGYDA7FDZJPRSJWXXWMXJRKX/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-06-02T20:26:25Z","links":{"resolver":"https://pith.science/pith/JFXGYDA7FDZJPRSJWXXWMXJRKX","bundle":"https://pith.science/pith/JFXGYDA7FDZJPRSJWXXWMXJRKX/bundle.json","state":"https://pith.science/pith/JFXGYDA7FDZJPRSJWXXWMXJRKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFXGYDA7FDZJPRSJWXXWMXJRKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JFXGYDA7FDZJPRSJWXXWMXJRKX","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":"f301d0f9239b5b3277a11d8454bd1921cbc3ef0efc392bc02f924f2cc233b18a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T16:14:56Z","title_canon_sha256":"428394d3d0c204091f5e76741bbb7aa5194a4adc5ad302a4132a0b594388511e"},"schema_version":"1.0","source":{"id":"1906.03206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03206","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03206v1","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03206","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"JFXGYDA7FDZJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JFXGYDA7FDZJPRSJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JFXGYDA7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:1dd9876c381d82a5643807d3aade7418a8a4deba718c1dff327f64213d0777ac","target":"graph","created_at":"2026-05-17T23:43:54Z","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":"Answering a question of H\\\"aggkvist and Scott, Verstra\\\"ete proved that every sufficiently large graph with average degree at least $k^2+19k+10$ contains $k$ vertex-disjoint cycles of consecutive even lengths. He further conjectured that the same holds for every graph $G$ with average degree at least $k^2+3k+2$. In this paper we prove this conjecture for $k\\geq 19$ when $G$ is sufficiently large. We also show that for any $\\epsilon>0$ and large $k\\geq k_\\epsilon$, average degree at least $k^2+3k-2+\\epsilon$ suffices, which is asymptotically tight for infinitely many graphs.","authors_text":"Jie Ma, Jun Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T16:14:56Z","title":"A conjecture of Verstra\\\"ete on vertex-disjoint cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03206","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:3b7f5ccba304aadba3f2f96b0d0cdaef94438a722b7374f3e5d03aa42e5308c7","target":"record","created_at":"2026-05-17T23:43:54Z","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":"f301d0f9239b5b3277a11d8454bd1921cbc3ef0efc392bc02f924f2cc233b18a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T16:14:56Z","title_canon_sha256":"428394d3d0c204091f5e76741bbb7aa5194a4adc5ad302a4132a0b594388511e"},"schema_version":"1.0","source":{"id":"1906.03206","kind":"arxiv","version":1}},"canonical_sha256":"496e6c0c1f28f297c649b5ef665d3155e9d4f7c5fb5c1432c884a78d1715370d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"496e6c0c1f28f297c649b5ef665d3155e9d4f7c5fb5c1432c884a78d1715370d","first_computed_at":"2026-05-17T23:43:54.687039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:54.687039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"62wo9kps4oWlgKk6tsZuyep4zh8aMf+BqTrkCg9SEWJotD81jqfz7auH9epkqmTUjLEUAuuVcuqBbw2dnsI/AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:54.687720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b7f5ccba304aadba3f2f96b0d0cdaef94438a722b7374f3e5d03aa42e5308c7","sha256:1dd9876c381d82a5643807d3aade7418a8a4deba718c1dff327f64213d0777ac"],"state_sha256":"904618624c18226274732e458b3d585a711bfd141950b4b026632d99eaf22fc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPLiRQVdFo4ory94dBFGx6j6RU4hXQGS879RGEBm3YOEa7Er0DeLjNYaUpAMaOKmQaHU/0OMr9YLhBQBAj3zDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:26:25.378913Z","bundle_sha256":"a68c2bb6335f30db4f84d88c73807beee25a24c8c2440082d1178fc3d71572ac"}}