{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PE7CIDZ7GURTQ52GO4FHQTJU63","short_pith_number":"pith:PE7CIDZ7","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"},"canonical_sha256":"793e240f3f3523387746770a784d34f6ce5b8bcdda6752a2da1687baea668108","source":{"kind":"arxiv","id":"1106.3628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3628","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3628v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3628","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"PE7CIDZ7GURT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PE7CIDZ7GURTQ52G","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PE7CIDZ7","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PE7CIDZ7GURTQ52GO4FHQTJU63","target":"record","payload":{"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"},"canonical_sha256":"793e240f3f3523387746770a784d34f6ce5b8bcdda6752a2da1687baea668108","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"},"source_kind":"arxiv","source_id":"1106.3628","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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CenqNsD+dJF6Ol82yloo6uZaFU16qykeQEmPSkMsKWGj1dmfR/HTsjUau1sYbf13g8KO1qasOoBwBf3JXbLvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:38:50.237403Z"},"content_sha256":"6e9d725ca29850b1f14263e02fd46a66bdf1345bcbfd051825d26fb5cc3ef649","schema_version":"1.0","event_id":"sha256:6e9d725ca29850b1f14263e02fd46a66bdf1345bcbfd051825d26fb5cc3ef649"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PE7CIDZ7GURTQ52GO4FHQTJU63","target":"graph","payload":{"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"},"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-18T04:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLTMS+NQky4Dan9gDg5T3fJRpDAiwKC2MoN2h3xrMaPdRbwvqxJahYMUG/XLYpQP3wPe9VJ9NADXZVxeIOmeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:38:50.237779Z"},"content_sha256":"7d46640af2064b05a0a72643f9758f89e86c2b00c52991d52dfd25c59cd5195a","schema_version":"1.0","event_id":"sha256:7d46640af2064b05a0a72643f9758f89e86c2b00c52991d52dfd25c59cd5195a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/bundle.json","state_url":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/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-28T01:38:50Z","links":{"resolver":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63","bundle":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/bundle.json","state":"https://pith.science/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PE7CIDZ7GURTQ52GO4FHQTJU63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PE7CIDZ7GURTQ52GO4FHQTJU63","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":"db426920312276285cf2e1b0a47859437368d1ba34da3740e8dca6243b7841e1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-18T08:56:46Z","title_canon_sha256":"7a914a65e4e611edea810852d6271ece70532d89f50ef7f959e44200cf305b28"},"schema_version":"1.0","source":{"id":"1106.3628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3628","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3628v1","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3628","created_at":"2026-05-18T04:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"PE7CIDZ7GURT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PE7CIDZ7GURTQ52G","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PE7CIDZ7","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:7d46640af2064b05a0a72643f9758f89e86c2b00c52991d52dfd25c59cd5195a","target":"graph","created_at":"2026-05-18T04:19:42Z","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":"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.","authors_text":"Haim Kaplan, Micha Sharir","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-18T08:56:46Z","title":"Finding the Maximal Empty Rectangle Containing a Query Point"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3628","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:6e9d725ca29850b1f14263e02fd46a66bdf1345bcbfd051825d26fb5cc3ef649","target":"record","created_at":"2026-05-18T04:19:42Z","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":"db426920312276285cf2e1b0a47859437368d1ba34da3740e8dca6243b7841e1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-18T08:56:46Z","title_canon_sha256":"7a914a65e4e611edea810852d6271ece70532d89f50ef7f959e44200cf305b28"},"schema_version":"1.0","source":{"id":"1106.3628","kind":"arxiv","version":1}},"canonical_sha256":"793e240f3f3523387746770a784d34f6ce5b8bcdda6752a2da1687baea668108","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"793e240f3f3523387746770a784d34f6ce5b8bcdda6752a2da1687baea668108","first_computed_at":"2026-05-18T04:19:42.646869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:42.646869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RNQSPQOv3c9G1H/1IATRC8H/VALQALdTKgNXkQFFQjpxFzCgYadiGLei6+3Gy34QaMzKOYPjw7CdQeqZWlF0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:42.647485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e9d725ca29850b1f14263e02fd46a66bdf1345bcbfd051825d26fb5cc3ef649","sha256:7d46640af2064b05a0a72643f9758f89e86c2b00c52991d52dfd25c59cd5195a"],"state_sha256":"0d94e1bf62698c82ce56ed300ec6446e57ec2027151b24d351277214fc410eba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3gw7cXtBAOBIZM5keUDfr72grDFaP7tVDQX21+hLeUFQJbeNUQEdVHy9ZT/slMuZUWeDY9GHZ8swfQ+fdl8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:38:50.239905Z","bundle_sha256":"67b11f384d1542db60d2659816e68e73c07368d0fef58c372ec505d611bdb956"}}