{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OAG3KDK3MJV54GVGLAS54CESGU","short_pith_number":"pith:OAG3KDK3","schema_version":"1.0","canonical_sha256":"700db50d5b626bde1aa65825de0892353abb9bf0351695991eed7f991681ff9a","source":{"kind":"arxiv","id":"2312.14593","version":1},"attestation_state":"computed","paper":{"title":"The Effect of Sparsity on $k$-Dominating Set and Related First-Order Graph Properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marvin K\\\"unnemann, Mirza Redzic, Nick Fischer","submitted_at":"2023-12-22T10:33:51Z","abstract_excerpt":"We revisit $k$-Dominating Set, one of the first problems for which a tight $n^k-o(1)$ conditional lower bound (for $k\\ge 3$), based on SETH, was shown (P\\u{a}tra\\c{s}cu and Williams, SODA 2007). However, the underlying reduction creates dense graphs, raising the question: how much does the sparsity of the graph affect its fine-grained complexity?\n  We first settle the fine-grained complexity of $k$-Dominating Set in terms of both the number of nodes $n$ and number of edges $m$. Specifically, we show an $mn^{k-2-o(1)}$ lower bound based on SETH, for any dependence of $m$ on $n$. This is complem"},"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":"2312.14593","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-22T10:33:51Z","cross_cats_sorted":[],"title_canon_sha256":"2fb3146d163df3d3e973e962cb4ae94c59c3de1708ff1774638c7eab9ab5962b","abstract_canon_sha256":"b0f2ded0baf6eac7cf28031083dedeb6360051878f10c45a4afd67525c9d1410"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:17.474809Z","signature_b64":"nKS3VGs0l+jC+bgM+cfycK9ZPSflM8TKR5Xx8R/TMTjgnSbjWNqrJCs512XmhaCPGaWVvpm+g2DbvVuna5UTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"700db50d5b626bde1aa65825de0892353abb9bf0351695991eed7f991681ff9a","last_reissued_at":"2026-07-05T07:27:17.473643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:17.473643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Effect of Sparsity on $k$-Dominating Set and Related First-Order Graph Properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marvin K\\\"unnemann, Mirza Redzic, Nick Fischer","submitted_at":"2023-12-22T10:33:51Z","abstract_excerpt":"We revisit $k$-Dominating Set, one of the first problems for which a tight $n^k-o(1)$ conditional lower bound (for $k\\ge 3$), based on SETH, was shown (P\\u{a}tra\\c{s}cu and Williams, SODA 2007). However, the underlying reduction creates dense graphs, raising the question: how much does the sparsity of the graph affect its fine-grained complexity?\n  We first settle the fine-grained complexity of $k$-Dominating Set in terms of both the number of nodes $n$ and number of edges $m$. Specifically, we show an $mn^{k-2-o(1)}$ lower bound based on SETH, for any dependence of $m$ on $n$. This is complem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14593","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/2312.14593/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":"2312.14593","created_at":"2026-07-05T07:27:17.474401+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.14593v1","created_at":"2026-07-05T07:27:17.474401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14593","created_at":"2026-07-05T07:27:17.474401+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAG3KDK3MJV5","created_at":"2026-07-05T07:27:17.474401+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAG3KDK3MJV54GVG","created_at":"2026-07-05T07:27:17.474401+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAG3KDK3","created_at":"2026-07-05T07:27:17.474401+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15671","citing_title":"Parameterized Complexity of (d,r)-Domination via Modular Decomposition","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU","json":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU.json","graph_json":"https://pith.science/api/pith-number/OAG3KDK3MJV54GVGLAS54CESGU/graph.json","events_json":"https://pith.science/api/pith-number/OAG3KDK3MJV54GVGLAS54CESGU/events.json","paper":"https://pith.science/paper/OAG3KDK3"},"agent_actions":{"view_html":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU","download_json":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU.json","view_paper":"https://pith.science/paper/OAG3KDK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.14593&json=true","fetch_graph":"https://pith.science/api/pith-number/OAG3KDK3MJV54GVGLAS54CESGU/graph.json","fetch_events":"https://pith.science/api/pith-number/OAG3KDK3MJV54GVGLAS54CESGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/action/storage_attestation","attest_author":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/action/author_attestation","sign_citation":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/action/citation_signature","submit_replication":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/action/replication_record"}},"created_at":"2026-07-05T07:27:17.474401+00:00","updated_at":"2026-07-05T07:27:17.474401+00:00"}