{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FFBEYQA2NU7BAFEUYGD6X26IDJ","short_pith_number":"pith:FFBEYQA2","schema_version":"1.0","canonical_sha256":"29424c401a6d3e101494c187ebebc81a5ec527f816602a692ac9ae57fc0e9a77","source":{"kind":"arxiv","id":"1811.06217","version":1},"attestation_state":"computed","paper":{"title":"Maximum-Width Empty Square and Rectangular Annulus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Won Bae","submitted_at":"2018-11-15T07:53:36Z","abstract_excerpt":"An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$ points in the plane. This problem can also be interpreted as the problem of finding an optimal location of a ring-shaped obnoxious facility among the input points. In this paper, we study square and rectangular variants of the maximum-width empty anuulus problem, and present first nontrivial algorithms. Specifically, our algorithms run in $O(n^3)$ and $O(n^2 \\"},"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":"1811.06217","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2018-11-15T07:53:36Z","cross_cats_sorted":[],"title_canon_sha256":"20d75ee974a6fd1635876227642760719fd43af5275d45e803f3c754a637199a","abstract_canon_sha256":"e0b203b6c82d63b2912160558a927dbc17512780169b55872c3f0d99cf412bce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.324150Z","signature_b64":"PzOcC9rFPCqf/UfgSzfacFrdXSOSIU+VoWgsyZuVAjL+pXCW2CVMyTIc+PAhlhIMYfLhUlnGDsBURGsN3jtOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29424c401a6d3e101494c187ebebc81a5ec527f816602a692ac9ae57fc0e9a77","last_reissued_at":"2026-05-18T00:00:38.323698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.323698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum-Width Empty Square and Rectangular Annulus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Won Bae","submitted_at":"2018-11-15T07:53:36Z","abstract_excerpt":"An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$ points in the plane. This problem can also be interpreted as the problem of finding an optimal location of a ring-shaped obnoxious facility among the input points. In this paper, we study square and rectangular variants of the maximum-width empty anuulus problem, and present first nontrivial algorithms. Specifically, our algorithms run in $O(n^3)$ and $O(n^2 \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06217","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":"1811.06217","created_at":"2026-05-18T00:00:38.323773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06217v1","created_at":"2026-05-18T00:00:38.323773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06217","created_at":"2026-05-18T00:00:38.323773+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFBEYQA2NU7B","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFBEYQA2NU7BAFEU","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFBEYQA2","created_at":"2026-05-18T12:32:22.470017+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/FFBEYQA2NU7BAFEUYGD6X26IDJ","json":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ.json","graph_json":"https://pith.science/api/pith-number/FFBEYQA2NU7BAFEUYGD6X26IDJ/graph.json","events_json":"https://pith.science/api/pith-number/FFBEYQA2NU7BAFEUYGD6X26IDJ/events.json","paper":"https://pith.science/paper/FFBEYQA2"},"agent_actions":{"view_html":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ","download_json":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ.json","view_paper":"https://pith.science/paper/FFBEYQA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06217&json=true","fetch_graph":"https://pith.science/api/pith-number/FFBEYQA2NU7BAFEUYGD6X26IDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FFBEYQA2NU7BAFEUYGD6X26IDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ/action/storage_attestation","attest_author":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ/action/author_attestation","sign_citation":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ/action/citation_signature","submit_replication":"https://pith.science/pith/FFBEYQA2NU7BAFEUYGD6X26IDJ/action/replication_record"}},"created_at":"2026-05-18T00:00:38.323773+00:00","updated_at":"2026-05-18T00:00:38.323773+00:00"}