{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E5KOG5EQTYEZYWXCTNQ4NQVQCC","short_pith_number":"pith:E5KOG5EQ","schema_version":"1.0","canonical_sha256":"2754e374909e099c5ae29b61c6c2b01082cadad784d25f95574be67b8a95b016","source":{"kind":"arxiv","id":"1612.02149","version":2},"attestation_state":"computed","paper":{"title":"Covering many points with a small-area box","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Knauer, David Eppstein, Mark de Berg, Otfried Cheong, Sergio Cabello","submitted_at":"2016-12-07T08:41:46Z","abstract_excerpt":"Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \\log n+ n\\log^2 n)$ time. We also consider the problem of, given a value $\\alpha>0$, covering as many points of $P$ as possible with an axis-parallel rectangle of area at most $\\alpha$. For this problem we give a probabilistic $(1-\\varepsilon)$-approximation that works in near-linear time: In $O((n/\\varepsilon^4)\\log^3 n \\log (1/\\varepsilon))$ time we find an axis-parallel rectangle of area at most $\\alpha$ that, with hi"},"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":"1612.02149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-07T08:41:46Z","cross_cats_sorted":[],"title_canon_sha256":"05da11f526e667219e03538636642c8cc50f83d8da0abdaf4e0700de212e0f32","abstract_canon_sha256":"b92ffe7bdbe588cee611d9dcd77b7b61a1f4c7dba07eaf163a4d0ba4a701fd6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.342565Z","signature_b64":"b+kbFroj8QSAknjbm+adDNjr6yeTDXi1C9VTwLd+2nfU49yrgJciwzhH9R/6pmGug7DjyTy0OCXiHS/JURXdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2754e374909e099c5ae29b61c6c2b01082cadad784d25f95574be67b8a95b016","last_reissued_at":"2026-05-17T23:40:56.341888Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.341888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering many points with a small-area box","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Knauer, David Eppstein, Mark de Berg, Otfried Cheong, Sergio Cabello","submitted_at":"2016-12-07T08:41:46Z","abstract_excerpt":"Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \\log n+ n\\log^2 n)$ time. We also consider the problem of, given a value $\\alpha>0$, covering as many points of $P$ as possible with an axis-parallel rectangle of area at most $\\alpha$. For this problem we give a probabilistic $(1-\\varepsilon)$-approximation that works in near-linear time: In $O((n/\\varepsilon^4)\\log^3 n \\log (1/\\varepsilon))$ time we find an axis-parallel rectangle of area at most $\\alpha$ that, with hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02149","kind":"arxiv","version":2},"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":"1612.02149","created_at":"2026-05-17T23:40:56.341998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02149v2","created_at":"2026-05-17T23:40:56.341998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02149","created_at":"2026-05-17T23:40:56.341998+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5KOG5EQTYEZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5KOG5EQTYEZYWXC","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5KOG5EQ","created_at":"2026-05-18T12:30:12.583610+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/E5KOG5EQTYEZYWXCTNQ4NQVQCC","json":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC.json","graph_json":"https://pith.science/api/pith-number/E5KOG5EQTYEZYWXCTNQ4NQVQCC/graph.json","events_json":"https://pith.science/api/pith-number/E5KOG5EQTYEZYWXCTNQ4NQVQCC/events.json","paper":"https://pith.science/paper/E5KOG5EQ"},"agent_actions":{"view_html":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC","download_json":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC.json","view_paper":"https://pith.science/paper/E5KOG5EQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02149&json=true","fetch_graph":"https://pith.science/api/pith-number/E5KOG5EQTYEZYWXCTNQ4NQVQCC/graph.json","fetch_events":"https://pith.science/api/pith-number/E5KOG5EQTYEZYWXCTNQ4NQVQCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC/action/storage_attestation","attest_author":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC/action/author_attestation","sign_citation":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC/action/citation_signature","submit_replication":"https://pith.science/pith/E5KOG5EQTYEZYWXCTNQ4NQVQCC/action/replication_record"}},"created_at":"2026-05-17T23:40:56.341998+00:00","updated_at":"2026-05-17T23:40:56.341998+00:00"}