{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WL2W3LHBZSSDZGFXERTBZW3P3U","short_pith_number":"pith:WL2W3LHB","schema_version":"1.0","canonical_sha256":"b2f56dace1cca43c98b724661cdb6fdd268ec2c706a72fc01a0f61f04179e9b3","source":{"kind":"arxiv","id":"1004.2642","version":6},"attestation_state":"computed","paper":{"title":"W[1]-hardness of some domination-like problems parameterized by tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Mathieu Chapelle","submitted_at":"2010-04-15T14:49:00Z","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"},"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":"1004.2642","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-15T14:49:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2725cbac04fd7da5af28c5b454eaeca2b1938a4a70d7ebda751059550a8346a4","abstract_canon_sha256":"5103480276955697c48e32d8fb89bf6e7ae5a92b268d0f332c41406578126dbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:56.723540Z","signature_b64":"Ck/w4v42Iyl7tGctg6Lk+o6Nypx3MaiZYl/5VephJSpmP/6UX4B3ngFgDg/TEWZMJN9zCEaQ/1+ns5h5HUwPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2f56dace1cca43c98b724661cdb6fdd268ec2c706a72fc01a0f61f04179e9b3","last_reissued_at":"2026-05-18T02:54:56.722973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:56.722973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"W[1]-hardness of some domination-like problems parameterized by tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Mathieu Chapelle","submitted_at":"2010-04-15T14:49:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2642","kind":"arxiv","version":6},"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":"1004.2642","created_at":"2026-05-18T02:54:56.723062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2642v6","created_at":"2026-05-18T02:54:56.723062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2642","created_at":"2026-05-18T02:54:56.723062+00:00"},{"alias_kind":"pith_short_12","alias_value":"WL2W3LHBZSSD","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WL2W3LHBZSSDZGFX","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WL2W3LHB","created_at":"2026-05-18T12:26:15.391820+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/WL2W3LHBZSSDZGFXERTBZW3P3U","json":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U.json","graph_json":"https://pith.science/api/pith-number/WL2W3LHBZSSDZGFXERTBZW3P3U/graph.json","events_json":"https://pith.science/api/pith-number/WL2W3LHBZSSDZGFXERTBZW3P3U/events.json","paper":"https://pith.science/paper/WL2W3LHB"},"agent_actions":{"view_html":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U","download_json":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U.json","view_paper":"https://pith.science/paper/WL2W3LHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2642&json=true","fetch_graph":"https://pith.science/api/pith-number/WL2W3LHBZSSDZGFXERTBZW3P3U/graph.json","fetch_events":"https://pith.science/api/pith-number/WL2W3LHBZSSDZGFXERTBZW3P3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/action/storage_attestation","attest_author":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/action/author_attestation","sign_citation":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/action/citation_signature","submit_replication":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/action/replication_record"}},"created_at":"2026-05-18T02:54:56.723062+00:00","updated_at":"2026-05-18T02:54:56.723062+00:00"}