{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4PH5W2AQECGOM6FIWT77BGDGYW","short_pith_number":"pith:4PH5W2AQ","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"},"canonical_sha256":"e3cfdb6810208ce678a8b4fff09866c5a0139d7d3325b6d4ee12b648d070004d","source":{"kind":"arxiv","id":"1603.05609","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05609","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05609v2","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05609","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"4PH5W2AQECGO","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4PH5W2AQECGOM6FI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4PH5W2AQ","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4PH5W2AQECGOM6FIWT77BGDGYW","target":"record","payload":{"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"},"canonical_sha256":"e3cfdb6810208ce678a8b4fff09866c5a0139d7d3325b6d4ee12b648d070004d","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"},"source_kind":"arxiv","source_id":"1603.05609","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-18T00:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwVhO0RMZMxkJiOvwTF4JSW98BZ67jzff6EvEq46dsPkcnWai5f3pc9RZ/QjmwNtJXOPRJeNV1Kgd0YrxxjeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:10:23.754294Z"},"content_sha256":"f1c463d7e6c82060edd91695128e04370d95d824bf35434b68197656eea9b764","schema_version":"1.0","event_id":"sha256:f1c463d7e6c82060edd91695128e04370d95d824bf35434b68197656eea9b764"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4PH5W2AQECGOM6FIWT77BGDGYW","target":"graph","payload":{"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"},"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:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"loE7HxmSuLB7Cm/MZu4kgUjVMSmgU+GDtaqkO6J29CT7KXoAdkOZbFeW7u6mEwKpFz1EWkRNuprP1OVt69h+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:10:23.755042Z"},"content_sha256":"d5ab836b9e75a4afb203416a263bf96a2ad1e3f004ee7722dc1c075f3e636b2d","schema_version":"1.0","event_id":"sha256:d5ab836b9e75a4afb203416a263bf96a2ad1e3f004ee7722dc1c075f3e636b2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/bundle.json","state_url":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PH5W2AQECGOM6FIWT77BGDGYW/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-31T09:10:23Z","links":{"resolver":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW","bundle":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/bundle.json","state":"https://pith.science/pith/4PH5W2AQECGOM6FIWT77BGDGYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PH5W2AQECGOM6FIWT77BGDGYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4PH5W2AQECGOM6FIWT77BGDGYW","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":"3dc32e9f8641bbc1e4d78c97a88d8f7cc56ce7c209b769c8fd829fe46fa4839d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-17T18:47:30Z","title_canon_sha256":"0fccbc1987e21d9c06f9486c8c78ddfec7accf474d809ff75acc379cd4565c60"},"schema_version":"1.0","source":{"id":"1603.05609","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05609","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05609v2","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05609","created_at":"2026-05-18T00:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"4PH5W2AQECGO","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4PH5W2AQECGOM6FI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4PH5W2AQ","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:d5ab836b9e75a4afb203416a263bf96a2ad1e3f004ee7722dc1c075f3e636b2d","target":"graph","created_at":"2026-05-18T00:58:55Z","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 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","authors_text":"Milan Merkle, Milica Bogicevic","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-17T18:47:30Z","title":"ABCDepth: efficient algorithm for Tukey depth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05609","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:f1c463d7e6c82060edd91695128e04370d95d824bf35434b68197656eea9b764","target":"record","created_at":"2026-05-18T00:58:55Z","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":"3dc32e9f8641bbc1e4d78c97a88d8f7cc56ce7c209b769c8fd829fe46fa4839d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-17T18:47:30Z","title_canon_sha256":"0fccbc1987e21d9c06f9486c8c78ddfec7accf474d809ff75acc379cd4565c60"},"schema_version":"1.0","source":{"id":"1603.05609","kind":"arxiv","version":2}},"canonical_sha256":"e3cfdb6810208ce678a8b4fff09866c5a0139d7d3325b6d4ee12b648d070004d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3cfdb6810208ce678a8b4fff09866c5a0139d7d3325b6d4ee12b648d070004d","first_computed_at":"2026-05-18T00:58:55.327347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:55.327347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRYc+jMmRPNYuXFdP5gBR6LqanwMSMv637+pLIKtwgDsjsiS9G/cXgJrd55If8HfhpBY2s1ncx2kaNpiNh2BBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:55.327909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05609","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1c463d7e6c82060edd91695128e04370d95d824bf35434b68197656eea9b764","sha256:d5ab836b9e75a4afb203416a263bf96a2ad1e3f004ee7722dc1c075f3e636b2d"],"state_sha256":"84d002dfc29dc8b6c42fc7c3a7e8afc7e418b2277016082682b50c247aa9a223"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkV2gYhPcmMQkB9njQG6aE1VqVvY7liuMneyHjRqLyyn+gb5wjZL2tvJUMBUuRlY+BXFT/el5WVk9MpqdDfyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:10:23.758765Z","bundle_sha256":"1b80642fde8b8919d0010ad69c322503f5b41f07cad524b94f6ffdaa92bd45a3"}}