{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NTARKWQ3ZTXORB6TCD5N2SV4NJ","short_pith_number":"pith:NTARKWQ3","schema_version":"1.0","canonical_sha256":"6cc1155a1bcceee887d310fadd4abc6a74da7fd9c56a69e2af67dcb144447ed0","source":{"kind":"arxiv","id":"1102.5540","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Heavy Hitters with the Space Saving Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Thaler, Michael Mitzenmacher, Thomas Steinke","submitted_at":"2011-02-27T19:31:05Z","abstract_excerpt":"The Hierarchical Heavy Hitters problem extends the notion of frequent items to data arranged in a hierarchy. This problem has applications to network traffic monitoring, anomaly detection, and DDoS detection. We present a new streaming approximation algorithm for computing Hierarchical Heavy Hitters that has several advantages over previous algorithms. It improves on the worst-case time and space bounds of earlier algorithms, is conceptually simple and substantially easier to implement, offers improved accuracy guarantees, is easily adopted to a distributed or parallel setting, and can be effi"},"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":"1102.5540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-27T19:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"73b904828fca3ec82ee82e9e892a87328b29dd9289ec16fa46dcfd988368fe75","abstract_canon_sha256":"3610f6d16a2e5fbbc3a25f00916b4c761eb24ab693faf35f56869744ce4f1fa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:59.387802Z","signature_b64":"cBceDml/5CNQHwcRTi0nKRoNwN9g/2id6Yk2HchojiErx/su/HkRmfLHyL5ifmWA+w9SnwVJGmNClsbHvwQhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc1155a1bcceee887d310fadd4abc6a74da7fd9c56a69e2af67dcb144447ed0","last_reissued_at":"2026-05-18T04:15:59.387140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:59.387140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Heavy Hitters with the Space Saving Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Thaler, Michael Mitzenmacher, Thomas Steinke","submitted_at":"2011-02-27T19:31:05Z","abstract_excerpt":"The Hierarchical Heavy Hitters problem extends the notion of frequent items to data arranged in a hierarchy. This problem has applications to network traffic monitoring, anomaly detection, and DDoS detection. We present a new streaming approximation algorithm for computing Hierarchical Heavy Hitters that has several advantages over previous algorithms. It improves on the worst-case time and space bounds of earlier algorithms, is conceptually simple and substantially easier to implement, offers improved accuracy guarantees, is easily adopted to a distributed or parallel setting, and can be effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5540","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":"1102.5540","created_at":"2026-05-18T04:15:59.387275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5540v2","created_at":"2026-05-18T04:15:59.387275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5540","created_at":"2026-05-18T04:15:59.387275+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTARKWQ3ZTXO","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTARKWQ3ZTXORB6T","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTARKWQ3","created_at":"2026-05-18T12:26:37.096874+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/NTARKWQ3ZTXORB6TCD5N2SV4NJ","json":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ.json","graph_json":"https://pith.science/api/pith-number/NTARKWQ3ZTXORB6TCD5N2SV4NJ/graph.json","events_json":"https://pith.science/api/pith-number/NTARKWQ3ZTXORB6TCD5N2SV4NJ/events.json","paper":"https://pith.science/paper/NTARKWQ3"},"agent_actions":{"view_html":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ","download_json":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ.json","view_paper":"https://pith.science/paper/NTARKWQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5540&json=true","fetch_graph":"https://pith.science/api/pith-number/NTARKWQ3ZTXORB6TCD5N2SV4NJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NTARKWQ3ZTXORB6TCD5N2SV4NJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/action/storage_attestation","attest_author":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/action/author_attestation","sign_citation":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/action/citation_signature","submit_replication":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/action/replication_record"}},"created_at":"2026-05-18T04:15:59.387275+00:00","updated_at":"2026-05-18T04:15:59.387275+00:00"}