{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PE7CIDZ7GURTQ52GO4FHQTJU63","short_pith_number":"pith:PE7CIDZ7","schema_version":"1.0","canonical_sha256":"793e240f3f3523387746770a784d34f6ce5b8bcdda6752a2da1687baea668108","source":{"kind":"arxiv","id":"1106.3628","version":1},"attestation_state":"computed","paper":{"title":"Finding the Maximal Empty Rectangle Containing a Query Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Micha Sharir","submitted_at":"2011-06-18T08:56:46Z","abstract_excerpt":"Let $P$ be a set of $n$ points in an axis-parallel rectangle $B$ in the plane. We present an $O(n\\alpha(n)\\log^4 n)$-time algorithm to preprocess $P$ into a data structure of size $O(n\\alpha(n)\\log^3 n)$, such that, given a query point $q$, we can find, in $O(\\log^4 n)$ time, the largest-area axis-parallel rectangle that is contained in $B$, contains $q$, and its interior contains no point of $P$. This is a significant improvement over the previous solution of Augustine {\\em et al.} \\cite{qmex}, which uses slightly superquadratic preprocessing and storage."},"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":"1106.3628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-18T08:56:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7a914a65e4e611edea810852d6271ece70532d89f50ef7f959e44200cf305b28","abstract_canon_sha256":"db426920312276285cf2e1b0a47859437368d1ba34da3740e8dca6243b7841e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:42.647485Z","signature_b64":"RNQSPQOv3c9G1H/1IATRC8H/VALQALdTKgNXkQFFQjpxFzCgYadiGLei6+3Gy34QaMzKOYPjw7CdQeqZWlF0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"793e240f3f3523387746770a784d34f6ce5b8bcdda6752a2da1687baea668108","last_reissued_at":"2026-05-18T04:19:42.646869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:42.646869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding the Maximal Empty Rectangle Containing a Query Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Micha Sharir","submitted_at":"2011-06-18T08:56:46Z","abstract_excerpt":"Let $P$ be a set of $n$ points in an axis-parallel rectangle $B$ in the plane. We present an $O(n\\alpha(n)\\log^4 n)$-time algorithm to preprocess $P$ into a data structure of size $O(n\\alpha(n)\\log^3 n)$, such that, given a query point $q$, we can find, in $O(\\log^4 n)$ time, the largest-area axis-parallel rectangle that is contained in $B$, contains $q$, and its interior contains no point of $P$. This is a significant improvement over the previous solution of Augustine {\\em et al.} \\cite{qmex}, which uses slightly superquadratic preprocessing and storage."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3628","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":"1106.3628","created_at":"2026-05-18T04:19:42.646972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3628v1","created_at":"2026-05-18T04:19:42.646972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3628","created_at":"2026-05-18T04:19:42.646972+00:00"},{"alias_kind":"pith_short_12","alias_value":"PE7CIDZ7GURT","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PE7CIDZ7GURTQ52G","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PE7CIDZ7","created_at":"2026-05-18T12:26:39.201973+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/PE7CIDZ7GURTQ52GO4FHQTJU63","json":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63.json","graph_json":"https://pith.science/api/pith-number/PE7CIDZ7GURTQ52GO4FHQTJU63/graph.json","events_json":"https://pith.science/api/pith-number/PE7CIDZ7GURTQ52GO4FHQTJU63/events.json","paper":"https://pith.science/paper/PE7CIDZ7"},"agent_actions":{"view_html":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63","download_json":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63.json","view_paper":"https://pith.science/paper/PE7CIDZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3628&json=true","fetch_graph":"https://pith.science/api/pith-number/PE7CIDZ7GURTQ52GO4FHQTJU63/graph.json","fetch_events":"https://pith.science/api/pith-number/PE7CIDZ7GURTQ52GO4FHQTJU63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/action/storage_attestation","attest_author":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/action/author_attestation","sign_citation":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/action/citation_signature","submit_replication":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/action/replication_record"}},"created_at":"2026-05-18T04:19:42.646972+00:00","updated_at":"2026-05-18T04:19:42.646972+00:00"}