{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FLE2Q64LISCASBZUZHNYYPNZTZ","short_pith_number":"pith:FLE2Q64L","schema_version":"1.0","canonical_sha256":"2ac9a87b8b4484090734c9db8c3db99e4a2972a80103471b740f505a4734248b","source":{"kind":"arxiv","id":"1510.07017","version":4},"attestation_state":"computed","paper":{"title":"Maximal $k$-Edge-Colorable Subgraphs, Vizing's Theorem, and Tuza's Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2015-10-23T19:08:08Z","abstract_excerpt":"We prove that if $M$ is a maximal $k$-edge-colorable subgraph of a multigraph $G$ and if $F = \\{v \\in V(G) : d_M(v) \\leq k-\\mu(v)\\}$, then $d_F(v) \\leq d_M(v)$ for all $v \\in F$. (When $G$ is a simple graph, the set $F$ is just the set of vertices having degree less than $k$ in $M$.) This implies Vizing's Theorem as well as a special case of Tuza's Conjecture on packing and covering of triangles. A more detailed version of our result also implies Vizing's Adjacency Lemma for simple graphs."},"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":"1510.07017","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-23T19:08:08Z","cross_cats_sorted":[],"title_canon_sha256":"93134465003cd0dbdff9b3515641e5936c830cc21c00973e3d24b10f93b8580b","abstract_canon_sha256":"1d117bc56362e7163138ebd5373c16309a0ffae470ab5b8fccf130f38bfd5284"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.264629Z","signature_b64":"SqyF6E30o2Tnc4qynLwOYmreTGTs2C1ts3CpebHxuZALA/MkB6E/iAsmZ1FtBbgXs2wxPsnPUvI2lalycpR1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ac9a87b8b4484090734c9db8c3db99e4a2972a80103471b740f505a4734248b","last_reissued_at":"2026-05-18T00:44:37.264084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.264084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal $k$-Edge-Colorable Subgraphs, Vizing's Theorem, and Tuza's Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo","submitted_at":"2015-10-23T19:08:08Z","abstract_excerpt":"We prove that if $M$ is a maximal $k$-edge-colorable subgraph of a multigraph $G$ and if $F = \\{v \\in V(G) : d_M(v) \\leq k-\\mu(v)\\}$, then $d_F(v) \\leq d_M(v)$ for all $v \\in F$. (When $G$ is a simple graph, the set $F$ is just the set of vertices having degree less than $k$ in $M$.) This implies Vizing's Theorem as well as a special case of Tuza's Conjecture on packing and covering of triangles. A more detailed version of our result also implies Vizing's Adjacency Lemma for simple graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07017","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":"1510.07017","created_at":"2026-05-18T00:44:37.264180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07017v4","created_at":"2026-05-18T00:44:37.264180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07017","created_at":"2026-05-18T00:44:37.264180+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLE2Q64LISCA","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLE2Q64LISCASBZU","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLE2Q64L","created_at":"2026-05-18T12:29:19.899920+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/FLE2Q64LISCASBZUZHNYYPNZTZ","json":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ.json","graph_json":"https://pith.science/api/pith-number/FLE2Q64LISCASBZUZHNYYPNZTZ/graph.json","events_json":"https://pith.science/api/pith-number/FLE2Q64LISCASBZUZHNYYPNZTZ/events.json","paper":"https://pith.science/paper/FLE2Q64L"},"agent_actions":{"view_html":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ","download_json":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ.json","view_paper":"https://pith.science/paper/FLE2Q64L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07017&json=true","fetch_graph":"https://pith.science/api/pith-number/FLE2Q64LISCASBZUZHNYYPNZTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FLE2Q64LISCASBZUZHNYYPNZTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ/action/storage_attestation","attest_author":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ/action/author_attestation","sign_citation":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ/action/citation_signature","submit_replication":"https://pith.science/pith/FLE2Q64LISCASBZUZHNYYPNZTZ/action/replication_record"}},"created_at":"2026-05-18T00:44:37.264180+00:00","updated_at":"2026-05-18T00:44:37.264180+00:00"}