{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OML5FZ3JTCBWN4R7PL736UHJI7","short_pith_number":"pith:OML5FZ3J","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"},"canonical_sha256":"7317d2e769988366f23f7affbf50e947f4cbef6b1767e227ac3c13f46fb3da3f","source":{"kind":"arxiv","id":"2303.09365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.09365","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"arxiv_version","alias_value":"2303.09365v2","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09365","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"pith_short_12","alias_value":"OML5FZ3JTCBW","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"pith_short_16","alias_value":"OML5FZ3JTCBWN4R7","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"pith_short_8","alias_value":"OML5FZ3J","created_at":"2026-07-05T09:44:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OML5FZ3JTCBWN4R7PL736UHJI7","target":"record","payload":{"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"},"canonical_sha256":"7317d2e769988366f23f7affbf50e947f4cbef6b1767e227ac3c13f46fb3da3f","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"},"source_kind":"arxiv","source_id":"2303.09365","source_version":2,"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-07-05T09:44:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFpAkQcfyq09hrw+52sW4LARH604MkjOE9TLm6NXYUszYdAhJNatsop/0Dd+IZpcsb84wXKOlyIVUS7L3/CjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:05:37.861923Z"},"content_sha256":"946d67ace2c4603cec68d37a35a47a51278afad1a2606fda1b139a74150d5ae0","schema_version":"1.0","event_id":"sha256:946d67ace2c4603cec68d37a35a47a51278afad1a2606fda1b139a74150d5ae0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OML5FZ3JTCBWN4R7PL736UHJI7","target":"graph","payload":{"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"},"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-07-05T09:44:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hETmV5lNw6ycbNJK3vUDxQV7xS6YYckFyvghxDSVQ8ykiPlVsV6a4YC3mJJcFR+remlXn60TFL9FSiq/rGbhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:05:37.862838Z"},"content_sha256":"eb5bfc26b9f808c6343686b532124830fdf73792e939c0ce0713dab050d7cbe0","schema_version":"1.0","event_id":"sha256:eb5bfc26b9f808c6343686b532124830fdf73792e939c0ce0713dab050d7cbe0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/bundle.json","state_url":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OML5FZ3JTCBWN4R7PL736UHJI7/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-08-11T01:05:37Z","links":{"resolver":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7","bundle":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/bundle.json","state":"https://pith.science/pith/OML5FZ3JTCBWN4R7PL736UHJI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OML5FZ3JTCBWN4R7PL736UHJI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OML5FZ3JTCBWN4R7PL736UHJI7","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":"181862ac61f95e29dcb189e72d5d22626bd198e8bb0caa8f79b4b20450d1610d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-16T14:50:48Z","title_canon_sha256":"925f83f50355032d7123c54a120a530387caab2a919c823fd31b6e9f9649c35f"},"schema_version":"1.0","source":{"id":"2303.09365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.09365","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"arxiv_version","alias_value":"2303.09365v2","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09365","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"pith_short_12","alias_value":"OML5FZ3JTCBW","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"pith_short_16","alias_value":"OML5FZ3JTCBWN4R7","created_at":"2026-07-05T09:44:32Z"},{"alias_kind":"pith_short_8","alias_value":"OML5FZ3J","created_at":"2026-07-05T09:44:32Z"}],"graph_snapshots":[{"event_id":"sha256:eb5bfc26b9f808c6343686b532124830fdf73792e939c0ce0713dab050d7cbe0","target":"graph","created_at":"2026-07-05T09:44:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.09365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Carl Feghali, Daniel W. Cranston","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-16T14:50:48Z","title":"Kempe Classes and Almost Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.09365","kind":"arxiv","version":2},"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:946d67ace2c4603cec68d37a35a47a51278afad1a2606fda1b139a74150d5ae0","target":"record","created_at":"2026-07-05T09:44:32Z","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":"181862ac61f95e29dcb189e72d5d22626bd198e8bb0caa8f79b4b20450d1610d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-16T14:50:48Z","title_canon_sha256":"925f83f50355032d7123c54a120a530387caab2a919c823fd31b6e9f9649c35f"},"schema_version":"1.0","source":{"id":"2303.09365","kind":"arxiv","version":2}},"canonical_sha256":"7317d2e769988366f23f7affbf50e947f4cbef6b1767e227ac3c13f46fb3da3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7317d2e769988366f23f7affbf50e947f4cbef6b1767e227ac3c13f46fb3da3f","first_computed_at":"2026-07-05T09:44:32.192187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:44:32.192187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jHFtofIw8HQts/lMK5807rXIZxDevkt9f8Tu6FcABsmm6uMWrPAPr2dSeNwO5PQYxZoQb5o2a+n7VlumBKq1Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:44:32.192668Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.09365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:946d67ace2c4603cec68d37a35a47a51278afad1a2606fda1b139a74150d5ae0","sha256:eb5bfc26b9f808c6343686b532124830fdf73792e939c0ce0713dab050d7cbe0"],"state_sha256":"575e900dfcd0a41e0628b5999032da56ab29ce9cbb2027a9d7b250ba66b841e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjSDHz4YoWDGPtH6V9QnR8gxMGhgianuU34JGHWOGW3jYpexzdeKRxERNrxoWYg95/pICo8aqP3BlzGg/NaoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:05:37.866554Z","bundle_sha256":"8a2556de213598b7795e02a828448934208f313e15422557aa8d0312e0c34850"}}