{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:H4NC3CX7COJSXF4MS2PQQ26V2J","short_pith_number":"pith:H4NC3CX7","canonical_record":{"source":{"id":"1612.02962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-09T10:06:40Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"df36fad404949fca844dddd970c28e916d2336cd2a2e943be252e3fd2e328585","abstract_canon_sha256":"3e83f98419393faef4266606a25a46dd481f463bfec6089d6de67384bd077115"},"schema_version":"1.0"},"canonical_sha256":"3f1a2d8aff13932b978c969f086bd5d269aecab65c7b13252fa232e979f0b15f","source":{"kind":"arxiv","id":"1612.02962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02962","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02962v1","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02962","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"pith_short_12","alias_value":"H4NC3CX7COJS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H4NC3CX7COJSXF4M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H4NC3CX7","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:H4NC3CX7COJSXF4MS2PQQ26V2J","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-09T10:06:40Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"df36fad404949fca844dddd970c28e916d2336cd2a2e943be252e3fd2e328585","abstract_canon_sha256":"3e83f98419393faef4266606a25a46dd481f463bfec6089d6de67384bd077115"},"schema_version":"1.0"},"canonical_sha256":"3f1a2d8aff13932b978c969f086bd5d269aecab65c7b13252fa232e979f0b15f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:27.880502Z","signature_b64":"mvO4jxrENMmQonCW2ntmhb6OH7Ia4e324vkCgJ3pnWC3MeLRm6nxc2xix1zxvBcr1QbarWGpoKKe0mhnCQGtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f1a2d8aff13932b978c969f086bd5d269aecab65c7b13252fa232e979f0b15f","last_reissued_at":"2026-05-18T00:55:27.879842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:27.879842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02962","source_version":1,"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-18T00:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrjZ5zwox5zZgRYiHuVfF8MAovKUY5A9L9XMdM5LHbkp2GRnyIWu10Z6uaZ1TsYngU8aRSf6ugIwpeSmWaalDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:57:17.568422Z"},"content_sha256":"30202855edb849ad05ebd6afb16d94249180dab51d5f3dc66eca2f798380e697","schema_version":"1.0","event_id":"sha256:30202855edb849ad05ebd6afb16d94249180dab51d5f3dc66eca2f798380e697"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:H4NC3CX7COJSXF4MS2PQQ26V2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Admission Policy for Efficient Top-k and Frequency Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Gil Einziger, Ran Ben Basat, Roy Friedman, Yaron Kassner","submitted_at":"2016-12-09T10:06:40Z","abstract_excerpt":"Network management protocols often require timely and meaningful insight about per flow network traffic. This paper introduces Randomized Admission Policy (RAP) - a novel algorithm for the frequency and top-k estimation problems, which are fundamental in network monitoring. We demonstrate space reductions compared to the alternatives by a factor of up to 32 on real packet traces and up to 128 on heavy-tailed workloads. For top-k identification, RAP exhibits memory savings by a factor of between 4 and 64 depending on the skew of the workload. These empirical results are backed by formal analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02962","kind":"arxiv","version":1},"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-18T00:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upiJsY+YFtGhVScqbQaz+rohS+rwbH3X/NtLAhgwvRW2SJ0IkRnVDVqjwJbPeNmQgEOQL5CcKvnruzdWTXDeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:57:17.569120Z"},"content_sha256":"795ffced1d308afdb830db68dec03c0a948e162b564f25526585864c79b5d3e1","schema_version":"1.0","event_id":"sha256:795ffced1d308afdb830db68dec03c0a948e162b564f25526585864c79b5d3e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/bundle.json","state_url":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/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-06-09T01:57:17Z","links":{"resolver":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J","bundle":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/bundle.json","state":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:H4NC3CX7COJSXF4MS2PQQ26V2J","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":"3e83f98419393faef4266606a25a46dd481f463bfec6089d6de67384bd077115","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-09T10:06:40Z","title_canon_sha256":"df36fad404949fca844dddd970c28e916d2336cd2a2e943be252e3fd2e328585"},"schema_version":"1.0","source":{"id":"1612.02962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02962","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02962v1","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02962","created_at":"2026-05-18T00:55:27Z"},{"alias_kind":"pith_short_12","alias_value":"H4NC3CX7COJS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H4NC3CX7COJSXF4M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H4NC3CX7","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:795ffced1d308afdb830db68dec03c0a948e162b564f25526585864c79b5d3e1","target":"graph","created_at":"2026-05-18T00:55:27Z","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":"Network management protocols often require timely and meaningful insight about per flow network traffic. This paper introduces Randomized Admission Policy (RAP) - a novel algorithm for the frequency and top-k estimation problems, which are fundamental in network monitoring. We demonstrate space reductions compared to the alternatives by a factor of up to 32 on real packet traces and up to 128 on heavy-tailed workloads. For top-k identification, RAP exhibits memory savings by a factor of between 4 and 64 depending on the skew of the workload. These empirical results are backed by formal analysi","authors_text":"Gil Einziger, Ran Ben Basat, Roy Friedman, Yaron Kassner","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-09T10:06:40Z","title":"Randomized Admission Policy for Efficient Top-k and Frequency Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02962","kind":"arxiv","version":1},"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:30202855edb849ad05ebd6afb16d94249180dab51d5f3dc66eca2f798380e697","target":"record","created_at":"2026-05-18T00:55:27Z","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":"3e83f98419393faef4266606a25a46dd481f463bfec6089d6de67384bd077115","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-09T10:06:40Z","title_canon_sha256":"df36fad404949fca844dddd970c28e916d2336cd2a2e943be252e3fd2e328585"},"schema_version":"1.0","source":{"id":"1612.02962","kind":"arxiv","version":1}},"canonical_sha256":"3f1a2d8aff13932b978c969f086bd5d269aecab65c7b13252fa232e979f0b15f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f1a2d8aff13932b978c969f086bd5d269aecab65c7b13252fa232e979f0b15f","first_computed_at":"2026-05-18T00:55:27.879842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:27.879842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvO4jxrENMmQonCW2ntmhb6OH7Ia4e324vkCgJ3pnWC3MeLRm6nxc2xix1zxvBcr1QbarWGpoKKe0mhnCQGtBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:27.880502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30202855edb849ad05ebd6afb16d94249180dab51d5f3dc66eca2f798380e697","sha256:795ffced1d308afdb830db68dec03c0a948e162b564f25526585864c79b5d3e1"],"state_sha256":"bbca03ce0d831e8176fb69951e508506117ca92db6bfdbe963dd2792695f31f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8sX9i99huK7Ira/sNRS7AA2/8DwgfZOlZpl4YKgnBSjBvCfAJCNqqMmPrqLoJBVaGsWsXnzkbSATHWPdA6GCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:57:17.572906Z","bundle_sha256":"f91bc839ed77146eb097279ecbedf735d7e1372db87fc80c05e7fbc7331cdee2"}}