{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y7Q7XSJ5L7T3Z3TY7A677A5RVV","short_pith_number":"pith:Y7Q7XSJ5","schema_version":"1.0","canonical_sha256":"c7e1fbc93d5fe7bcee78f83dff83b1ad547382617ae07878c0a9d603437ac460","source":{"kind":"arxiv","id":"2403.07524","version":2},"attestation_state":"computed","paper":{"title":"Residue Domination in Bounded-Treewidth Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jakob Greilhuber, Philipp Schepper, Philip Wellnitz","submitted_at":"2024-03-12T11:01:43Z","abstract_excerpt":"For the vertex selection problem $(\\sigma,\\rho)$-DomSet one is given two fixed sets $\\sigma$ and $\\rho$ of integers and the task is to decide whether we can select vertices of the input graph such that, for every selected vertex, the number of selected neighbors is in $\\sigma$ and, for every unselected vertex, the number of selected neighbors is in $\\rho$ [Telle, Nord. J. Comp. 1994]. This framework covers many fundamental graph problems such as Independent Set and Dominating Set.\n  We significantly extend the recent result by Focke et al. [SODA 2023] to investigate the case when $\\sigma$ and "},"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":"2403.07524","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-12T11:01:43Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"04b39192a8ed978eaa449b27d8534c27c6ec1d4568800ef06da113c6206d1436","abstract_canon_sha256":"e41a42575a2e6e3ccecfd5986811d87e4b1ff257cbf2b3dc3250a8a18da7c7fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:46.762144Z","signature_b64":"uNxeHrjsiqpYvPheAVBPdcolJDmqWmtjENZTVJMzmx6Gt1JPatbkUcRzubBnLPnCLl1yFAk3AXsd7VMrwKtBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7e1fbc93d5fe7bcee78f83dff83b1ad547382617ae07878c0a9d603437ac460","last_reissued_at":"2026-07-05T10:59:46.761733Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:46.761733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Residue Domination in Bounded-Treewidth Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jakob Greilhuber, Philipp Schepper, Philip Wellnitz","submitted_at":"2024-03-12T11:01:43Z","abstract_excerpt":"For the vertex selection problem $(\\sigma,\\rho)$-DomSet one is given two fixed sets $\\sigma$ and $\\rho$ of integers and the task is to decide whether we can select vertices of the input graph such that, for every selected vertex, the number of selected neighbors is in $\\sigma$ and, for every unselected vertex, the number of selected neighbors is in $\\rho$ [Telle, Nord. J. Comp. 1994]. This framework covers many fundamental graph problems such as Independent Set and Dominating Set.\n  We significantly extend the recent result by Focke et al. [SODA 2023] to investigate the case when $\\sigma$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07524","kind":"arxiv","version":2},"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/2403.07524/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":"2403.07524","created_at":"2026-07-05T10:59:46.761787+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.07524v2","created_at":"2026-07-05T10:59:46.761787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07524","created_at":"2026-07-05T10:59:46.761787+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7Q7XSJ5L7T3","created_at":"2026-07-05T10:59:46.761787+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7Q7XSJ5L7T3Z3TY","created_at":"2026-07-05T10:59:46.761787+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7Q7XSJ5","created_at":"2026-07-05T10:59:46.761787+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/Y7Q7XSJ5L7T3Z3TY7A677A5RVV","json":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV.json","graph_json":"https://pith.science/api/pith-number/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/graph.json","events_json":"https://pith.science/api/pith-number/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/events.json","paper":"https://pith.science/paper/Y7Q7XSJ5"},"agent_actions":{"view_html":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV","download_json":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV.json","view_paper":"https://pith.science/paper/Y7Q7XSJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.07524&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/action/storage_attestation","attest_author":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/action/author_attestation","sign_citation":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/action/citation_signature","submit_replication":"https://pith.science/pith/Y7Q7XSJ5L7T3Z3TY7A677A5RVV/action/replication_record"}},"created_at":"2026-07-05T10:59:46.761787+00:00","updated_at":"2026-07-05T10:59:46.761787+00:00"}