{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YROADGA2JK25ZU5ER2FK7RHM3T","short_pith_number":"pith:YROADGA2","schema_version":"1.0","canonical_sha256":"c45c01981a4ab5dcd3a48e8aafc4ecdce076171b31516de399bc4a86a6c8d791","source":{"kind":"arxiv","id":"1705.10022","version":3},"attestation_state":"computed","paper":{"title":"Depth Distribution in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Javiel Rojas-Ledesma, J\\'er\\'emy Barbay, Pablo P\\'erez-Lantero","submitted_at":"2017-05-29T02:31:33Z","abstract_excerpt":"Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set $\\mathcal{B}$ of axis aligned boxes, whose computation generalizes that of the Klee's Measure and of the Maximum Depth. In the worst case over instances of fixed input size $n$, we describe an algorithm of complexity within $O({n^\\frac{d+1}{2}\\log n})$, using space within $O({n\\log n})$, mixing two techniques previously used to compute the Klee's Measure. We refine this result and previous results on the Klee's Measure and the Maximum Depth for various measures of difficulty"},"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":"1705.10022","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-29T02:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"a0e8ac26650f35f2518e721db6c7d3cbb5e8d75cc5114c40f284c7c7ac0dce2c","abstract_canon_sha256":"612bc2bc686270629200d4dc687ef1a92575cfa3e9b1f8fdea290ee6dcbb8456"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.349096Z","signature_b64":"XXlO7ea4XrQiqwGMQow26dQ58Vlmtu5kS7czy2bXfeTygd52d+Idg3CRPZc/f+Eg+CUmTz1z9xehBTZDWlCwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c45c01981a4ab5dcd3a48e8aafc4ecdce076171b31516de399bc4a86a6c8d791","last_reissued_at":"2026-05-18T00:43:15.348451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.348451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth Distribution in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Javiel Rojas-Ledesma, J\\'er\\'emy Barbay, Pablo P\\'erez-Lantero","submitted_at":"2017-05-29T02:31:33Z","abstract_excerpt":"Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set $\\mathcal{B}$ of axis aligned boxes, whose computation generalizes that of the Klee's Measure and of the Maximum Depth. In the worst case over instances of fixed input size $n$, we describe an algorithm of complexity within $O({n^\\frac{d+1}{2}\\log n})$, using space within $O({n\\log n})$, mixing two techniques previously used to compute the Klee's Measure. We refine this result and previous results on the Klee's Measure and the Maximum Depth for various measures of difficulty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10022","kind":"arxiv","version":3},"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":"1705.10022","created_at":"2026-05-18T00:43:15.348565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10022v3","created_at":"2026-05-18T00:43:15.348565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10022","created_at":"2026-05-18T00:43:15.348565+00:00"},{"alias_kind":"pith_short_12","alias_value":"YROADGA2JK25","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YROADGA2JK25ZU5E","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YROADGA2","created_at":"2026-05-18T12:31:56.362134+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/YROADGA2JK25ZU5ER2FK7RHM3T","json":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T.json","graph_json":"https://pith.science/api/pith-number/YROADGA2JK25ZU5ER2FK7RHM3T/graph.json","events_json":"https://pith.science/api/pith-number/YROADGA2JK25ZU5ER2FK7RHM3T/events.json","paper":"https://pith.science/paper/YROADGA2"},"agent_actions":{"view_html":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T","download_json":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T.json","view_paper":"https://pith.science/paper/YROADGA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10022&json=true","fetch_graph":"https://pith.science/api/pith-number/YROADGA2JK25ZU5ER2FK7RHM3T/graph.json","fetch_events":"https://pith.science/api/pith-number/YROADGA2JK25ZU5ER2FK7RHM3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T/action/storage_attestation","attest_author":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T/action/author_attestation","sign_citation":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T/action/citation_signature","submit_replication":"https://pith.science/pith/YROADGA2JK25ZU5ER2FK7RHM3T/action/replication_record"}},"created_at":"2026-05-18T00:43:15.348565+00:00","updated_at":"2026-05-18T00:43:15.348565+00:00"}