{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OAG3KDK3MJV54GVGLAS54CESGU","short_pith_number":"pith:OAG3KDK3","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"},"canonical_sha256":"700db50d5b626bde1aa65825de0892353abb9bf0351695991eed7f991681ff9a","source":{"kind":"arxiv","id":"2312.14593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14593","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14593v1","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14593","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"OAG3KDK3MJV5","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_16","alias_value":"OAG3KDK3MJV54GVG","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_8","alias_value":"OAG3KDK3","created_at":"2026-07-05T07:27:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OAG3KDK3MJV54GVGLAS54CESGU","target":"record","payload":{"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"},"canonical_sha256":"700db50d5b626bde1aa65825de0892353abb9bf0351695991eed7f991681ff9a","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"},"source_kind":"arxiv","source_id":"2312.14593","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-07-05T07:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npXdkBM1bhF6p+DnIeUh0Bj03YbIjfgAq64PrHYSzsp2ZJu9QMiqxPi+yBIqiQbYsH0RXvjSRWPvawOXtzIkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:37:26.477941Z"},"content_sha256":"6c5cee84394cc5d59a76d0708dce54c52b50ebcad35815c80ea059d16f9c55bf","schema_version":"1.0","event_id":"sha256:6c5cee84394cc5d59a76d0708dce54c52b50ebcad35815c80ea059d16f9c55bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OAG3KDK3MJV54GVGLAS54CESGU","target":"graph","payload":{"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"},"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-07-05T07:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0v9K2DzTm4GjxX7bvcdKacUfP8K8MGJoT9pqEOetzsb7hbNG2phJhvCahv0QILOejRqY3HEw8pUsiIhDOpR5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:37:26.478479Z"},"content_sha256":"6863d0778587b399abfa5e75628f1ba337cfad90f9c58cb10d3467bb81366aac","schema_version":"1.0","event_id":"sha256:6863d0778587b399abfa5e75628f1ba337cfad90f9c58cb10d3467bb81366aac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/bundle.json","state_url":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAG3KDK3MJV54GVGLAS54CESGU/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-08-19T06:37:26Z","links":{"resolver":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU","bundle":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/bundle.json","state":"https://pith.science/pith/OAG3KDK3MJV54GVGLAS54CESGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAG3KDK3MJV54GVGLAS54CESGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OAG3KDK3MJV54GVGLAS54CESGU","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":"b0f2ded0baf6eac7cf28031083dedeb6360051878f10c45a4afd67525c9d1410","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-22T10:33:51Z","title_canon_sha256":"2fb3146d163df3d3e973e962cb4ae94c59c3de1708ff1774638c7eab9ab5962b"},"schema_version":"1.0","source":{"id":"2312.14593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.14593","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"2312.14593v1","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14593","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"OAG3KDK3MJV5","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_16","alias_value":"OAG3KDK3MJV54GVG","created_at":"2026-07-05T07:27:17Z"},{"alias_kind":"pith_short_8","alias_value":"OAG3KDK3","created_at":"2026-07-05T07:27:17Z"}],"graph_snapshots":[{"event_id":"sha256:6863d0778587b399abfa5e75628f1ba337cfad90f9c58cb10d3467bb81366aac","target":"graph","created_at":"2026-07-05T07:27: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.14593/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Marvin K\\\"unnemann, Mirza Redzic, Nick Fischer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-22T10:33:51Z","title":"The Effect of Sparsity on $k$-Dominating Set and Related First-Order Graph Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14593","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:6c5cee84394cc5d59a76d0708dce54c52b50ebcad35815c80ea059d16f9c55bf","target":"record","created_at":"2026-07-05T07:27: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":"b0f2ded0baf6eac7cf28031083dedeb6360051878f10c45a4afd67525c9d1410","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-22T10:33:51Z","title_canon_sha256":"2fb3146d163df3d3e973e962cb4ae94c59c3de1708ff1774638c7eab9ab5962b"},"schema_version":"1.0","source":{"id":"2312.14593","kind":"arxiv","version":1}},"canonical_sha256":"700db50d5b626bde1aa65825de0892353abb9bf0351695991eed7f991681ff9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"700db50d5b626bde1aa65825de0892353abb9bf0351695991eed7f991681ff9a","first_computed_at":"2026-07-05T07:27:17.473643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:27:17.473643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nKS3VGs0l+jC+bgM+cfycK9ZPSflM8TKR5Xx8R/TMTjgnSbjWNqrJCs512XmhaCPGaWVvpm+g2DbvVuna5UTBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:27:17.474809Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.14593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c5cee84394cc5d59a76d0708dce54c52b50ebcad35815c80ea059d16f9c55bf","sha256:6863d0778587b399abfa5e75628f1ba337cfad90f9c58cb10d3467bb81366aac"],"state_sha256":"7f451cb87d0b3dd87f8e9edaaf9a02f66505d39bc930315a13d29511e5fc9d6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcZlzgtF8rmF9fN7EYQVrox0SMrW2iIGWE6OniMPTRCOqKMi/e7vVIH7flTd0SQ8y+EqOPFxOiKUVZZ6hyEhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T06:37:26.484282Z","bundle_sha256":"865faf7619cc6a72050854e4f367d22011b258924f98e15ec034d1c47df903bd"}}