{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LZF7GATIWNHFVHTCM6ENIAZXPQ","short_pith_number":"pith:LZF7GATI","schema_version":"1.0","canonical_sha256":"5e4bf30268b34e5a9e626788d403377c106132952feea1b3b21d97ec25498f8f","source":{"kind":"arxiv","id":"1903.06785","version":1},"attestation_state":"computed","paper":{"title":"Smallest k-Enclosing Rectangle Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled, Timothy M. Chan","submitted_at":"2019-03-15T20:16:15Z","abstract_excerpt":"Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this problem, improving over the previous near-$O(n^{5/2})$-time algorithm by Kaplan etal [KRS17]. We provide an almost matching conditional lower bound, under the assumption that $(\\min,+)$-convolution cannot be solved in truly subquadratic time. Furthermore, we present a new reduction (for either perimeter or area) that can make the time bound sensitive to $k$, givi"},"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":"1903.06785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-15T20:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"f61d706fbea449188013da3436ae38961aa5d907eacf9a189aaa088daf9c28b9","abstract_canon_sha256":"93144f3fb84354931effee00960555b3c9396f8d63a2b7c89d55e42d2c300b97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:09.052336Z","signature_b64":"RUBs8z7NLLXcQ+puQ16kT0SZcMoMqKXAXOswBbs3yCpZzY44Rajt8lc/0IKCn+AS8lbkSmiIEwtxcDi2sih6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e4bf30268b34e5a9e626788d403377c106132952feea1b3b21d97ec25498f8f","last_reissued_at":"2026-05-17T23:51:09.051852Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:09.051852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smallest k-Enclosing Rectangle Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled, Timothy M. Chan","submitted_at":"2019-03-15T20:16:15Z","abstract_excerpt":"Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this problem, improving over the previous near-$O(n^{5/2})$-time algorithm by Kaplan etal [KRS17]. We provide an almost matching conditional lower bound, under the assumption that $(\\min,+)$-convolution cannot be solved in truly subquadratic time. Furthermore, we present a new reduction (for either perimeter or area) that can make the time bound sensitive to $k$, givi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06785","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":"1903.06785","created_at":"2026-05-17T23:51:09.051916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06785v1","created_at":"2026-05-17T23:51:09.051916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06785","created_at":"2026-05-17T23:51:09.051916+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZF7GATIWNHF","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZF7GATIWNHFVHTC","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZF7GATI","created_at":"2026-05-18T12:33:21.387695+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/LZF7GATIWNHFVHTCM6ENIAZXPQ","json":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ.json","graph_json":"https://pith.science/api/pith-number/LZF7GATIWNHFVHTCM6ENIAZXPQ/graph.json","events_json":"https://pith.science/api/pith-number/LZF7GATIWNHFVHTCM6ENIAZXPQ/events.json","paper":"https://pith.science/paper/LZF7GATI"},"agent_actions":{"view_html":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ","download_json":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ.json","view_paper":"https://pith.science/paper/LZF7GATI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06785&json=true","fetch_graph":"https://pith.science/api/pith-number/LZF7GATIWNHFVHTCM6ENIAZXPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LZF7GATIWNHFVHTCM6ENIAZXPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ/action/storage_attestation","attest_author":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ/action/author_attestation","sign_citation":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ/action/citation_signature","submit_replication":"https://pith.science/pith/LZF7GATIWNHFVHTCM6ENIAZXPQ/action/replication_record"}},"created_at":"2026-05-17T23:51:09.051916+00:00","updated_at":"2026-05-17T23:51:09.051916+00:00"}