{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V2UF7F5RKDNWGDMTWJJMSYJEV4","short_pith_number":"pith:V2UF7F5R","schema_version":"1.0","canonical_sha256":"aea85f97b150db630d93b252c96124af1b840e7149d4bea2cea827d7bf4aa5f1","source":{"kind":"arxiv","id":"1701.01939","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Restoring Corrupted Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Juho Lauri, Marzio De Biasi","submitted_at":"2017-01-08T10:43:55Z","abstract_excerpt":"In the \\probrFix problem, we are given a graph $G$, a (non-proper) vertex-coloring $c : V(G) \\to [r]$, and a positive integer $k$. The goal is to decide whether a proper $r$-coloring $c'$ is obtainable from $c$ by recoloring at most $k$ vertices of $G$. Recently, Junosza-Szaniawski, Liedloff, and Rz{\\k{a}}{\\.z}ewski [SOFSEM 2015] asked whether the problem has a polynomial kernel parameterized by the number of recolorings $k$. In a full version of the manuscript, the authors together with Garnero and Montealegre, answered the question in the negative: for every $r \\geq 3$, the problem \\probrFix"},"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":"1701.01939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-08T10:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"cd9d8cbd9012b80325c2894753a2ebe7cde75c3baec9e4f8a4ff6343b1e78eba","abstract_canon_sha256":"297d0d1fbcf6cc6be2ac8cee54e01695455b9da8d0564efde51f229d92c66f24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:13.015676Z","signature_b64":"LAe49+zDKfODBju2oq9sVQc5R9005r7Kcw/dPKp85MR9S6J5GzaRBCHy/6qwjo7o8yOaiykibQCfLRMAasomAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aea85f97b150db630d93b252c96124af1b840e7149d4bea2cea827d7bf4aa5f1","last_reissued_at":"2026-05-18T00:53:13.015226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:13.015226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Restoring Corrupted Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Juho Lauri, Marzio De Biasi","submitted_at":"2017-01-08T10:43:55Z","abstract_excerpt":"In the \\probrFix problem, we are given a graph $G$, a (non-proper) vertex-coloring $c : V(G) \\to [r]$, and a positive integer $k$. The goal is to decide whether a proper $r$-coloring $c'$ is obtainable from $c$ by recoloring at most $k$ vertices of $G$. Recently, Junosza-Szaniawski, Liedloff, and Rz{\\k{a}}{\\.z}ewski [SOFSEM 2015] asked whether the problem has a polynomial kernel parameterized by the number of recolorings $k$. In a full version of the manuscript, the authors together with Garnero and Montealegre, answered the question in the negative: for every $r \\geq 3$, the problem \\probrFix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01939","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":"1701.01939","created_at":"2026-05-18T00:53:13.015297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01939v1","created_at":"2026-05-18T00:53:13.015297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01939","created_at":"2026-05-18T00:53:13.015297+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2UF7F5RKDNW","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2UF7F5RKDNWGDMT","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2UF7F5R","created_at":"2026-05-18T12:31:49.984773+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/V2UF7F5RKDNWGDMTWJJMSYJEV4","json":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4.json","graph_json":"https://pith.science/api/pith-number/V2UF7F5RKDNWGDMTWJJMSYJEV4/graph.json","events_json":"https://pith.science/api/pith-number/V2UF7F5RKDNWGDMTWJJMSYJEV4/events.json","paper":"https://pith.science/paper/V2UF7F5R"},"agent_actions":{"view_html":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4","download_json":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4.json","view_paper":"https://pith.science/paper/V2UF7F5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01939&json=true","fetch_graph":"https://pith.science/api/pith-number/V2UF7F5RKDNWGDMTWJJMSYJEV4/graph.json","fetch_events":"https://pith.science/api/pith-number/V2UF7F5RKDNWGDMTWJJMSYJEV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/action/storage_attestation","attest_author":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/action/author_attestation","sign_citation":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/action/citation_signature","submit_replication":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/action/replication_record"}},"created_at":"2026-05-18T00:53:13.015297+00:00","updated_at":"2026-05-18T00:53:13.015297+00:00"}