{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H4NC3CX7COJSXF4MS2PQQ26V2J","short_pith_number":"pith:H4NC3CX7","schema_version":"1.0","canonical_sha256":"3f1a2d8aff13932b978c969f086bd5d269aecab65c7b13252fa232e979f0b15f","source":{"kind":"arxiv","id":"1612.02962","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.02962","created_at":"2026-05-18T00:55:27.879941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02962v1","created_at":"2026-05-18T00:55:27.879941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02962","created_at":"2026-05-18T00:55:27.879941+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4NC3CX7COJS","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4NC3CX7COJSXF4M","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4NC3CX7","created_at":"2026-05-18T12:30:19.053100+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/H4NC3CX7COJSXF4MS2PQQ26V2J","json":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J.json","graph_json":"https://pith.science/api/pith-number/H4NC3CX7COJSXF4MS2PQQ26V2J/graph.json","events_json":"https://pith.science/api/pith-number/H4NC3CX7COJSXF4MS2PQQ26V2J/events.json","paper":"https://pith.science/paper/H4NC3CX7"},"agent_actions":{"view_html":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J","download_json":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J.json","view_paper":"https://pith.science/paper/H4NC3CX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02962&json=true","fetch_graph":"https://pith.science/api/pith-number/H4NC3CX7COJSXF4MS2PQQ26V2J/graph.json","fetch_events":"https://pith.science/api/pith-number/H4NC3CX7COJSXF4MS2PQQ26V2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/action/storage_attestation","attest_author":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/action/author_attestation","sign_citation":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/action/citation_signature","submit_replication":"https://pith.science/pith/H4NC3CX7COJSXF4MS2PQQ26V2J/action/replication_record"}},"created_at":"2026-05-18T00:55:27.879941+00:00","updated_at":"2026-05-18T00:55:27.879941+00:00"}