{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NTARKWQ3ZTXORB6TCD5N2SV4NJ","short_pith_number":"pith:NTARKWQ3","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"},"canonical_sha256":"6cc1155a1bcceee887d310fadd4abc6a74da7fd9c56a69e2af67dcb144447ed0","source":{"kind":"arxiv","id":"1102.5540","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5540","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5540v2","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5540","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"NTARKWQ3ZTXO","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NTARKWQ3ZTXORB6T","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NTARKWQ3","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NTARKWQ3ZTXORB6TCD5N2SV4NJ","target":"record","payload":{"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"},"canonical_sha256":"6cc1155a1bcceee887d310fadd4abc6a74da7fd9c56a69e2af67dcb144447ed0","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"},"source_kind":"arxiv","source_id":"1102.5540","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-18T04:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glo/Q6FgjYsuym3cvIGPVfBiVK6QTJXejAwMSg6Tryzz1b0TdwmaV/YqjUuHQTlOsOGsv5W2oczKy4yPnWELDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:40:47.189934Z"},"content_sha256":"fb9ebab3774e4a46f13e0abedf40294309b3a853cc986499a96553680edf8365","schema_version":"1.0","event_id":"sha256:fb9ebab3774e4a46f13e0abedf40294309b3a853cc986499a96553680edf8365"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NTARKWQ3ZTXORB6TCD5N2SV4NJ","target":"graph","payload":{"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"},"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-18T04:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDpRF15tkY5vAhJ4MD+c1jbfes4HQEbl1pohlqZoMxMioY1nEFcAUhSkd0pfUR+LLqvvImH6QGdrM1ZoIPIVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:40:47.190576Z"},"content_sha256":"8fea8626117102efa80307598bc6e66b44bc6d9a9ca41af5c3bdb2ad9be57425","schema_version":"1.0","event_id":"sha256:8fea8626117102efa80307598bc6e66b44bc6d9a9ca41af5c3bdb2ad9be57425"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/bundle.json","state_url":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/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-28T04:40:47Z","links":{"resolver":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ","bundle":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/bundle.json","state":"https://pith.science/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTARKWQ3ZTXORB6TCD5N2SV4NJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NTARKWQ3ZTXORB6TCD5N2SV4NJ","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":"3610f6d16a2e5fbbc3a25f00916b4c761eb24ab693faf35f56869744ce4f1fa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-27T19:31:05Z","title_canon_sha256":"73b904828fca3ec82ee82e9e892a87328b29dd9289ec16fa46dcfd988368fe75"},"schema_version":"1.0","source":{"id":"1102.5540","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5540","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5540v2","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5540","created_at":"2026-05-18T04:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"NTARKWQ3ZTXO","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NTARKWQ3ZTXORB6T","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NTARKWQ3","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:8fea8626117102efa80307598bc6e66b44bc6d9a9ca41af5c3bdb2ad9be57425","target":"graph","created_at":"2026-05-18T04:15:59Z","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":"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","authors_text":"Justin Thaler, Michael Mitzenmacher, Thomas Steinke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-27T19:31:05Z","title":"Hierarchical Heavy Hitters with the Space Saving Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5540","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:fb9ebab3774e4a46f13e0abedf40294309b3a853cc986499a96553680edf8365","target":"record","created_at":"2026-05-18T04:15:59Z","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":"3610f6d16a2e5fbbc3a25f00916b4c761eb24ab693faf35f56869744ce4f1fa6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-27T19:31:05Z","title_canon_sha256":"73b904828fca3ec82ee82e9e892a87328b29dd9289ec16fa46dcfd988368fe75"},"schema_version":"1.0","source":{"id":"1102.5540","kind":"arxiv","version":2}},"canonical_sha256":"6cc1155a1bcceee887d310fadd4abc6a74da7fd9c56a69e2af67dcb144447ed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cc1155a1bcceee887d310fadd4abc6a74da7fd9c56a69e2af67dcb144447ed0","first_computed_at":"2026-05-18T04:15:59.387140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:59.387140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cBceDml/5CNQHwcRTi0nKRoNwN9g/2id6Yk2HchojiErx/su/HkRmfLHyL5ifmWA+w9SnwVJGmNClsbHvwQhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:59.387802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5540","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9ebab3774e4a46f13e0abedf40294309b3a853cc986499a96553680edf8365","sha256:8fea8626117102efa80307598bc6e66b44bc6d9a9ca41af5c3bdb2ad9be57425"],"state_sha256":"67e728036ee02372eceb8935643428111e0402b9cc142f58ae9cd2884d9b1010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYmi6SDyDXSCpqG9lEFeOTG+U7G16GiXYSknzLqGf6npGfpKf0nCckQ+lPHoHBzG1d2ziFWpwg5tMv4a6k7SDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:40:47.194349Z","bundle_sha256":"1746769386c6ec89f48293fd4baac8997dae02eca3454d766d72a9e89d79b772"}}