{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L3U6TQ5IGMKPNH3KWTUAT4XMYP","short_pith_number":"pith:L3U6TQ5I","schema_version":"1.0","canonical_sha256":"5ee9e9c3a83314f69f6ab4e809f2ecc3f612ea4fe4b72c34133072227cb3dcce","source":{"kind":"arxiv","id":"1512.08602","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Approximate Carath\\'eodory and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Renato Paes Leme, Sam Chiu-wai Wong, Vahab Mirrokni","submitted_at":"2015-12-29T05:06:23Z","abstract_excerpt":"We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate Carath\\'{e}odory Problem, which states that any point inside a polytope contained in the $\\ell_p$ ball of radius $D$ can be approximated to within $\\epsilon$ in $\\ell_p$ norm by a convex combination of only $O\\left(D^2 p/\\epsilon^2\\right)$ vertices of the polytope for $p \\geq 2$. We also show that this bound is tight, using an argument based on anti-concentration for th"},"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":"1512.08602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-29T05:06:23Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"33e5a809c57fae34480276bd403efbd29a7f6c32dd6f5145cc917591cb0f0473","abstract_canon_sha256":"5b8c1f7d8024d99764ef083fb2874ef3eae1cc095b475314261855e3d4f71327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:37.227501Z","signature_b64":"Vtp6+bM5GB/yf0vCuIzjUJemjI3pz2tanhyzMpyVhLfWYWc1O6OIamubwNv8DXmdrK0QleBUT8DE8dC50hpABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ee9e9c3a83314f69f6ab4e809f2ecc3f612ea4fe4b72c34133072227cb3dcce","last_reissued_at":"2026-05-18T01:23:37.226826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:37.226826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Approximate Carath\\'eodory and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Renato Paes Leme, Sam Chiu-wai Wong, Vahab Mirrokni","submitted_at":"2015-12-29T05:06:23Z","abstract_excerpt":"We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate Carath\\'{e}odory Problem, which states that any point inside a polytope contained in the $\\ell_p$ ball of radius $D$ can be approximated to within $\\epsilon$ in $\\ell_p$ norm by a convex combination of only $O\\left(D^2 p/\\epsilon^2\\right)$ vertices of the polytope for $p \\geq 2$. We also show that this bound is tight, using an argument based on anti-concentration for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08602","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":"1512.08602","created_at":"2026-05-18T01:23:37.226956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08602v1","created_at":"2026-05-18T01:23:37.226956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08602","created_at":"2026-05-18T01:23:37.226956+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3U6TQ5IGMKP","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3U6TQ5IGMKPNH3K","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3U6TQ5I","created_at":"2026-05-18T12:29:29.992203+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/L3U6TQ5IGMKPNH3KWTUAT4XMYP","json":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP.json","graph_json":"https://pith.science/api/pith-number/L3U6TQ5IGMKPNH3KWTUAT4XMYP/graph.json","events_json":"https://pith.science/api/pith-number/L3U6TQ5IGMKPNH3KWTUAT4XMYP/events.json","paper":"https://pith.science/paper/L3U6TQ5I"},"agent_actions":{"view_html":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP","download_json":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP.json","view_paper":"https://pith.science/paper/L3U6TQ5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08602&json=true","fetch_graph":"https://pith.science/api/pith-number/L3U6TQ5IGMKPNH3KWTUAT4XMYP/graph.json","fetch_events":"https://pith.science/api/pith-number/L3U6TQ5IGMKPNH3KWTUAT4XMYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP/action/storage_attestation","attest_author":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP/action/author_attestation","sign_citation":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP/action/citation_signature","submit_replication":"https://pith.science/pith/L3U6TQ5IGMKPNH3KWTUAT4XMYP/action/replication_record"}},"created_at":"2026-05-18T01:23:37.226956+00:00","updated_at":"2026-05-18T01:23:37.226956+00:00"}