{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RFWF6DQAFGRCHWYNZD27U4DPZX","short_pith_number":"pith:RFWF6DQA","schema_version":"1.0","canonical_sha256":"896c5f0e0029a223db0dc8f5fa706fcde949fe1e6a837b6827e57564865627d2","source":{"kind":"arxiv","id":"1709.02241","version":1},"attestation_state":"computed","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-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.02241","created_at":"2026-05-18T00:35:49.751911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02241v1","created_at":"2026-05-18T00:35:49.751911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02241","created_at":"2026-05-18T00:35:49.751911+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFWF6DQAFGRC","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFWF6DQAFGRCHWYN","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFWF6DQA","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX","json":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX.json","graph_json":"https://pith.science/api/pith-number/RFWF6DQAFGRCHWYNZD27U4DPZX/graph.json","events_json":"https://pith.science/api/pith-number/RFWF6DQAFGRCHWYNZD27U4DPZX/events.json","paper":"https://pith.science/paper/RFWF6DQA"},"agent_actions":{"view_html":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX","download_json":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX.json","view_paper":"https://pith.science/paper/RFWF6DQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02241&json=true","fetch_graph":"https://pith.science/api/pith-number/RFWF6DQAFGRCHWYNZD27U4DPZX/graph.json","fetch_events":"https://pith.science/api/pith-number/RFWF6DQAFGRCHWYNZD27U4DPZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/action/storage_attestation","attest_author":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/action/author_attestation","sign_citation":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/action/citation_signature","submit_replication":"https://pith.science/pith/RFWF6DQAFGRCHWYNZD27U4DPZX/action/replication_record"}},"created_at":"2026-05-18T00:35:49.751911+00:00","updated_at":"2026-05-18T00:35:49.751911+00:00"}