{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YCJB3LGQSGK2ZR6IQNJHWOBBRM","short_pith_number":"pith:YCJB3LGQ","schema_version":"1.0","canonical_sha256":"c0921dacd09195acc7c883527b38218b1f61aeb70ea594a87d68da56d3cf31c1","source":{"kind":"arxiv","id":"1608.07348","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Colourful Simplicial Depth and Medians in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Olga Zasenko, Tamon Stephen","submitted_at":"2016-08-26T01:51:02Z","abstract_excerpt":"The colourful simplicial depth of a point x in the plane relative to a configuration of n points in k colour classes is exactly the number of closed simplices (triangles) with vertices from 3 different colour classes that contain x in their convex hull. We consider the problems of efficiently computing the colourful simplicial depth of a point x, and of finding a point, called a median, that maximizes colourful simplicial depth.\n  For computing the colourful simplicial depth of x, our algorithm runs in time O(n log(n) + k n) in general, and O(kn) if the points are sorted around x. For finding "},"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":"1608.07348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-08-26T01:51:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4df5f830cab12b4407f3a967ab23081c9a7520e24e116b0d8fcb430df0fd89ea","abstract_canon_sha256":"8b63916515f598af57855ffe6d37b97dc350a3d2a81f62488d9eccee14747702"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:53.302526Z","signature_b64":"ZlE6H0yQHViG3pJ7w0RyoTpG/Pxd+lWVXQykkcgHI+B/aw3e2la96+Lut9wnWi5rNU6o/ajhjJ1E91qeur1pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0921dacd09195acc7c883527b38218b1f61aeb70ea594a87d68da56d3cf31c1","last_reissued_at":"2026-05-18T01:07:53.301960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:53.301960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Colourful Simplicial Depth and Medians in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Olga Zasenko, Tamon Stephen","submitted_at":"2016-08-26T01:51:02Z","abstract_excerpt":"The colourful simplicial depth of a point x in the plane relative to a configuration of n points in k colour classes is exactly the number of closed simplices (triangles) with vertices from 3 different colour classes that contain x in their convex hull. We consider the problems of efficiently computing the colourful simplicial depth of a point x, and of finding a point, called a median, that maximizes colourful simplicial depth.\n  For computing the colourful simplicial depth of x, our algorithm runs in time O(n log(n) + k n) in general, and O(kn) if the points are sorted around x. For finding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07348","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":"1608.07348","created_at":"2026-05-18T01:07:53.302067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07348v1","created_at":"2026-05-18T01:07:53.302067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07348","created_at":"2026-05-18T01:07:53.302067+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCJB3LGQSGK2","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCJB3LGQSGK2ZR6I","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCJB3LGQ","created_at":"2026-05-18T12:30:53.716459+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/YCJB3LGQSGK2ZR6IQNJHWOBBRM","json":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM.json","graph_json":"https://pith.science/api/pith-number/YCJB3LGQSGK2ZR6IQNJHWOBBRM/graph.json","events_json":"https://pith.science/api/pith-number/YCJB3LGQSGK2ZR6IQNJHWOBBRM/events.json","paper":"https://pith.science/paper/YCJB3LGQ"},"agent_actions":{"view_html":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM","download_json":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM.json","view_paper":"https://pith.science/paper/YCJB3LGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07348&json=true","fetch_graph":"https://pith.science/api/pith-number/YCJB3LGQSGK2ZR6IQNJHWOBBRM/graph.json","fetch_events":"https://pith.science/api/pith-number/YCJB3LGQSGK2ZR6IQNJHWOBBRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM/action/storage_attestation","attest_author":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM/action/author_attestation","sign_citation":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM/action/citation_signature","submit_replication":"https://pith.science/pith/YCJB3LGQSGK2ZR6IQNJHWOBBRM/action/replication_record"}},"created_at":"2026-05-18T01:07:53.302067+00:00","updated_at":"2026-05-18T01:07:53.302067+00:00"}