{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TO64Y6TJGNRZOOKBS3L3GROW7Z","short_pith_number":"pith:TO64Y6TJ","schema_version":"1.0","canonical_sha256":"9bbdcc7a69336397394196d7b345d6fe67a508d616c62bf1b24580f8267ba102","source":{"kind":"arxiv","id":"1503.01156","version":1},"attestation_state":"computed","paper":{"title":"A randomized online quantile summary in $O(\\frac{1}{\\varepsilon} \\log \\frac{1}{\\varepsilon})$ words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Felber, Rafail Ostrovsky","submitted_at":"2015-03-03T22:58:55Z","abstract_excerpt":"A quantile summary is a data structure that approximates to $\\varepsilon$-relative error the order statistics of a much larger underlying dataset.\n  In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses $O(\\frac{1}{\\varepsilon} \\log \\frac{1}{\\varepsilon})$ words of memory. This improves upon the previous best upper bound of $O(\\frac{1}{\\varepsilon} \\log^{3/2} \\frac{1}{\\varepsilon})$ by Agarwal et. al. (PODS 2012). Further, by a lower bound of Hung and Ting (FAW 2010) no deterministic summary for the compa"},"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":"1503.01156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-03T22:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"0977274442ca1f9a764a59e54e7ca7d9928847960b5d510a088a5e46114548a2","abstract_canon_sha256":"7c30e1ee47ec844d5984e74a6b7bfb88ce1c4b4fa87c60506360e8b697157328"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:39.757889Z","signature_b64":"1II5xcESJ9uQmhf37gw8SHaDEoGxZeLDTcJE25jBHdNNBnIJnZX8mWLn1yKYBcgJfFOcnCvujnlV5Cm3LCoBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bbdcc7a69336397394196d7b345d6fe67a508d616c62bf1b24580f8267ba102","last_reissued_at":"2026-05-18T02:25:39.757035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:39.757035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A randomized online quantile summary in $O(\\frac{1}{\\varepsilon} \\log \\frac{1}{\\varepsilon})$ words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Felber, Rafail Ostrovsky","submitted_at":"2015-03-03T22:58:55Z","abstract_excerpt":"A quantile summary is a data structure that approximates to $\\varepsilon$-relative error the order statistics of a much larger underlying dataset.\n  In this paper we develop a randomized online quantile summary for the cash register data input model and comparison data domain model that uses $O(\\frac{1}{\\varepsilon} \\log \\frac{1}{\\varepsilon})$ words of memory. This improves upon the previous best upper bound of $O(\\frac{1}{\\varepsilon} \\log^{3/2} \\frac{1}{\\varepsilon})$ by Agarwal et. al. (PODS 2012). Further, by a lower bound of Hung and Ting (FAW 2010) no deterministic summary for the compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01156","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":"1503.01156","created_at":"2026-05-18T02:25:39.757392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01156v1","created_at":"2026-05-18T02:25:39.757392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01156","created_at":"2026-05-18T02:25:39.757392+00:00"},{"alias_kind":"pith_short_12","alias_value":"TO64Y6TJGNRZ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TO64Y6TJGNRZOOKB","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TO64Y6TJ","created_at":"2026-05-18T12:29:42.218222+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/TO64Y6TJGNRZOOKBS3L3GROW7Z","json":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z.json","graph_json":"https://pith.science/api/pith-number/TO64Y6TJGNRZOOKBS3L3GROW7Z/graph.json","events_json":"https://pith.science/api/pith-number/TO64Y6TJGNRZOOKBS3L3GROW7Z/events.json","paper":"https://pith.science/paper/TO64Y6TJ"},"agent_actions":{"view_html":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z","download_json":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z.json","view_paper":"https://pith.science/paper/TO64Y6TJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01156&json=true","fetch_graph":"https://pith.science/api/pith-number/TO64Y6TJGNRZOOKBS3L3GROW7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/TO64Y6TJGNRZOOKBS3L3GROW7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z/action/storage_attestation","attest_author":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z/action/author_attestation","sign_citation":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z/action/citation_signature","submit_replication":"https://pith.science/pith/TO64Y6TJGNRZOOKBS3L3GROW7Z/action/replication_record"}},"created_at":"2026-05-18T02:25:39.757392+00:00","updated_at":"2026-05-18T02:25:39.757392+00:00"}