{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QDPEWDOFHIJPQWEJ2EQLO4RYDK","short_pith_number":"pith:QDPEWDOF","schema_version":"1.0","canonical_sha256":"80de4b0dc53a12f85889d120b772381ab12bad158be9ef23ba70c66911242135","source":{"kind":"arxiv","id":"1603.00759","version":4},"attestation_state":"computed","paper":{"title":"BPTree: an $\\ell_2$ heavy hitters algorithm using constant memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Jelani Nelson, Nikita Ivkin, Stephen R. Chestnut, Vladimir Braverman, Zhengyu Wang","submitted_at":"2016-03-02T15:48:36Z","abstract_excerpt":"The task of finding heavy hitters is one of the best known and well studied problems in the area of data streams. One is given a list $i_1,i_2,\\ldots,i_m\\in[n]$ and the goal is to identify the items among $[n]$ that appear frequently in the list. In sub-polynomial space, the strongest guarantee available is the $\\ell_2$ guarantee, which requires finding all items that occur at least $\\epsilon\\|f\\|_2$ times in the stream, where the vector $f\\in\\mathbb{R}^n$ is the count histogram of the stream with $i$th coordinate equal to the number of times~$i$ appears $f_i:=\\#\\{j\\in[m]:i_j=i\\}$. The first a"},"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.00759","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-02T15:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"97b1506137da2467f8c606d4bab062b514417396c94e487185b8e59db435da16","abstract_canon_sha256":"7cd043435d80f6fc7c104315a80886b9fb33e9d59f14db30e1df959a86337ec5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.525273Z","signature_b64":"7+v91ipzozYMXqL1GdjLBL3eZSZZgI6YMrs67a03O6a7NhOaHOzLBCMoiMzyoAejVB+6YjY4A85vylgr1GGgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80de4b0dc53a12f85889d120b772381ab12bad158be9ef23ba70c66911242135","last_reissued_at":"2026-05-18T00:31:00.524624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.524624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BPTree: an $\\ell_2$ heavy hitters algorithm using constant memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Jelani Nelson, Nikita Ivkin, Stephen R. Chestnut, Vladimir Braverman, Zhengyu Wang","submitted_at":"2016-03-02T15:48:36Z","abstract_excerpt":"The task of finding heavy hitters is one of the best known and well studied problems in the area of data streams. One is given a list $i_1,i_2,\\ldots,i_m\\in[n]$ and the goal is to identify the items among $[n]$ that appear frequently in the list. In sub-polynomial space, the strongest guarantee available is the $\\ell_2$ guarantee, which requires finding all items that occur at least $\\epsilon\\|f\\|_2$ times in the stream, where the vector $f\\in\\mathbb{R}^n$ is the count histogram of the stream with $i$th coordinate equal to the number of times~$i$ appears $f_i:=\\#\\{j\\in[m]:i_j=i\\}$. The first a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00759","kind":"arxiv","version":4},"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.00759","created_at":"2026-05-18T00:31:00.524714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00759v4","created_at":"2026-05-18T00:31:00.524714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00759","created_at":"2026-05-18T00:31:00.524714+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDPEWDOFHIJP","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDPEWDOFHIJPQWEJ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDPEWDOF","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05816","citing_title":"Towards Optimal Moment Estimation in Streaming and Distributed Models","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK","json":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK.json","graph_json":"https://pith.science/api/pith-number/QDPEWDOFHIJPQWEJ2EQLO4RYDK/graph.json","events_json":"https://pith.science/api/pith-number/QDPEWDOFHIJPQWEJ2EQLO4RYDK/events.json","paper":"https://pith.science/paper/QDPEWDOF"},"agent_actions":{"view_html":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK","download_json":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK.json","view_paper":"https://pith.science/paper/QDPEWDOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00759&json=true","fetch_graph":"https://pith.science/api/pith-number/QDPEWDOFHIJPQWEJ2EQLO4RYDK/graph.json","fetch_events":"https://pith.science/api/pith-number/QDPEWDOFHIJPQWEJ2EQLO4RYDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK/action/storage_attestation","attest_author":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK/action/author_attestation","sign_citation":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK/action/citation_signature","submit_replication":"https://pith.science/pith/QDPEWDOFHIJPQWEJ2EQLO4RYDK/action/replication_record"}},"created_at":"2026-05-18T00:31:00.524714+00:00","updated_at":"2026-05-18T00:31:00.524714+00:00"}