{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VKESOBHQC3G52VX73CGTZEDLQR","short_pith_number":"pith:VKESOBHQ","schema_version":"1.0","canonical_sha256":"aa892704f016cddd56ffd88d3c906b8473dcdb33b44742dd3a86f59d358a591f","source":{"kind":"arxiv","id":"1411.6810","version":1},"attestation_state":"computed","paper":{"title":"Discretization of Planar Geometric Cover Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Dae-Sung Jang, Han-Lim Choi","submitted_at":"2014-11-25T10:52:44Z","abstract_excerpt":"We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union of the translates in the collection contains all the points in $P$. We show that the geometric cover problem can be converted to a form of the geometric set cover, which has a given finite-size collection of translates rather than the infinite continuous solution space of the former. We propose a reduced finite solution space that consists of distinct canoni"},"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":"1411.6810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-25T10:52:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"73e64982079414a39e7780c722971be0e15202256c57e437ab34b00381301af9","abstract_canon_sha256":"04a249450bc41fa7d8d26124599ac7c56735473c92e7d1a2cc379242dc4e816a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:47.273536Z","signature_b64":"BTHzqutmfw1BDG7FW4YVlooG1RZ/XvIiGnY9jhGP2Owtuhi/B6VXkjJOUdj8cWvqsObmz8WkdkJrCVYDY/kJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa892704f016cddd56ffd88d3c906b8473dcdb33b44742dd3a86f59d358a591f","last_reissued_at":"2026-05-18T02:32:47.272993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:47.272993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discretization of Planar Geometric Cover Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Dae-Sung Jang, Han-Lim Choi","submitted_at":"2014-11-25T10:52:44Z","abstract_excerpt":"We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union of the translates in the collection contains all the points in $P$. We show that the geometric cover problem can be converted to a form of the geometric set cover, which has a given finite-size collection of translates rather than the infinite continuous solution space of the former. We propose a reduced finite solution space that consists of distinct canoni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6810","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":"1411.6810","created_at":"2026-05-18T02:32:47.273068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6810v1","created_at":"2026-05-18T02:32:47.273068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6810","created_at":"2026-05-18T02:32:47.273068+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKESOBHQC3G5","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKESOBHQC3G52VX7","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKESOBHQ","created_at":"2026-05-18T12:28:54.890064+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/VKESOBHQC3G52VX73CGTZEDLQR","json":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR.json","graph_json":"https://pith.science/api/pith-number/VKESOBHQC3G52VX73CGTZEDLQR/graph.json","events_json":"https://pith.science/api/pith-number/VKESOBHQC3G52VX73CGTZEDLQR/events.json","paper":"https://pith.science/paper/VKESOBHQ"},"agent_actions":{"view_html":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR","download_json":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR.json","view_paper":"https://pith.science/paper/VKESOBHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6810&json=true","fetch_graph":"https://pith.science/api/pith-number/VKESOBHQC3G52VX73CGTZEDLQR/graph.json","fetch_events":"https://pith.science/api/pith-number/VKESOBHQC3G52VX73CGTZEDLQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR/action/storage_attestation","attest_author":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR/action/author_attestation","sign_citation":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR/action/citation_signature","submit_replication":"https://pith.science/pith/VKESOBHQC3G52VX73CGTZEDLQR/action/replication_record"}},"created_at":"2026-05-18T02:32:47.273068+00:00","updated_at":"2026-05-18T02:32:47.273068+00:00"}