{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LS7536RG7BXTOFENXQGVM4KIXJ","short_pith_number":"pith:LS7536RG","schema_version":"1.0","canonical_sha256":"5cbfddfa26f86f37148dbc0d567148ba56868e2df453093ede867ad936d7baac","source":{"kind":"arxiv","id":"1706.03268","version":1},"attestation_state":"computed","paper":{"title":"Maximum Area Rectangle Separating Red and Blue Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bogdan Armaselu, Ovidiu Daescu","submitted_at":"2017-06-10T18:48:18Z","abstract_excerpt":"Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum separating rectangle. We address the planar, axis-aligned (2D) version, and present an O(mlogm+n) time, O(m+n) space algorithm. The running time reduces to O(m + n) if the points are pre-sorted by one of the coordinates. We further prove that our algorithm is optimal in the decision model of computation."},"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":"1706.03268","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-06-10T18:48:18Z","cross_cats_sorted":[],"title_canon_sha256":"66c57287919ea13794723c3bf03cfadad6a260c66627322c38b63d20f325449f","abstract_canon_sha256":"b40850e4ab5b48f5e8a58a53781c422e3d36c3fcbc97c6a09e97b7fd1351eb94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:37.976501Z","signature_b64":"LGFNUSE9IBeB27ETEVX8Gh/8oDpVkaKB5Bxj1PEwIm96/rcvnNXsIm8cW0erASGbiSo83K0wHLQsL6PrMJXMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cbfddfa26f86f37148dbc0d567148ba56868e2df453093ede867ad936d7baac","last_reissued_at":"2026-05-18T00:42:37.975838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:37.975838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Area Rectangle Separating Red and Blue Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bogdan Armaselu, Ovidiu Daescu","submitted_at":"2017-06-10T18:48:18Z","abstract_excerpt":"Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum separating rectangle. We address the planar, axis-aligned (2D) version, and present an O(mlogm+n) time, O(m+n) space algorithm. The running time reduces to O(m + n) if the points are pre-sorted by one of the coordinates. We further prove that our algorithm is optimal in the decision model of computation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03268","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":"1706.03268","created_at":"2026-05-18T00:42:37.975951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03268v1","created_at":"2026-05-18T00:42:37.975951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03268","created_at":"2026-05-18T00:42:37.975951+00:00"},{"alias_kind":"pith_short_12","alias_value":"LS7536RG7BXT","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LS7536RG7BXTOFEN","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LS7536RG","created_at":"2026-05-18T12:31:28.150371+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/LS7536RG7BXTOFENXQGVM4KIXJ","json":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ.json","graph_json":"https://pith.science/api/pith-number/LS7536RG7BXTOFENXQGVM4KIXJ/graph.json","events_json":"https://pith.science/api/pith-number/LS7536RG7BXTOFENXQGVM4KIXJ/events.json","paper":"https://pith.science/paper/LS7536RG"},"agent_actions":{"view_html":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ","download_json":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ.json","view_paper":"https://pith.science/paper/LS7536RG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03268&json=true","fetch_graph":"https://pith.science/api/pith-number/LS7536RG7BXTOFENXQGVM4KIXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LS7536RG7BXTOFENXQGVM4KIXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/action/storage_attestation","attest_author":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/action/author_attestation","sign_citation":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/action/citation_signature","submit_replication":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/action/replication_record"}},"created_at":"2026-05-18T00:42:37.975951+00:00","updated_at":"2026-05-18T00:42:37.975951+00:00"}