{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WL2W3LHBZSSDZGFXERTBZW3P3U","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":"5103480276955697c48e32d8fb89bf6e7ae5a92b268d0f332c41406578126dbc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-15T14:49:00Z","title_canon_sha256":"2725cbac04fd7da5af28c5b454eaeca2b1938a4a70d7ebda751059550a8346a4"},"schema_version":"1.0","source":{"id":"1004.2642","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.2642","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"arxiv_version","alias_value":"1004.2642v6","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2642","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"pith_short_12","alias_value":"WL2W3LHBZSSD","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WL2W3LHBZSSDZGFX","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WL2W3LHB","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:663127a7f68f8284c1840f4e4d0a6c160741133a66fa08e7766aeb6859b0d845","target":"graph","created_at":"2026-05-18T02:54:56Z","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":"The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A generalized domination (also called $[\\sigma,\\rho]$-Dominating Set}) problem consists in finding a subset of vertices in a graph such that every vertex is satisfied with respect to two given sets of constraints $\\sigma$ and $\\rho$. Very few problems are known not to be FPT when parameterized by tree-width, as usually this restriction allows one to write efficient algorithms to solve the considered problems. The main result","authors_text":"Mathieu Chapelle","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-15T14:49:00Z","title":"W[1]-hardness of some domination-like problems parameterized by tree-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2642","kind":"arxiv","version":6},"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:072173a73ffe599b92d2a46efff74c92269c2c6bd215c162e5c8f48e58278db1","target":"record","created_at":"2026-05-18T02:54:56Z","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":"5103480276955697c48e32d8fb89bf6e7ae5a92b268d0f332c41406578126dbc","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-15T14:49:00Z","title_canon_sha256":"2725cbac04fd7da5af28c5b454eaeca2b1938a4a70d7ebda751059550a8346a4"},"schema_version":"1.0","source":{"id":"1004.2642","kind":"arxiv","version":6}},"canonical_sha256":"b2f56dace1cca43c98b724661cdb6fdd268ec2c706a72fc01a0f61f04179e9b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2f56dace1cca43c98b724661cdb6fdd268ec2c706a72fc01a0f61f04179e9b3","first_computed_at":"2026-05-18T02:54:56.722973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:56.722973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ck/w4v42Iyl7tGctg6Lk+o6Nypx3MaiZYl/5VephJSpmP/6UX4B3ngFgDg/TEWZMJN9zCEaQ/1+ns5h5HUwPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:56.723540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.2642","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:072173a73ffe599b92d2a46efff74c92269c2c6bd215c162e5c8f48e58278db1","sha256:663127a7f68f8284c1840f4e4d0a6c160741133a66fa08e7766aeb6859b0d845"],"state_sha256":"7def044a2a57d56f9a4b700e69d6fc7805e38ba61719c3952b7216d9506015af"}