{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WXHEFUZRR352ENKNV2VW3IEHN4","short_pith_number":"pith:WXHEFUZR","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"},"canonical_sha256":"b5ce42d3318efba2354daeab6da0876f16ae10d62265d55d2603e77187373b1b","source":{"kind":"arxiv","id":"1110.0187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0187","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0187v1","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0187","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"WXHEFUZRR352","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WXHEFUZRR352ENKN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WXHEFUZR","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WXHEFUZRR352ENKNV2VW3IEHN4","target":"record","payload":{"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"},"canonical_sha256":"b5ce42d3318efba2354daeab6da0876f16ae10d62265d55d2603e77187373b1b","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"},"source_kind":"arxiv","source_id":"1110.0187","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-18T02:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2yRXjatktJNpXH4gjCLNikcLSBPV2EHdCB55on/U2MWaj/oaQ6EQNFTyUMdwlfd7VQrWJYPzQQzbqJYSQCpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:36:43.437233Z"},"content_sha256":"c1ad749bde1718f26f57d5f49186003865f70e0695db9aff910d3f3baf3aa858","schema_version":"1.0","event_id":"sha256:c1ad749bde1718f26f57d5f49186003865f70e0695db9aff910d3f3baf3aa858"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WXHEFUZRR352ENKNV2VW3IEHN4","target":"graph","payload":{"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"},"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:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2NXwtbPLr7Fw8Kaom/zIsndWi2gV2t6GkBUB3zyDGkHq3wExvXxGSQJZjb/tt4KHdPl9gRHMIVY66E4bONtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:36:43.437963Z"},"content_sha256":"ac2ddfa9ccc5bf37c17f3a81d678bc48cc058ab827155aaba73346d34cf0442e","schema_version":"1.0","event_id":"sha256:ac2ddfa9ccc5bf37c17f3a81d678bc48cc058ab827155aaba73346d34cf0442e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/bundle.json","state_url":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXHEFUZRR352ENKNV2VW3IEHN4/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-31T13:36:43Z","links":{"resolver":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4","bundle":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/bundle.json","state":"https://pith.science/pith/WXHEFUZRR352ENKNV2VW3IEHN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXHEFUZRR352ENKNV2VW3IEHN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WXHEFUZRR352ENKNV2VW3IEHN4","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":"28141feacac1b13ebb35335f070e91c245e0d73b25091c40d928469b94da4975","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-02T14:06:59Z","title_canon_sha256":"ad1d184f1c1d6bcd39eff71fdc102cf777b3a823bac054d177032d0ad50679dc"},"schema_version":"1.0","source":{"id":"1110.0187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0187","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0187v1","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0187","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"WXHEFUZRR352","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WXHEFUZRR352ENKN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WXHEFUZR","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:ac2ddfa9ccc5bf37c17f3a81d678bc48cc058ab827155aaba73346d34cf0442e","target":"graph","created_at":"2026-05-18T02:21:35Z","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":"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","authors_text":"Minghui Jiang, Yong Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-02T14:06:59Z","title":"Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0187","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:c1ad749bde1718f26f57d5f49186003865f70e0695db9aff910d3f3baf3aa858","target":"record","created_at":"2026-05-18T02:21:35Z","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":"28141feacac1b13ebb35335f070e91c245e0d73b25091c40d928469b94da4975","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-02T14:06:59Z","title_canon_sha256":"ad1d184f1c1d6bcd39eff71fdc102cf777b3a823bac054d177032d0ad50679dc"},"schema_version":"1.0","source":{"id":"1110.0187","kind":"arxiv","version":1}},"canonical_sha256":"b5ce42d3318efba2354daeab6da0876f16ae10d62265d55d2603e77187373b1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5ce42d3318efba2354daeab6da0876f16ae10d62265d55d2603e77187373b1b","first_computed_at":"2026-05-18T02:21:35.616539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:35.616539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pmSW6Z8F4qkTS4HlFKDTh7izrUVnNMOsUvPC3h+2J1ekZvd4Y4mJD/7YMxigXqhGX5cVqI1PG7gu7ZrhVNMmDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:35.616991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1ad749bde1718f26f57d5f49186003865f70e0695db9aff910d3f3baf3aa858","sha256:ac2ddfa9ccc5bf37c17f3a81d678bc48cc058ab827155aaba73346d34cf0442e"],"state_sha256":"9d34435a178d3f1c3f84b11254359c9ab369836899b014258552197cb07e9f76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAz5ubsFOVEbbjhWAwL4D9plxW25/MNgOV44Tr32jo1+KGXdOzDr5P7CfouSpWWecnUOOBLjcdfR6UxE0T6sDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:36:43.444577Z","bundle_sha256":"5d5dcd393c1436baa85ac2521205e865a91f351b3a3be375ada9d7048436af95"}}