{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FHX2632ZGWBJZSE563WVCNE3MP","short_pith_number":"pith:FHX2632Z","schema_version":"1.0","canonical_sha256":"29efaf6f5935829cc89df6ed51349b63d2076bcc4f23a9ca0beae9f46c6e3601","source":{"kind":"arxiv","id":"1403.5807","version":1},"attestation_state":"computed","paper":{"title":"Solution of Vizing's Problem on Interchanges for Graphs with Maximum Degree 4 and Related Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Armen S. Asratian, Carl Johan Casselgren","submitted_at":"2014-03-23T21:49:04Z","abstract_excerpt":"Let $G$ be a Class 1 graph with maximum degree $4$ and let $t\\geq 5$ be an integer. We show that any proper $t$-edge coloring of $G$ can be transformed to any proper $4$-edge coloring of $G$ using only transformations on $2$-colored subgraphs (so-called interchanges). This settles the smallest previously unsolved case of a well-known problem of Vizing on interchanges, posed in 1965. Using our result we give an affirmative answer to a question of Mohar for two classes of graphs: we show that all proper $5$-edge colorings of a Class 1 graph with maximum degree 4 are Kempe equivalent, that is, ca"},"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":"1403.5807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-23T21:49:04Z","cross_cats_sorted":[],"title_canon_sha256":"51e2bece9f616a7aba98990098041cb3d30e6351435cee1f310ad18488817a57","abstract_canon_sha256":"042b682c5de35d3bea5fbcad696bfbe0aa78fd33b9ac40a7121dc387d0c31c17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:48.856104Z","signature_b64":"oGhve2OqJL+j+qL9PTqU4TAubWFTMk6n62l/YykJBu9y1CJWhTWeYbJXHEVaixuKwAxdiyLJ04H22XhYmHOXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29efaf6f5935829cc89df6ed51349b63d2076bcc4f23a9ca0beae9f46c6e3601","last_reissued_at":"2026-05-18T02:55:48.855502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:48.855502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution of Vizing's Problem on Interchanges for Graphs with Maximum Degree 4 and Related Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Armen S. Asratian, Carl Johan Casselgren","submitted_at":"2014-03-23T21:49:04Z","abstract_excerpt":"Let $G$ be a Class 1 graph with maximum degree $4$ and let $t\\geq 5$ be an integer. We show that any proper $t$-edge coloring of $G$ can be transformed to any proper $4$-edge coloring of $G$ using only transformations on $2$-colored subgraphs (so-called interchanges). This settles the smallest previously unsolved case of a well-known problem of Vizing on interchanges, posed in 1965. Using our result we give an affirmative answer to a question of Mohar for two classes of graphs: we show that all proper $5$-edge colorings of a Class 1 graph with maximum degree 4 are Kempe equivalent, that is, ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5807","kind":"arxiv","version":1},"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":"1403.5807","created_at":"2026-05-18T02:55:48.855598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5807v1","created_at":"2026-05-18T02:55:48.855598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5807","created_at":"2026-05-18T02:55:48.855598+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHX2632ZGWBJ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHX2632ZGWBJZSE5","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHX2632Z","created_at":"2026-05-18T12:28:28.263976+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/FHX2632ZGWBJZSE563WVCNE3MP","json":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP.json","graph_json":"https://pith.science/api/pith-number/FHX2632ZGWBJZSE563WVCNE3MP/graph.json","events_json":"https://pith.science/api/pith-number/FHX2632ZGWBJZSE563WVCNE3MP/events.json","paper":"https://pith.science/paper/FHX2632Z"},"agent_actions":{"view_html":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP","download_json":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP.json","view_paper":"https://pith.science/paper/FHX2632Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5807&json=true","fetch_graph":"https://pith.science/api/pith-number/FHX2632ZGWBJZSE563WVCNE3MP/graph.json","fetch_events":"https://pith.science/api/pith-number/FHX2632ZGWBJZSE563WVCNE3MP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP/action/storage_attestation","attest_author":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP/action/author_attestation","sign_citation":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP/action/citation_signature","submit_replication":"https://pith.science/pith/FHX2632ZGWBJZSE563WVCNE3MP/action/replication_record"}},"created_at":"2026-05-18T02:55:48.855598+00:00","updated_at":"2026-05-18T02:55:48.855598+00:00"}