{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FBRV4OH53GP3EXKEBSLFH4WVJN","short_pith_number":"pith:FBRV4OH5","schema_version":"1.0","canonical_sha256":"28635e38fdd99fb25d440c9653f2d54b768c0fceeee602e0464bd229a288e7e1","source":{"kind":"arxiv","id":"1906.09180","version":1},"attestation_state":"computed","paper":{"title":"Domination above r-independence: does sparseness help?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Einarson, Felix Reidl","submitted_at":"2019-06-21T15:04:16Z","abstract_excerpt":"Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound witness. Concretely, we consider being provided with a maximal r-independent set X (a set in which all vertices have pairwise distance at least r + 1) along the input graph G which, for r >= 2, lower-bounds the minimum size of any dominating set of G. In the spirit of gap-parameters, we consider a parametrisation by the size of the 'residual' set R := V (G) \\ N [X]. Our work aims to answer two questions: How does the"},"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":"1906.09180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-21T15:04:16Z","cross_cats_sorted":[],"title_canon_sha256":"28effd79802a5b0aa53ab00278787b1fd569c3233519f382ba87c5e38d8c9bf1","abstract_canon_sha256":"9588558be6f0c002eed4198d2ddda9d822f8c91373ea9cd07db26c44b2641783"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.266158Z","signature_b64":"BiZ4LgEUJ9bMf1C+zFxtPRLH4mLVOgpyhxg2kgB+qXgai9zE1jXY8ke10OGZn0Wnl3F2SUwXjFrBS1Jva0ZkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28635e38fdd99fb25d440c9653f2d54b768c0fceeee602e0464bd229a288e7e1","last_reissued_at":"2026-05-17T23:42:44.265539Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:44.265539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination above r-independence: does sparseness help?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Einarson, Felix Reidl","submitted_at":"2019-06-21T15:04:16Z","abstract_excerpt":"Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound witness. Concretely, we consider being provided with a maximal r-independent set X (a set in which all vertices have pairwise distance at least r + 1) along the input graph G which, for r >= 2, lower-bounds the minimum size of any dominating set of G. In the spirit of gap-parameters, we consider a parametrisation by the size of the 'residual' set R := V (G) \\ N [X]. Our work aims to answer two questions: How does the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09180","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":""},"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":"1906.09180","created_at":"2026-05-17T23:42:44.265641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09180v1","created_at":"2026-05-17T23:42:44.265641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09180","created_at":"2026-05-17T23:42:44.265641+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBRV4OH53GP3","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBRV4OH53GP3EXKE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBRV4OH5","created_at":"2026-05-18T12:33:15.570797+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/FBRV4OH53GP3EXKEBSLFH4WVJN","json":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN.json","graph_json":"https://pith.science/api/pith-number/FBRV4OH53GP3EXKEBSLFH4WVJN/graph.json","events_json":"https://pith.science/api/pith-number/FBRV4OH53GP3EXKEBSLFH4WVJN/events.json","paper":"https://pith.science/paper/FBRV4OH5"},"agent_actions":{"view_html":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN","download_json":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN.json","view_paper":"https://pith.science/paper/FBRV4OH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09180&json=true","fetch_graph":"https://pith.science/api/pith-number/FBRV4OH53GP3EXKEBSLFH4WVJN/graph.json","fetch_events":"https://pith.science/api/pith-number/FBRV4OH53GP3EXKEBSLFH4WVJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN/action/storage_attestation","attest_author":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN/action/author_attestation","sign_citation":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN/action/citation_signature","submit_replication":"https://pith.science/pith/FBRV4OH53GP3EXKEBSLFH4WVJN/action/replication_record"}},"created_at":"2026-05-17T23:42:44.265641+00:00","updated_at":"2026-05-17T23:42:44.265641+00:00"}