{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2EJ5X5B3NIFSQGHTMHN7RCXBGK","short_pith_number":"pith:2EJ5X5B3","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"},"canonical_sha256":"d113dbf43b6a0b2818f361dbf88ae1329177215c98d832bc2961206f5170c961","source":{"kind":"arxiv","id":"1608.06874","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06874","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06874v2","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06874","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"2EJ5X5B3NIFS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2EJ5X5B3NIFSQGHT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2EJ5X5B3","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2EJ5X5B3NIFSQGHTMHN7RCXBGK","target":"record","payload":{"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"},"canonical_sha256":"d113dbf43b6a0b2818f361dbf88ae1329177215c98d832bc2961206f5170c961","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"},"source_kind":"arxiv","source_id":"1608.06874","source_version":2,"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-18T01:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3EU9SxhxzAKIXD4XmLe+pkItPfFT2CLtiS2Z5AKGqmR/g4n3BhveUoQ6XlYluAAtp9Y+JPiMqmv2lpSz06QCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:54:13.726014Z"},"content_sha256":"f4b9d048d7f04e7c09528e72bf7824f6c21613fc7c8386126b2807b2129741ca","schema_version":"1.0","event_id":"sha256:f4b9d048d7f04e7c09528e72bf7824f6c21613fc7c8386126b2807b2129741ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2EJ5X5B3NIFSQGHTMHN7RCXBGK","target":"graph","payload":{"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"},"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-18T01:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOgD5syDQi9GtPJguXqmxBIXJQVJYMzd4BAy+XGK1TP+f+TQzFwaeIyv1bzEcoQ+zCuMeUpSv3qK68tn7Y1VBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:54:13.726406Z"},"content_sha256":"dd75fb1e586907ba7ae18abc9b97dc329c499e71646760de6a6b54273ddac096","schema_version":"1.0","event_id":"sha256:dd75fb1e586907ba7ae18abc9b97dc329c499e71646760de6a6b54273ddac096"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/bundle.json","state_url":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/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-05-30T11:54:13Z","links":{"resolver":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK","bundle":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/bundle.json","state":"https://pith.science/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EJ5X5B3NIFSQGHTMHN7RCXBGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2EJ5X5B3NIFSQGHTMHN7RCXBGK","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":"dca8282da8cb229427b9d9e191e1d5b67abd315169f1137333eff0c31b2f4a45","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T15:48:25Z","title_canon_sha256":"2818b1a3393ea6d1854de650308bc7d8926f22cabd627cdf0c8c3a349ea8e7b1"},"schema_version":"1.0","source":{"id":"1608.06874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06874","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06874v2","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06874","created_at":"2026-05-18T01:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"2EJ5X5B3NIFS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2EJ5X5B3NIFSQGHT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2EJ5X5B3","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:dd75fb1e586907ba7ae18abc9b97dc329c499e71646760de6a6b54273ddac096","target":"graph","created_at":"2026-05-18T01:02:20Z","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":"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","authors_text":"Adrian Dumitrescu, Minghui Jiang","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T15:48:25Z","title":"Perfect vector sets, properly overlapping partitions, and largest empty box"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06874","kind":"arxiv","version":2},"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:f4b9d048d7f04e7c09528e72bf7824f6c21613fc7c8386126b2807b2129741ca","target":"record","created_at":"2026-05-18T01:02:20Z","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":"dca8282da8cb229427b9d9e191e1d5b67abd315169f1137333eff0c31b2f4a45","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-24T15:48:25Z","title_canon_sha256":"2818b1a3393ea6d1854de650308bc7d8926f22cabd627cdf0c8c3a349ea8e7b1"},"schema_version":"1.0","source":{"id":"1608.06874","kind":"arxiv","version":2}},"canonical_sha256":"d113dbf43b6a0b2818f361dbf88ae1329177215c98d832bc2961206f5170c961","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d113dbf43b6a0b2818f361dbf88ae1329177215c98d832bc2961206f5170c961","first_computed_at":"2026-05-18T01:02:20.527147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:20.527147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QXUkkswKHiXhbGtdsGRQ6Y8q2VsaCz9U0IydsJIMmuc0+5YbfFCyB5zxnmR2xbd/eaxdHCE2GiptMSM2Q6cgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:20.527639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4b9d048d7f04e7c09528e72bf7824f6c21613fc7c8386126b2807b2129741ca","sha256:dd75fb1e586907ba7ae18abc9b97dc329c499e71646760de6a6b54273ddac096"],"state_sha256":"dec2fa0046d527e06a2929fdbb4f6055900ca3822d9b54fe6de1a3b607c4f819"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alyK+ctsnayXzDkJ4L2gZ4rIRAgHlbLLwECOeOA0WKbVpiMW43FjCjO2jfzFJ+C7EpaHCGKIigpEbFRGFRjpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:54:13.728585Z","bundle_sha256":"30af99a5dea6002d13e9dac9714ad6d8594713f094833d276173f5d460059cfa"}}