{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:52PXBG5XDM275JQY52XJDKKB2K","short_pith_number":"pith:52PXBG5X","schema_version":"1.0","canonical_sha256":"ee9f709bb71b35fea618eeae91a941d28d3b94ac81cf4771e708fe00ff5496f8","source":{"kind":"arxiv","id":"1603.04422","version":1},"attestation_state":"computed","paper":{"title":"Computing the Approximate Convex Hull in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Hossein Sartipizadeh, Tyrone L. Vincent","submitted_at":"2016-03-08T22:20:02Z","abstract_excerpt":"In this paper, an effective method with time complexity of $\\mathcal{O}(K^{3/2}N^2\\log \\frac{K}{\\epsilon_0})$ is introduced to find an approximation of the convex hull for $N$ points in dimension $n$, where $K$ is close to the number of vertices of the approximation. Since the time complexity is independent of dimension, this method is highly suitable for the data in high dimensions. Utilizing a greedy approach, the proposed method attempts to find the best approximate convex hull for a given number of vertices. The approximate convex hull can be a helpful substitute for the exact convex hull "},"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.04422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-08T22:20:02Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"237050e62ca4ddb98ede3e40c6eee5febc0d12f732e134e523788ec2ba09b883","abstract_canon_sha256":"b0221c58d14f302751929754e3dbf34cbbc9e64a8b783e993e27f8f3baa6abb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:06.800035Z","signature_b64":"tPYOev1wFrB+p3pGOa2jV2qcXuOW8HlHYaYXw+a3oPO62p/9QLoz35RfL8R3K+D/7uWVXq49n4NeIR9OEIaqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee9f709bb71b35fea618eeae91a941d28d3b94ac81cf4771e708fe00ff5496f8","last_reissued_at":"2026-05-18T01:19:06.799271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:06.799271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Approximate Convex Hull in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Hossein Sartipizadeh, Tyrone L. Vincent","submitted_at":"2016-03-08T22:20:02Z","abstract_excerpt":"In this paper, an effective method with time complexity of $\\mathcal{O}(K^{3/2}N^2\\log \\frac{K}{\\epsilon_0})$ is introduced to find an approximation of the convex hull for $N$ points in dimension $n$, where $K$ is close to the number of vertices of the approximation. Since the time complexity is independent of dimension, this method is highly suitable for the data in high dimensions. Utilizing a greedy approach, the proposed method attempts to find the best approximate convex hull for a given number of vertices. The approximate convex hull can be a helpful substitute for the exact convex hull "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04422","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":"1603.04422","created_at":"2026-05-18T01:19:06.799412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04422v1","created_at":"2026-05-18T01:19:06.799412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04422","created_at":"2026-05-18T01:19:06.799412+00:00"},{"alias_kind":"pith_short_12","alias_value":"52PXBG5XDM27","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"52PXBG5XDM275JQY","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"52PXBG5X","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/52PXBG5XDM275JQY52XJDKKB2K","json":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K.json","graph_json":"https://pith.science/api/pith-number/52PXBG5XDM275JQY52XJDKKB2K/graph.json","events_json":"https://pith.science/api/pith-number/52PXBG5XDM275JQY52XJDKKB2K/events.json","paper":"https://pith.science/paper/52PXBG5X"},"agent_actions":{"view_html":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K","download_json":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K.json","view_paper":"https://pith.science/paper/52PXBG5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04422&json=true","fetch_graph":"https://pith.science/api/pith-number/52PXBG5XDM275JQY52XJDKKB2K/graph.json","fetch_events":"https://pith.science/api/pith-number/52PXBG5XDM275JQY52XJDKKB2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/action/storage_attestation","attest_author":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/action/author_attestation","sign_citation":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/action/citation_signature","submit_replication":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/action/replication_record"}},"created_at":"2026-05-18T01:19:06.799412+00:00","updated_at":"2026-05-18T01:19:06.799412+00:00"}