{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OML5FZ3JTCBWN4R7PL736UHJI7","short_pith_number":"pith:OML5FZ3J","schema_version":"1.0","canonical_sha256":"7317d2e769988366f23f7affbf50e947f4cbef6b1767e227ac3c13f46fb3da3f","source":{"kind":"arxiv","id":"2303.09365","version":2},"attestation_state":"computed","paper":{"title":"Kempe Classes and Almost Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Daniel W. Cranston","submitted_at":"2023-03-16T14:50:48Z","abstract_excerpt":"Let $G$ be a graph and $k$ be a positive integer, and let $Kc(G, k)$ denote the number of Kempe equivalence classes for the $k$-colorings of $G$. In 2006, Mohar noted that $Kc(G, k) = 1$ if $G$ is bipartite. As a generalization, we show that $Kc(G, k) = 1$ if $G$ is formed from a bipartite graph by adding any number of edges less than $\\binom{\\lceil k/2\\rceil}2+\\binom{\\lfloor k/2\\rfloor}2$. We show that our result is tight (up to lower order terms) by constructing, for each $k \\geq 8$, a graph $G$ formed from a bipartite graph by adding $(k^2+8k-45+1)/4$ edges such that $Kc(G, k) \\geq 2$. This"},"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":"2303.09365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-16T14:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"925f83f50355032d7123c54a120a530387caab2a919c823fd31b6e9f9649c35f","abstract_canon_sha256":"181862ac61f95e29dcb189e72d5d22626bd198e8bb0caa8f79b4b20450d1610d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:32.192668Z","signature_b64":"jHFtofIw8HQts/lMK5807rXIZxDevkt9f8Tu6FcABsmm6uMWrPAPr2dSeNwO5PQYxZoQb5o2a+n7VlumBKq1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7317d2e769988366f23f7affbf50e947f4cbef6b1767e227ac3c13f46fb3da3f","last_reissued_at":"2026-07-05T09:44:32.192187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:32.192187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kempe Classes and Almost Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali, Daniel W. Cranston","submitted_at":"2023-03-16T14:50:48Z","abstract_excerpt":"Let $G$ be a graph and $k$ be a positive integer, and let $Kc(G, k)$ denote the number of Kempe equivalence classes for the $k$-colorings of $G$. In 2006, Mohar noted that $Kc(G, k) = 1$ if $G$ is bipartite. As a generalization, we show that $Kc(G, k) = 1$ if $G$ is formed from a bipartite graph by adding any number of edges less than $\\binom{\\lceil k/2\\rceil}2+\\binom{\\lfloor k/2\\rfloor}2$. We show that our result is tight (up to lower order terms) by constructing, for each $k \\geq 8$, a graph $G$ formed from a bipartite graph by adding $(k^2+8k-45+1)/4$ edges such that $Kc(G, k) \\geq 2$. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.09365","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.09365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.09365","created_at":"2026-07-05T09:44:32.192245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.09365v2","created_at":"2026-07-05T09:44:32.192245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09365","created_at":"2026-07-05T09:44:32.192245+00:00"},{"alias_kind":"pith_short_12","alias_value":"OML5FZ3JTCBW","created_at":"2026-07-05T09:44:32.192245+00:00"},{"alias_kind":"pith_short_16","alias_value":"OML5FZ3JTCBWN4R7","created_at":"2026-07-05T09:44:32.192245+00:00"},{"alias_kind":"pith_short_8","alias_value":"OML5FZ3J","created_at":"2026-07-05T09:44:32.192245+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/OML5FZ3JTCBWN4R7PL736UHJI7","json":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7.json","graph_json":"https://pith.science/api/pith-number/OML5FZ3JTCBWN4R7PL736UHJI7/graph.json","events_json":"https://pith.science/api/pith-number/OML5FZ3JTCBWN4R7PL736UHJI7/events.json","paper":"https://pith.science/paper/OML5FZ3J"},"agent_actions":{"view_html":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7","download_json":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7.json","view_paper":"https://pith.science/paper/OML5FZ3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.09365&json=true","fetch_graph":"https://pith.science/api/pith-number/OML5FZ3JTCBWN4R7PL736UHJI7/graph.json","fetch_events":"https://pith.science/api/pith-number/OML5FZ3JTCBWN4R7PL736UHJI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/action/storage_attestation","attest_author":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/action/author_attestation","sign_citation":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/action/citation_signature","submit_replication":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/action/replication_record"}},"created_at":"2026-07-05T09:44:32.192245+00:00","updated_at":"2026-07-05T09:44:32.192245+00:00"}