{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CKMRL54HHE32BNQRVWTVIQ4OPA","short_pith_number":"pith:CKMRL54H","schema_version":"1.0","canonical_sha256":"129915f7873937a0b611ada754438e782428af4b07caa1ea355e7c8037e2a1a9","source":{"kind":"arxiv","id":"1702.01836","version":1},"attestation_state":"computed","paper":{"title":"Linear Time Approximation Schemes for Geometric Maximum Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bowei Zhang, Haitao Wang, Jian Li, Kai Jin, Ningye Zhang","submitted_at":"2017-02-07T01:11:38Z","abstract_excerpt":"We study approximation algorithms for the following geometric version of the maximum coverage problem: Let $\\mathcal{P}$ be a set of $n$ weighted points in the plane. Let $D$ represent a planar object, such as a rectangle, or a disk. We want to place $m$ copies of $D$ such that the sum of the weights of the points in $\\mathcal{P}$ covered by these copies is maximized. For any fixed $\\varepsilon>0$, we present efficient approximation schemes that can find a $(1-\\varepsilon)$-approximation to the optimal solution. In particular, for $m=1$ and for the special case where $D$ is a rectangle, our al"},"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":"1702.01836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-07T01:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"a50986ebc38ca3c8e8181698597403762053e1df9ffcb42c2ed4f941f499492b","abstract_canon_sha256":"86abc209ea473ea287ce19c6de09dce2bb772ae0e1ecaa4de459721f9337234a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:35.719370Z","signature_b64":"4SXV827Yy5Dp6KW3kGh2Ya0hCUXaMtaylOKWBYer1kspRupCntMQWmyGt8UsE6Eg6TttzAN88Vx30kuw3a3UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"129915f7873937a0b611ada754438e782428af4b07caa1ea355e7c8037e2a1a9","last_reissued_at":"2026-05-18T00:28:35.718741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:35.718741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time Approximation Schemes for Geometric Maximum Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bowei Zhang, Haitao Wang, Jian Li, Kai Jin, Ningye Zhang","submitted_at":"2017-02-07T01:11:38Z","abstract_excerpt":"We study approximation algorithms for the following geometric version of the maximum coverage problem: Let $\\mathcal{P}$ be a set of $n$ weighted points in the plane. Let $D$ represent a planar object, such as a rectangle, or a disk. We want to place $m$ copies of $D$ such that the sum of the weights of the points in $\\mathcal{P}$ covered by these copies is maximized. For any fixed $\\varepsilon>0$, we present efficient approximation schemes that can find a $(1-\\varepsilon)$-approximation to the optimal solution. In particular, for $m=1$ and for the special case where $D$ is a rectangle, our al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01836","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":"1702.01836","created_at":"2026-05-18T00:28:35.718833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01836v1","created_at":"2026-05-18T00:28:35.718833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01836","created_at":"2026-05-18T00:28:35.718833+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKMRL54HHE32","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKMRL54HHE32BNQR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKMRL54H","created_at":"2026-05-18T12:31:10.602751+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/CKMRL54HHE32BNQRVWTVIQ4OPA","json":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA.json","graph_json":"https://pith.science/api/pith-number/CKMRL54HHE32BNQRVWTVIQ4OPA/graph.json","events_json":"https://pith.science/api/pith-number/CKMRL54HHE32BNQRVWTVIQ4OPA/events.json","paper":"https://pith.science/paper/CKMRL54H"},"agent_actions":{"view_html":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA","download_json":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA.json","view_paper":"https://pith.science/paper/CKMRL54H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01836&json=true","fetch_graph":"https://pith.science/api/pith-number/CKMRL54HHE32BNQRVWTVIQ4OPA/graph.json","fetch_events":"https://pith.science/api/pith-number/CKMRL54HHE32BNQRVWTVIQ4OPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/action/storage_attestation","attest_author":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/action/author_attestation","sign_citation":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/action/citation_signature","submit_replication":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/action/replication_record"}},"created_at":"2026-05-18T00:28:35.718833+00:00","updated_at":"2026-05-18T00:28:35.718833+00:00"}