{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SIEGHGG3XCXHAXQXSWHDFY5J37","short_pith_number":"pith:SIEGHGG3","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"},"canonical_sha256":"92086398dbb8ae705e17958e32e3a9dfc2d2e284aab18dbb4b3d2666d92fefd1","source":{"kind":"arxiv","id":"0909.1062","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1062","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1062v4","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1062","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"SIEGHGG3XCXH","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SIEGHGG3XCXHAXQX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SIEGHGG3","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SIEGHGG3XCXHAXQXSWHDFY5J37","target":"record","payload":{"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"},"canonical_sha256":"92086398dbb8ae705e17958e32e3a9dfc2d2e284aab18dbb4b3d2666d92fefd1","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"},"source_kind":"arxiv","source_id":"0909.1062","source_version":4,"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-18T04:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROwJG67ZQx5q0aE9I+ElrK5/PwVkBIkObGoUIYTvK4TNtbvhMKHn40/CyPBQCeAOBg5wIueBjMIY6OyIxEK0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:36.909648Z"},"content_sha256":"b692a85f06c4c183508b7bb3bab589c1b483f1033126f8912f9c3ebbd29fde06","schema_version":"1.0","event_id":"sha256:b692a85f06c4c183508b7bb3bab589c1b483f1033126f8912f9c3ebbd29fde06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SIEGHGG3XCXHAXQXSWHDFY5J37","target":"graph","payload":{"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"},"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-18T04:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwOnLs18spBAUpHUBcbBOmsr3hRQHwRJAeTb2Fm66dAx/BYNKAjHB/DKMZNcAMIx2t4n1mjUpT8T6vX96oCSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:36.910381Z"},"content_sha256":"a17fdba12e7788ce7c087951a73909b2a7630592ae4a2431757f03a4dbd259b3","schema_version":"1.0","event_id":"sha256:a17fdba12e7788ce7c087951a73909b2a7630592ae4a2431757f03a4dbd259b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/bundle.json","state_url":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/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-06-09T08:02:36Z","links":{"resolver":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37","bundle":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/bundle.json","state":"https://pith.science/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIEGHGG3XCXHAXQXSWHDFY5J37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SIEGHGG3XCXHAXQXSWHDFY5J37","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":"06a3da33922ff479bc85bd76a9e220c93453ceaa205fc7f15dfa44f7a4b6dcbd","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-09-05T23:24:32Z","title_canon_sha256":"679f69d414cd628d12e026f679a7d4682c4c8c69822607ce036f7602ed31196d"},"schema_version":"1.0","source":{"id":"0909.1062","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1062","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1062v4","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1062","created_at":"2026-05-18T04:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"SIEGHGG3XCXH","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SIEGHGG3XCXHAXQX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SIEGHGG3","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:a17fdba12e7788ce7c087951a73909b2a7630592ae4a2431757f03a4dbd259b3","target":"graph","created_at":"2026-05-18T04:40:56Z","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":"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","authors_text":"(2) Purdue University, (3) University of Alberta), Ankan Saha (1), S.V.N. Vishwanathan (2), Xinhua Zhang (3) ((1) University of Chicago","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-09-05T23:24:32Z","title":"New Approximation Algorithms for Minimum Enclosing Convex Shapes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1062","kind":"arxiv","version":4},"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:b692a85f06c4c183508b7bb3bab589c1b483f1033126f8912f9c3ebbd29fde06","target":"record","created_at":"2026-05-18T04:40:56Z","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":"06a3da33922ff479bc85bd76a9e220c93453ceaa205fc7f15dfa44f7a4b6dcbd","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-09-05T23:24:32Z","title_canon_sha256":"679f69d414cd628d12e026f679a7d4682c4c8c69822607ce036f7602ed31196d"},"schema_version":"1.0","source":{"id":"0909.1062","kind":"arxiv","version":4}},"canonical_sha256":"92086398dbb8ae705e17958e32e3a9dfc2d2e284aab18dbb4b3d2666d92fefd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92086398dbb8ae705e17958e32e3a9dfc2d2e284aab18dbb4b3d2666d92fefd1","first_computed_at":"2026-05-18T04:40:56.153381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:56.153381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Il8LrGtjbsusPWUElJzqcWsSYLL1SoNjvH/RcRofwP8oAgeN8rW3gLBL48yY4XvMhAsvb155AbAE9CN90A8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:56.154105Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.1062","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b692a85f06c4c183508b7bb3bab589c1b483f1033126f8912f9c3ebbd29fde06","sha256:a17fdba12e7788ce7c087951a73909b2a7630592ae4a2431757f03a4dbd259b3"],"state_sha256":"3f73106809074929093e222e52abacf41dffb4cc504f6924736e48230801df4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DiCKNT2efqimAtJsHzlRc4pZaoZjfBZv8KiRz9uqo5exXM4saL5C3Zmbfe8kENgpsAGXPlbYW8ktPiNhuGvdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:02:36.918137Z","bundle_sha256":"4a7caeb3a16ce19118de537938b1913e09d4b530599dfb12db0e57435fcc2372"}}