{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SIEGHGG3XCXHAXQXSWHDFY5J37","short_pith_number":"pith:SIEGHGG3","schema_version":"1.0","canonical_sha256":"92086398dbb8ae705e17958e32e3a9dfc2d2e284aab18dbb4b3d2666d92fefd1","source":{"kind":"arxiv","id":"0909.1062","version":4},"attestation_state":"computed","paper":{"title":"New Approximation Algorithms for Minimum Enclosing Convex Shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CG","authors_text":"(2) Purdue University, (3) University of Alberta), Ankan Saha (1), S.V.N. Vishwanathan (2), Xinhua Zhang (3) ((1) University of Chicago","submitted_at":"2009-09-05T23:24:32Z","abstract_excerpt":"Given $n$ points in a $d$ dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to find the ball with the smallest radius which contains all $n$ points. We give a $O(nd\\Qcal/\\sqrt{\\epsilon})$ approximation algorithm for producing an enclosing ball whose radius is at most $\\epsilon$ away from the optimum (where $\\Qcal$ is an upper bound on the norm of the points). This improves existing results using \\emph{coresets}, which yield a $O(nd/\\epsilon)$ greedy algorithm. Finding the Minimum Enclosing Convex Polytope (MECP) is a related problem wherein a convex polytope of a fixed s"},"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":"0909.1062","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-09-05T23:24:32Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"679f69d414cd628d12e026f679a7d4682c4c8c69822607ce036f7602ed31196d","abstract_canon_sha256":"06a3da33922ff479bc85bd76a9e220c93453ceaa205fc7f15dfa44f7a4b6dcbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:56.154105Z","signature_b64":"2Il8LrGtjbsusPWUElJzqcWsSYLL1SoNjvH/RcRofwP8oAgeN8rW3gLBL48yY4XvMhAsvb155AbAE9CN90A8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92086398dbb8ae705e17958e32e3a9dfc2d2e284aab18dbb4b3d2666d92fefd1","last_reissued_at":"2026-05-18T04:40:56.153381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:56.153381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Approximation Algorithms for Minimum Enclosing Convex Shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CG","authors_text":"(2) Purdue University, (3) University of Alberta), Ankan Saha (1), S.V.N. Vishwanathan (2), Xinhua Zhang (3) ((1) University of Chicago","submitted_at":"2009-09-05T23:24:32Z","abstract_excerpt":"Given $n$ points in a $d$ dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to find the ball with the smallest radius which contains all $n$ points. We give a $O(nd\\Qcal/\\sqrt{\\epsilon})$ approximation algorithm for producing an enclosing ball whose radius is at most $\\epsilon$ away from the optimum (where $\\Qcal$ is an upper bound on the norm of the points). This improves existing results using \\emph{coresets}, which yield a $O(nd/\\epsilon)$ greedy algorithm. Finding the Minimum Enclosing Convex Polytope (MECP) is a related problem wherein a convex polytope of a fixed s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1062","kind":"arxiv","version":4},"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":"0909.1062","created_at":"2026-05-18T04:40:56.153504+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.1062v4","created_at":"2026-05-18T04:40:56.153504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1062","created_at":"2026-05-18T04:40:56.153504+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIEGHGG3XCXH","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIEGHGG3XCXHAXQX","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIEGHGG3","created_at":"2026-05-18T12:26:01.383474+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/SIEGHGG3XCXHAXQXSWHDFY5J37","json":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37.json","graph_json":"https://pith.science/api/pith-number/SIEGHGG3XCXHAXQXSWHDFY5J37/graph.json","events_json":"https://pith.science/api/pith-number/SIEGHGG3XCXHAXQXSWHDFY5J37/events.json","paper":"https://pith.science/paper/SIEGHGG3"},"agent_actions":{"view_html":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37","download_json":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37.json","view_paper":"https://pith.science/paper/SIEGHGG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.1062&json=true","fetch_graph":"https://pith.science/api/pith-number/SIEGHGG3XCXHAXQXSWHDFY5J37/graph.json","fetch_events":"https://pith.science/api/pith-number/SIEGHGG3XCXHAXQXSWHDFY5J37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/action/storage_attestation","attest_author":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/action/author_attestation","sign_citation":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/action/citation_signature","submit_replication":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/action/replication_record"}},"created_at":"2026-05-18T04:40:56.153504+00:00","updated_at":"2026-05-18T04:40:56.153504+00:00"}