{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:52PXBG5XDM275JQY52XJDKKB2K","short_pith_number":"pith:52PXBG5X","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"},"canonical_sha256":"ee9f709bb71b35fea618eeae91a941d28d3b94ac81cf4771e708fe00ff5496f8","source":{"kind":"arxiv","id":"1603.04422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04422","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04422v1","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04422","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"52PXBG5XDM27","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"52PXBG5XDM275JQY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"52PXBG5X","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:52PXBG5XDM275JQY52XJDKKB2K","target":"record","payload":{"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"},"canonical_sha256":"ee9f709bb71b35fea618eeae91a941d28d3b94ac81cf4771e708fe00ff5496f8","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"},"source_kind":"arxiv","source_id":"1603.04422","source_version":1,"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-18T01:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daJMmygFih/jrF/Js32WbPkuTZD6rO+veDC1HyWmoXAIu1lskHH81iH2fLD2O0qw86GUAnwS2e610dUC9vc7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:36:46.303713Z"},"content_sha256":"102a1f5f1b6a54db5d23daee886b1424484dbd858a183112736b21a4941d2a60","schema_version":"1.0","event_id":"sha256:102a1f5f1b6a54db5d23daee886b1424484dbd858a183112736b21a4941d2a60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:52PXBG5XDM275JQY52XJDKKB2K","target":"graph","payload":{"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"},"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-18T01:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tqFnmTvELeyUubh7Y64v2Y1XYSIwhMBULvxdeWx15skDYbQJLgb7u88wueIERKiFiciFgOGtwyL+QebPYm4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:36:46.304481Z"},"content_sha256":"5f46b8454688fd514885f5fac34a832e1c9b3c14ec3147c95288f7dfd0779db5","schema_version":"1.0","event_id":"sha256:5f46b8454688fd514885f5fac34a832e1c9b3c14ec3147c95288f7dfd0779db5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/bundle.json","state_url":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52PXBG5XDM275JQY52XJDKKB2K/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-31T02:36:46Z","links":{"resolver":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K","bundle":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/bundle.json","state":"https://pith.science/pith/52PXBG5XDM275JQY52XJDKKB2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52PXBG5XDM275JQY52XJDKKB2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:52PXBG5XDM275JQY52XJDKKB2K","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":"b0221c58d14f302751929754e3dbf34cbbc9e64a8b783e993e27f8f3baa6abb0","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-08T22:20:02Z","title_canon_sha256":"237050e62ca4ddb98ede3e40c6eee5febc0d12f732e134e523788ec2ba09b883"},"schema_version":"1.0","source":{"id":"1603.04422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04422","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04422v1","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04422","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"52PXBG5XDM27","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"52PXBG5XDM275JQY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"52PXBG5X","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:5f46b8454688fd514885f5fac34a832e1c9b3c14ec3147c95288f7dfd0779db5","target":"graph","created_at":"2026-05-18T01:19:06Z","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":"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 ","authors_text":"Hossein Sartipizadeh, Tyrone L. Vincent","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-08T22:20:02Z","title":"Computing the Approximate Convex Hull in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04422","kind":"arxiv","version":1},"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:102a1f5f1b6a54db5d23daee886b1424484dbd858a183112736b21a4941d2a60","target":"record","created_at":"2026-05-18T01:19:06Z","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":"b0221c58d14f302751929754e3dbf34cbbc9e64a8b783e993e27f8f3baa6abb0","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-08T22:20:02Z","title_canon_sha256":"237050e62ca4ddb98ede3e40c6eee5febc0d12f732e134e523788ec2ba09b883"},"schema_version":"1.0","source":{"id":"1603.04422","kind":"arxiv","version":1}},"canonical_sha256":"ee9f709bb71b35fea618eeae91a941d28d3b94ac81cf4771e708fe00ff5496f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee9f709bb71b35fea618eeae91a941d28d3b94ac81cf4771e708fe00ff5496f8","first_computed_at":"2026-05-18T01:19:06.799271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:06.799271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tPYOev1wFrB+p3pGOa2jV2qcXuOW8HlHYaYXw+a3oPO62p/9QLoz35RfL8R3K+D/7uWVXq49n4NeIR9OEIaqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:06.800035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:102a1f5f1b6a54db5d23daee886b1424484dbd858a183112736b21a4941d2a60","sha256:5f46b8454688fd514885f5fac34a832e1c9b3c14ec3147c95288f7dfd0779db5"],"state_sha256":"d59f447eb86f61df3ac728c6ef2aa7bc24c847e5dba4b6d7157aeb5a73a53498"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeagrxE5AOu5a+kIMFcR+Mo/fFRJSU2iwAO5aKbz3He95MU434l6ex6Hc78cCjw4UYowCOjPOpHG68AGcHbDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:36:46.308503Z","bundle_sha256":"c980fee1b934281c821e349bc3ffbdaaf4d45993f948feb192d380cb226c7a85"}}