{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XPR5VRCVLDD2G6BUOHHVPQMNQ7","short_pith_number":"pith:XPR5VRCV","schema_version":"1.0","canonical_sha256":"bbe3dac45558c7a3783471cf57c18d87ea8e5e05ee8b7d31d31578059c70c323","source":{"kind":"arxiv","id":"1607.06665","version":3},"attestation_state":"computed","paper":{"title":"Approximation Schemes for Geometric Coverage Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alexander Ravsky, Joachim Spoerhase, Minati De, Steven Chaplick","submitted_at":"2016-07-22T13:02:16Z","abstract_excerpt":"In their seminal work, Mustafa and Ray (2009) showed that a wide class of geometric set cover (SC) problems admit a PTAS via local search -- this is one of the most general approaches known for such problems. Their result applies if a naturally defined \"exchange graph\" for two feasible solutions is planar and is based on subdividing this graph via a planar separator theorem due to Frederickson (1987). Obtaining similar results for the related maximum k-coverage problem (MC) seems non-trivial due to the hard cardinality constraint. In fact, while Badanidiyuru, Kleinberg, and Lee (2012) have sho"},"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":"1607.06665","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-22T13:02:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"835bd1c47b3839bbef778676549f6b4c8187907315c8eee9cba70cb9a94b1222","abstract_canon_sha256":"f6f02c836ac8c2436b233300f3ea625a9d00f9ff8110f5fe5047389fc0a9b520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:09.606281Z","signature_b64":"3pt2HnNJsupEkgVXRFooH/9Mmo7equsntqij7GdVzdUu+/oQbPl6ByoIznGkzT4GYFxRkJk4SMcJ91Ec/jaSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbe3dac45558c7a3783471cf57c18d87ea8e5e05ee8b7d31d31578059c70c323","last_reissued_at":"2026-05-18T00:50:09.605660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:09.605660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Schemes for Geometric Coverage Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alexander Ravsky, Joachim Spoerhase, Minati De, Steven Chaplick","submitted_at":"2016-07-22T13:02:16Z","abstract_excerpt":"In their seminal work, Mustafa and Ray (2009) showed that a wide class of geometric set cover (SC) problems admit a PTAS via local search -- this is one of the most general approaches known for such problems. Their result applies if a naturally defined \"exchange graph\" for two feasible solutions is planar and is based on subdividing this graph via a planar separator theorem due to Frederickson (1987). Obtaining similar results for the related maximum k-coverage problem (MC) seems non-trivial due to the hard cardinality constraint. In fact, while Badanidiyuru, Kleinberg, and Lee (2012) have sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06665","kind":"arxiv","version":3},"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":"1607.06665","created_at":"2026-05-18T00:50:09.605749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06665v3","created_at":"2026-05-18T00:50:09.605749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06665","created_at":"2026-05-18T00:50:09.605749+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPR5VRCVLDD2","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPR5VRCVLDD2G6BU","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPR5VRCV","created_at":"2026-05-18T12:30:51.357362+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/XPR5VRCVLDD2G6BUOHHVPQMNQ7","json":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7.json","graph_json":"https://pith.science/api/pith-number/XPR5VRCVLDD2G6BUOHHVPQMNQ7/graph.json","events_json":"https://pith.science/api/pith-number/XPR5VRCVLDD2G6BUOHHVPQMNQ7/events.json","paper":"https://pith.science/paper/XPR5VRCV"},"agent_actions":{"view_html":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7","download_json":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7.json","view_paper":"https://pith.science/paper/XPR5VRCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06665&json=true","fetch_graph":"https://pith.science/api/pith-number/XPR5VRCVLDD2G6BUOHHVPQMNQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/XPR5VRCVLDD2G6BUOHHVPQMNQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/action/storage_attestation","attest_author":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/action/author_attestation","sign_citation":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/action/citation_signature","submit_replication":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/action/replication_record"}},"created_at":"2026-05-18T00:50:09.605749+00:00","updated_at":"2026-05-18T00:50:09.605749+00:00"}