{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W7BG5ZFWXDIRXRUHIOTO5ZJIEG","short_pith_number":"pith:W7BG5ZFW","canonical_record":{"source":{"id":"1404.6299","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T01:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"8df24d666f7dc897b410cc6abddfd72d4d61d2c894f8884409a518c9350ef35a","abstract_canon_sha256":"38891820071926d359d20c92f102da13343a57ef408be064c39cf779ee970a22"},"schema_version":"1.0"},"canonical_sha256":"b7c26ee4b6b8d11bc68743a6eee528218db3ba64e77fc3abe9398dcd190b143f","source":{"kind":"arxiv","id":"1404.6299","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6299","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6299v2","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6299","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"W7BG5ZFWXDIR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W7BG5ZFWXDIRXRUH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W7BG5ZFW","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W7BG5ZFWXDIRXRUHIOTO5ZJIEG","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6299","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T01:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"8df24d666f7dc897b410cc6abddfd72d4d61d2c894f8884409a518c9350ef35a","abstract_canon_sha256":"38891820071926d359d20c92f102da13343a57ef408be064c39cf779ee970a22"},"schema_version":"1.0"},"canonical_sha256":"b7c26ee4b6b8d11bc68743a6eee528218db3ba64e77fc3abe9398dcd190b143f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:18.605473Z","signature_b64":"DSEtdl8iuX29BIdAmdEdPiT6YzIr5uWktAQf/+EmVc0KhDPC4cHF2znsZ0bGJ/g8/TlcETVQqDhUS3PV6DUNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7c26ee4b6b8d11bc68743a6eee528218db3ba64e77fc3abe9398dcd190b143f","last_reissued_at":"2026-05-18T02:41:18.605010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:18.605010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6299","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-05-18T02:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ExBoADR9NHNbC/5Uvdir0tNm77Tdl9hYE9V+06NifNKAc1DqsLQqux6nec8UYNKJwW6r4j4zcD94eVC9qwgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:08:47.602514Z"},"content_sha256":"1325e50a570e962a5f93182a7bc730a10260ce12403a150e6893bd73e5574249","schema_version":"1.0","event_id":"sha256:1325e50a570e962a5f93182a7bc730a10260ce12403a150e6893bd73e5574249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W7BG5ZFWXDIRXRUHIOTO5ZJIEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vizing's 2-factor Conjecture Involving Large Maximum Degree","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Songling Shan","submitted_at":"2014-04-25T01:16:51Z","abstract_excerpt":"Let $G$ be a connected simple graph of order $n$ and let $\\Delta(G)$ and $\\chi'(G)$ denote the maximum degree and chromatic index of $G$, respectively. Vizing proved that $\\chi'(G)=\\Delta(G)$ or $\\Delta(G)+1$. Following this result, $G$ is called $\\Delta$-critical if $\\chi'(G)=\\Delta(G)+1$ and $\\chi'(G-e)=\\Delta(G)$ for every $e\\in E(G)$. In 1968, Vizing conjectured that if $G$ is an $n$-vertex $\\Delta$-critical graph, then the independence number $\\alpha(G)\\le n/2$. Furthermore, he conjectured that, in fact, $G$ has a 2-factor. Luo and Zhao showed that if $G$ is an $n$-vertex $\\Delta$-critica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6299","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":""},"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-18T02:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpGLOaiVOMFbD32WdhRewa6OFTuARHz9Lu/pt8rgOdy/HOrco11oGq9PXRcGn8XO8zp0rPOlsg6os/SRj2soAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:08:47.603181Z"},"content_sha256":"220511a5c50d7fafcaf94ce5b72c66ab5605a4c13d1b95074498865b4161e570","schema_version":"1.0","event_id":"sha256:220511a5c50d7fafcaf94ce5b72c66ab5605a4c13d1b95074498865b4161e570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7BG5ZFWXDIRXRUHIOTO5ZJIEG/bundle.json","state_url":"https://pith.science/pith/W7BG5ZFWXDIRXRUHIOTO5ZJIEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7BG5ZFWXDIRXRUHIOTO5ZJIEG/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-29T19:08:47Z","links":{"resolver":"https://pith.science/pith/W7BG5ZFWXDIRXRUHIOTO5ZJIEG","bundle":"https://pith.science/pith/W7BG5ZFWXDIRXRUHIOTO5ZJIEG/bundle.json","state":"https://pith.science/pith/W7BG5ZFWXDIRXRUHIOTO5ZJIEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7BG5ZFWXDIRXRUHIOTO5ZJIEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W7BG5ZFWXDIRXRUHIOTO5ZJIEG","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":"38891820071926d359d20c92f102da13343a57ef408be064c39cf779ee970a22","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T01:16:51Z","title_canon_sha256":"8df24d666f7dc897b410cc6abddfd72d4d61d2c894f8884409a518c9350ef35a"},"schema_version":"1.0","source":{"id":"1404.6299","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6299","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6299v2","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6299","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"W7BG5ZFWXDIR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W7BG5ZFWXDIRXRUH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W7BG5ZFW","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:220511a5c50d7fafcaf94ce5b72c66ab5605a4c13d1b95074498865b4161e570","target":"graph","created_at":"2026-05-18T02:41:18Z","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":"Let $G$ be a connected simple graph of order $n$ and let $\\Delta(G)$ and $\\chi'(G)$ denote the maximum degree and chromatic index of $G$, respectively. Vizing proved that $\\chi'(G)=\\Delta(G)$ or $\\Delta(G)+1$. Following this result, $G$ is called $\\Delta$-critical if $\\chi'(G)=\\Delta(G)+1$ and $\\chi'(G-e)=\\Delta(G)$ for every $e\\in E(G)$. In 1968, Vizing conjectured that if $G$ is an $n$-vertex $\\Delta$-critical graph, then the independence number $\\alpha(G)\\le n/2$. Furthermore, he conjectured that, in fact, $G$ has a 2-factor. Luo and Zhao showed that if $G$ is an $n$-vertex $\\Delta$-critica","authors_text":"Guantao Chen, Songling Shan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T01:16:51Z","title":"Vizing's 2-factor Conjecture Involving Large Maximum Degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6299","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:1325e50a570e962a5f93182a7bc730a10260ce12403a150e6893bd73e5574249","target":"record","created_at":"2026-05-18T02:41:18Z","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":"38891820071926d359d20c92f102da13343a57ef408be064c39cf779ee970a22","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T01:16:51Z","title_canon_sha256":"8df24d666f7dc897b410cc6abddfd72d4d61d2c894f8884409a518c9350ef35a"},"schema_version":"1.0","source":{"id":"1404.6299","kind":"arxiv","version":2}},"canonical_sha256":"b7c26ee4b6b8d11bc68743a6eee528218db3ba64e77fc3abe9398dcd190b143f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7c26ee4b6b8d11bc68743a6eee528218db3ba64e77fc3abe9398dcd190b143f","first_computed_at":"2026-05-18T02:41:18.605010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:18.605010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DSEtdl8iuX29BIdAmdEdPiT6YzIr5uWktAQf/+EmVc0KhDPC4cHF2znsZ0bGJ/g8/TlcETVQqDhUS3PV6DUNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:18.605473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6299","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1325e50a570e962a5f93182a7bc730a10260ce12403a150e6893bd73e5574249","sha256:220511a5c50d7fafcaf94ce5b72c66ab5605a4c13d1b95074498865b4161e570"],"state_sha256":"178b73e5bed7feac3f7b5b4f1f92d74def5d8d0a3cf08cfa7aa5553490e0627a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"je2wtg1ialRcmNB5xdnj0mu0334SH/8GeiuP4siObMb1bFTR3IYJDIkh9O7IDkHwBO0kqqX8Hk15ZwvLtS63Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:08:47.606574Z","bundle_sha256":"fc654ddc74ec494d964adb4bd1235611a7c410e434557f3a64e0f1921371d0df"}}