{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XWRALHKAM3LS5BK4YOPEBP3VVP","short_pith_number":"pith:XWRALHKA","schema_version":"1.0","canonical_sha256":"bda2059d4066d72e855cc39e40bf75abc45897de8247d1eb55230ff79b224461","source":{"kind":"arxiv","id":"1012.3130","version":3},"attestation_state":"computed","paper":{"title":"How to Catch L_2-Heavy-Hitters on Sliding Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rafail Ostrovsky, Ran Gelles, Vladimir Braverman","submitted_at":"2010-12-14T18:52:58Z","abstract_excerpt":"Finding heavy-elements (heavy-hitters) in streaming data is one of the central, and well-understood tasks. Despite the importance of this problem, when considering the sliding windows model of streaming (where elements eventually expire) the problem of finding L_2-heavy elements has remained completely open despite multiple papers and considerable success in finding L_1-heavy elements.\n  In this paper, we develop the first poly-logarithmic-memory algorithm for finding L_2-heavy elements in sliding window model. Since L_2 heavy elements play a central role for many fundamental streaming problem"},"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":"1012.3130","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-14T18:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"c9e33d83ae566b42cd44c65dab2b1397ef7156310b0c42396f34799a4f7da57f","abstract_canon_sha256":"350f66f419caf59f079cfd647d4091087fed04430d8b705e6991c89d900ac1f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:31.743826Z","signature_b64":"SLBgE14YI4sAMEfz5pq99CqqPBRpT0kLgx9+zcEYK6vfOGsilKZxvCOUNgWJ8UZele8mBd58B+vtgnhSAs3+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda2059d4066d72e855cc39e40bf75abc45897de8247d1eb55230ff79b224461","last_reissued_at":"2026-05-18T02:46:31.743451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:31.743451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Catch L_2-Heavy-Hitters on Sliding Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rafail Ostrovsky, Ran Gelles, Vladimir Braverman","submitted_at":"2010-12-14T18:52:58Z","abstract_excerpt":"Finding heavy-elements (heavy-hitters) in streaming data is one of the central, and well-understood tasks. Despite the importance of this problem, when considering the sliding windows model of streaming (where elements eventually expire) the problem of finding L_2-heavy elements has remained completely open despite multiple papers and considerable success in finding L_1-heavy elements.\n  In this paper, we develop the first poly-logarithmic-memory algorithm for finding L_2-heavy elements in sliding window model. Since L_2 heavy elements play a central role for many fundamental streaming problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3130","kind":"arxiv","version":3},"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":"1012.3130","created_at":"2026-05-18T02:46:31.743509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3130v3","created_at":"2026-05-18T02:46:31.743509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3130","created_at":"2026-05-18T02:46:31.743509+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWRALHKAM3LS","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWRALHKAM3LS5BK4","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWRALHKA","created_at":"2026-05-18T12:26:17.028572+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/XWRALHKAM3LS5BK4YOPEBP3VVP","json":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP.json","graph_json":"https://pith.science/api/pith-number/XWRALHKAM3LS5BK4YOPEBP3VVP/graph.json","events_json":"https://pith.science/api/pith-number/XWRALHKAM3LS5BK4YOPEBP3VVP/events.json","paper":"https://pith.science/paper/XWRALHKA"},"agent_actions":{"view_html":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP","download_json":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP.json","view_paper":"https://pith.science/paper/XWRALHKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3130&json=true","fetch_graph":"https://pith.science/api/pith-number/XWRALHKAM3LS5BK4YOPEBP3VVP/graph.json","fetch_events":"https://pith.science/api/pith-number/XWRALHKAM3LS5BK4YOPEBP3VVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP/action/storage_attestation","attest_author":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP/action/author_attestation","sign_citation":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP/action/citation_signature","submit_replication":"https://pith.science/pith/XWRALHKAM3LS5BK4YOPEBP3VVP/action/replication_record"}},"created_at":"2026-05-18T02:46:31.743509+00:00","updated_at":"2026-05-18T02:46:31.743509+00:00"}