{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BN6Q4JWL6HERSCBIPWN5MDREZI","short_pith_number":"pith:BN6Q4JWL","schema_version":"1.0","canonical_sha256":"0b7d0e26cbf1c91908287d9bd60e24ca1e04c4b81623bbc4689a34cfaf0b633d","source":{"kind":"arxiv","id":"1806.03611","version":1},"attestation_state":"computed","paper":{"title":"CuCoTrack: Cuckoo Filter Based Connection Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gil Levy, Pedro Reviriego, Salvatore Pontarelli","submitted_at":"2018-06-10T08:29:30Z","abstract_excerpt":"This paper introduces CuCoTrack, a cuckoo hash based data structure designed to efficiently implement connection tracking. The proposed scheme exploits the fact that queries always match one existing connection to compress the 5-tuple that identifies the connection. This reduces significantly the amount of memory needed to store the connections and also the memory bandwidth needed for lookups. CuCoTrack uses a dynamic fingerprint to avoid collisions thus ensuring that queries are completed in at most two memory accesses and facilitating a hardware implementation. The proposed scheme has been a"},"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":"1806.03611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T08:29:30Z","cross_cats_sorted":[],"title_canon_sha256":"88eee5038a50fade9e29a87dfbd55423e7de1bef0d7d3c8458a2d85ff1cbc559","abstract_canon_sha256":"025c67e706c2af728f05a78244f13c9da4aa5cd96adee75c2b4cb1d38e53d515"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:42.755800Z","signature_b64":"zTohsDCV8nOPfAQfxtiKBa4YvogoHbwV8FhbsgdPw0atMEvBZFPiL59izjQ5QcFLxUzfQOvwSf5Z0PqDpLLPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b7d0e26cbf1c91908287d9bd60e24ca1e04c4b81623bbc4689a34cfaf0b633d","last_reissued_at":"2026-05-18T00:13:42.755139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:42.755139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CuCoTrack: Cuckoo Filter Based Connection Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gil Levy, Pedro Reviriego, Salvatore Pontarelli","submitted_at":"2018-06-10T08:29:30Z","abstract_excerpt":"This paper introduces CuCoTrack, a cuckoo hash based data structure designed to efficiently implement connection tracking. The proposed scheme exploits the fact that queries always match one existing connection to compress the 5-tuple that identifies the connection. This reduces significantly the amount of memory needed to store the connections and also the memory bandwidth needed for lookups. CuCoTrack uses a dynamic fingerprint to avoid collisions thus ensuring that queries are completed in at most two memory accesses and facilitating a hardware implementation. The proposed scheme has been a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03611","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":"1806.03611","created_at":"2026-05-18T00:13:42.755273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03611v1","created_at":"2026-05-18T00:13:42.755273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03611","created_at":"2026-05-18T00:13:42.755273+00:00"},{"alias_kind":"pith_short_12","alias_value":"BN6Q4JWL6HER","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BN6Q4JWL6HERSCBI","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BN6Q4JWL","created_at":"2026-05-18T12:32:16.446611+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/BN6Q4JWL6HERSCBIPWN5MDREZI","json":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI.json","graph_json":"https://pith.science/api/pith-number/BN6Q4JWL6HERSCBIPWN5MDREZI/graph.json","events_json":"https://pith.science/api/pith-number/BN6Q4JWL6HERSCBIPWN5MDREZI/events.json","paper":"https://pith.science/paper/BN6Q4JWL"},"agent_actions":{"view_html":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI","download_json":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI.json","view_paper":"https://pith.science/paper/BN6Q4JWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03611&json=true","fetch_graph":"https://pith.science/api/pith-number/BN6Q4JWL6HERSCBIPWN5MDREZI/graph.json","fetch_events":"https://pith.science/api/pith-number/BN6Q4JWL6HERSCBIPWN5MDREZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI/action/storage_attestation","attest_author":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI/action/author_attestation","sign_citation":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI/action/citation_signature","submit_replication":"https://pith.science/pith/BN6Q4JWL6HERSCBIPWN5MDREZI/action/replication_record"}},"created_at":"2026-05-18T00:13:42.755273+00:00","updated_at":"2026-05-18T00:13:42.755273+00:00"}