{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2YFQT7DL4OYQF4OTM7RLL7DYE6","short_pith_number":"pith:2YFQT7DL","canonical_record":{"source":{"id":"1607.06911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T10:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"baf68699ea62366b3b799d66f773def99fa9760acf6382c6dbb55f56f0ea4987","abstract_canon_sha256":"d6321f0f751078c70abb17bd1550634902d9071c92ca4136b0a76fdabed53f78"},"schema_version":"1.0"},"canonical_sha256":"d60b09fc6be3b102f1d367e2b5fc782792d7e2d6b82358ec53f8db7e44948e60","source":{"kind":"arxiv","id":"1607.06911","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06911","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06911v2","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06911","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"2YFQT7DL4OYQ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YFQT7DL4OYQF4OT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YFQT7DL","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2YFQT7DL4OYQF4OTM7RLL7DYE6","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T10:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"baf68699ea62366b3b799d66f773def99fa9760acf6382c6dbb55f56f0ea4987","abstract_canon_sha256":"d6321f0f751078c70abb17bd1550634902d9071c92ca4136b0a76fdabed53f78"},"schema_version":"1.0"},"canonical_sha256":"d60b09fc6be3b102f1d367e2b5fc782792d7e2d6b82358ec53f8db7e44948e60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:48.917680Z","signature_b64":"q4HilyDr7qo+5Rv2rAYrc80oPb4bJK61VQsWdP69LQcyoPMUTylx3VSf7jxn+MfEFT6bs3LEwLgSVLnn83NyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d60b09fc6be3b102f1d367e2b5fc782792d7e2d6b82358ec53f8db7e44948e60","last_reissued_at":"2026-05-18T00:30:48.917212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:48.917212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06911","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-05-18T00:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVIXGpzP0VNwGkl/TBtXWu8BaBXtIALBoXvmLdsI2uBTrHmEuICxasgfuWuVu/BNVZ9VS5SXH8N/EWUgMAYACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:42:17.808249Z"},"content_sha256":"92f7e622c4ca283639a27a646d13fa2c1ba35423cfb78bd7c012be59e5bc5b90","schema_version":"1.0","event_id":"sha256:92f7e622c4ca283639a27a646d13fa2c1ba35423cfb78bd7c012be59e5bc5b90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2YFQT7DL4OYQF4OTM7RLL7DYE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixing improper colorings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawe{\\l} Rz\\k{a}\\.zewski, Pedro Montealegre, Valentin Garnero","submitted_at":"2016-07-23T10:09:56Z","abstract_excerpt":"In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper $r$-coloring $\\varphi$ of a graph $G$. We investigate the problem of finding a proper $r$-coloring of $G$, which is \"the most similar\" to $\\varphi$, i.e. the number $k$ of vertices that have to be recolored is minimum possible. We observe that the problem is NP-complete for any $r \\geq 3$, even for bipartite planar graphs. On the other hand, the problem is fixed-parameter tractable, when parameterized by the number of allowed transformations $k$. We provide an $2^n \\cdot n^{\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06911","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":""},"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-18T00:30:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5L4qERCNfh6lhH9N59E8v4jUAKV6WI+lNNhPP1+nw+Rd2x3rzJ+H2qxFDdqsN73zC0nouWVgJtV/8nNxRAYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:42:17.808617Z"},"content_sha256":"8118898f88439b07442820efef24381b3c81defbbc30f72436dac8815915fda7","schema_version":"1.0","event_id":"sha256:8118898f88439b07442820efef24381b3c81defbbc30f72436dac8815915fda7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YFQT7DL4OYQF4OTM7RLL7DYE6/bundle.json","state_url":"https://pith.science/pith/2YFQT7DL4OYQF4OTM7RLL7DYE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YFQT7DL4OYQF4OTM7RLL7DYE6/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-07-04T04:42:17Z","links":{"resolver":"https://pith.science/pith/2YFQT7DL4OYQF4OTM7RLL7DYE6","bundle":"https://pith.science/pith/2YFQT7DL4OYQF4OTM7RLL7DYE6/bundle.json","state":"https://pith.science/pith/2YFQT7DL4OYQF4OTM7RLL7DYE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YFQT7DL4OYQF4OTM7RLL7DYE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2YFQT7DL4OYQF4OTM7RLL7DYE6","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":"d6321f0f751078c70abb17bd1550634902d9071c92ca4136b0a76fdabed53f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T10:09:56Z","title_canon_sha256":"baf68699ea62366b3b799d66f773def99fa9760acf6382c6dbb55f56f0ea4987"},"schema_version":"1.0","source":{"id":"1607.06911","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06911","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06911v2","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06911","created_at":"2026-05-18T00:30:48Z"},{"alias_kind":"pith_short_12","alias_value":"2YFQT7DL4OYQ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YFQT7DL4OYQF4OT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YFQT7DL","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:8118898f88439b07442820efef24381b3c81defbbc30f72436dac8815915fda7","target":"graph","created_at":"2026-05-18T00:30:48Z","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":"In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper $r$-coloring $\\varphi$ of a graph $G$. We investigate the problem of finding a proper $r$-coloring of $G$, which is \"the most similar\" to $\\varphi$, i.e. the number $k$ of vertices that have to be recolored is minimum possible. We observe that the problem is NP-complete for any $r \\geq 3$, even for bipartite planar graphs. On the other hand, the problem is fixed-parameter tractable, when parameterized by the number of allowed transformations $k$. We provide an $2^n \\cdot n^{\\math","authors_text":"Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawe{\\l} Rz\\k{a}\\.zewski, Pedro Montealegre, Valentin Garnero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T10:09:56Z","title":"Fixing improper colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06911","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:92f7e622c4ca283639a27a646d13fa2c1ba35423cfb78bd7c012be59e5bc5b90","target":"record","created_at":"2026-05-18T00:30:48Z","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":"d6321f0f751078c70abb17bd1550634902d9071c92ca4136b0a76fdabed53f78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-23T10:09:56Z","title_canon_sha256":"baf68699ea62366b3b799d66f773def99fa9760acf6382c6dbb55f56f0ea4987"},"schema_version":"1.0","source":{"id":"1607.06911","kind":"arxiv","version":2}},"canonical_sha256":"d60b09fc6be3b102f1d367e2b5fc782792d7e2d6b82358ec53f8db7e44948e60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d60b09fc6be3b102f1d367e2b5fc782792d7e2d6b82358ec53f8db7e44948e60","first_computed_at":"2026-05-18T00:30:48.917212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:48.917212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4HilyDr7qo+5Rv2rAYrc80oPb4bJK61VQsWdP69LQcyoPMUTylx3VSf7jxn+MfEFT6bs3LEwLgSVLnn83NyDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:48.917680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06911","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92f7e622c4ca283639a27a646d13fa2c1ba35423cfb78bd7c012be59e5bc5b90","sha256:8118898f88439b07442820efef24381b3c81defbbc30f72436dac8815915fda7"],"state_sha256":"7930c854c18587402368ecb85b87369f3ac3cba4c2b49dbb9b1402685fa68b02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjom5CjXJAbmllfNmqRLxa9hZdvivHj/DtmWFshVSWsMDSJnjAhbLSTGbO0/w0zz1t5wx5P6VpN70SVdWnXPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T04:42:17.810574Z","bundle_sha256":"75a373ec47c49bece3fb8dc582654408ea2f7b05655ef768ff2c94eba39ef807"}}