{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NK5VLU5CFZULU3OJBPWE6646LU","short_pith_number":"pith:NK5VLU5C","schema_version":"1.0","canonical_sha256":"6abb55d3a22e68ba6dc90bec4f7b9e5d3bb98ca79d5a85184c06e38d934d9bd6","source":{"kind":"arxiv","id":"1211.5031","version":4},"attestation_state":"computed","paper":{"title":"Beyond the Vizing's bound for at most seven colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"{\\L}ukasz Kowalik, Marcin Kami\\'nski","submitted_at":"2012-11-21T13:52:26Z","abstract_excerpt":"Let $G=(V,E)$ be a simple graph of maximum degree $\\Delta$. The edges of $G$ can be colored with at most $\\Delta +1$ colors by Vizing's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\\Delta$ colors.\n  Vizing's Theorem gives a bound of $\\frac{\\Delta}{\\Delta+1}|E|$. This is known to be tight for cliques $K_{\\Delta+1}$ when $\\Delta$ is even. However, for $\\Delta=3$ it was improved to $26/31|E|$ by Albertson and Haas [Parsimonious edge colorings, Disc. Math. 148, 1996] and later to $6/7|E|$ by Rizzi [Approximating the maximum 3-edge-colorable subgraph prob"},"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":"1211.5031","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-21T13:52:26Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"9e3cc58d22496f942c8283690fa89b69aff452a1819e7d385c0000149df73748","abstract_canon_sha256":"1caa30ab1c1b4eeeaa7df613ce63fd8c4a847e14b14ba0e18044c174367ba8af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:33.838604Z","signature_b64":"Bd52d7s9MCY3cdOYCL/2G0GmZfoxAw3wChBGI7gA9Q9p65wN9kIZnL2xh6TQ4In/73bdd11nlMsFCT/wNdE/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6abb55d3a22e68ba6dc90bec4f7b9e5d3bb98ca79d5a85184c06e38d934d9bd6","last_reissued_at":"2026-05-18T02:57:33.838143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:33.838143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond the Vizing's bound for at most seven colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"{\\L}ukasz Kowalik, Marcin Kami\\'nski","submitted_at":"2012-11-21T13:52:26Z","abstract_excerpt":"Let $G=(V,E)$ be a simple graph of maximum degree $\\Delta$. The edges of $G$ can be colored with at most $\\Delta +1$ colors by Vizing's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\\Delta$ colors.\n  Vizing's Theorem gives a bound of $\\frac{\\Delta}{\\Delta+1}|E|$. This is known to be tight for cliques $K_{\\Delta+1}$ when $\\Delta$ is even. However, for $\\Delta=3$ it was improved to $26/31|E|$ by Albertson and Haas [Parsimonious edge colorings, Disc. Math. 148, 1996] and later to $6/7|E|$ by Rizzi [Approximating the maximum 3-edge-colorable subgraph prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5031","kind":"arxiv","version":4},"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":"1211.5031","created_at":"2026-05-18T02:57:33.838211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5031v4","created_at":"2026-05-18T02:57:33.838211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5031","created_at":"2026-05-18T02:57:33.838211+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK5VLU5CFZUL","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK5VLU5CFZULU3OJ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK5VLU5C","created_at":"2026-05-18T12:27:16.716162+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/NK5VLU5CFZULU3OJBPWE6646LU","json":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU.json","graph_json":"https://pith.science/api/pith-number/NK5VLU5CFZULU3OJBPWE6646LU/graph.json","events_json":"https://pith.science/api/pith-number/NK5VLU5CFZULU3OJBPWE6646LU/events.json","paper":"https://pith.science/paper/NK5VLU5C"},"agent_actions":{"view_html":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU","download_json":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU.json","view_paper":"https://pith.science/paper/NK5VLU5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5031&json=true","fetch_graph":"https://pith.science/api/pith-number/NK5VLU5CFZULU3OJBPWE6646LU/graph.json","fetch_events":"https://pith.science/api/pith-number/NK5VLU5CFZULU3OJBPWE6646LU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/action/storage_attestation","attest_author":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/action/author_attestation","sign_citation":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/action/citation_signature","submit_replication":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/action/replication_record"}},"created_at":"2026-05-18T02:57:33.838211+00:00","updated_at":"2026-05-18T02:57:33.838211+00:00"}