{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CKMRL54HHE32BNQRVWTVIQ4OPA","short_pith_number":"pith:CKMRL54H","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"},"canonical_sha256":"129915f7873937a0b611ada754438e782428af4b07caa1ea355e7c8037e2a1a9","source":{"kind":"arxiv","id":"1702.01836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01836","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01836v1","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01836","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"CKMRL54HHE32","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CKMRL54HHE32BNQR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CKMRL54H","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CKMRL54HHE32BNQRVWTVIQ4OPA","target":"record","payload":{"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"},"canonical_sha256":"129915f7873937a0b611ada754438e782428af4b07caa1ea355e7c8037e2a1a9","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"},"source_kind":"arxiv","source_id":"1702.01836","source_version":1,"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:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeHn+Wz+xQUmDW/TJYj1T3fYWvkVs3PAq7HwXjife0xg0KOvTS6r3RaT+te+hMRNqqEcFPNYSnCdwOxTeBbPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:25:53.271236Z"},"content_sha256":"6eb11862500490e654c0f0a227427b1ff17c22830183d3d685c597d6c1c5799c","schema_version":"1.0","event_id":"sha256:6eb11862500490e654c0f0a227427b1ff17c22830183d3d685c597d6c1c5799c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CKMRL54HHE32BNQRVWTVIQ4OPA","target":"graph","payload":{"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"},"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:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuANeQ2XB+bznzawZNynXgiY0fCLfjoaXaNa5jy7sqd5UtGGOs5Z0PEJNl/qNf1PzVtSHMRVq5r+jU2xZ9nlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:25:53.271907Z"},"content_sha256":"ebc8281a0728581785a9b3e26589f1cd7b81a8dbfa1d7864e9157db16f916b67","schema_version":"1.0","event_id":"sha256:ebc8281a0728581785a9b3e26589f1cd7b81a8dbfa1d7864e9157db16f916b67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/bundle.json","state_url":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/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-31T12:25:53Z","links":{"resolver":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA","bundle":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/bundle.json","state":"https://pith.science/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKMRL54HHE32BNQRVWTVIQ4OPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CKMRL54HHE32BNQRVWTVIQ4OPA","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":"86abc209ea473ea287ce19c6de09dce2bb772ae0e1ecaa4de459721f9337234a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-07T01:11:38Z","title_canon_sha256":"a50986ebc38ca3c8e8181698597403762053e1df9ffcb42c2ed4f941f499492b"},"schema_version":"1.0","source":{"id":"1702.01836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01836","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01836v1","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01836","created_at":"2026-05-18T00:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"CKMRL54HHE32","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CKMRL54HHE32BNQR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CKMRL54H","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:ebc8281a0728581785a9b3e26589f1cd7b81a8dbfa1d7864e9157db16f916b67","target":"graph","created_at":"2026-05-18T00:28:35Z","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":"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","authors_text":"Bowei Zhang, Haitao Wang, Jian Li, Kai Jin, Ningye Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-07T01:11:38Z","title":"Linear Time Approximation Schemes for Geometric Maximum Coverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01836","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:6eb11862500490e654c0f0a227427b1ff17c22830183d3d685c597d6c1c5799c","target":"record","created_at":"2026-05-18T00:28:35Z","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":"86abc209ea473ea287ce19c6de09dce2bb772ae0e1ecaa4de459721f9337234a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-07T01:11:38Z","title_canon_sha256":"a50986ebc38ca3c8e8181698597403762053e1df9ffcb42c2ed4f941f499492b"},"schema_version":"1.0","source":{"id":"1702.01836","kind":"arxiv","version":1}},"canonical_sha256":"129915f7873937a0b611ada754438e782428af4b07caa1ea355e7c8037e2a1a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"129915f7873937a0b611ada754438e782428af4b07caa1ea355e7c8037e2a1a9","first_computed_at":"2026-05-18T00:28:35.718741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:35.718741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4SXV827Yy5Dp6KW3kGh2Ya0hCUXaMtaylOKWBYer1kspRupCntMQWmyGt8UsE6Eg6TttzAN88Vx30kuw3a3UAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:35.719370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eb11862500490e654c0f0a227427b1ff17c22830183d3d685c597d6c1c5799c","sha256:ebc8281a0728581785a9b3e26589f1cd7b81a8dbfa1d7864e9157db16f916b67"],"state_sha256":"f069d53be868eb2562d32f7657e93de2d3f3c780acd9d8ae030415690eff984e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gszASKZz/c5Mr4KGSy8r1e0uoJyzcqea6oeWy+vjWKOkF2LKlou3NeWtxJ7iApnNQSfZX98+npWFG0XGxnb5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:25:53.275653Z","bundle_sha256":"31e32c5325fe7bc188b8fd9222996cbb06dd6a010f9f4006469fefa15f853069"}}