{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LS7536RG7BXTOFENXQGVM4KIXJ","short_pith_number":"pith:LS7536RG","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"},"canonical_sha256":"5cbfddfa26f86f37148dbc0d567148ba56868e2df453093ede867ad936d7baac","source":{"kind":"arxiv","id":"1706.03268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03268","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03268v1","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03268","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"LS7536RG7BXT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LS7536RG7BXTOFEN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LS7536RG","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LS7536RG7BXTOFENXQGVM4KIXJ","target":"record","payload":{"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"},"canonical_sha256":"5cbfddfa26f86f37148dbc0d567148ba56868e2df453093ede867ad936d7baac","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"},"source_kind":"arxiv","source_id":"1706.03268","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-18T00:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poZVYnW4i9gjKuLPbmZKuhIDkMtcdQnAXMZ45QNOsSBjxxZql3bXCqeEjRQC7WRAjkWqOtDNkfqBY8RtJiPVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:43:51.847019Z"},"content_sha256":"0889ffcf835749118378a4fb510bec8da71f58f8bbc6fb853c747608b2a741cb","schema_version":"1.0","event_id":"sha256:0889ffcf835749118378a4fb510bec8da71f58f8bbc6fb853c747608b2a741cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LS7536RG7BXTOFENXQGVM4KIXJ","target":"graph","payload":{"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"},"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-18T00:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiDL4lnHuVisaAX5RK6sBUjbFKF8ZekfMDqhfTruhMB7Q6oidAjjxCFncbnVR+SbzKbcZR0374AW8up175zkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:43:51.847375Z"},"content_sha256":"8c8f67118d3230f7454988f72174a83f125f2e4732273fb92cc5d90c42c6c31f","schema_version":"1.0","event_id":"sha256:8c8f67118d3230f7454988f72174a83f125f2e4732273fb92cc5d90c42c6c31f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/bundle.json","state_url":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LS7536RG7BXTOFENXQGVM4KIXJ/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-06-04T04:43:51Z","links":{"resolver":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ","bundle":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/bundle.json","state":"https://pith.science/pith/LS7536RG7BXTOFENXQGVM4KIXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LS7536RG7BXTOFENXQGVM4KIXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LS7536RG7BXTOFENXQGVM4KIXJ","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":"b40850e4ab5b48f5e8a58a53781c422e3d36c3fcbc97c6a09e97b7fd1351eb94","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-06-10T18:48:18Z","title_canon_sha256":"66c57287919ea13794723c3bf03cfadad6a260c66627322c38b63d20f325449f"},"schema_version":"1.0","source":{"id":"1706.03268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03268","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03268v1","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03268","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"LS7536RG7BXT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LS7536RG7BXTOFEN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LS7536RG","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:8c8f67118d3230f7454988f72174a83f125f2e4732273fb92cc5d90c42c6c31f","target":"graph","created_at":"2026-05-18T00:42:37Z","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":"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.","authors_text":"Bogdan Armaselu, Ovidiu Daescu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-06-10T18:48:18Z","title":"Maximum Area Rectangle Separating Red and Blue Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03268","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:0889ffcf835749118378a4fb510bec8da71f58f8bbc6fb853c747608b2a741cb","target":"record","created_at":"2026-05-18T00:42:37Z","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":"b40850e4ab5b48f5e8a58a53781c422e3d36c3fcbc97c6a09e97b7fd1351eb94","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2017-06-10T18:48:18Z","title_canon_sha256":"66c57287919ea13794723c3bf03cfadad6a260c66627322c38b63d20f325449f"},"schema_version":"1.0","source":{"id":"1706.03268","kind":"arxiv","version":1}},"canonical_sha256":"5cbfddfa26f86f37148dbc0d567148ba56868e2df453093ede867ad936d7baac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cbfddfa26f86f37148dbc0d567148ba56868e2df453093ede867ad936d7baac","first_computed_at":"2026-05-18T00:42:37.975838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:37.975838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LGFNUSE9IBeB27ETEVX8Gh/8oDpVkaKB5Bxj1PEwIm96/rcvnNXsIm8cW0erASGbiSo83K0wHLQsL6PrMJXMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:37.976501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0889ffcf835749118378a4fb510bec8da71f58f8bbc6fb853c747608b2a741cb","sha256:8c8f67118d3230f7454988f72174a83f125f2e4732273fb92cc5d90c42c6c31f"],"state_sha256":"c156dea9e02a34d3e6ff2216fea21c2f54e1478438d5145791ae0eb63f946b96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVd4aSXk4EvJZLujsjg9oHCZsdD81AszAap58oq4fIkr0Y9fQSX2UMMUsUelgVXM9ajRiuS/9MzKYcZTUfqIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:43:51.849443Z","bundle_sha256":"f5358d849762b8e690e545a1e058d7d92ff7dc2c1dddfb8d1951605f261ab82b"}}