{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LGKLEFSJZE5HS7B7KK6RSMPIYY","short_pith_number":"pith:LGKLEFSJ","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"},"canonical_sha256":"5994b21649c93a797c3f52bd1931e8c6168e1f15853d1e1c97e422597abb225b","source":{"kind":"arxiv","id":"1603.05346","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05346","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05346v2","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05346","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"LGKLEFSJZE5H","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGKLEFSJZE5HS7B7","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGKLEFSJ","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LGKLEFSJZE5HS7B7KK6RSMPIYY","target":"record","payload":{"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"},"canonical_sha256":"5994b21649c93a797c3f52bd1931e8c6168e1f15853d1e1c97e422597abb225b","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"},"source_kind":"arxiv","source_id":"1603.05346","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSFO5fvSYVUBqaMjaDf4kjf+rYJ/Ru1dbeMAEd0/f4QusfbW2zyut+HLadSZ7I87nXF/EZmFoQtYWHRQ3j69Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:29.123413Z"},"content_sha256":"47a03d048136b76b26baad66eb43208b9920cf01034b78c37a60c4e0fc89b2c7","schema_version":"1.0","event_id":"sha256:47a03d048136b76b26baad66eb43208b9920cf01034b78c37a60c4e0fc89b2c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LGKLEFSJZE5HS7B7KK6RSMPIYY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7uu37ePYbManxn176YjbOfbqA1S01fJxEBDSCYS02RFmpCjwOZ74nlRdbOn9K4TlDFtF5SK/E4ohrAI5z2dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:16:29.124065Z"},"content_sha256":"a06f56758b66921b8a4645c968786454ef057e3ece187cbd087ff6eacca64595","schema_version":"1.0","event_id":"sha256:a06f56758b66921b8a4645c968786454ef057e3ece187cbd087ff6eacca64595"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/bundle.json","state_url":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T22:16:29Z","links":{"resolver":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY","bundle":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/bundle.json","state":"https://pith.science/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGKLEFSJZE5HS7B7KK6RSMPIYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LGKLEFSJZE5HS7B7KK6RSMPIYY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d29df2669cb21377c053287390535e99cc89468b350970dedc4bdc8219833fd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T03:14:24Z","title_canon_sha256":"50360cfcb907086359c87930936148b0a5007d7cd7ac0fbd524f5cb8b12d1370"},"schema_version":"1.0","source":{"id":"1603.05346","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05346","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05346v2","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05346","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"LGKLEFSJZE5H","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LGKLEFSJZE5HS7B7","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LGKLEFSJ","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:a06f56758b66921b8a4645c968786454ef057e3ece187cbd087ff6eacca64595","target":"graph","created_at":"2026-05-18T01:17:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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))$","authors_text":"Edo Liberty, Kevin Lang, Zohar Karnin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T03:14:24Z","title":"Optimal Quantile Approximation in Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05346","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:47a03d048136b76b26baad66eb43208b9920cf01034b78c37a60c4e0fc89b2c7","target":"record","created_at":"2026-05-18T01:17:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d29df2669cb21377c053287390535e99cc89468b350970dedc4bdc8219833fd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-17T03:14:24Z","title_canon_sha256":"50360cfcb907086359c87930936148b0a5007d7cd7ac0fbd524f5cb8b12d1370"},"schema_version":"1.0","source":{"id":"1603.05346","kind":"arxiv","version":2}},"canonical_sha256":"5994b21649c93a797c3f52bd1931e8c6168e1f15853d1e1c97e422597abb225b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5994b21649c93a797c3f52bd1931e8c6168e1f15853d1e1c97e422597abb225b","first_computed_at":"2026-05-18T01:17:36.652132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:36.652132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AaLx7qXyx1X2NGMcP8szrpi3bpdhSk2enTUVOxcJ52ZnD4lb3LA3BfDwsm/9gnNdIMaOFdOmDgGOjii3CIPjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:36.652697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05346","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47a03d048136b76b26baad66eb43208b9920cf01034b78c37a60c4e0fc89b2c7","sha256:a06f56758b66921b8a4645c968786454ef057e3ece187cbd087ff6eacca64595"],"state_sha256":"c52d008e2c6042ffaf7a9d7e2836f10697b29d40dfa8f3a0d96d4b372bc47a19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2aXS5NpF/EaROfa8M+AQXtY8mZdPke4KWOJeFH12V0pWUNnbnI5djqT7ObLmJ0ZJm9chB0dPQsFKuVzlpGyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:16:29.127412Z","bundle_sha256":"996466a68d68d00240265b188bff0bb0cb3e5dcbf8738ba957967b16d324d731"}}