{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NK5VLU5CFZULU3OJBPWE6646LU","short_pith_number":"pith:NK5VLU5C","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"},"canonical_sha256":"6abb55d3a22e68ba6dc90bec4f7b9e5d3bb98ca79d5a85184c06e38d934d9bd6","source":{"kind":"arxiv","id":"1211.5031","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NK5VLU5CFZULU3OJBPWE6646LU","target":"record","payload":{"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"},"canonical_sha256":"6abb55d3a22e68ba6dc90bec4f7b9e5d3bb98ca79d5a85184c06e38d934d9bd6","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"},"source_kind":"arxiv","source_id":"1211.5031","source_version":4,"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:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kAhccN2cBIMna9dD5yP+lRGhEHe9WgT/TAwFb602DGy/pz8jJP4rRXhNP8u4t9CSsTVDieZQydDqeS6wS1mDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:44:29.223329Z"},"content_sha256":"0e5daefad970d93409a030b197dcca57550914ff438733d88ee073d2e2f5bb63","schema_version":"1.0","event_id":"sha256:0e5daefad970d93409a030b197dcca57550914ff438733d88ee073d2e2f5bb63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NK5VLU5CFZULU3OJBPWE6646LU","target":"graph","payload":{"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"},"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:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ks5tkgUo40RecT9krA8ghw1FyboB23+ylAKaD9RxTTBg1W0j6xXPr4/Oy7RC6tcTRf3SeZwKWvYpNvZumEcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:44:29.223932Z"},"content_sha256":"e9dd74176e0ac41feeaf957453a546cd2bd128a4dacf11ffdc35f03ea106f0c5","schema_version":"1.0","event_id":"sha256:e9dd74176e0ac41feeaf957453a546cd2bd128a4dacf11ffdc35f03ea106f0c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/bundle.json","state_url":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NK5VLU5CFZULU3OJBPWE6646LU/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-05T02:44:29Z","links":{"resolver":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU","bundle":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/bundle.json","state":"https://pith.science/pith/NK5VLU5CFZULU3OJBPWE6646LU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NK5VLU5CFZULU3OJBPWE6646LU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vD7/xt7HGk9mlluIJ5vT7+ywo9gBuaU6BI6Bbi+elGwKoD/69kREBrfSqjJfTA8x45AWWM7aqY0ttOtad+GOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:44:29.227086Z","bundle_sha256":"dc2133180409d1eb1701f24909e6d3d24417abec627c61adce284d7cb3c0e36f"}}