{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:474HDUPCKME7DI6COTGJZH37A5","short_pith_number":"pith:474HDUPC","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"},"canonical_sha256":"e7f871d1e25309f1a3c274cc9c9f7f076bc4dbcd22c67191af73d88fd4af1b30","source":{"kind":"arxiv","id":"1905.00790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00790","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00790v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00790","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"474HDUPCKME7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"474HDUPCKME7DI6C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"474HDUPC","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:474HDUPCKME7DI6COTGJZH37A5","target":"record","payload":{"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"},"canonical_sha256":"e7f871d1e25309f1a3c274cc9c9f7f076bc4dbcd22c67191af73d88fd4af1b30","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"},"source_kind":"arxiv","source_id":"1905.00790","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-17T23:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ha6gZ9U6vLg96xg4yWfJX2cbMcm+ZpQra8Ziti9/ar9IahXvdSNGccUl8Vr7eu3qExzg/5A/40DQNDExOGaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:33:01.967920Z"},"content_sha256":"3883e1bf17c309e883450296a32af68dbb0d2fe167ae42bfe8836427af4a7faa","schema_version":"1.0","event_id":"sha256:3883e1bf17c309e883450296a32af68dbb0d2fe167ae42bfe8836427af4a7faa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:474HDUPCKME7DI6COTGJZH37A5","target":"graph","payload":{"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"},"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-17T23:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFBdFirJqa1GdNNVM11hmxiM7RS/zBfgpOXJsP6JabGtYNm50UnLaVrzXN+gph97J167MHWkHLa2pIZis/b3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:33:01.968390Z"},"content_sha256":"744f4571b0279c762b517aaf00687ab919882da74dc5c2e5517a735c7a7229b8","schema_version":"1.0","event_id":"sha256:744f4571b0279c762b517aaf00687ab919882da74dc5c2e5517a735c7a7229b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/bundle.json","state_url":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/474HDUPCKME7DI6COTGJZH37A5/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-05-30T23:33:01Z","links":{"resolver":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5","bundle":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/bundle.json","state":"https://pith.science/pith/474HDUPCKME7DI6COTGJZH37A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/474HDUPCKME7DI6COTGJZH37A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:474HDUPCKME7DI6COTGJZH37A5","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":"8d2b6bccfcb54ef76da40a556e7e733d49c7b26700f4cfb4d5ccd27c473aaf54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T14:55:28Z","title_canon_sha256":"8f48b2987edde2ced582b7e7f34d19b72fedc484db88942a84938b90332256ce"},"schema_version":"1.0","source":{"id":"1905.00790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00790","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00790v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00790","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"474HDUPCKME7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"474HDUPCKME7DI6C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"474HDUPC","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:744f4571b0279c762b517aaf00687ab919882da74dc5c2e5517a735c7a7229b8","target":"graph","created_at":"2026-05-17T23:47: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":"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.","authors_text":"Ahmad Biniaz, Anna Lubiw, Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T14:55:28Z","title":"Minimum Ply Covering of Points with Disks and Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00790","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:3883e1bf17c309e883450296a32af68dbb0d2fe167ae42bfe8836427af4a7faa","target":"record","created_at":"2026-05-17T23:47: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":"8d2b6bccfcb54ef76da40a556e7e733d49c7b26700f4cfb4d5ccd27c473aaf54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-02T14:55:28Z","title_canon_sha256":"8f48b2987edde2ced582b7e7f34d19b72fedc484db88942a84938b90332256ce"},"schema_version":"1.0","source":{"id":"1905.00790","kind":"arxiv","version":1}},"canonical_sha256":"e7f871d1e25309f1a3c274cc9c9f7f076bc4dbcd22c67191af73d88fd4af1b30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7f871d1e25309f1a3c274cc9c9f7f076bc4dbcd22c67191af73d88fd4af1b30","first_computed_at":"2026-05-17T23:47:09.292376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:09.292376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ptxz+P0QXBSzl/90Mk/WhFET2srvA916J97ennGrQltUUsUu8k1im8ik6+E4X0FsZqQboF7i+j75X2tbwlvNDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:09.293117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3883e1bf17c309e883450296a32af68dbb0d2fe167ae42bfe8836427af4a7faa","sha256:744f4571b0279c762b517aaf00687ab919882da74dc5c2e5517a735c7a7229b8"],"state_sha256":"4af2036021732aae8ae383bc2af14574f30f053a6cd20c1a979b3d4ef2f5ba94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZhkoPXVCLJKNnj+Pe1Aq6Q121zsy8s9fCRgVa+06RMKwBt6jE4BvQWM3I4vLMmgYV+i+xZOm1Im08CCZI1PDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:33:01.971458Z","bundle_sha256":"83edfd2c7e6ffb660f59a282e97f78ddb4641ba8a3c9b69f4f17b68854741287"}}