{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4PH5W2AQECGOM6FIWT77BGDGYW","short_pith_number":"pith:4PH5W2AQ","schema_version":"1.0","canonical_sha256":"e3cfdb6810208ce678a8b4fff09866c5a0139d7d3325b6d4ee12b648d070004d","source":{"kind":"arxiv","id":"1603.05609","version":2},"attestation_state":"computed","paper":{"title":"ABCDepth: efficient algorithm for Tukey depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Milan Merkle, Milica Bogicevic","submitted_at":"2016-03-17T18:47:30Z","abstract_excerpt":"We present a new algorithm for Tukey (halfspace) depth level sets and its implementation. Given $d$-dimensional data set for any $d\\geq 2$, the algorithm is based on representation of level sets as intersections of balls in $R^d$, and can be easily adapted to related depths (Type D, Zuo and Serfling (Ann. Stat. {\\bf 28} (2000), 461--482)). The algorithm complexity is $O(dn^2 + n^2\\log{n})$ where $n$ is the data set size. Examples with real and synthetic data show that the algorithm is much faster than other implemented algorithms and that it can accept thousands of multidimensional observation"},"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":"1603.05609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-17T18:47:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0fccbc1987e21d9c06f9486c8c78ddfec7accf474d809ff75acc379cd4565c60","abstract_canon_sha256":"3dc32e9f8641bbc1e4d78c97a88d8f7cc56ce7c209b769c8fd829fe46fa4839d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:55.327909Z","signature_b64":"QRYc+jMmRPNYuXFdP5gBR6LqanwMSMv637+pLIKtwgDsjsiS9G/cXgJrd55If8HfhpBY2s1ncx2kaNpiNh2BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3cfdb6810208ce678a8b4fff09866c5a0139d7d3325b6d4ee12b648d070004d","last_reissued_at":"2026-05-18T00:58:55.327347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:55.327347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ABCDepth: efficient algorithm for Tukey depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Milan Merkle, Milica Bogicevic","submitted_at":"2016-03-17T18:47:30Z","abstract_excerpt":"We present a new algorithm for Tukey (halfspace) depth level sets and its implementation. Given $d$-dimensional data set for any $d\\geq 2$, the algorithm is based on representation of level sets as intersections of balls in $R^d$, and can be easily adapted to related depths (Type D, Zuo and Serfling (Ann. Stat. {\\bf 28} (2000), 461--482)). The algorithm complexity is $O(dn^2 + n^2\\log{n})$ where $n$ is the data set size. Examples with real and synthetic data show that the algorithm is much faster than other implemented algorithms and that it can accept thousands of multidimensional observation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05609","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":"1603.05609","created_at":"2026-05-18T00:58:55.327443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05609v2","created_at":"2026-05-18T00:58:55.327443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05609","created_at":"2026-05-18T00:58:55.327443+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PH5W2AQECGO","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PH5W2AQECGOM6FI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PH5W2AQ","created_at":"2026-05-18T12:29:58.707656+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/4PH5W2AQECGOM6FIWT77BGDGYW","json":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW.json","graph_json":"https://pith.science/api/pith-number/4PH5W2AQECGOM6FIWT77BGDGYW/graph.json","events_json":"https://pith.science/api/pith-number/4PH5W2AQECGOM6FIWT77BGDGYW/events.json","paper":"https://pith.science/paper/4PH5W2AQ"},"agent_actions":{"view_html":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW","download_json":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW.json","view_paper":"https://pith.science/paper/4PH5W2AQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05609&json=true","fetch_graph":"https://pith.science/api/pith-number/4PH5W2AQECGOM6FIWT77BGDGYW/graph.json","fetch_events":"https://pith.science/api/pith-number/4PH5W2AQECGOM6FIWT77BGDGYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/action/storage_attestation","attest_author":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/action/author_attestation","sign_citation":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/action/citation_signature","submit_replication":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/action/replication_record"}},"created_at":"2026-05-18T00:58:55.327443+00:00","updated_at":"2026-05-18T00:58:55.327443+00:00"}