{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YYJSJHQBIV4EJGIWZBSQHVYZ5P","short_pith_number":"pith:YYJSJHQB","canonical_record":{"source":{"id":"1704.00683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-03T16:51:44Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"6e72705aa3c9b4fb44594cc632fe86d1fd36588db4bc5c2a40fe89060e960744","abstract_canon_sha256":"2d2014ae4a588fc4bf693531ae863aa088d8186cc202db04614bc7684f34686b"},"schema_version":"1.0"},"canonical_sha256":"c613249e014578449916c86503d719ebd143b14d722fb73a447320a62064b47d","source":{"kind":"arxiv","id":"1704.00683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00683","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00683v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00683","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"YYJSJHQBIV4E","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YYJSJHQBIV4EJGIW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YYJSJHQB","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YYJSJHQBIV4EJGIWZBSQHVYZ5P","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-03T16:51:44Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"6e72705aa3c9b4fb44594cc632fe86d1fd36588db4bc5c2a40fe89060e960744","abstract_canon_sha256":"2d2014ae4a588fc4bf693531ae863aa088d8186cc202db04614bc7684f34686b"},"schema_version":"1.0"},"canonical_sha256":"c613249e014578449916c86503d719ebd143b14d722fb73a447320a62064b47d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:21.623201Z","signature_b64":"1p27rF+ZJ2rDRawYuhepuPV/bq5huxlnjJ+3I1j3xfjl/7nyI1HGspqoI8j8UkzZfIO71mZbZhoA6R3KdMT3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c613249e014578449916c86503d719ebd143b14d722fb73a447320a62064b47d","last_reissued_at":"2026-05-18T00:47:21.622579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:21.622579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00683","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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+YOHJaR4Twd0uZN+FkZok4TFt2mVcdtKCMTzVgsRNSJ+4oPfJCIQ0bhfc30WQTPLjAYWCkVK1+ThNdmIiA2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:15:08.928997Z"},"content_sha256":"76ff87b520febac896480d1e7ec9608697006e3472bedd870f640750aadda753","schema_version":"1.0","event_id":"sha256:76ff87b520febac896480d1e7ec9608697006e3472bedd870f640750aadda753"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YYJSJHQBIV4EJGIWZBSQHVYZ5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Big Holes in Big Data: A Monte Carlo Algorithm for Detecting Large Hyper-rectangles in High Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cs.CG","authors_text":"Filip Jagodzinski, Joseph Lemley, Razvan Andonie","submitted_at":"2017-04-03T16:51:44Z","abstract_excerpt":"We present the first algorithm for finding holes in high dimensional data that runs in polynomial time with respect to the number of dimensions. Previous algorithms are exponential. Finding large empty rectangles or boxes in a set of points in 2D and 3D space has been well studied. Efficient algorithms exist to identify the empty regions in these low-dimensional spaces. Unfortunately such efficiency is lacking in higher dimensions where the problem has been shown to be NP-complete when the dimensions are included in the input. Applications for algorithms that find large empty spaces include bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00683","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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JiHU5+g0neaCOpPqoXudRSXWVBstwN+hiKtn++sgKsgn2Wv0o1rbDPlXHvuuuC9D1Bz5grAwxzu5PY35sutJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:15:08.929464Z"},"content_sha256":"a919b8f7400e05d3f590c994d214a7a749143edfbf72a6b2bf1025f300403be2","schema_version":"1.0","event_id":"sha256:a919b8f7400e05d3f590c994d214a7a749143edfbf72a6b2bf1025f300403be2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYJSJHQBIV4EJGIWZBSQHVYZ5P/bundle.json","state_url":"https://pith.science/pith/YYJSJHQBIV4EJGIWZBSQHVYZ5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYJSJHQBIV4EJGIWZBSQHVYZ5P/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-08-23T17:15:08Z","links":{"resolver":"https://pith.science/pith/YYJSJHQBIV4EJGIWZBSQHVYZ5P","bundle":"https://pith.science/pith/YYJSJHQBIV4EJGIWZBSQHVYZ5P/bundle.json","state":"https://pith.science/pith/YYJSJHQBIV4EJGIWZBSQHVYZ5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYJSJHQBIV4EJGIWZBSQHVYZ5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YYJSJHQBIV4EJGIWZBSQHVYZ5P","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":"2d2014ae4a588fc4bf693531ae863aa088d8186cc202db04614bc7684f34686b","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-03T16:51:44Z","title_canon_sha256":"6e72705aa3c9b4fb44594cc632fe86d1fd36588db4bc5c2a40fe89060e960744"},"schema_version":"1.0","source":{"id":"1704.00683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00683","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00683v1","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00683","created_at":"2026-05-18T00:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"YYJSJHQBIV4E","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YYJSJHQBIV4EJGIW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YYJSJHQB","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a919b8f7400e05d3f590c994d214a7a749143edfbf72a6b2bf1025f300403be2","target":"graph","created_at":"2026-05-18T00:47:21Z","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 present the first algorithm for finding holes in high dimensional data that runs in polynomial time with respect to the number of dimensions. Previous algorithms are exponential. Finding large empty rectangles or boxes in a set of points in 2D and 3D space has been well studied. Efficient algorithms exist to identify the empty regions in these low-dimensional spaces. Unfortunately such efficiency is lacking in higher dimensions where the problem has been shown to be NP-complete when the dimensions are included in the input. Applications for algorithms that find large empty spaces include bi","authors_text":"Filip Jagodzinski, Joseph Lemley, Razvan Andonie","cross_cats":["physics.data-an"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-03T16:51:44Z","title":"Big Holes in Big Data: A Monte Carlo Algorithm for Detecting Large Hyper-rectangles in High Dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00683","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:76ff87b520febac896480d1e7ec9608697006e3472bedd870f640750aadda753","target":"record","created_at":"2026-05-18T00:47:21Z","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":"2d2014ae4a588fc4bf693531ae863aa088d8186cc202db04614bc7684f34686b","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-04-03T16:51:44Z","title_canon_sha256":"6e72705aa3c9b4fb44594cc632fe86d1fd36588db4bc5c2a40fe89060e960744"},"schema_version":"1.0","source":{"id":"1704.00683","kind":"arxiv","version":1}},"canonical_sha256":"c613249e014578449916c86503d719ebd143b14d722fb73a447320a62064b47d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c613249e014578449916c86503d719ebd143b14d722fb73a447320a62064b47d","first_computed_at":"2026-05-18T00:47:21.622579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:21.622579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1p27rF+ZJ2rDRawYuhepuPV/bq5huxlnjJ+3I1j3xfjl/7nyI1HGspqoI8j8UkzZfIO71mZbZhoA6R3KdMT3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:21.623201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ff87b520febac896480d1e7ec9608697006e3472bedd870f640750aadda753","sha256:a919b8f7400e05d3f590c994d214a7a749143edfbf72a6b2bf1025f300403be2"],"state_sha256":"eb63b101f605bcf58830b9590558ac85a4ead451feaa1889c76cdc3891ad8e5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AOyJmrY4cef41zaJOVVvpDHgFyWsRq1QroGQe1o5CgMRuUebKYuOmRT5ws8VGEORbI4uEfBg9CXTvvGSBbeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T17:15:08.934744Z","bundle_sha256":"c70d96a5d622ccf8bac3ea1a4ee7ecc73268d2d64bd302dad321d2fa4f4fca58"}}