{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4ZES3YJA5CICBYHNWAK6ZYDB52","short_pith_number":"pith:4ZES3YJA","schema_version":"1.0","canonical_sha256":"e6492de120e89020e0edb015ece061eeb9653369f863f0b829d3d7afc1bb969e","source":{"kind":"arxiv","id":"1104.3076","version":1},"attestation_state":"computed","paper":{"title":"Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Minati De, Subhas C. Nandy","submitted_at":"2011-04-15T14:51:45Z","abstract_excerpt":"There is a high demand of space-efficient algorithms in built-in or embedded softwares. In this paper, we consider the problem of designing space-efficient algorithms for computing the maximum area empty rectangle (MER) among a set of points inside a rectangular region $\\cal R$ in 2D. We first propose an inplace algorithm for computing the priority search tree with a set of $n$ points in $\\cal R$ using $O(\\log n)$ extra bit space in $O(n\\log n)$ time. It supports all the standard queries on priority search tree in $O(\\log^2n)$ time. We also show an application of this algorithm in computing th"},"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":"1104.3076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-04-15T14:51:45Z","cross_cats_sorted":[],"title_canon_sha256":"d814d336eb5105f889a6e1c389090e24e877cb0c899ec7b5d49297d7feadce84","abstract_canon_sha256":"9ac27fd1ca07a6c184480a2288ed8fb17034b32c1978e0d7df1a5087c624a497"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.622261Z","signature_b64":"O3wBot7tDURvhHhsnG05RW160YT65lJ+g3MacgmK0EV+4dBQWiafcSWrT9SvgcOjIWTvJ8lYRKK5MyGJiDe3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6492de120e89020e0edb015ece061eeb9653369f863f0b829d3d7afc1bb969e","last_reissued_at":"2026-05-18T04:24:06.621648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.621648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Minati De, Subhas C. Nandy","submitted_at":"2011-04-15T14:51:45Z","abstract_excerpt":"There is a high demand of space-efficient algorithms in built-in or embedded softwares. In this paper, we consider the problem of designing space-efficient algorithms for computing the maximum area empty rectangle (MER) among a set of points inside a rectangular region $\\cal R$ in 2D. We first propose an inplace algorithm for computing the priority search tree with a set of $n$ points in $\\cal R$ using $O(\\log n)$ extra bit space in $O(n\\log n)$ time. It supports all the standard queries on priority search tree in $O(\\log^2n)$ time. We also show an application of this algorithm in computing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3076","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":"1104.3076","created_at":"2026-05-18T04:24:06.621744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3076v1","created_at":"2026-05-18T04:24:06.621744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3076","created_at":"2026-05-18T04:24:06.621744+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZES3YJA5CIC","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZES3YJA5CICBYHN","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZES3YJA","created_at":"2026-05-18T12:26:20.644004+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/4ZES3YJA5CICBYHNWAK6ZYDB52","json":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52.json","graph_json":"https://pith.science/api/pith-number/4ZES3YJA5CICBYHNWAK6ZYDB52/graph.json","events_json":"https://pith.science/api/pith-number/4ZES3YJA5CICBYHNWAK6ZYDB52/events.json","paper":"https://pith.science/paper/4ZES3YJA"},"agent_actions":{"view_html":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52","download_json":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52.json","view_paper":"https://pith.science/paper/4ZES3YJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3076&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZES3YJA5CICBYHNWAK6ZYDB52/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZES3YJA5CICBYHNWAK6ZYDB52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52/action/storage_attestation","attest_author":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52/action/author_attestation","sign_citation":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52/action/citation_signature","submit_replication":"https://pith.science/pith/4ZES3YJA5CICBYHNWAK6ZYDB52/action/replication_record"}},"created_at":"2026-05-18T04:24:06.621744+00:00","updated_at":"2026-05-18T04:24:06.621744+00:00"}