{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AMUB7O4LCDOUY6LT636VBSSY7G","short_pith_number":"pith:AMUB7O4L","schema_version":"1.0","canonical_sha256":"03281fbb8b10dd4c7973f6fd50ca58f9914b5e5f84a150a88aa2a8863a6332af","source":{"kind":"arxiv","id":"1812.03174","version":1},"attestation_state":"computed","paper":{"title":"Approximate Calculation of Tukey's Depth and Median With High-dimensional Data","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Milan Merkle, Milica Bogi\\'cevi\\'c","submitted_at":"2018-12-07T10:27:14Z","abstract_excerpt":"We present a new fast approximate algorithm for Tukey (halfspace) depth level sets and its implementation-ABCDepth. Given a $d$-dimensional data set for any $d\\geq 1$, the algorithm is based on a representation of level sets as intersections of balls in $\\mathbb{R}^d$. Our approach does not need calculations of projections of sample points to directions. This novel idea enables calculations of approximate level sets in very high dimensions with complexity which is linear in $d$, which provides a great advantage over all other approximate algorithms. Using different versions of this algorithm w"},"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":"1812.03174","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-07T10:27:14Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4822e1b0e45228168258fe2f8636e248003a32be4bd5e61afffded21803120f1","abstract_canon_sha256":"a389eba98141b8e478e34bc390a480b327f685d847457ea12f722a77f4bf1d34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:46.993274Z","signature_b64":"/YVExOoYXoaL4IGbFT9rv2TFd3xOjq58Hz5lIXLUsZ+noDze50cPxMYc+h0k4F4LqrgCyYWBR1JRsha7m71/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03281fbb8b10dd4c7973f6fd50ca58f9914b5e5f84a150a88aa2a8863a6332af","last_reissued_at":"2026-05-17T23:58:46.992559Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:46.992559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Calculation of Tukey's Depth and Median With High-dimensional Data","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Milan Merkle, Milica Bogi\\'cevi\\'c","submitted_at":"2018-12-07T10:27:14Z","abstract_excerpt":"We present a new fast approximate algorithm for Tukey (halfspace) depth level sets and its implementation-ABCDepth. Given a $d$-dimensional data set for any $d\\geq 1$, the algorithm is based on a representation of level sets as intersections of balls in $\\mathbb{R}^d$. Our approach does not need calculations of projections of sample points to directions. This novel idea enables calculations of approximate level sets in very high dimensions with complexity which is linear in $d$, which provides a great advantage over all other approximate algorithms. Using different versions of this algorithm w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03174","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.03174","created_at":"2026-05-17T23:58:46.992677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03174v1","created_at":"2026-05-17T23:58:46.992677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03174","created_at":"2026-05-17T23:58:46.992677+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMUB7O4LCDOU","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMUB7O4LCDOUY6LT","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMUB7O4L","created_at":"2026-05-18T12:32:13.499390+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/AMUB7O4LCDOUY6LT636VBSSY7G","json":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G.json","graph_json":"https://pith.science/api/pith-number/AMUB7O4LCDOUY6LT636VBSSY7G/graph.json","events_json":"https://pith.science/api/pith-number/AMUB7O4LCDOUY6LT636VBSSY7G/events.json","paper":"https://pith.science/paper/AMUB7O4L"},"agent_actions":{"view_html":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G","download_json":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G.json","view_paper":"https://pith.science/paper/AMUB7O4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03174&json=true","fetch_graph":"https://pith.science/api/pith-number/AMUB7O4LCDOUY6LT636VBSSY7G/graph.json","fetch_events":"https://pith.science/api/pith-number/AMUB7O4LCDOUY6LT636VBSSY7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G/action/storage_attestation","attest_author":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G/action/author_attestation","sign_citation":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G/action/citation_signature","submit_replication":"https://pith.science/pith/AMUB7O4LCDOUY6LT636VBSSY7G/action/replication_record"}},"created_at":"2026-05-17T23:58:46.992677+00:00","updated_at":"2026-05-17T23:58:46.992677+00:00"}