{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XWDDSQ2BXPDESKSV7DDNLAJ7VQ","short_pith_number":"pith:XWDDSQ2B","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"},"canonical_sha256":"bd86394341bbc6492a55f8c6d5813fac267869b077c512666e3fd779bf067175","source":{"kind":"arxiv","id":"1308.1068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1068","created_at":"2026-05-18T03:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1068v1","created_at":"2026-05-18T03:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1068","created_at":"2026-05-18T03:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"XWDDSQ2BXPDE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XWDDSQ2BXPDESKSV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XWDDSQ2B","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XWDDSQ2BXPDESKSV7DDNLAJ7VQ","target":"record","payload":{"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"},"canonical_sha256":"bd86394341bbc6492a55f8c6d5813fac267869b077c512666e3fd779bf067175","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"},"source_kind":"arxiv","source_id":"1308.1068","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-18T03:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Wrc9K9/q7YOO/xxMLKa9NUE4ZwBRjZKZiHK0ohOOxgQaXM5grcNtTwnbhHWQhxxJ5OK6idIQBS53ufC2JYeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:30:51.799382Z"},"content_sha256":"ade23000a626b5687d373c391e996553d9c4d6a893bf9e0243a5fa15c92708fd","schema_version":"1.0","event_id":"sha256:ade23000a626b5687d373c391e996553d9c4d6a893bf9e0243a5fa15c92708fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XWDDSQ2BXPDESKSV7DDNLAJ7VQ","target":"graph","payload":{"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"},"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-18T03:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sAvJUPyntyBoJltLpIPoKPj1glmyMW9yI2kLJZKIvwRdFaWWT8jBhk8taO3KwiHM+ftHk8u3EmkRnvgLDysCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:30:51.799765Z"},"content_sha256":"11c41933dd999d29ebbb7235fa945052207f5cff9bc44c373fc5836043d37437","schema_version":"1.0","event_id":"sha256:11c41933dd999d29ebbb7235fa945052207f5cff9bc44c373fc5836043d37437"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/bundle.json","state_url":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/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-06-23T07:30:51Z","links":{"resolver":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ","bundle":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/bundle.json","state":"https://pith.science/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWDDSQ2BXPDESKSV7DDNLAJ7VQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XWDDSQ2BXPDESKSV7DDNLAJ7VQ","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":"9207574ea4214c82606e08a5ffef551a6fe0dfeafd32cba08714efacf40bc87e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-05T18:56:38Z","title_canon_sha256":"76e206355b46a8f870ddf864d13318d8d50ea6414c888f4c0568e95d2ec8197f"},"schema_version":"1.0","source":{"id":"1308.1068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1068","created_at":"2026-05-18T03:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1068v1","created_at":"2026-05-18T03:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1068","created_at":"2026-05-18T03:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"XWDDSQ2BXPDE","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XWDDSQ2BXPDESKSV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XWDDSQ2B","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:11c41933dd999d29ebbb7235fa945052207f5cff9bc44c373fc5836043d37437","target":"graph","created_at":"2026-05-18T03:16:40Z","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 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","authors_text":"Daniel Marx, Laszlo Egri, Rajesh Chitnis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-05T18:56:38Z","title":"List H-Coloring a Graph by Removing Few Vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1068","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:ade23000a626b5687d373c391e996553d9c4d6a893bf9e0243a5fa15c92708fd","target":"record","created_at":"2026-05-18T03:16:40Z","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":"9207574ea4214c82606e08a5ffef551a6fe0dfeafd32cba08714efacf40bc87e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-05T18:56:38Z","title_canon_sha256":"76e206355b46a8f870ddf864d13318d8d50ea6414c888f4c0568e95d2ec8197f"},"schema_version":"1.0","source":{"id":"1308.1068","kind":"arxiv","version":1}},"canonical_sha256":"bd86394341bbc6492a55f8c6d5813fac267869b077c512666e3fd779bf067175","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd86394341bbc6492a55f8c6d5813fac267869b077c512666e3fd779bf067175","first_computed_at":"2026-05-18T03:16:40.787696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:40.787696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hXzaRQVP5kJfQQX/x9YkhpuXwdAI+zFPs8HT49EdM/FkQP/ztfl6JzvyqC3760CX7lSqJuWbN4I5IrY3ZxYAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:40.788221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ade23000a626b5687d373c391e996553d9c4d6a893bf9e0243a5fa15c92708fd","sha256:11c41933dd999d29ebbb7235fa945052207f5cff9bc44c373fc5836043d37437"],"state_sha256":"c976b4051408f9fd2a858fee82fe7613fad2a1562a900d5010f23e50d1f9b56e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VeTf1soA+5yJjDL0nxEazL6BqZ8F8bND5Xeimsh0nhceL5uUdDOHKk+wLT1baVc/JeXNzAPsyDLdZFPqd3pKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:30:51.801801Z","bundle_sha256":"4adccebdaf888828e04ba070e549b9738a0ffd5c3cf20546c288aa39789f7f10"}}