{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RFWF6DQAFGRCHWYNZD27U4DPZX","short_pith_number":"pith:RFWF6DQA","canonical_record":{"source":{"id":"1709.02241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T19:21:00Z","cross_cats_sorted":[],"title_canon_sha256":"b20972a346b200d00003ea09f77c8bdabb15afc99bca5601215feab58810b7fc","abstract_canon_sha256":"82f959decd754044d4e380b5e4e826d5465e3235895b65f323990d704ff705a1"},"schema_version":"1.0"},"canonical_sha256":"896c5f0e0029a223db0dc8f5fa706fcde949fe1e6a837b6827e57564865627d2","source":{"kind":"arxiv","id":"1709.02241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02241","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02241v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02241","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"RFWF6DQAFGRC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFWF6DQAFGRCHWYN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFWF6DQA","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RFWF6DQAFGRCHWYNZD27U4DPZX","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T19:21:00Z","cross_cats_sorted":[],"title_canon_sha256":"b20972a346b200d00003ea09f77c8bdabb15afc99bca5601215feab58810b7fc","abstract_canon_sha256":"82f959decd754044d4e380b5e4e826d5465e3235895b65f323990d704ff705a1"},"schema_version":"1.0"},"canonical_sha256":"896c5f0e0029a223db0dc8f5fa706fcde949fe1e6a837b6827e57564865627d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:49.752536Z","signature_b64":"p4ODyB14L2BHK5huzkJDBjEU+oRPVGiybuk84XafI0w48tORUlnF66GVZHuLi5Pl5CkE6w+mjNRlkLYEYjjQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"896c5f0e0029a223db0dc8f5fa706fcde949fe1e6a837b6827e57564865627d2","last_reissued_at":"2026-05-18T00:35:49.751789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:49.751789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02241","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:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYwutOjGog6h+C0ofC9eyEqzbjhkfVkg26pH3/J5MH0CPybO3P4G8rVHM/RV6tHRMQa1t1DxS++3nrCI1+uABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:17:03.750441Z"},"content_sha256":"5a63e4c9e73bcc23786d971a8272d652dbd15866af3ccdd454397fe4ec4a0db1","schema_version":"1.0","event_id":"sha256:5a63e4c9e73bcc23786d971a8272d652dbd15866af3ccdd454397fe4ec4a0db1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RFWF6DQAFGRCHWYNZD27U4DPZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vizing's 2-factor Conjecture Involving Toughness and Maximum Degree Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jinko Kanno, Songling Shan","submitted_at":"2017-09-05T19:21:00Z","abstract_excerpt":"Let $G$ be a simple graph, 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$. We say $G$ is $\\Delta$-critical if $\\chi'(G)=\\Delta+1$ and $\\chi'(H)<\\chi'(G)$ for every proper subgraph $H$ of $G$. In 1968, Vizing conjectured that if $G$ is a $\\Delta$-critical graph, then $G$ has a 2-factor. Let $G$ be an $n$-vertex $\\Delta$-critical graph. It was proved that if $\\Delta(G)\\ge n/2$, then $G$ has a 2-factor; and that if $\\Delta(G)\\ge 2n/3+12$, then $G$ has a hamiltonian cycle, and thus a 2-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02241","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:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdVu4OyO6xaBEnjOix5/zJN95FAlBp9C2IBj9sKcN1Bkz3HQnGIErbySpksIMP5895e04uv18LIcrQQdfBGeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:17:03.750783Z"},"content_sha256":"5896e6235f28a24f3477a129d8d0578955df67f1e16dfc1c328de5564e4caefe","schema_version":"1.0","event_id":"sha256:5896e6235f28a24f3477a129d8d0578955df67f1e16dfc1c328de5564e4caefe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/bundle.json","state_url":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/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-29T08:17:03Z","links":{"resolver":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX","bundle":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/bundle.json","state":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RFWF6DQAFGRCHWYNZD27U4DPZX","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":"82f959decd754044d4e380b5e4e826d5465e3235895b65f323990d704ff705a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T19:21:00Z","title_canon_sha256":"b20972a346b200d00003ea09f77c8bdabb15afc99bca5601215feab58810b7fc"},"schema_version":"1.0","source":{"id":"1709.02241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02241","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02241v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02241","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"RFWF6DQAFGRC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFWF6DQAFGRCHWYN","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFWF6DQA","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:5896e6235f28a24f3477a129d8d0578955df67f1e16dfc1c328de5564e4caefe","target":"graph","created_at":"2026-05-18T00:35:49Z","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 simple graph, 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$. We say $G$ is $\\Delta$-critical if $\\chi'(G)=\\Delta+1$ and $\\chi'(H)<\\chi'(G)$ for every proper subgraph $H$ of $G$. In 1968, Vizing conjectured that if $G$ is a $\\Delta$-critical graph, then $G$ has a 2-factor. Let $G$ be an $n$-vertex $\\Delta$-critical graph. It was proved that if $\\Delta(G)\\ge n/2$, then $G$ has a 2-factor; and that if $\\Delta(G)\\ge 2n/3+12$, then $G$ has a hamiltonian cycle, and thus a 2-","authors_text":"Jinko Kanno, Songling Shan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T19:21:00Z","title":"Vizing's 2-factor Conjecture Involving Toughness and Maximum Degree Conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02241","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:5a63e4c9e73bcc23786d971a8272d652dbd15866af3ccdd454397fe4ec4a0db1","target":"record","created_at":"2026-05-18T00:35:49Z","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":"82f959decd754044d4e380b5e4e826d5465e3235895b65f323990d704ff705a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T19:21:00Z","title_canon_sha256":"b20972a346b200d00003ea09f77c8bdabb15afc99bca5601215feab58810b7fc"},"schema_version":"1.0","source":{"id":"1709.02241","kind":"arxiv","version":1}},"canonical_sha256":"896c5f0e0029a223db0dc8f5fa706fcde949fe1e6a837b6827e57564865627d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"896c5f0e0029a223db0dc8f5fa706fcde949fe1e6a837b6827e57564865627d2","first_computed_at":"2026-05-18T00:35:49.751789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:49.751789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p4ODyB14L2BHK5huzkJDBjEU+oRPVGiybuk84XafI0w48tORUlnF66GVZHuLi5Pl5CkE6w+mjNRlkLYEYjjQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:49.752536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a63e4c9e73bcc23786d971a8272d652dbd15866af3ccdd454397fe4ec4a0db1","sha256:5896e6235f28a24f3477a129d8d0578955df67f1e16dfc1c328de5564e4caefe"],"state_sha256":"915287b3130c8dcfe427d4f8f64d3b9e438dd0c403c734b7fa8acc15560f630b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Geoz1BS6DOS5eWtcpQc3QGn/Irm7hYS8JMr7m9dp2u+6ByWyTb4j2hwPT/IuTtEQbHFK+Mxlsfuu4GMj1uKpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:17:03.752632Z","bundle_sha256":"065fb8db48cd2f5523b00cc46f349633601cdf9031e6b82fae5a1642ec5b1164"}}