{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SZZHHO4TK4KKMRWPMJJPZUSP5P","short_pith_number":"pith:SZZHHO4T","schema_version":"1.0","canonical_sha256":"967273bb935714a646cf6252fcd24febfcee34a5d00a67c5a38ef131cd62340a","source":{"kind":"arxiv","id":"1707.05527","version":1},"attestation_state":"computed","paper":{"title":"Nested Convex Bodies are Chaseable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, Marek Eli\\'a\\v{s}, Martin B\\\"ohm, Nikhil Bansal, Seeun William Umboh","submitted_at":"2017-07-18T08:56:28Z","abstract_excerpt":"In the Convex Body Chasing problem, we are given an initial point $v_0$ in $R^d$ and an online sequence of $n$ convex bodies $F_1, ..., F_n$. When we receive $F_i$, we are required to move inside $F_i$. Our goal is to minimize the total distance travelled. This fundamental online problem was first studied by Friedman and Linial (DCG 1993). They proved an $\\Omega(\\sqrt{d})$ lower bound on the competitive ratio, and conjectured that a competitive ratio depending only on d is possible. However, despite much interest in the problem, the conjecture remains wide open.\n  We consider the setting in wh"},"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":"1707.05527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-18T08:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"b8da7b77d67dc44a9db02d4aa33a15a67d7019602015eb8e115897a42d7bed80","abstract_canon_sha256":"a2fcf77c0357eac8f9af93c6a99424c76792d812d8f39ce02905faa003fa10bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.094942Z","signature_b64":"yI+doOIFieZ6GuLf5atGF8y4hqUu2oOTPBeDhWSiROuLyuucKy1StY/h1ZCpSh7zbhwcYpxi2FNCGe5fqVG2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"967273bb935714a646cf6252fcd24febfcee34a5d00a67c5a38ef131cd62340a","last_reissued_at":"2026-05-18T00:40:02.094475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.094475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nested Convex Bodies are Chaseable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, Marek Eli\\'a\\v{s}, Martin B\\\"ohm, Nikhil Bansal, Seeun William Umboh","submitted_at":"2017-07-18T08:56:28Z","abstract_excerpt":"In the Convex Body Chasing problem, we are given an initial point $v_0$ in $R^d$ and an online sequence of $n$ convex bodies $F_1, ..., F_n$. When we receive $F_i$, we are required to move inside $F_i$. Our goal is to minimize the total distance travelled. This fundamental online problem was first studied by Friedman and Linial (DCG 1993). They proved an $\\Omega(\\sqrt{d})$ lower bound on the competitive ratio, and conjectured that a competitive ratio depending only on d is possible. However, despite much interest in the problem, the conjecture remains wide open.\n  We consider the setting in wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05527","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":"1707.05527","created_at":"2026-05-18T00:40:02.094540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05527v1","created_at":"2026-05-18T00:40:02.094540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05527","created_at":"2026-05-18T00:40:02.094540+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZZHHO4TK4KK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZZHHO4TK4KKMRWP","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZZHHO4T","created_at":"2026-05-18T12:31:43.269735+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/SZZHHO4TK4KKMRWPMJJPZUSP5P","json":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P.json","graph_json":"https://pith.science/api/pith-number/SZZHHO4TK4KKMRWPMJJPZUSP5P/graph.json","events_json":"https://pith.science/api/pith-number/SZZHHO4TK4KKMRWPMJJPZUSP5P/events.json","paper":"https://pith.science/paper/SZZHHO4T"},"agent_actions":{"view_html":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P","download_json":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P.json","view_paper":"https://pith.science/paper/SZZHHO4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05527&json=true","fetch_graph":"https://pith.science/api/pith-number/SZZHHO4TK4KKMRWPMJJPZUSP5P/graph.json","fetch_events":"https://pith.science/api/pith-number/SZZHHO4TK4KKMRWPMJJPZUSP5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P/action/storage_attestation","attest_author":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P/action/author_attestation","sign_citation":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P/action/citation_signature","submit_replication":"https://pith.science/pith/SZZHHO4TK4KKMRWPMJJPZUSP5P/action/replication_record"}},"created_at":"2026-05-18T00:40:02.094540+00:00","updated_at":"2026-05-18T00:40:02.094540+00:00"}