{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XPR5VRCVLDD2G6BUOHHVPQMNQ7","short_pith_number":"pith:XPR5VRCV","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"},"canonical_sha256":"bbe3dac45558c7a3783471cf57c18d87ea8e5e05ee8b7d31d31578059c70c323","source":{"kind":"arxiv","id":"1607.06665","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06665","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06665v3","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06665","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"XPR5VRCVLDD2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XPR5VRCVLDD2G6BU","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XPR5VRCV","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XPR5VRCVLDD2G6BUOHHVPQMNQ7","target":"record","payload":{"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"},"canonical_sha256":"bbe3dac45558c7a3783471cf57c18d87ea8e5e05ee8b7d31d31578059c70c323","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"},"source_kind":"arxiv","source_id":"1607.06665","source_version":3,"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:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRsJ1KWvu8EcpfOPuU9DAYjfGGIaGnapq3OOJmchXoYRlp3EXM+dPRHighB6sLycbd63CNm0kkzf1D0QMTuiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:29:46.963622Z"},"content_sha256":"546785e71c98608d2a09a6d8571ad894d1f19e1d7f5e33fd156307d260206835","schema_version":"1.0","event_id":"sha256:546785e71c98608d2a09a6d8571ad894d1f19e1d7f5e33fd156307d260206835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XPR5VRCVLDD2G6BUOHHVPQMNQ7","target":"graph","payload":{"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"},"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:50:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbxGNPisJBSUYCVQl1aQvhJMui0TS9ArTJ+hmu5fPHabQrU5z3J1DxS9daKD3tfgHe8zutObVUU6TbS7GSf2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:29:46.964207Z"},"content_sha256":"d8f6867bfed2b327781fde0b4b2a497384de28248e27a5d9e4ddebf79f0dba8a","schema_version":"1.0","event_id":"sha256:d8f6867bfed2b327781fde0b4b2a497384de28248e27a5d9e4ddebf79f0dba8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/bundle.json","state_url":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/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-07T14:29:46Z","links":{"resolver":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7","bundle":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/bundle.json","state":"https://pith.science/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPR5VRCVLDD2G6BUOHHVPQMNQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XPR5VRCVLDD2G6BUOHHVPQMNQ7","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":"f6f02c836ac8c2436b233300f3ea625a9d00f9ff8110f5fe5047389fc0a9b520","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-22T13:02:16Z","title_canon_sha256":"835bd1c47b3839bbef778676549f6b4c8187907315c8eee9cba70cb9a94b1222"},"schema_version":"1.0","source":{"id":"1607.06665","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06665","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06665v3","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06665","created_at":"2026-05-18T00:50:09Z"},{"alias_kind":"pith_short_12","alias_value":"XPR5VRCVLDD2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XPR5VRCVLDD2G6BU","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XPR5VRCV","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:d8f6867bfed2b327781fde0b4b2a497384de28248e27a5d9e4ddebf79f0dba8a","target":"graph","created_at":"2026-05-18T00:50:09Z","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":"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","authors_text":"Alexander Ravsky, Joachim Spoerhase, Minati De, Steven Chaplick","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-22T13:02:16Z","title":"Approximation Schemes for Geometric Coverage Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06665","kind":"arxiv","version":3},"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:546785e71c98608d2a09a6d8571ad894d1f19e1d7f5e33fd156307d260206835","target":"record","created_at":"2026-05-18T00:50:09Z","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":"f6f02c836ac8c2436b233300f3ea625a9d00f9ff8110f5fe5047389fc0a9b520","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-22T13:02:16Z","title_canon_sha256":"835bd1c47b3839bbef778676549f6b4c8187907315c8eee9cba70cb9a94b1222"},"schema_version":"1.0","source":{"id":"1607.06665","kind":"arxiv","version":3}},"canonical_sha256":"bbe3dac45558c7a3783471cf57c18d87ea8e5e05ee8b7d31d31578059c70c323","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbe3dac45558c7a3783471cf57c18d87ea8e5e05ee8b7d31d31578059c70c323","first_computed_at":"2026-05-18T00:50:09.605660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:09.605660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3pt2HnNJsupEkgVXRFooH/9Mmo7equsntqij7GdVzdUu+/oQbPl6ByoIznGkzT4GYFxRkJk4SMcJ91Ec/jaSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:09.606281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06665","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:546785e71c98608d2a09a6d8571ad894d1f19e1d7f5e33fd156307d260206835","sha256:d8f6867bfed2b327781fde0b4b2a497384de28248e27a5d9e4ddebf79f0dba8a"],"state_sha256":"0b208e92aa4873ece536a75c17626ffe354f8ba8226b23ddbe762c8e1454f311"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdjjkYjaaHmTI3mhoEwYiHdpEItRvm7m6bySSS3Ork+xTU5/gIoYt9kG31IFGpSgKYVK5lrmVqk1f+VWTjpsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:29:46.967660Z","bundle_sha256":"97a8fc0c5f48b0af0ba0111791e546dffde1ee657d4ea695206263ae621f08a4"}}