{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C5JORB5VBCDR37FF2MYCYBU4WK","short_pith_number":"pith:C5JORB5V","canonical_record":{"source":{"id":"1607.07378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T17:38:39Z","cross_cats_sorted":[],"title_canon_sha256":"ef2f91d5713bdb6c9d8432697f5041e700aa760a98a3c5732c58465439d260ca","abstract_canon_sha256":"d0a9ceb0cacc74cf6fb43a5fe94c0d1be671e4c24e298969cba32db5967fb3a1"},"schema_version":"1.0"},"canonical_sha256":"1752e887b508871dfca5d3302c069cb2a53a15b76124e8e4500d5ea836d099db","source":{"kind":"arxiv","id":"1607.07378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07378","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07378v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07378","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"C5JORB5VBCDR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5JORB5VBCDR37FF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5JORB5V","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C5JORB5VBCDR37FF2MYCYBU4WK","target":"record","payload":{"canonical_record":{"source":{"id":"1607.07378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T17:38:39Z","cross_cats_sorted":[],"title_canon_sha256":"ef2f91d5713bdb6c9d8432697f5041e700aa760a98a3c5732c58465439d260ca","abstract_canon_sha256":"d0a9ceb0cacc74cf6fb43a5fe94c0d1be671e4c24e298969cba32db5967fb3a1"},"schema_version":"1.0"},"canonical_sha256":"1752e887b508871dfca5d3302c069cb2a53a15b76124e8e4500d5ea836d099db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:34.088774Z","signature_b64":"x95CDOop6ub4AxyVlGr8z2pPdjZZbR+NrfImfv+9J6tc67nI9JKGqYttVAjGV9edDMxwm7HLqXjdeTvT/p5/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1752e887b508871dfca5d3302c069cb2a53a15b76124e8e4500d5ea836d099db","last_reissued_at":"2026-05-18T01:10:34.088122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:34.088122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.07378","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-18T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkVuPoaLK55cLqK+zC14UKTdsFVxKfgwBBdyF3C4QBkGuiVRGjxrvfZaUm0JO1iZnHohBuw1BegAYjt1nmV0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:00:20.656499Z"},"content_sha256":"63d4f83e004432f6b5070b6cd4e5a26f08f3efedf614341d4723a42785781ad2","schema_version":"1.0","event_id":"sha256:63d4f83e004432f6b5070b6cd4e5a26f08f3efedf614341d4723a42785781ad2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C5JORB5VBCDR37FF2MYCYBU4WK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unique Set Cover on Unit Disks and Unit Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi","submitted_at":"2016-07-25T17:38:39Z","abstract_excerpt":"We study the Unique Set Cover problem on unit disks and unit squares. For a given set $P$ of $n$ points and a set $D$ of $m$ geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset $D'\\subseteq D$ of objects such that every point in $P$ is covered by at least one object in $D'$ and the number of points covered uniquely is maximized, where a point is covered uniquely if the point is covered by exactly one object in $D'$. In this paper, (i) we show that the Unique Set Cover is NP-hard on both unit disks and unit squares, and (ii) we give a PTAS fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07378","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-18T01:10:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8GgF6TkbcQ5y4/PSH/0/QbB6bklpW8DbujqL0sv4D0IKRxuB2wu7LOnqzz0zJcKgpcuNQSF3KyeSBfJy+HsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:00:20.656848Z"},"content_sha256":"fdb15ce63074b6907f04b467da53235b624f3ea11adab2b6d5195b4271127679","schema_version":"1.0","event_id":"sha256:fdb15ce63074b6907f04b467da53235b624f3ea11adab2b6d5195b4271127679"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5JORB5VBCDR37FF2MYCYBU4WK/bundle.json","state_url":"https://pith.science/pith/C5JORB5VBCDR37FF2MYCYBU4WK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5JORB5VBCDR37FF2MYCYBU4WK/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-21T23:00:20Z","links":{"resolver":"https://pith.science/pith/C5JORB5VBCDR37FF2MYCYBU4WK","bundle":"https://pith.science/pith/C5JORB5VBCDR37FF2MYCYBU4WK/bundle.json","state":"https://pith.science/pith/C5JORB5VBCDR37FF2MYCYBU4WK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5JORB5VBCDR37FF2MYCYBU4WK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C5JORB5VBCDR37FF2MYCYBU4WK","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":"d0a9ceb0cacc74cf6fb43a5fe94c0d1be671e4c24e298969cba32db5967fb3a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T17:38:39Z","title_canon_sha256":"ef2f91d5713bdb6c9d8432697f5041e700aa760a98a3c5732c58465439d260ca"},"schema_version":"1.0","source":{"id":"1607.07378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07378","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07378v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07378","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"C5JORB5VBCDR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5JORB5VBCDR37FF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5JORB5V","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:fdb15ce63074b6907f04b467da53235b624f3ea11adab2b6d5195b4271127679","target":"graph","created_at":"2026-05-18T01:10:34Z","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 the Unique Set Cover problem on unit disks and unit squares. For a given set $P$ of $n$ points and a set $D$ of $m$ geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset $D'\\subseteq D$ of objects such that every point in $P$ is covered by at least one object in $D'$ and the number of points covered uniquely is maximized, where a point is covered uniquely if the point is covered by exactly one object in $D'$. In this paper, (i) we show that the Unique Set Cover is NP-hard on both unit disks and unit squares, and (ii) we give a PTAS fo","authors_text":"Saeed Mehrabi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T17:38:39Z","title":"Unique Set Cover on Unit Disks and Unit Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07378","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:63d4f83e004432f6b5070b6cd4e5a26f08f3efedf614341d4723a42785781ad2","target":"record","created_at":"2026-05-18T01:10:34Z","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":"d0a9ceb0cacc74cf6fb43a5fe94c0d1be671e4c24e298969cba32db5967fb3a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T17:38:39Z","title_canon_sha256":"ef2f91d5713bdb6c9d8432697f5041e700aa760a98a3c5732c58465439d260ca"},"schema_version":"1.0","source":{"id":"1607.07378","kind":"arxiv","version":1}},"canonical_sha256":"1752e887b508871dfca5d3302c069cb2a53a15b76124e8e4500d5ea836d099db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1752e887b508871dfca5d3302c069cb2a53a15b76124e8e4500d5ea836d099db","first_computed_at":"2026-05-18T01:10:34.088122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:34.088122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x95CDOop6ub4AxyVlGr8z2pPdjZZbR+NrfImfv+9J6tc67nI9JKGqYttVAjGV9edDMxwm7HLqXjdeTvT/p5/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:34.088774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63d4f83e004432f6b5070b6cd4e5a26f08f3efedf614341d4723a42785781ad2","sha256:fdb15ce63074b6907f04b467da53235b624f3ea11adab2b6d5195b4271127679"],"state_sha256":"c3e46bff8f625c2f2197c10ff47a0658abd1dadb4766429795195924b6396563"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frJ+yc14ypIc+Xc5qz1OSLGIovk/wQsDGVD08I921/1vvJI7vEt3vajJlp8QLufPPMmzYXN52TdfrmgvwxqXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:00:20.658937Z","bundle_sha256":"a951061de9ae6c09b842e52080e517021e0e676d72cd7cd071d42b910511a370"}}