{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WXHEFUZRR352ENKNV2VW3IEHN4","short_pith_number":"pith:WXHEFUZR","schema_version":"1.0","canonical_sha256":"b5ce42d3318efba2354daeab6da0876f16ae10d62265d55d2603e77187373b1b","source":{"kind":"arxiv","id":"1110.0187","version":1},"attestation_state":"computed","paper":{"title":"Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Minghui Jiang, Yong Zhang","submitted_at":"2011-10-02T14:06:59Z","abstract_excerpt":"We show that the problem k-Dominating Set and its several variants including k-Connected Dominating Set, k-Independent Dominating Set, and k-Dominating Clique, when parameterized by the solution size k, are W[1]-hard in either multiple-interval graphs or their complements or both. On the other hand, we show that these problems belong to W[1] when restricted to multiple-interval graphs and their complements. This answers an open question of Fellows et al. In sharp contrast, we show that d-Distance k-Dominating Set for d >= 2 is W[2]-complete in multiple-interval graphs and their complements. We"},"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":"1110.0187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-02T14:06:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ad1d184f1c1d6bcd39eff71fdc102cf777b3a823bac054d177032d0ad50679dc","abstract_canon_sha256":"28141feacac1b13ebb35335f070e91c245e0d73b25091c40d928469b94da4975"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.616991Z","signature_b64":"pmSW6Z8F4qkTS4HlFKDTh7izrUVnNMOsUvPC3h+2J1ekZvd4Y4mJD/7YMxigXqhGX5cVqI1PG7gu7ZrhVNMmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5ce42d3318efba2354daeab6da0876f16ae10d62265d55d2603e77187373b1b","last_reissued_at":"2026-05-18T02:21:35.616539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.616539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Minghui Jiang, Yong Zhang","submitted_at":"2011-10-02T14:06:59Z","abstract_excerpt":"We show that the problem k-Dominating Set and its several variants including k-Connected Dominating Set, k-Independent Dominating Set, and k-Dominating Clique, when parameterized by the solution size k, are W[1]-hard in either multiple-interval graphs or their complements or both. On the other hand, we show that these problems belong to W[1] when restricted to multiple-interval graphs and their complements. This answers an open question of Fellows et al. In sharp contrast, we show that d-Distance k-Dominating Set for d >= 2 is W[2]-complete in multiple-interval graphs and their complements. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0187","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":"1110.0187","created_at":"2026-05-18T02:21:35.616614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0187v1","created_at":"2026-05-18T02:21:35.616614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0187","created_at":"2026-05-18T02:21:35.616614+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXHEFUZRR352","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXHEFUZRR352ENKN","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXHEFUZR","created_at":"2026-05-18T12:26:44.992195+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/WXHEFUZRR352ENKNV2VW3IEHN4","json":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4.json","graph_json":"https://pith.science/api/pith-number/WXHEFUZRR352ENKNV2VW3IEHN4/graph.json","events_json":"https://pith.science/api/pith-number/WXHEFUZRR352ENKNV2VW3IEHN4/events.json","paper":"https://pith.science/paper/WXHEFUZR"},"agent_actions":{"view_html":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4","download_json":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4.json","view_paper":"https://pith.science/paper/WXHEFUZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0187&json=true","fetch_graph":"https://pith.science/api/pith-number/WXHEFUZRR352ENKNV2VW3IEHN4/graph.json","fetch_events":"https://pith.science/api/pith-number/WXHEFUZRR352ENKNV2VW3IEHN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/action/storage_attestation","attest_author":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/action/author_attestation","sign_citation":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/action/citation_signature","submit_replication":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/action/replication_record"}},"created_at":"2026-05-18T02:21:35.616614+00:00","updated_at":"2026-05-18T02:21:35.616614+00:00"}