{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NKF3BRKVTNSEZNMVPNQA4EQLZR","short_pith_number":"pith:NKF3BRKV","canonical_record":{"source":{"id":"1011.6239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T14:28:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"44ec4e98c1628d1bda34c83372175144f4b70fe911371073206a576cab94c2a3","abstract_canon_sha256":"5958268b2aa4254490563c29701dcee2bb4c1ce0fdb8a7d0e3c70bb605b7b96e"},"schema_version":"1.0"},"canonical_sha256":"6a8bb0c5559b644cb5957b600e120bcc67656f7d4bd0ff65ddb2f03f78037130","source":{"kind":"arxiv","id":"1011.6239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6239","created_at":"2026-05-18T02:23:17Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6239v2","created_at":"2026-05-18T02:23:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6239","created_at":"2026-05-18T02:23:17Z"},{"alias_kind":"pith_short_12","alias_value":"NKF3BRKVTNSE","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NKF3BRKVTNSEZNMV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NKF3BRKV","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NKF3BRKVTNSEZNMVPNQA4EQLZR","target":"record","payload":{"canonical_record":{"source":{"id":"1011.6239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T14:28:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"44ec4e98c1628d1bda34c83372175144f4b70fe911371073206a576cab94c2a3","abstract_canon_sha256":"5958268b2aa4254490563c29701dcee2bb4c1ce0fdb8a7d0e3c70bb605b7b96e"},"schema_version":"1.0"},"canonical_sha256":"6a8bb0c5559b644cb5957b600e120bcc67656f7d4bd0ff65ddb2f03f78037130","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:17.263562Z","signature_b64":"Gy3eZHFEzaf3hNFHjJ2+kS5eDzD9j8KMouNCver6QfuqayAvSDe5yn6aRDUNcXABicuo7jIqy6aP+D3iffOnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a8bb0c5559b644cb5957b600e120bcc67656f7d4bd0ff65ddb2f03f78037130","last_reissued_at":"2026-05-18T02:23:17.262825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:17.262825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.6239","source_version":2,"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:23:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3hGpKupq5Tt8xDvuJ+1qvphBVq3dYbqh8EAZd/7XQW8w28u421679oMh87xMIPm91AviWAykJk9RtA4qI7fBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:39:00.892008Z"},"content_sha256":"9bf528acaa4fa1e48cbb3c91f9abdf836e0116d38e06d151c072b55d21e66f92","schema_version":"1.0","event_id":"sha256:9bf528acaa4fa1e48cbb3c91f9abdf836e0116d38e06d151c072b55d21e66f92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NKF3BRKVTNSEZNMVPNQA4EQLZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dominating Set is Fixed Parameter Tractable in Claw-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Geevarghese Philip, Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2010-11-29T14:28:40Z","abstract_excerpt":"We show that the dominating set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K(1,3)), the complete bipartite graph on four vertices where the two parts have one and three vertices, respectively) as an induced subgraph. We present an algorithm that uses 2^O(k^2)n^O(1) time and polynomial space to decide whether a claw-free graph on n vertices has a dominating set of size at most k. Note that this parameterization of dominating set is W[2]-hard on the set of all graphs, and thus is unlikely to have an FPT algorithm for graphs i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6239","kind":"arxiv","version":2},"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:23:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BSbKqRAEpC+aVWrx0snSD+d5H3ChrzEW5CzHXwdwwAYE0B7nwthyY3bjrB0vWDRrhmK2/yfndIcbY8flLHuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:39:00.892384Z"},"content_sha256":"e13faf79e4054985beab9df26b3095d02cc43f42ee798606f71aae68145af760","schema_version":"1.0","event_id":"sha256:e13faf79e4054985beab9df26b3095d02cc43f42ee798606f71aae68145af760"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKF3BRKVTNSEZNMVPNQA4EQLZR/bundle.json","state_url":"https://pith.science/pith/NKF3BRKVTNSEZNMVPNQA4EQLZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKF3BRKVTNSEZNMVPNQA4EQLZR/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-19T10:39:00Z","links":{"resolver":"https://pith.science/pith/NKF3BRKVTNSEZNMVPNQA4EQLZR","bundle":"https://pith.science/pith/NKF3BRKVTNSEZNMVPNQA4EQLZR/bundle.json","state":"https://pith.science/pith/NKF3BRKVTNSEZNMVPNQA4EQLZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKF3BRKVTNSEZNMVPNQA4EQLZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NKF3BRKVTNSEZNMVPNQA4EQLZR","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":"5958268b2aa4254490563c29701dcee2bb4c1ce0fdb8a7d0e3c70bb605b7b96e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T14:28:40Z","title_canon_sha256":"44ec4e98c1628d1bda34c83372175144f4b70fe911371073206a576cab94c2a3"},"schema_version":"1.0","source":{"id":"1011.6239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6239","created_at":"2026-05-18T02:23:17Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6239v2","created_at":"2026-05-18T02:23:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6239","created_at":"2026-05-18T02:23:17Z"},{"alias_kind":"pith_short_12","alias_value":"NKF3BRKVTNSE","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NKF3BRKVTNSEZNMV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NKF3BRKV","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:e13faf79e4054985beab9df26b3095d02cc43f42ee798606f71aae68145af760","target":"graph","created_at":"2026-05-18T02:23:17Z","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 dominating set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K(1,3)), the complete bipartite graph on four vertices where the two parts have one and three vertices, respectively) as an induced subgraph. We present an algorithm that uses 2^O(k^2)n^O(1) time and polynomial space to decide whether a claw-free graph on n vertices has a dominating set of size at most k. Note that this parameterization of dominating set is W[2]-hard on the set of all graphs, and thus is unlikely to have an FPT algorithm for graphs i","authors_text":"Geevarghese Philip, Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T14:28:40Z","title":"Dominating Set is Fixed Parameter Tractable in Claw-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6239","kind":"arxiv","version":2},"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:9bf528acaa4fa1e48cbb3c91f9abdf836e0116d38e06d151c072b55d21e66f92","target":"record","created_at":"2026-05-18T02:23:17Z","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":"5958268b2aa4254490563c29701dcee2bb4c1ce0fdb8a7d0e3c70bb605b7b96e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T14:28:40Z","title_canon_sha256":"44ec4e98c1628d1bda34c83372175144f4b70fe911371073206a576cab94c2a3"},"schema_version":"1.0","source":{"id":"1011.6239","kind":"arxiv","version":2}},"canonical_sha256":"6a8bb0c5559b644cb5957b600e120bcc67656f7d4bd0ff65ddb2f03f78037130","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a8bb0c5559b644cb5957b600e120bcc67656f7d4bd0ff65ddb2f03f78037130","first_computed_at":"2026-05-18T02:23:17.262825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:17.262825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gy3eZHFEzaf3hNFHjJ2+kS5eDzD9j8KMouNCver6QfuqayAvSDe5yn6aRDUNcXABicuo7jIqy6aP+D3iffOnCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:17.263562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.6239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bf528acaa4fa1e48cbb3c91f9abdf836e0116d38e06d151c072b55d21e66f92","sha256:e13faf79e4054985beab9df26b3095d02cc43f42ee798606f71aae68145af760"],"state_sha256":"07049187f1a2ace29c638096c604062a9225c42b7da68878b6f80421ecdca790"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLf0VoOvNcVQuyn/k0/AoY+d0Q+rRPnMaxVahPh0Izu7XS0Nhvcqqt+6ro8DVUhYjJ1YEymB70Zx33ntPnGFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T10:39:00.894043Z","bundle_sha256":"12e38a91bbc26ec8fc5159f8881b1df85074ee8b30f77df43b05f0377ce5b055"}}