{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WUXGXS6TGRWF6AL45XP2PVCLQT","short_pith_number":"pith:WUXGXS6T","schema_version":"1.0","canonical_sha256":"b52e6bcbd3346c5f017ceddfa7d44b84dadef93cabc1fa10409b374931580a62","source":{"kind":"arxiv","id":"1709.02180","version":4},"attestation_state":"computed","paper":{"title":"Structurally Parameterized d-Scattered Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2017-09-07T10:54:30Z","abstract_excerpt":"In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the complexity of this problem with respect to various standard graph parameters. In particular, we show the following:\n  - For any $d\\ge2$, an $O^*(d^{\\textrm{tw}})$-time algorithm, where $\\textrm{tw}$ is the treewidth of the input graph.\n  - A tight SETH-based lower bound matching this algorithm's performance. These generalize known results for Independent Set.\n "},"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":"1709.02180","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T10:54:30Z","cross_cats_sorted":[],"title_canon_sha256":"d60cd728b700ab128bf2c4b0d19571c03200938925e828fa7356ebbb013441e8","abstract_canon_sha256":"0f97c3caaa139d5a41d00ba08f3567882001ca1405268c344ead3e2ce0275817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:10.238856Z","signature_b64":"a1kec03nf2wbw6XnN+HNyoCN3EXuA9jrJjZxx6qMP0FMdHBIvE7IzG8BPPCWIenfLWvRRDl7uccu2hkc3gpsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b52e6bcbd3346c5f017ceddfa7d44b84dadef93cabc1fa10409b374931580a62","last_reissued_at":"2026-05-18T00:01:10.238113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:10.238113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structurally Parameterized d-Scattered Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2017-09-07T10:54:30Z","abstract_excerpt":"In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the complexity of this problem with respect to various standard graph parameters. In particular, we show the following:\n  - For any $d\\ge2$, an $O^*(d^{\\textrm{tw}})$-time algorithm, where $\\textrm{tw}$ is the treewidth of the input graph.\n  - A tight SETH-based lower bound matching this algorithm's performance. These generalize known results for Independent Set.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02180","kind":"arxiv","version":4},"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":"1709.02180","created_at":"2026-05-18T00:01:10.238244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02180v4","created_at":"2026-05-18T00:01:10.238244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02180","created_at":"2026-05-18T00:01:10.238244+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUXGXS6TGRWF","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUXGXS6TGRWF6AL4","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUXGXS6T","created_at":"2026-05-18T12:31:53.515858+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/WUXGXS6TGRWF6AL45XP2PVCLQT","json":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT.json","graph_json":"https://pith.science/api/pith-number/WUXGXS6TGRWF6AL45XP2PVCLQT/graph.json","events_json":"https://pith.science/api/pith-number/WUXGXS6TGRWF6AL45XP2PVCLQT/events.json","paper":"https://pith.science/paper/WUXGXS6T"},"agent_actions":{"view_html":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT","download_json":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT.json","view_paper":"https://pith.science/paper/WUXGXS6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02180&json=true","fetch_graph":"https://pith.science/api/pith-number/WUXGXS6TGRWF6AL45XP2PVCLQT/graph.json","fetch_events":"https://pith.science/api/pith-number/WUXGXS6TGRWF6AL45XP2PVCLQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/action/storage_attestation","attest_author":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/action/author_attestation","sign_citation":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/action/citation_signature","submit_replication":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/action/replication_record"}},"created_at":"2026-05-18T00:01:10.238244+00:00","updated_at":"2026-05-18T00:01:10.238244+00:00"}