{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HFWUQBMGQ2NCRRB2NON6DA6FTS","short_pith_number":"pith:HFWUQBMG","schema_version":"1.0","canonical_sha256":"396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc","source":{"kind":"arxiv","id":"2306.03640","version":1},"attestation_state":"computed","paper":{"title":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"D\\'aniel Marx, Daniel Neuen, Fionn Mc Inerney, Govind S. Sankar, Jacob Focke, Philipp Schepper, Philip Wellnitz","submitted_at":"2023-05-26T09:26:10Z","abstract_excerpt":"For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets $\\sigma,\\rho$ of non-negative integers, a $(\\sigma,\\rho)$-set of a graph $G$ is a set $S$ of vertices such that $|N(u)\\cap S|\\in \\sigma$ for every $u\\in S$, and $|N(v)\\cap S|\\in \\rho$ for every $v\\not\\in S$. The problem of finding a $(\\sigma,\\rho)$-set (of a certain size) unifies common problems like $\\text{Independent Set}$, $\\text{Dominating Set}$, $\\text{Independent Dominating Set}$, and many others.\n  In an accompanying paper, it is p"},"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":"2306.03640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-05-26T09:26:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b0c77878508725a6f53c131e19f837332188f6e4610991e87ab90c0b7c663f2e","abstract_canon_sha256":"328b04b6b418ea5771b820fbff4e8a8d9a2ffc80e6d2af9947e0c1c0c6c0db64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:00.553449Z","signature_b64":"HpR5mk3/N2/WwHO6aT53RG5HvAQFQ2kdWGZwVzfeFl+I/2Vl3JasR0H63R5bbzH6DclOxBkE4oUWrLMd71G/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc","last_reissued_at":"2026-07-05T06:18:00.552960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:00.552960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"D\\'aniel Marx, Daniel Neuen, Fionn Mc Inerney, Govind S. Sankar, Jacob Focke, Philipp Schepper, Philip Wellnitz","submitted_at":"2023-05-26T09:26:10Z","abstract_excerpt":"For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets $\\sigma,\\rho$ of non-negative integers, a $(\\sigma,\\rho)$-set of a graph $G$ is a set $S$ of vertices such that $|N(u)\\cap S|\\in \\sigma$ for every $u\\in S$, and $|N(v)\\cap S|\\in \\rho$ for every $v\\not\\in S$. The problem of finding a $(\\sigma,\\rho)$-set (of a certain size) unifies common problems like $\\text{Independent Set}$, $\\text{Dominating Set}$, $\\text{Independent Dominating Set}$, and many others.\n  In an accompanying paper, it is p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.03640","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/2306.03640/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":"2306.03640","created_at":"2026-07-05T06:18:00.553020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.03640v1","created_at":"2026-07-05T06:18:00.553020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03640","created_at":"2026-07-05T06:18:00.553020+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFWUQBMGQ2NC","created_at":"2026-07-05T06:18:00.553020+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFWUQBMGQ2NCRRB2","created_at":"2026-07-05T06:18:00.553020+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFWUQBMG","created_at":"2026-07-05T06:18:00.553020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS","json":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS.json","graph_json":"https://pith.science/api/pith-number/HFWUQBMGQ2NCRRB2NON6DA6FTS/graph.json","events_json":"https://pith.science/api/pith-number/HFWUQBMGQ2NCRRB2NON6DA6FTS/events.json","paper":"https://pith.science/paper/HFWUQBMG"},"agent_actions":{"view_html":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS","download_json":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS.json","view_paper":"https://pith.science/paper/HFWUQBMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.03640&json=true","fetch_graph":"https://pith.science/api/pith-number/HFWUQBMGQ2NCRRB2NON6DA6FTS/graph.json","fetch_events":"https://pith.science/api/pith-number/HFWUQBMGQ2NCRRB2NON6DA6FTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/action/storage_attestation","attest_author":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/action/author_attestation","sign_citation":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/action/citation_signature","submit_replication":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/action/replication_record"}},"created_at":"2026-07-05T06:18:00.553020+00:00","updated_at":"2026-07-05T06:18:00.553020+00:00"}