{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CKSXQJ2AOYRQZ7TBKYWBGIP7BY","short_pith_number":"pith:CKSXQJ2A","schema_version":"1.0","canonical_sha256":"12a578274076230cfe61562c1321ff0e17c4028928f9ae8a519d6102dd231e68","source":{"kind":"arxiv","id":"1712.04564","version":2},"attestation_state":"computed","paper":{"title":"Approximate Convex Hull of Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ananya Kumar, Avrim Blum, Harry Lang, Lin F. Yang, Vladimir Braverman","submitted_at":"2017-12-12T23:05:32Z","abstract_excerpt":"Given a finite set of points $P \\subseteq \\mathbb{R}^d$, we would like to find a small subset $S \\subseteq P$ such that the convex hull of $S$ approximately contains $P$. More formally, every point in $P$ is within distance $\\epsilon$ from the convex hull of $S$. Such a subset $S$ is called an $\\epsilon$-hull. Computing an $\\epsilon$-hull is an important problem in computational geometry, machine learning, and approximation algorithms.\n  In many real world applications, the set $P$ is too large to fit in memory. We consider the streaming model where the algorithm receives the points of $P$ seq"},"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":"1712.04564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-12T23:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"588e00ee0e66559e68e6af5ebcbd8ebfb30f92b6cfbbd12d4ce3a231ff078dae","abstract_canon_sha256":"c9cf30d1967856d7669e6208ae0f3e01e70f9e0dbd4deb2b031f91b2f728fada"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:01.447096Z","signature_b64":"7y5oLRJzPwS3Xc48pA8qqz3diCfocoP2BFHC6D1lxrUtS8XQq2Nq/NFla/veUBQoe4ZCdHXVceo/ADVvyrAmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12a578274076230cfe61562c1321ff0e17c4028928f9ae8a519d6102dd231e68","last_reissued_at":"2026-05-18T00:28:01.445988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:01.445988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Convex Hull of Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ananya Kumar, Avrim Blum, Harry Lang, Lin F. Yang, Vladimir Braverman","submitted_at":"2017-12-12T23:05:32Z","abstract_excerpt":"Given a finite set of points $P \\subseteq \\mathbb{R}^d$, we would like to find a small subset $S \\subseteq P$ such that the convex hull of $S$ approximately contains $P$. More formally, every point in $P$ is within distance $\\epsilon$ from the convex hull of $S$. Such a subset $S$ is called an $\\epsilon$-hull. Computing an $\\epsilon$-hull is an important problem in computational geometry, machine learning, and approximation algorithms.\n  In many real world applications, the set $P$ is too large to fit in memory. We consider the streaming model where the algorithm receives the points of $P$ seq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04564","kind":"arxiv","version":2},"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":"1712.04564","created_at":"2026-05-18T00:28:01.446127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04564v2","created_at":"2026-05-18T00:28:01.446127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04564","created_at":"2026-05-18T00:28:01.446127+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKSXQJ2AOYRQ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKSXQJ2AOYRQZ7TB","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKSXQJ2A","created_at":"2026-05-18T12:31:10.602751+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/CKSXQJ2AOYRQZ7TBKYWBGIP7BY","json":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY.json","graph_json":"https://pith.science/api/pith-number/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/graph.json","events_json":"https://pith.science/api/pith-number/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/events.json","paper":"https://pith.science/paper/CKSXQJ2A"},"agent_actions":{"view_html":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY","download_json":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY.json","view_paper":"https://pith.science/paper/CKSXQJ2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04564&json=true","fetch_graph":"https://pith.science/api/pith-number/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/graph.json","fetch_events":"https://pith.science/api/pith-number/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/action/storage_attestation","attest_author":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/action/author_attestation","sign_citation":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/action/citation_signature","submit_replication":"https://pith.science/pith/CKSXQJ2AOYRQZ7TBKYWBGIP7BY/action/replication_record"}},"created_at":"2026-05-18T00:28:01.446127+00:00","updated_at":"2026-05-18T00:28:01.446127+00:00"}