{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EKX26G462UA64IJZVSH4KZSZN6","short_pith_number":"pith:EKX26G46","canonical_record":{"source":{"id":"1505.02591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-11T12:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"a50986ebc38ca3c8e8181698597403762053e1df9ffcb42c2ed4f941f499492b","abstract_canon_sha256":"c31bedad5dd537e002e97dd0b767cf75a676dadeae1691d597f3a530f7b05757"},"schema_version":"1.0"},"canonical_sha256":"22afaf1b9ed501ee2139ac8fc566596fb435e76a6ea4e3f805a22ce825151b4e","source":{"kind":"arxiv","id":"1505.02591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02591","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02591v1","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02591","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"EKX26G462UA6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKX26G462UA64IJZ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKX26G46","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EKX26G462UA64IJZVSH4KZSZN6","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-11T12:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"a50986ebc38ca3c8e8181698597403762053e1df9ffcb42c2ed4f941f499492b","abstract_canon_sha256":"c31bedad5dd537e002e97dd0b767cf75a676dadeae1691d597f3a530f7b05757"},"schema_version":"1.0"},"canonical_sha256":"22afaf1b9ed501ee2139ac8fc566596fb435e76a6ea4e3f805a22ce825151b4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:12.201092Z","signature_b64":"p6RrAmbIZpPNMVUXWl8+uXNF24i58wlh08lPRwuzCuY+Gv/pTSQ7m0R2NuRw7rzcPSsEThBvLRYlufn4mSIHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22afaf1b9ed501ee2139ac8fc566596fb435e76a6ea4e3f805a22ce825151b4e","last_reissued_at":"2026-05-18T02:16:12.200574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:12.200574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02591","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-18T02:16:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSxk8WaWwRVDtiTAWAtkbmunvYQ84YGXunCG4JOjGINVlFP5A5E/Vs/Yv/RoU1tOAS31rZxLz2v3In2DcsgwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:44:39.457654Z"},"content_sha256":"2656545ea3d72c94f340921f54e1ab52479861c6a20f06b8e1931d6fd6c9c13d","schema_version":"1.0","event_id":"sha256:2656545ea3d72c94f340921f54e1ab52479861c6a20f06b8e1931d6fd6c9c13d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EKX26G462UA64IJZVSH4KZSZN6","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, Ningye Zhang","submitted_at":"2015-05-11T12:50:13Z","abstract_excerpt":"We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b rectangles such that the sum of the weights of the points in P covered by these rectangles is maximized.For any fixed > 0, we present efficient approximation schemes that can find (1-{\\epsilon})-approximation to the optimal solution.In particular, for m = 1, our algorithm runs in linear time O(n log( 1/{\\epsilon})), improving over the previous result. For m > 1, we present an algorithm that runs in O(n/{\\epsilon}log(1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02591","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-18T02:16:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+s3jJafVYOj1IatCtRaxJ/UahK6oRXegh1mQcnE9H4CZVxgJUuTAu7cWALK2kOfOCQfklA1JJ+d1/2x1igOlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:44:39.458259Z"},"content_sha256":"36f2fb87ed01f84859a2eee3f5f57719ba48b106796855732742d7a40e2a52cc","schema_version":"1.0","event_id":"sha256:36f2fb87ed01f84859a2eee3f5f57719ba48b106796855732742d7a40e2a52cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKX26G462UA64IJZVSH4KZSZN6/bundle.json","state_url":"https://pith.science/pith/EKX26G462UA64IJZVSH4KZSZN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKX26G462UA64IJZVSH4KZSZN6/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-06-07T21:44:39Z","links":{"resolver":"https://pith.science/pith/EKX26G462UA64IJZVSH4KZSZN6","bundle":"https://pith.science/pith/EKX26G462UA64IJZVSH4KZSZN6/bundle.json","state":"https://pith.science/pith/EKX26G462UA64IJZVSH4KZSZN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKX26G462UA64IJZVSH4KZSZN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EKX26G462UA64IJZVSH4KZSZN6","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":"c31bedad5dd537e002e97dd0b767cf75a676dadeae1691d597f3a530f7b05757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-11T12:50:13Z","title_canon_sha256":"a50986ebc38ca3c8e8181698597403762053e1df9ffcb42c2ed4f941f499492b"},"schema_version":"1.0","source":{"id":"1505.02591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02591","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02591v1","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02591","created_at":"2026-05-18T02:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"EKX26G462UA6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKX26G462UA64IJZ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKX26G46","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:36f2fb87ed01f84859a2eee3f5f57719ba48b106796855732742d7a40e2a52cc","target":"graph","created_at":"2026-05-18T02:16:12Z","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 P be a set of n weighted points in the plane. We want to place m a * b rectangles such that the sum of the weights of the points in P covered by these rectangles is maximized.For any fixed > 0, we present efficient approximation schemes that can find (1-{\\epsilon})-approximation to the optimal solution.In particular, for m = 1, our algorithm runs in linear time O(n log( 1/{\\epsilon})), improving over the previous result. For m > 1, we present an algorithm that runs in O(n/{\\epsilon}log(1/","authors_text":"Bowei Zhang, Haitao Wang, Jian Li, Ningye Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-11T12:50:13Z","title":"Linear Time Approximation Schemes for Geometric Maximum Coverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02591","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:2656545ea3d72c94f340921f54e1ab52479861c6a20f06b8e1931d6fd6c9c13d","target":"record","created_at":"2026-05-18T02:16:12Z","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":"c31bedad5dd537e002e97dd0b767cf75a676dadeae1691d597f3a530f7b05757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-11T12:50:13Z","title_canon_sha256":"a50986ebc38ca3c8e8181698597403762053e1df9ffcb42c2ed4f941f499492b"},"schema_version":"1.0","source":{"id":"1505.02591","kind":"arxiv","version":1}},"canonical_sha256":"22afaf1b9ed501ee2139ac8fc566596fb435e76a6ea4e3f805a22ce825151b4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22afaf1b9ed501ee2139ac8fc566596fb435e76a6ea4e3f805a22ce825151b4e","first_computed_at":"2026-05-18T02:16:12.200574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:12.200574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p6RrAmbIZpPNMVUXWl8+uXNF24i58wlh08lPRwuzCuY+Gv/pTSQ7m0R2NuRw7rzcPSsEThBvLRYlufn4mSIHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:12.201092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2656545ea3d72c94f340921f54e1ab52479861c6a20f06b8e1931d6fd6c9c13d","sha256:36f2fb87ed01f84859a2eee3f5f57719ba48b106796855732742d7a40e2a52cc"],"state_sha256":"3df971e0cd76be4cb62940e098b89ec4d500368d1817808eebf4a68c7d219143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nnl44VZZqAr2QV6TqynsgvgDr2I2spGii5oLSGU30yKB5IQkuTyX0elIs5mhAzrkatsivisKXvFUlJBUtD/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:44:39.461788Z","bundle_sha256":"82ac2f2578dd16be849aeff5872b79770cb1b3f8e2c580f69c0c905a9f4a00ce"}}