{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QIYT6J3IY36DKCYS2RBOJ7HPYQ","short_pith_number":"pith:QIYT6J3I","schema_version":"1.0","canonical_sha256":"82313f2768c6fc350b12d442e4fcefc42a7dd7beb38d676a8ca96c85409c4fa9","source":{"kind":"arxiv","id":"1708.03853","version":1},"attestation_state":"computed","paper":{"title":"The Parameterized Complexity of Happy Colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"I. Vinod Reddy, Neeldhara Misra","submitted_at":"2017-08-13T04:52:27Z","abstract_excerpt":"Consider a graph $G = (V,E)$ and a coloring $c$ of vertices with colors from $[\\ell]$. A vertex $v$ is said to be happy with respect to $c$ if $c(v) = c(u)$ for all neighbors $u$ of $v$. Further, an edge $(u,v)$ is happy if $c(u) = c(v)$. Given a partial coloring $c$ of $V$, the Maximum Happy Vertex (Edge) problem asks for a total coloring of $V$ extending $c$ to all vertices of $V$ that maximises the number of happy vertices (edges). Both problems are known to be NP-hard in general even when $\\ell = 3$, and is polynomially solvable when $\\ell = 2$. In [IWOCA 2016] it was shown that both probl"},"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":"1708.03853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-08-13T04:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"bd56d2e569bfe1ae0d4115253d7647c42d23d72c0552093f7beca41a9448f085","abstract_canon_sha256":"25fc656c9bdfcf83d07b79e28c3711e63d88d1aefb6e343dff8daff33c8a6d90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:07.734532Z","signature_b64":"ys6voA2HD9Xcl3dZp0VsaeGgFGg9DBCQnJBrMnj8MobORmXVfxT7gWvHex3ljVMFLa9AEXZ6bd6NihwHvzpVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82313f2768c6fc350b12d442e4fcefc42a7dd7beb38d676a8ca96c85409c4fa9","last_reissued_at":"2026-05-18T00:38:07.734026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:07.734026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Happy Colorings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"I. Vinod Reddy, Neeldhara Misra","submitted_at":"2017-08-13T04:52:27Z","abstract_excerpt":"Consider a graph $G = (V,E)$ and a coloring $c$ of vertices with colors from $[\\ell]$. A vertex $v$ is said to be happy with respect to $c$ if $c(v) = c(u)$ for all neighbors $u$ of $v$. Further, an edge $(u,v)$ is happy if $c(u) = c(v)$. Given a partial coloring $c$ of $V$, the Maximum Happy Vertex (Edge) problem asks for a total coloring of $V$ extending $c$ to all vertices of $V$ that maximises the number of happy vertices (edges). Both problems are known to be NP-hard in general even when $\\ell = 3$, and is polynomially solvable when $\\ell = 2$. In [IWOCA 2016] it was shown that both probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03853","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":"1708.03853","created_at":"2026-05-18T00:38:07.734093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03853v1","created_at":"2026-05-18T00:38:07.734093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03853","created_at":"2026-05-18T00:38:07.734093+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIYT6J3IY36D","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIYT6J3IY36DKCYS","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIYT6J3I","created_at":"2026-05-18T12:31:39.905425+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/QIYT6J3IY36DKCYS2RBOJ7HPYQ","json":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ.json","graph_json":"https://pith.science/api/pith-number/QIYT6J3IY36DKCYS2RBOJ7HPYQ/graph.json","events_json":"https://pith.science/api/pith-number/QIYT6J3IY36DKCYS2RBOJ7HPYQ/events.json","paper":"https://pith.science/paper/QIYT6J3I"},"agent_actions":{"view_html":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ","download_json":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ.json","view_paper":"https://pith.science/paper/QIYT6J3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03853&json=true","fetch_graph":"https://pith.science/api/pith-number/QIYT6J3IY36DKCYS2RBOJ7HPYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QIYT6J3IY36DKCYS2RBOJ7HPYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ/action/storage_attestation","attest_author":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ/action/author_attestation","sign_citation":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ/action/citation_signature","submit_replication":"https://pith.science/pith/QIYT6J3IY36DKCYS2RBOJ7HPYQ/action/replication_record"}},"created_at":"2026-05-18T00:38:07.734093+00:00","updated_at":"2026-05-18T00:38:07.734093+00:00"}