{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WL2W3LHBZSSDZGFXERTBZW3P3U","short_pith_number":"pith:WL2W3LHB","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"},"canonical_sha256":"b2f56dace1cca43c98b724661cdb6fdd268ec2c706a72fc01a0f61f04179e9b3","source":{"kind":"arxiv","id":"1004.2642","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WL2W3LHBZSSDZGFXERTBZW3P3U","target":"record","payload":{"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"},"canonical_sha256":"b2f56dace1cca43c98b724661cdb6fdd268ec2c706a72fc01a0f61f04179e9b3","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"},"source_kind":"arxiv","source_id":"1004.2642","source_version":6,"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-18T02:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VeXofJU3WTi5B/65n9VPX2V8N/mzvhAT3mds7ANbCgbbK0gNnbChTYX/wCliT6W6KiRZHrp48pAxoIs26vRcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:00:40.629847Z"},"content_sha256":"072173a73ffe599b92d2a46efff74c92269c2c6bd215c162e5c8f48e58278db1","schema_version":"1.0","event_id":"sha256:072173a73ffe599b92d2a46efff74c92269c2c6bd215c162e5c8f48e58278db1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WL2W3LHBZSSDZGFXERTBZW3P3U","target":"graph","payload":{"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"},"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-18T02:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgIa8PD+PlQ83RBscdOVdNZ1swtwfJke4O6vK7srCD/iIxrui83RYQVNz2m0Cp2h0HPfmdW3uEdomuqbRXpnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:00:40.630519Z"},"content_sha256":"663127a7f68f8284c1840f4e4d0a6c160741133a66fa08e7766aeb6859b0d845","schema_version":"1.0","event_id":"sha256:663127a7f68f8284c1840f4e4d0a6c160741133a66fa08e7766aeb6859b0d845"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/bundle.json","state_url":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/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-05-27T13:00:40Z","links":{"resolver":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U","bundle":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/bundle.json","state":"https://pith.science/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WL2W3LHBZSSDZGFXERTBZW3P3U/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVqE7TqvUzvlwPgakIBsa7Mkhl7WJtAQgUp7++M0ttUY+uvOzgAmKbMc5my/L+f4RtktkqvHgunDHTdYkYp3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:00:40.634216Z","bundle_sha256":"aaa8b26230edbf972a67909225b04673a994c6577f9837efff35eeab4d424213"}}