{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:6NS2QYLCOQPBR5WT4V5BOBZOYP","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":"0e340d65d6892505b3bc493768ea7d5f34357bce8e333c0f57e75b47e2f659e0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-08T14:36:12Z","title_canon_sha256":"2a939c8f08fb8cc60a609ed775c25919c231b83c74330bd9e4fef1956de56b91"},"schema_version":"1.0","source":{"id":"2211.04278","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04278","created_at":"2026-07-05T10:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04278v3","created_at":"2026-07-05T10:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04278","created_at":"2026-07-05T10:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"6NS2QYLCOQPB","created_at":"2026-07-05T10:51:03Z"},{"alias_kind":"pith_short_16","alias_value":"6NS2QYLCOQPBR5WT","created_at":"2026-07-05T10:51:03Z"},{"alias_kind":"pith_short_8","alias_value":"6NS2QYLC","created_at":"2026-07-05T10:51:03Z"}],"graph_snapshots":[{"event_id":"sha256:7cff58a5d2b9901bf2d4bba37a991415badd18fd27d9623e85b5b27abc777ce4","target":"graph","created_at":"2026-07-05T10:51:03Z","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/2211.04278/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate how efficiently a well-studied family of domination-type problems can be solved on bounded-treewidth graphs. 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 standard problems such as Independent Set, Dominating Set, Independent Dominating Set, and many others.\n  For all pairs of finite or cofinite sets $(\\sigma,\\rho)$, we determine (under st","authors_text":"D\\'aniel Marx, Daniel Neuen, Fionn Mc Inerney, Govind S. Sankar, Jacob Focke, Philipp Schepper, Philip Wellnitz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-08T14:36:12Z","title":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04278","kind":"arxiv","version":3},"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:8164c92f7894acacc979caf69e8dac451ea0c2cc4517ad73783aedb726c5bb3a","target":"record","created_at":"2026-07-05T10:51:03Z","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":"0e340d65d6892505b3bc493768ea7d5f34357bce8e333c0f57e75b47e2f659e0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-08T14:36:12Z","title_canon_sha256":"2a939c8f08fb8cc60a609ed775c25919c231b83c74330bd9e4fef1956de56b91"},"schema_version":"1.0","source":{"id":"2211.04278","kind":"arxiv","version":3}},"canonical_sha256":"f365a86162741e18f6d3e57a17072ec3e7363cf43efcc1f2fdd514316f13d7d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f365a86162741e18f6d3e57a17072ec3e7363cf43efcc1f2fdd514316f13d7d6","first_computed_at":"2026-07-05T10:51:03.044153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:51:03.044153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KH8A38RU4ipvfwuSRoxiaFiM/1CZQxjimiL50wVYSgM0dpvSDAn06TmJ6RSaizAeRtYzfkRX5dWP1YYqpaWsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:51:03.044670Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.04278","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8164c92f7894acacc979caf69e8dac451ea0c2cc4517ad73783aedb726c5bb3a","sha256:7cff58a5d2b9901bf2d4bba37a991415badd18fd27d9623e85b5b27abc777ce4"],"state_sha256":"da0f9ec44c1371ff4db809438e0e5ef366f58b02f4aae13d17da3fadbfb8466a"}