{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NK5VLU5CFZULU3OJBPWE6646LU","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":"1caa30ab1c1b4eeeaa7df613ce63fd8c4a847e14b14ba0e18044c174367ba8af","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-21T13:52:26Z","title_canon_sha256":"9e3cc58d22496f942c8283690fa89b69aff452a1819e7d385c0000149df73748"},"schema_version":"1.0","source":{"id":"1211.5031","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5031","created_at":"2026-05-18T02:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5031v4","created_at":"2026-05-18T02:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5031","created_at":"2026-05-18T02:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"NK5VLU5CFZUL","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NK5VLU5CFZULU3OJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NK5VLU5C","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:e9dd74176e0ac41feeaf957453a546cd2bd128a4dacf11ffdc35f03ea106f0c5","target":"graph","created_at":"2026-05-18T02:57:33Z","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=(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","authors_text":"{\\L}ukasz Kowalik, Marcin Kami\\'nski","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-21T13:52:26Z","title":"Beyond the Vizing's bound for at most seven colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5031","kind":"arxiv","version":4},"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:0e5daefad970d93409a030b197dcca57550914ff438733d88ee073d2e2f5bb63","target":"record","created_at":"2026-05-18T02:57:33Z","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":"1caa30ab1c1b4eeeaa7df613ce63fd8c4a847e14b14ba0e18044c174367ba8af","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-21T13:52:26Z","title_canon_sha256":"9e3cc58d22496f942c8283690fa89b69aff452a1819e7d385c0000149df73748"},"schema_version":"1.0","source":{"id":"1211.5031","kind":"arxiv","version":4}},"canonical_sha256":"6abb55d3a22e68ba6dc90bec4f7b9e5d3bb98ca79d5a85184c06e38d934d9bd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6abb55d3a22e68ba6dc90bec4f7b9e5d3bb98ca79d5a85184c06e38d934d9bd6","first_computed_at":"2026-05-18T02:57:33.838143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:33.838143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bd52d7s9MCY3cdOYCL/2G0GmZfoxAw3wChBGI7gA9Q9p65wN9kIZnL2xh6TQ4In/73bdd11nlMsFCT/wNdE/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:33.838604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5031","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e5daefad970d93409a030b197dcca57550914ff438733d88ee073d2e2f5bb63","sha256:e9dd74176e0ac41feeaf957453a546cd2bd128a4dacf11ffdc35f03ea106f0c5"],"state_sha256":"d48e042cb81cdd2052767764988b51c7e457f4e7a5b771c93a64b70f6390b13b"}