{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TAYWCSTVZM7D2QCRKU7V2OWBI4","short_pith_number":"pith:TAYWCSTV","schema_version":"1.0","canonical_sha256":"9831614a75cb3e3d4051553f5d3ac147377ff3e675ee2359333921dbc04e7d57","source":{"kind":"arxiv","id":"2405.10556","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashwin Jacob, Diptapriyo Majumdar, Dishant Goyal, Kaushtubh Kumar, Venkatesh Raman","submitted_at":"2024-05-17T05:47:26Z","abstract_excerpt":"We consider structural parameterizations of the fundamental Dominating Set problem and its variants in the parameter ecology program. We give improved FPT algorithms and lower bounds under well-known conjectures for dominating set in graphs that are k vertices away from a cluster graph or a split graph. These are graphs in which there is a set of k vertices (called the modulator) whose deletion results in a cluster graph or a split graph. We also call k as the deletion distance (to the appropriate class of graphs). When parameterized by the deletion distance k to cluster graphs - we can find a"},"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":"2405.10556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-17T05:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"576760e861e566cd3d3d81450e80e209b2d0577e4b228aebb23786910345be7a","abstract_canon_sha256":"fbb661d044120a2d2ea34ae567ed490e79137a193a8b15fe87ec8a6aa66d1230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:13.538225Z","signature_b64":"a68Ja5ujomWq/RoIssKLiHq3tCCezD72tcTH0r9oWGnjBdW25w8049y7hHGVppYZg2QX/38Cy6xaI/5v628kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9831614a75cb3e3d4051553f5d3ac147377ff3e675ee2359333921dbc04e7d57","last_reissued_at":"2026-07-05T08:20:13.537751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:13.537751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashwin Jacob, Diptapriyo Majumdar, Dishant Goyal, Kaushtubh Kumar, Venkatesh Raman","submitted_at":"2024-05-17T05:47:26Z","abstract_excerpt":"We consider structural parameterizations of the fundamental Dominating Set problem and its variants in the parameter ecology program. We give improved FPT algorithms and lower bounds under well-known conjectures for dominating set in graphs that are k vertices away from a cluster graph or a split graph. These are graphs in which there is a set of k vertices (called the modulator) whose deletion results in a cluster graph or a split graph. We also call k as the deletion distance (to the appropriate class of graphs). When parameterized by the deletion distance k to cluster graphs - we can find a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.10556","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.10556/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.10556","created_at":"2026-07-05T08:20:13.537803+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.10556v1","created_at":"2026-07-05T08:20:13.537803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.10556","created_at":"2026-07-05T08:20:13.537803+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAYWCSTVZM7D","created_at":"2026-07-05T08:20:13.537803+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAYWCSTVZM7D2QCR","created_at":"2026-07-05T08:20:13.537803+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAYWCSTV","created_at":"2026-07-05T08:20:13.537803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13141","citing_title":"(Independent) Roman Domination Parameterized by Distance to Cluster","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4","json":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4.json","graph_json":"https://pith.science/api/pith-number/TAYWCSTVZM7D2QCRKU7V2OWBI4/graph.json","events_json":"https://pith.science/api/pith-number/TAYWCSTVZM7D2QCRKU7V2OWBI4/events.json","paper":"https://pith.science/paper/TAYWCSTV"},"agent_actions":{"view_html":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4","download_json":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4.json","view_paper":"https://pith.science/paper/TAYWCSTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.10556&json=true","fetch_graph":"https://pith.science/api/pith-number/TAYWCSTVZM7D2QCRKU7V2OWBI4/graph.json","fetch_events":"https://pith.science/api/pith-number/TAYWCSTVZM7D2QCRKU7V2OWBI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4/action/storage_attestation","attest_author":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4/action/author_attestation","sign_citation":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4/action/citation_signature","submit_replication":"https://pith.science/pith/TAYWCSTVZM7D2QCRKU7V2OWBI4/action/replication_record"}},"created_at":"2026-07-05T08:20:13.537803+00:00","updated_at":"2026-07-05T08:20:13.537803+00:00"}