{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HFWUQBMGQ2NCRRB2NON6DA6FTS","short_pith_number":"pith:HFWUQBMG","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"},"canonical_sha256":"396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc","source":{"kind":"arxiv","id":"2306.03640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.03640","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"2306.03640v1","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03640","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFWUQBMGQ2NC","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"pith_short_16","alias_value":"HFWUQBMGQ2NCRRB2","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"pith_short_8","alias_value":"HFWUQBMG","created_at":"2026-07-05T06:18:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HFWUQBMGQ2NCRRB2NON6DA6FTS","target":"record","payload":{"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"},"canonical_sha256":"396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc","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"},"source_kind":"arxiv","source_id":"2306.03640","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-05T06:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czR5WJruQFpgkAs7+dx+dGJeOrvsuggjcSuUHaC6xXbJvNE0APPshJ+XEdyM3m/cAYmyc4699TYE6Y7RgkFjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:23:11.931926Z"},"content_sha256":"2a339e00ffedc5b7a99396c877e8b5a4a5cc4335cbb26a3db2f5d2a0b4782c61","schema_version":"1.0","event_id":"sha256:2a339e00ffedc5b7a99396c877e8b5a4a5cc4335cbb26a3db2f5d2a0b4782c61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HFWUQBMGQ2NCRRB2NON6DA6FTS","target":"graph","payload":{"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"},"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-05T06:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUSrQrJ96aVpRZ28cEgh+AnhqhpcfsYSP7vJ/hVRZRXa/hXIgaMDrW1ZL62Ma+x8cKieVa++NQI+defgGfpMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:23:11.932453Z"},"content_sha256":"d51f1d825d4aa21ba5a6d678b5c345c0da10ceda00acc5d1fa1c517e91967f73","schema_version":"1.0","event_id":"sha256:d51f1d825d4aa21ba5a6d678b5c345c0da10ceda00acc5d1fa1c517e91967f73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/bundle.json","state_url":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/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-05T17:23:11Z","links":{"resolver":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS","bundle":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/bundle.json","state":"https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HFWUQBMGQ2NCRRB2NON6DA6FTS","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":"328b04b6b418ea5771b820fbff4e8a8d9a2ffc80e6d2af9947e0c1c0c6c0db64","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-05-26T09:26:10Z","title_canon_sha256":"b0c77878508725a6f53c131e19f837332188f6e4610991e87ab90c0b7c663f2e"},"schema_version":"1.0","source":{"id":"2306.03640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.03640","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"2306.03640v1","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03640","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFWUQBMGQ2NC","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"pith_short_16","alias_value":"HFWUQBMGQ2NCRRB2","created_at":"2026-07-05T06:18:00Z"},{"alias_kind":"pith_short_8","alias_value":"HFWUQBMG","created_at":"2026-07-05T06:18:00Z"}],"graph_snapshots":[{"event_id":"sha256:d51f1d825d4aa21ba5a6d678b5c345c0da10ceda00acc5d1fa1c517e91967f73","target":"graph","created_at":"2026-07-05T06:18:00Z","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/2306.03640/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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":"2023-05-26T09:26:10Z","title":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.03640","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:2a339e00ffedc5b7a99396c877e8b5a4a5cc4335cbb26a3db2f5d2a0b4782c61","target":"record","created_at":"2026-07-05T06:18:00Z","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":"328b04b6b418ea5771b820fbff4e8a8d9a2ffc80e6d2af9947e0c1c0c6c0db64","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-05-26T09:26:10Z","title_canon_sha256":"b0c77878508725a6f53c131e19f837332188f6e4610991e87ab90c0b7c663f2e"},"schema_version":"1.0","source":{"id":"2306.03640","kind":"arxiv","version":1}},"canonical_sha256":"396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc","first_computed_at":"2026-07-05T06:18:00.552960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:18:00.552960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HpR5mk3/N2/WwHO6aT53RG5HvAQFQ2kdWGZwVzfeFl+I/2Vl3JasR0H63R5bbzH6DclOxBkE4oUWrLMd71G/BA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:18:00.553449Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.03640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a339e00ffedc5b7a99396c877e8b5a4a5cc4335cbb26a3db2f5d2a0b4782c61","sha256:d51f1d825d4aa21ba5a6d678b5c345c0da10ceda00acc5d1fa1c517e91967f73"],"state_sha256":"b618d27bd1b8fd18cea4947cc63aa155be50e377e02dd8233e5557d3a73f5f52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0V2OFyArcjoz0K0ICaz1lOoZZNRZLF1RH6JMjs1pg1bS2peFReidZ38v6Gwm6zJKHSf3akagljOn/zwlh62CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T17:23:11.938290Z","bundle_sha256":"80310b9e42f3edb7c83aedcf5f23c547ecc8a78c7ce972dfd65df7d98dd183f1"}}