{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QNFIXI5K3GNP55THGNQU6QARDV","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":"e4a2dd73ee72f76eb82b6cd810ade9517b42e9bbd644304cdd787873e8ab965b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-10-12T16:13:59Z","title_canon_sha256":"82886d4e75827a32917b30ac6f9916f3fe3a31614497a79929fab90524211822"},"schema_version":"1.0","source":{"id":"1910.05589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.05589","created_at":"2026-07-05T00:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1910.05589v1","created_at":"2026-07-05T00:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05589","created_at":"2026-07-05T00:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"QNFIXI5K3GNP","created_at":"2026-07-05T00:11:40Z"},{"alias_kind":"pith_short_16","alias_value":"QNFIXI5K3GNP55TH","created_at":"2026-07-05T00:11:40Z"},{"alias_kind":"pith_short_8","alias_value":"QNFIXI5K","created_at":"2026-07-05T00:11:40Z"}],"graph_snapshots":[{"event_id":"sha256:7f3545d0b2bf24626a39bd31f1c6b3bf263f4ca7bafd787dccb54e687e1225b9","target":"graph","created_at":"2026-07-05T00:11:40Z","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/1910.05589/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of known results for Independent Set, of which the problem is a generalization.\n  Specifically, we show:\n  - A lower bound of $\\Delta^{\\lfloor d/2\\rfloor-\\epsilon}$ on the approximation ratio of any polynomial-time algorithm for graphs of maximum degree $\\Delta$ and an improved upper bound of $O(\\Delta^{\\lfloor d/2\\rfloor})$ on the approximation ratio of any greedy","authors_text":"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-10-12T16:13:59Z","title":"Improved (In-)Approximability Bounds for d-Scattered Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05589","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:66d58d683200597e424dea5fe1840e28562a250f570a79d297705679531b533a","target":"record","created_at":"2026-07-05T00:11:40Z","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":"e4a2dd73ee72f76eb82b6cd810ade9517b42e9bbd644304cdd787873e8ab965b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-10-12T16:13:59Z","title_canon_sha256":"82886d4e75827a32917b30ac6f9916f3fe3a31614497a79929fab90524211822"},"schema_version":"1.0","source":{"id":"1910.05589","kind":"arxiv","version":1}},"canonical_sha256":"834a8ba3aad99afef66733614f40111d6185e0a5c905530b0fa1e7576f3ef7b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"834a8ba3aad99afef66733614f40111d6185e0a5c905530b0fa1e7576f3ef7b8","first_computed_at":"2026-07-05T00:11:40.067036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:11:40.067036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bYZg3HgvaOp417+ZXCfwM5m1J1+MzKC35I0WjBNCLOUVogKSWytoOUVLG7deUHBk6Sonv15SB1wxuv0m9TzOAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:11:40.067434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.05589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66d58d683200597e424dea5fe1840e28562a250f570a79d297705679531b533a","sha256:7f3545d0b2bf24626a39bd31f1c6b3bf263f4ca7bafd787dccb54e687e1225b9"],"state_sha256":"e2b79eb1b8a73fa0fbd6fa318050315ac3293136cbf2e6c51316f4700ed6bd46"}