{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XWDDSQ2BXPDESKSV7DDNLAJ7VQ","short_pith_number":"pith:XWDDSQ2B","schema_version":"1.0","canonical_sha256":"bd86394341bbc6492a55f8c6d5813fac267869b077c512666e3fd779bf067175","source":{"kind":"arxiv","id":"1308.1068","version":1},"attestation_state":"computed","paper":{"title":"List H-Coloring a Graph by Removing Few Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Marx, Laszlo Egri, Rajesh Chitnis","submitted_at":"2013-08-05T18:56:38Z","abstract_excerpt":"In the deletion version of the list homomorphism problem, we are given graphs G and H, a list L(v) that is a subset of V(H) for each vertex v of G, and an integer k. The task is to decide whether there exists a subset W of V(G) of size at most k such that there is a homomorphism from G \\ W to H respecting the lists. We show that DL-Hom(H), parameterized by k and |H|, is fixed-parameter tractable for any (P6, C6)-free bipartite graph H; already for this restricted class of graphs, the problem generalizes Vertex Cover, Odd Cycle Transversal, and Vertex Multiway Cut parameterized by the size of t"},"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":"1308.1068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-05T18:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"76e206355b46a8f870ddf864d13318d8d50ea6414c888f4c0568e95d2ec8197f","abstract_canon_sha256":"9207574ea4214c82606e08a5ffef551a6fe0dfeafd32cba08714efacf40bc87e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:40.788221Z","signature_b64":"hXzaRQVP5kJfQQX/x9YkhpuXwdAI+zFPs8HT49EdM/FkQP/ztfl6JzvyqC3760CX7lSqJuWbN4I5IrY3ZxYAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd86394341bbc6492a55f8c6d5813fac267869b077c512666e3fd779bf067175","last_reissued_at":"2026-05-18T03:16:40.787696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:40.787696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List H-Coloring a Graph by Removing Few Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Marx, Laszlo Egri, Rajesh Chitnis","submitted_at":"2013-08-05T18:56:38Z","abstract_excerpt":"In the deletion version of the list homomorphism problem, we are given graphs G and H, a list L(v) that is a subset of V(H) for each vertex v of G, and an integer k. The task is to decide whether there exists a subset W of V(G) of size at most k such that there is a homomorphism from G \\ W to H respecting the lists. We show that DL-Hom(H), parameterized by k and |H|, is fixed-parameter tractable for any (P6, C6)-free bipartite graph H; already for this restricted class of graphs, the problem generalizes Vertex Cover, Odd Cycle Transversal, and Vertex Multiway Cut parameterized by the size of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1068","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":"1308.1068","created_at":"2026-05-18T03:16:40.787768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1068v1","created_at":"2026-05-18T03:16:40.787768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1068","created_at":"2026-05-18T03:16:40.787768+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWDDSQ2BXPDE","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWDDSQ2BXPDESKSV","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWDDSQ2B","created_at":"2026-05-18T12:28:06.772260+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/XWDDSQ2BXPDESKSV7DDNLAJ7VQ","json":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ.json","graph_json":"https://pith.science/api/pith-number/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/graph.json","events_json":"https://pith.science/api/pith-number/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/events.json","paper":"https://pith.science/paper/XWDDSQ2B"},"agent_actions":{"view_html":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ","download_json":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ.json","view_paper":"https://pith.science/paper/XWDDSQ2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1068&json=true","fetch_graph":"https://pith.science/api/pith-number/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/action/storage_attestation","attest_author":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/action/author_attestation","sign_citation":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/action/citation_signature","submit_replication":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/action/replication_record"}},"created_at":"2026-05-18T03:16:40.787768+00:00","updated_at":"2026-05-18T03:16:40.787768+00:00"}