{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2EJ5X5B3NIFSQGHTMHN7RCXBGK","short_pith_number":"pith:2EJ5X5B3","schema_version":"1.0","canonical_sha256":"d113dbf43b6a0b2818f361dbf88ae1329177215c98d832bc2961206f5170c961","source":{"kind":"arxiv","id":"1608.06874","version":2},"attestation_state":"computed","paper":{"title":"Perfect vector sets, properly overlapping partitions, and largest empty box","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Adrian Dumitrescu, Minghui Jiang","submitted_at":"2016-08-24T15:48:25Z","abstract_excerpt":"We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but contains no points of $S$. (I) We present an algorithm that finds a large empty box amidst $n$ points in $[0,1]^d$: a box whose volume is at least $\\frac{\\log{d}}{4(n + \\log{d})}$ can be computed in $O(n+d \\log{d})$ time. (II) To better analyze the above approach, we introduce the concepts of perfect vector sets and properly overlapping partitions, in connectio"},"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":"1608.06874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T15:48:25Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2818b1a3393ea6d1854de650308bc7d8926f22cabd627cdf0c8c3a349ea8e7b1","abstract_canon_sha256":"dca8282da8cb229427b9d9e191e1d5b67abd315169f1137333eff0c31b2f4a45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:20.527639Z","signature_b64":"QXUkkswKHiXhbGtdsGRQ6Y8q2VsaCz9U0IydsJIMmuc0+5YbfFCyB5zxnmR2xbd/eaxdHCE2GiptMSM2Q6cgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d113dbf43b6a0b2818f361dbf88ae1329177215c98d832bc2961206f5170c961","last_reissued_at":"2026-05-18T01:02:20.527147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:20.527147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect vector sets, properly overlapping partitions, and largest empty box","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Adrian Dumitrescu, Minghui Jiang","submitted_at":"2016-08-24T15:48:25Z","abstract_excerpt":"We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but contains no points of $S$. (I) We present an algorithm that finds a large empty box amidst $n$ points in $[0,1]^d$: a box whose volume is at least $\\frac{\\log{d}}{4(n + \\log{d})}$ can be computed in $O(n+d \\log{d})$ time. (II) To better analyze the above approach, we introduce the concepts of perfect vector sets and properly overlapping partitions, in connectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06874","kind":"arxiv","version":2},"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":"1608.06874","created_at":"2026-05-18T01:02:20.527222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06874v2","created_at":"2026-05-18T01:02:20.527222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06874","created_at":"2026-05-18T01:02:20.527222+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EJ5X5B3NIFS","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EJ5X5B3NIFSQGHT","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EJ5X5B3","created_at":"2026-05-18T12:29:55.572404+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/2EJ5X5B3NIFSQGHTMHN7RCXBGK","json":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK.json","graph_json":"https://pith.science/api/pith-number/2EJ5X5B3NIFSQGHTMHN7RCXBGK/graph.json","events_json":"https://pith.science/api/pith-number/2EJ5X5B3NIFSQGHTMHN7RCXBGK/events.json","paper":"https://pith.science/paper/2EJ5X5B3"},"agent_actions":{"view_html":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK","download_json":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK.json","view_paper":"https://pith.science/paper/2EJ5X5B3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06874&json=true","fetch_graph":"https://pith.science/api/pith-number/2EJ5X5B3NIFSQGHTMHN7RCXBGK/graph.json","fetch_events":"https://pith.science/api/pith-number/2EJ5X5B3NIFSQGHTMHN7RCXBGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/action/storage_attestation","attest_author":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/action/author_attestation","sign_citation":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/action/citation_signature","submit_replication":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/action/replication_record"}},"created_at":"2026-05-18T01:02:20.527222+00:00","updated_at":"2026-05-18T01:02:20.527222+00:00"}