{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QEORV2KYNDFD424MRIPNS5VTG3","short_pith_number":"pith:QEORV2KY","canonical_record":{"source":{"id":"1806.05347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-14T03:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"7ce994ad56b70de4bcd3f7991df811e1b203f16260209f35fd589eba2cba869f","abstract_canon_sha256":"3bcf3e11f787aad44b88a2611e1adcf676f8c73b088e386044c79d43ae5d45a3"},"schema_version":"1.0"},"canonical_sha256":"811d1ae95868ca3e6b8c8a1ed976b336d8d75dcafa4d5506135933bd265bb3a6","source":{"kind":"arxiv","id":"1806.05347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05347","created_at":"2026-05-18T00:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05347v1","created_at":"2026-05-18T00:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05347","created_at":"2026-05-18T00:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"QEORV2KYNDFD","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QEORV2KYNDFD424M","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QEORV2KY","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QEORV2KYNDFD424MRIPNS5VTG3","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-14T03:09:59Z","cross_cats_sorted":[],"title_canon_sha256":"7ce994ad56b70de4bcd3f7991df811e1b203f16260209f35fd589eba2cba869f","abstract_canon_sha256":"3bcf3e11f787aad44b88a2611e1adcf676f8c73b088e386044c79d43ae5d45a3"},"schema_version":"1.0"},"canonical_sha256":"811d1ae95868ca3e6b8c8a1ed976b336d8d75dcafa4d5506135933bd265bb3a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:16.282656Z","signature_b64":"GYOaWjfoym0ELnrtbYiiU9YaYvYTRjbQGkzZlfeRvIQHUf/0cdbv0zPUcqrMRbPw6FnFU3SmsV49auVghnRCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"811d1ae95868ca3e6b8c8a1ed976b336d8d75dcafa4d5506135933bd265bb3a6","last_reissued_at":"2026-05-18T00:13:16.282052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:16.282052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05347","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-18T00:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BouIdQXN5CXFI66nGg+daBkzQclvovsRFhkMjOhhLDFXdHxk8XtbI8VPv2DrhjAu4lTO/bpZJXw7by7c7zk1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:04:58.045989Z"},"content_sha256":"d1724d8a14767e7890d8883f001085880653c299dbabbaea5661e2cd09f59e36","schema_version":"1.0","event_id":"sha256:d1724d8a14767e7890d8883f001085880653c299dbabbaea5661e2cd09f59e36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QEORV2KYNDFD424MRIPNS5VTG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cut-edges and regular factors in regular graphs of odd degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander V. Kostochka, Andr\\'e Raspaud, Bjarne Toft, Dara Zirlin, Douglas B. West","submitted_at":"2018-06-14T03:09:59Z","abstract_excerpt":"We study $2k$-factors in $(2r+1)$-regular graphs. Hanson, Loten, and Toft proved that every $(2r+1)$-regular graph with at most $2r$ cut-edges has a $2$-factor. We generalize their result by proving for $k\\le(2r+1)/3$ that every $(2r+1)$-regular graph with at most $2r-3(k-1)$ cut-edges has a $2k$-factor. Both the restriction on $k$ and the restriction on the number of cut-edges are sharp. We characterize the graphs that have exactly $2r-3(k-1)+1$ cut-edges but no $2k$-factor. For $k>(2r+1)/3$, there are graphs without cut-edges that have no $2k$-factor, as studied by Bollob\\'as, Saito, and Wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05347","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-18T00:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gbKmfyyj4t6IvusVcedHGbsXuAg7hebTcIp5zR9bqCdZRRmF3zaP6q2x+rq9nWy/ovMWoon8qF5KlpWLHRLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:04:58.046751Z"},"content_sha256":"1ae7088246f36170877fe5e49d2fa8d14c45f3129a71b1f057a9bbed071b2d6d","schema_version":"1.0","event_id":"sha256:1ae7088246f36170877fe5e49d2fa8d14c45f3129a71b1f057a9bbed071b2d6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/bundle.json","state_url":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEORV2KYNDFD424MRIPNS5VTG3/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-05-25T16:04:58Z","links":{"resolver":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3","bundle":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/bundle.json","state":"https://pith.science/pith/QEORV2KYNDFD424MRIPNS5VTG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEORV2KYNDFD424MRIPNS5VTG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QEORV2KYNDFD424MRIPNS5VTG3","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":"3bcf3e11f787aad44b88a2611e1adcf676f8c73b088e386044c79d43ae5d45a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-14T03:09:59Z","title_canon_sha256":"7ce994ad56b70de4bcd3f7991df811e1b203f16260209f35fd589eba2cba869f"},"schema_version":"1.0","source":{"id":"1806.05347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05347","created_at":"2026-05-18T00:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05347v1","created_at":"2026-05-18T00:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05347","created_at":"2026-05-18T00:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"QEORV2KYNDFD","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QEORV2KYNDFD424M","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QEORV2KY","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:1ae7088246f36170877fe5e49d2fa8d14c45f3129a71b1f057a9bbed071b2d6d","target":"graph","created_at":"2026-05-18T00:13:16Z","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":"We study $2k$-factors in $(2r+1)$-regular graphs. Hanson, Loten, and Toft proved that every $(2r+1)$-regular graph with at most $2r$ cut-edges has a $2$-factor. We generalize their result by proving for $k\\le(2r+1)/3$ that every $(2r+1)$-regular graph with at most $2r-3(k-1)$ cut-edges has a $2k$-factor. Both the restriction on $k$ and the restriction on the number of cut-edges are sharp. We characterize the graphs that have exactly $2r-3(k-1)+1$ cut-edges but no $2k$-factor. For $k>(2r+1)/3$, there are graphs without cut-edges that have no $2k$-factor, as studied by Bollob\\'as, Saito, and Wor","authors_text":"Alexander V. Kostochka, Andr\\'e Raspaud, Bjarne Toft, Dara Zirlin, Douglas B. West","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-14T03:09:59Z","title":"Cut-edges and regular factors in regular graphs of odd degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05347","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:d1724d8a14767e7890d8883f001085880653c299dbabbaea5661e2cd09f59e36","target":"record","created_at":"2026-05-18T00:13:16Z","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":"3bcf3e11f787aad44b88a2611e1adcf676f8c73b088e386044c79d43ae5d45a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-14T03:09:59Z","title_canon_sha256":"7ce994ad56b70de4bcd3f7991df811e1b203f16260209f35fd589eba2cba869f"},"schema_version":"1.0","source":{"id":"1806.05347","kind":"arxiv","version":1}},"canonical_sha256":"811d1ae95868ca3e6b8c8a1ed976b336d8d75dcafa4d5506135933bd265bb3a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"811d1ae95868ca3e6b8c8a1ed976b336d8d75dcafa4d5506135933bd265bb3a6","first_computed_at":"2026-05-18T00:13:16.282052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:16.282052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GYOaWjfoym0ELnrtbYiiU9YaYvYTRjbQGkzZlfeRvIQHUf/0cdbv0zPUcqrMRbPw6FnFU3SmsV49auVghnRCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:16.282656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1724d8a14767e7890d8883f001085880653c299dbabbaea5661e2cd09f59e36","sha256:1ae7088246f36170877fe5e49d2fa8d14c45f3129a71b1f057a9bbed071b2d6d"],"state_sha256":"99ca3d8336168783dee072a9f39ba38320711a55fa293d0e6a6871c8bb419a9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8w0cKSKuRgztvWdP4oQxP6KJkOnbSTgR9kj+h9Z+INcVWv+m3Fsgh0fjaxMl7a7LEnatG4h/dqoTZQnYU36Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:04:58.050784Z","bundle_sha256":"972d5473e90b942105f9687096eece8025eaa284ee60bf5808a01622446f2fc7"}}