{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WUXGXS6TGRWF6AL45XP2PVCLQT","short_pith_number":"pith:WUXGXS6T","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"},"canonical_sha256":"b52e6bcbd3346c5f017ceddfa7d44b84dadef93cabc1fa10409b374931580a62","source":{"kind":"arxiv","id":"1709.02180","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02180","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02180v4","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02180","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"WUXGXS6TGRWF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WUXGXS6TGRWF6AL4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WUXGXS6T","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WUXGXS6TGRWF6AL45XP2PVCLQT","target":"record","payload":{"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"},"canonical_sha256":"b52e6bcbd3346c5f017ceddfa7d44b84dadef93cabc1fa10409b374931580a62","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"},"source_kind":"arxiv","source_id":"1709.02180","source_version":4,"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-05-18T00:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZv8sMj45EDHEepiFop6tIxCciZp3XapvLFFEF+ZP1SMrMIArNR2VEIKlkXenDMrg+xmaWIAxpQaFDE9/fy3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:30:37.478659Z"},"content_sha256":"eeaa2d284f91a7da5493f42ecf2b826f413bee450d64e52fcbaa72477052592b","schema_version":"1.0","event_id":"sha256:eeaa2d284f91a7da5493f42ecf2b826f413bee450d64e52fcbaa72477052592b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WUXGXS6TGRWF6AL45XP2PVCLQT","target":"graph","payload":{"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"},"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-05-18T00:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vu2/D0Ywwz0HVKILMckbwEZnX8HtFeIT+B1WD5KZXdOZ+synbZCOf3qByIOnM1P5zSrbLBVXb4wazUmU0/kRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:30:37.479295Z"},"content_sha256":"09cd385de79e03841de11df64b22583387deb0203075d802078ec18c82bd6eb1","schema_version":"1.0","event_id":"sha256:09cd385de79e03841de11df64b22583387deb0203075d802078ec18c82bd6eb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/bundle.json","state_url":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/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-05-21T17:30:37Z","links":{"resolver":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT","bundle":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/bundle.json","state":"https://pith.science/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUXGXS6TGRWF6AL45XP2PVCLQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WUXGXS6TGRWF6AL45XP2PVCLQT","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":"0f97c3caaa139d5a41d00ba08f3567882001ca1405268c344ead3e2ce0275817","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T10:54:30Z","title_canon_sha256":"d60cd728b700ab128bf2c4b0d19571c03200938925e828fa7356ebbb013441e8"},"schema_version":"1.0","source":{"id":"1709.02180","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02180","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02180v4","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02180","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"WUXGXS6TGRWF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WUXGXS6TGRWF6AL4","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WUXGXS6T","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:09cd385de79e03841de11df64b22583387deb0203075d802078ec18c82bd6eb1","target":"graph","created_at":"2026-05-18T00:01:10Z","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"},"paper":{"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 ","authors_text":"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T10:54:30Z","title":"Structurally Parameterized d-Scattered Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02180","kind":"arxiv","version":4},"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:eeaa2d284f91a7da5493f42ecf2b826f413bee450d64e52fcbaa72477052592b","target":"record","created_at":"2026-05-18T00:01:10Z","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":"0f97c3caaa139d5a41d00ba08f3567882001ca1405268c344ead3e2ce0275817","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-07T10:54:30Z","title_canon_sha256":"d60cd728b700ab128bf2c4b0d19571c03200938925e828fa7356ebbb013441e8"},"schema_version":"1.0","source":{"id":"1709.02180","kind":"arxiv","version":4}},"canonical_sha256":"b52e6bcbd3346c5f017ceddfa7d44b84dadef93cabc1fa10409b374931580a62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b52e6bcbd3346c5f017ceddfa7d44b84dadef93cabc1fa10409b374931580a62","first_computed_at":"2026-05-18T00:01:10.238113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:10.238113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1kec03nf2wbw6XnN+HNyoCN3EXuA9jrJjZxx6qMP0FMdHBIvE7IzG8BPPCWIenfLWvRRDl7uccu2hkc3gpsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:10.238856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02180","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeaa2d284f91a7da5493f42ecf2b826f413bee450d64e52fcbaa72477052592b","sha256:09cd385de79e03841de11df64b22583387deb0203075d802078ec18c82bd6eb1"],"state_sha256":"3d9dac244ff0c4a07d61ee98b49548924cfc384294880d5182802762fe834c9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3m6WCtro+q0wsSaTTIjrRqivB3oJiguQotooEvDZg/mTpm5mvECiijp5YW6oWWJO9w5V75MDGeJBq7cwi8vODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:30:37.482555Z","bundle_sha256":"fb15d89caa2684bf969c8a3ee32bd7f1398c0b04e449639620e1f898ff853ebb"}}