{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V2UF7F5RKDNWGDMTWJJMSYJEV4","short_pith_number":"pith:V2UF7F5R","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"},"canonical_sha256":"aea85f97b150db630d93b252c96124af1b840e7149d4bea2cea827d7bf4aa5f1","source":{"kind":"arxiv","id":"1701.01939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01939","created_at":"2026-05-18T00:53:13Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01939v1","created_at":"2026-05-18T00:53:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01939","created_at":"2026-05-18T00:53:13Z"},{"alias_kind":"pith_short_12","alias_value":"V2UF7F5RKDNW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V2UF7F5RKDNWGDMT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V2UF7F5R","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V2UF7F5RKDNWGDMTWJJMSYJEV4","target":"record","payload":{"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"},"canonical_sha256":"aea85f97b150db630d93b252c96124af1b840e7149d4bea2cea827d7bf4aa5f1","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"},"source_kind":"arxiv","source_id":"1701.01939","source_version":1,"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:53:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgm9TiLL/k4F3RW//rtLXH9TSu21IBDHRWnxDxLiha2+n/b0VXbDcl+C5WnP8auGtrSsPND+veaxGeuqYToqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:31:08.041843Z"},"content_sha256":"5e755297eccdf6c25d69053479c56f4b3f9c691e12a40fb4d33e0799a732aff4","schema_version":"1.0","event_id":"sha256:5e755297eccdf6c25d69053479c56f4b3f9c691e12a40fb4d33e0799a732aff4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V2UF7F5RKDNWGDMTWJJMSYJEV4","target":"graph","payload":{"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"},"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:53:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LexcIfEv0tsAcmI3+usRLpnBHRYZAeB4tiMu9yVFgcZt5ZeMOvpgz36ZPKFHmtXltiu8ejE1SkxxiFNCZ6EBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:31:08.042523Z"},"content_sha256":"8fa507953febf828e6b63032b054bb730bc598c7203317322f3fbd71516cea14","schema_version":"1.0","event_id":"sha256:8fa507953febf828e6b63032b054bb730bc598c7203317322f3fbd71516cea14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/bundle.json","state_url":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/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-05-26T07:31:08Z","links":{"resolver":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4","bundle":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/bundle.json","state":"https://pith.science/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2UF7F5RKDNWGDMTWJJMSYJEV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V2UF7F5RKDNWGDMTWJJMSYJEV4","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":"297d0d1fbcf6cc6be2ac8cee54e01695455b9da8d0564efde51f229d92c66f24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-08T10:43:55Z","title_canon_sha256":"cd9d8cbd9012b80325c2894753a2ebe7cde75c3baec9e4f8a4ff6343b1e78eba"},"schema_version":"1.0","source":{"id":"1701.01939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01939","created_at":"2026-05-18T00:53:13Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01939v1","created_at":"2026-05-18T00:53:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01939","created_at":"2026-05-18T00:53:13Z"},{"alias_kind":"pith_short_12","alias_value":"V2UF7F5RKDNW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V2UF7F5RKDNWGDMT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V2UF7F5R","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:8fa507953febf828e6b63032b054bb730bc598c7203317322f3fbd71516cea14","target":"graph","created_at":"2026-05-18T00:53:13Z","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 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","authors_text":"Juho Lauri, Marzio De Biasi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-08T10:43:55Z","title":"On the Complexity of Restoring Corrupted Colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01939","kind":"arxiv","version":1},"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:5e755297eccdf6c25d69053479c56f4b3f9c691e12a40fb4d33e0799a732aff4","target":"record","created_at":"2026-05-18T00:53:13Z","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":"297d0d1fbcf6cc6be2ac8cee54e01695455b9da8d0564efde51f229d92c66f24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-08T10:43:55Z","title_canon_sha256":"cd9d8cbd9012b80325c2894753a2ebe7cde75c3baec9e4f8a4ff6343b1e78eba"},"schema_version":"1.0","source":{"id":"1701.01939","kind":"arxiv","version":1}},"canonical_sha256":"aea85f97b150db630d93b252c96124af1b840e7149d4bea2cea827d7bf4aa5f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aea85f97b150db630d93b252c96124af1b840e7149d4bea2cea827d7bf4aa5f1","first_computed_at":"2026-05-18T00:53:13.015226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:13.015226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LAe49+zDKfODBju2oq9sVQc5R9005r7Kcw/dPKp85MR9S6J5GzaRBCHy/6qwjo7o8yOaiykibQCfLRMAasomAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:13.015676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e755297eccdf6c25d69053479c56f4b3f9c691e12a40fb4d33e0799a732aff4","sha256:8fa507953febf828e6b63032b054bb730bc598c7203317322f3fbd71516cea14"],"state_sha256":"6b11476ff209a209985fcdadb9b41b469b1a6a458de1224b716019592ebbb2d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfGdro3owL8mlqSCEP+hiAcJmHyd2DKA6+imBTeLjMBSXVoe6F6F5TzAO78Q3RtPdDmUdfaZ57rlVtbjoRnfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:31:08.045308Z","bundle_sha256":"a14f659e98947b9433407dbd2288d68b09dab3b2213192fa9bb3369e7619bfc7"}}