{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:23WF265ZFDLJDLBZOQO6R72STQ","short_pith_number":"pith:23WF265Z","schema_version":"1.0","canonical_sha256":"d6ec5d7bb928d691ac39741de8ff529c0cb42265fcca0eb67daa06b6548fa6fb","source":{"kind":"arxiv","id":"1512.04856","version":2},"attestation_state":"computed","paper":{"title":"Approximating the Simplicial Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Donald R. Sheehy, Peyman Afshani, Yannik Stein","submitted_at":"2015-12-15T17:00:49Z","abstract_excerpt":"Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth with many applications in robust statistics and computational geometry. Computing the simplicial depth of a point is known to be a challenging problem. The trivial solution requires $O(n^{d+1})$ time whereas it is generally believed that one cannot do better than $O(n^{d-1})$. In this paper, we consider approximation algorithms for computing the simplicial d"},"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":"1512.04856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-15T17:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"c518f3e5bd354e972c18b7d37ade40c6064fa23721d6fdc5cc0036b6c18da240","abstract_canon_sha256":"5d76fc275d09a0a81c8e29ed13e207bd7f779a8c2a761bb069e38c1ff9d43139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:44.026864Z","signature_b64":"Bl0zoEo9U+t09QDDhcxTCjhm+uE87RmmULBYds4Q6BgzmbibSc9bd6074j4vEfAFZPM+9y1bGT0LK4kG9c11DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ec5d7bb928d691ac39741de8ff529c0cb42265fcca0eb67daa06b6548fa6fb","last_reissued_at":"2026-05-18T01:23:44.026180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:44.026180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Simplicial Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Donald R. Sheehy, Peyman Afshani, Yannik Stein","submitted_at":"2015-12-15T17:00:49Z","abstract_excerpt":"Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth with many applications in robust statistics and computational geometry. Computing the simplicial depth of a point is known to be a challenging problem. The trivial solution requires $O(n^{d+1})$ time whereas it is generally believed that one cannot do better than $O(n^{d-1})$. In this paper, we consider approximation algorithms for computing the simplicial d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04856","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":"1512.04856","created_at":"2026-05-18T01:23:44.026296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04856v2","created_at":"2026-05-18T01:23:44.026296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04856","created_at":"2026-05-18T01:23:44.026296+00:00"},{"alias_kind":"pith_short_12","alias_value":"23WF265ZFDLJ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"23WF265ZFDLJDLBZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"23WF265Z","created_at":"2026-05-18T12:28:59.999130+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/23WF265ZFDLJDLBZOQO6R72STQ","json":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ.json","graph_json":"https://pith.science/api/pith-number/23WF265ZFDLJDLBZOQO6R72STQ/graph.json","events_json":"https://pith.science/api/pith-number/23WF265ZFDLJDLBZOQO6R72STQ/events.json","paper":"https://pith.science/paper/23WF265Z"},"agent_actions":{"view_html":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ","download_json":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ.json","view_paper":"https://pith.science/paper/23WF265Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04856&json=true","fetch_graph":"https://pith.science/api/pith-number/23WF265ZFDLJDLBZOQO6R72STQ/graph.json","fetch_events":"https://pith.science/api/pith-number/23WF265ZFDLJDLBZOQO6R72STQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ/action/storage_attestation","attest_author":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ/action/author_attestation","sign_citation":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ/action/citation_signature","submit_replication":"https://pith.science/pith/23WF265ZFDLJDLBZOQO6R72STQ/action/replication_record"}},"created_at":"2026-05-18T01:23:44.026296+00:00","updated_at":"2026-05-18T01:23:44.026296+00:00"}