{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:474HDUPCKME7DI6COTGJZH37A5","short_pith_number":"pith:474HDUPC","schema_version":"1.0","canonical_sha256":"e7f871d1e25309f1a3c274cc9c9f7f076bc4dbcd22c67191af73d88fd4af1b30","source":{"kind":"arxiv","id":"1905.00790","version":1},"attestation_state":"computed","paper":{"title":"Minimum Ply Covering of Points with Disks and Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anna Lubiw, Therese Biedl","submitted_at":"2019-05-02T14:55:28Z","abstract_excerpt":"Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$ that covers all points of $P$ while minimizing the maximum number of objects covering any point in the plane (not only points of $P$). For objects that are unit squares and unit disks, this problem is NP-hard and cannot be approximated by a ratio smaller than 2. We present 2-approximation algorithms for this problem with respect to unit squares and unit disks."},"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":"1905.00790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T14:55:28Z","cross_cats_sorted":[],"title_canon_sha256":"8f48b2987edde2ced582b7e7f34d19b72fedc484db88942a84938b90332256ce","abstract_canon_sha256":"8d2b6bccfcb54ef76da40a556e7e733d49c7b26700f4cfb4d5ccd27c473aaf54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:09.293117Z","signature_b64":"Ptxz+P0QXBSzl/90Mk/WhFET2srvA916J97ennGrQltUUsUu8k1im8ik6+E4X0FsZqQboF7i+j75X2tbwlvNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7f871d1e25309f1a3c274cc9c9f7f076bc4dbcd22c67191af73d88fd4af1b30","last_reissued_at":"2026-05-17T23:47:09.292376Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:09.292376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Ply Covering of Points with Disks and Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anna Lubiw, Therese Biedl","submitted_at":"2019-05-02T14:55:28Z","abstract_excerpt":"Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$ that covers all points of $P$ while minimizing the maximum number of objects covering any point in the plane (not only points of $P$). For objects that are unit squares and unit disks, this problem is NP-hard and cannot be approximated by a ratio smaller than 2. We present 2-approximation algorithms for this problem with respect to unit squares and unit disks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00790","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":"1905.00790","created_at":"2026-05-17T23:47:09.292497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00790v1","created_at":"2026-05-17T23:47:09.292497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00790","created_at":"2026-05-17T23:47:09.292497+00:00"},{"alias_kind":"pith_short_12","alias_value":"474HDUPCKME7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"474HDUPCKME7DI6C","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"474HDUPC","created_at":"2026-05-18T12:33:10.108867+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/474HDUPCKME7DI6COTGJZH37A5","json":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5.json","graph_json":"https://pith.science/api/pith-number/474HDUPCKME7DI6COTGJZH37A5/graph.json","events_json":"https://pith.science/api/pith-number/474HDUPCKME7DI6COTGJZH37A5/events.json","paper":"https://pith.science/paper/474HDUPC"},"agent_actions":{"view_html":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5","download_json":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5.json","view_paper":"https://pith.science/paper/474HDUPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00790&json=true","fetch_graph":"https://pith.science/api/pith-number/474HDUPCKME7DI6COTGJZH37A5/graph.json","fetch_events":"https://pith.science/api/pith-number/474HDUPCKME7DI6COTGJZH37A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/action/storage_attestation","attest_author":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/action/author_attestation","sign_citation":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/action/citation_signature","submit_replication":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/action/replication_record"}},"created_at":"2026-05-17T23:47:09.292497+00:00","updated_at":"2026-05-17T23:47:09.292497+00:00"}