{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QOUHKP2AOVVC2UBE2SRCZCO3TJ","short_pith_number":"pith:QOUHKP2A","schema_version":"1.0","canonical_sha256":"83a8753f40756a2d5024d4a22c89db9a4d6d78c1c33b08a421ca3f7b7022c8f7","source":{"kind":"arxiv","id":"1406.2296","version":3},"attestation_state":"computed","paper":{"title":"Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carath\\'{e}odory's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Siddharth Barman","submitted_at":"2014-06-09T19:39:50Z","abstract_excerpt":"We present algorithmic applications of an approximate version of Carath\\'{e}odory's theorem. The theorem states that given a set of vectors $X$ in $\\mathbb{R}^d$, for every vector in the convex hull of $X$ there exists an $\\varepsilon$-close (under the $p$-norm distance, for $2\\leq p < \\infty$) vector that can be expressed as a convex combination of at most $b$ vectors of $X$, where the bound $b$ depends on $\\varepsilon$ and the norm $p$ and is independent of the dimension $d$. This theorem can be derived by instantiating Maurey's lemma, early references to which can be found in the work of Pi"},"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":"1406.2296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-06-09T19:39:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dbf051e10457a751c7f80844567cf7ec988be3273fd9659439f8aade71a4fe8e","abstract_canon_sha256":"e6e27c3b9b28841e5a9d76f86dec207741e16a52e4767ce8309341c014dfc08a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.026655Z","signature_b64":"EYd1ZmJOMkSGBiox+QfUUsUZsxoed/yxjC/d3ocqsdgLXzjJUIoH2jkwK+yaWiHCDRLqV4lwaMkHF2YFvOBrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a8753f40756a2d5024d4a22c89db9a4d6d78c1c33b08a421ca3f7b7022c8f7","last_reissued_at":"2026-05-18T02:19:06.026220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.026220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carath\\'{e}odory's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Siddharth Barman","submitted_at":"2014-06-09T19:39:50Z","abstract_excerpt":"We present algorithmic applications of an approximate version of Carath\\'{e}odory's theorem. The theorem states that given a set of vectors $X$ in $\\mathbb{R}^d$, for every vector in the convex hull of $X$ there exists an $\\varepsilon$-close (under the $p$-norm distance, for $2\\leq p < \\infty$) vector that can be expressed as a convex combination of at most $b$ vectors of $X$, where the bound $b$ depends on $\\varepsilon$ and the norm $p$ and is independent of the dimension $d$. This theorem can be derived by instantiating Maurey's lemma, early references to which can be found in the work of Pi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2296","kind":"arxiv","version":3},"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":"1406.2296","created_at":"2026-05-18T02:19:06.026277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2296v3","created_at":"2026-05-18T02:19:06.026277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2296","created_at":"2026-05-18T02:19:06.026277+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOUHKP2AOVVC","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOUHKP2AOVVC2UBE","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOUHKP2A","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.25854","citing_title":"Sharp approximate Carath\\'eodory theorem and application to iterated Delaunay refinement","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ","json":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ.json","graph_json":"https://pith.science/api/pith-number/QOUHKP2AOVVC2UBE2SRCZCO3TJ/graph.json","events_json":"https://pith.science/api/pith-number/QOUHKP2AOVVC2UBE2SRCZCO3TJ/events.json","paper":"https://pith.science/paper/QOUHKP2A"},"agent_actions":{"view_html":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ","download_json":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ.json","view_paper":"https://pith.science/paper/QOUHKP2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2296&json=true","fetch_graph":"https://pith.science/api/pith-number/QOUHKP2AOVVC2UBE2SRCZCO3TJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QOUHKP2AOVVC2UBE2SRCZCO3TJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ/action/storage_attestation","attest_author":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ/action/author_attestation","sign_citation":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ/action/citation_signature","submit_replication":"https://pith.science/pith/QOUHKP2AOVVC2UBE2SRCZCO3TJ/action/replication_record"}},"created_at":"2026-05-18T02:19:06.026277+00:00","updated_at":"2026-05-18T02:19:06.026277+00:00"}