{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LGKLEFSJZE5HS7B7KK6RSMPIYY","short_pith_number":"pith:LGKLEFSJ","schema_version":"1.0","canonical_sha256":"5994b21649c93a797c3f52bd1931e8c6168e1f15853d1e1c97e422597abb225b","source":{"kind":"arxiv","id":"1603.05346","version":2},"attestation_state":"computed","paper":{"title":"Optimal Quantile Approximation in Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edo Liberty, Kevin Lang, Zohar Karnin","submitted_at":"2016-03-17T03:14:24Z","abstract_excerpt":"This paper resolves one of the longest standing basic problems in the streaming computational model. Namely, optimal construction of quantile sketches. An $\\varepsilon$ approximate quantile sketch receives a stream of items $x_1,\\ldots,x_n$ and allows one to approximate the rank of any query up to additive error $\\varepsilon n$ with probability at least $1-\\delta$. The rank of a query $x$ is the number of stream items such that $x_i \\le x$. The minimal sketch size required for this task is trivially at least $1/\\varepsilon$. Felber and Ostrovsky obtain a $O((1/\\varepsilon)\\log(1/\\varepsilon))$"},"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":"1603.05346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T03:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"50360cfcb907086359c87930936148b0a5007d7cd7ac0fbd524f5cb8b12d1370","abstract_canon_sha256":"d29df2669cb21377c053287390535e99cc89468b350970dedc4bdc8219833fd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:36.652697Z","signature_b64":"AaLx7qXyx1X2NGMcP8szrpi3bpdhSk2enTUVOxcJ52ZnD4lb3LA3BfDwsm/9gnNdIMaOFdOmDgGOjii3CIPjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5994b21649c93a797c3f52bd1931e8c6168e1f15853d1e1c97e422597abb225b","last_reissued_at":"2026-05-18T01:17:36.652132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:36.652132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Quantile Approximation in Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edo Liberty, Kevin Lang, Zohar Karnin","submitted_at":"2016-03-17T03:14:24Z","abstract_excerpt":"This paper resolves one of the longest standing basic problems in the streaming computational model. Namely, optimal construction of quantile sketches. An $\\varepsilon$ approximate quantile sketch receives a stream of items $x_1,\\ldots,x_n$ and allows one to approximate the rank of any query up to additive error $\\varepsilon n$ with probability at least $1-\\delta$. The rank of a query $x$ is the number of stream items such that $x_i \\le x$. The minimal sketch size required for this task is trivially at least $1/\\varepsilon$. Felber and Ostrovsky obtain a $O((1/\\varepsilon)\\log(1/\\varepsilon))$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05346","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":"1603.05346","created_at":"2026-05-18T01:17:36.652210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05346v2","created_at":"2026-05-18T01:17:36.652210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05346","created_at":"2026-05-18T01:17:36.652210+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGKLEFSJZE5H","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGKLEFSJZE5HS7B7","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGKLEFSJ","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10295","citing_title":"Icicle: Scalable Metadata Indexing and Real-Time Monitoring for HPC File Systems","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY","json":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY.json","graph_json":"https://pith.science/api/pith-number/LGKLEFSJZE5HS7B7KK6RSMPIYY/graph.json","events_json":"https://pith.science/api/pith-number/LGKLEFSJZE5HS7B7KK6RSMPIYY/events.json","paper":"https://pith.science/paper/LGKLEFSJ"},"agent_actions":{"view_html":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY","download_json":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY.json","view_paper":"https://pith.science/paper/LGKLEFSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05346&json=true","fetch_graph":"https://pith.science/api/pith-number/LGKLEFSJZE5HS7B7KK6RSMPIYY/graph.json","fetch_events":"https://pith.science/api/pith-number/LGKLEFSJZE5HS7B7KK6RSMPIYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/action/storage_attestation","attest_author":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/action/author_attestation","sign_citation":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/action/citation_signature","submit_replication":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/action/replication_record"}},"created_at":"2026-05-18T01:17:36.652210+00:00","updated_at":"2026-05-18T01:17:36.652210+00:00"}