{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GWLICXVP3LUQUURLF7SOWMXTZ6","short_pith_number":"pith:GWLICXVP","schema_version":"1.0","canonical_sha256":"3596815eafdae90a522b2fe4eb32f3cfbb994a3a1f68e301a75e813dcefb0d9c","source":{"kind":"arxiv","id":"1802.01515","version":2},"attestation_state":"computed","paper":{"title":"Robust Vertex Enumeration for Convex Hulls in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bahman Kalantari, Pranjal Awasthi, Yikai Zhang","submitted_at":"2018-02-05T17:13:16Z","abstract_excerpt":"Computation of the vertices of the convex hull of a set $S$ of $n$ points in $\\mathbb{R} ^m$ is a fundamental problem in computational geometry, optimization, machine learning and more. We present \"All Vertex Triangle Algorithm\" (AVTA), a robust and efficient algorithm for computing the subset $\\overline S$ of all $K$ vertices of $conv(S)$, the convex hull of $S$. If $\\Gamma_*$ is the minimum of the distances from each vertex to the convex hull of the remaining vertices, given any $\\gamma \\leq \\gamma_* = \\Gamma_*/R$, $R$ the diameter of $S$, $AVTA$ computes $\\overline S$ in $O(nK(m+ \\gamma^{-2"},"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":"1802.01515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-05T17:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"bf96354289c1015ae6b38a70534d1a67e8e2d6c2e30a10a50c98e7492f0bbbc3","abstract_canon_sha256":"85b6f8b8e5ecfd69ec5aadaecb76c3446165e43b34878ab98a36961ad3db61b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:59.576524Z","signature_b64":"+Pdp/FGfhURObt1LNs9jIinPm/WK9L1ls3iFWJ7WpkmGqBzBybE4nq6DJxmqBMUvPe+ffhuWaCxZOyaC/9k/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3596815eafdae90a522b2fe4eb32f3cfbb994a3a1f68e301a75e813dcefb0d9c","last_reissued_at":"2026-05-18T00:04:59.575868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:59.575868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Vertex Enumeration for Convex Hulls in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bahman Kalantari, Pranjal Awasthi, Yikai Zhang","submitted_at":"2018-02-05T17:13:16Z","abstract_excerpt":"Computation of the vertices of the convex hull of a set $S$ of $n$ points in $\\mathbb{R} ^m$ is a fundamental problem in computational geometry, optimization, machine learning and more. We present \"All Vertex Triangle Algorithm\" (AVTA), a robust and efficient algorithm for computing the subset $\\overline S$ of all $K$ vertices of $conv(S)$, the convex hull of $S$. If $\\Gamma_*$ is the minimum of the distances from each vertex to the convex hull of the remaining vertices, given any $\\gamma \\leq \\gamma_* = \\Gamma_*/R$, $R$ the diameter of $S$, $AVTA$ computes $\\overline S$ in $O(nK(m+ \\gamma^{-2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01515","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":"1802.01515","created_at":"2026-05-18T00:04:59.575953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01515v2","created_at":"2026-05-18T00:04:59.575953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01515","created_at":"2026-05-18T00:04:59.575953+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWLICXVP3LUQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWLICXVP3LUQUURL","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWLICXVP","created_at":"2026-05-18T12:32:25.280505+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/GWLICXVP3LUQUURLF7SOWMXTZ6","json":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6.json","graph_json":"https://pith.science/api/pith-number/GWLICXVP3LUQUURLF7SOWMXTZ6/graph.json","events_json":"https://pith.science/api/pith-number/GWLICXVP3LUQUURLF7SOWMXTZ6/events.json","paper":"https://pith.science/paper/GWLICXVP"},"agent_actions":{"view_html":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6","download_json":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6.json","view_paper":"https://pith.science/paper/GWLICXVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01515&json=true","fetch_graph":"https://pith.science/api/pith-number/GWLICXVP3LUQUURLF7SOWMXTZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/GWLICXVP3LUQUURLF7SOWMXTZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6/action/storage_attestation","attest_author":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6/action/author_attestation","sign_citation":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6/action/citation_signature","submit_replication":"https://pith.science/pith/GWLICXVP3LUQUURLF7SOWMXTZ6/action/replication_record"}},"created_at":"2026-05-18T00:04:59.575953+00:00","updated_at":"2026-05-18T00:04:59.575953+00:00"}