{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CZD6KLZJR3KKXMRUPFRPJQEZP4","short_pith_number":"pith:CZD6KLZJ","canonical_record":{"source":{"id":"1711.06754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-17T22:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"825bf4cae70d6a608ec2401f82507b5b22dfefdf1070f77e56b94f0759acea83","abstract_canon_sha256":"5eb9ba754bf125442b38db8a83fc4c46ae3e9bdc76b4b09958609d26a94b940f"},"schema_version":"1.0"},"canonical_sha256":"1647e52f298ed4abb2347962f4c0997f2432141089985ef0c9e5e9d0cdf32dd7","source":{"kind":"arxiv","id":"1711.06754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06754","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06754v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06754","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"CZD6KLZJR3KK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CZD6KLZJR3KKXMRU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CZD6KLZJ","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CZD6KLZJR3KKXMRUPFRPJQEZP4","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-17T22:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"825bf4cae70d6a608ec2401f82507b5b22dfefdf1070f77e56b94f0759acea83","abstract_canon_sha256":"5eb9ba754bf125442b38db8a83fc4c46ae3e9bdc76b4b09958609d26a94b940f"},"schema_version":"1.0"},"canonical_sha256":"1647e52f298ed4abb2347962f4c0997f2432141089985ef0c9e5e9d0cdf32dd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:15.734596Z","signature_b64":"WdZRd090JcxXgI7eqoZw7Dm3XBkftDjhRpksdFP37FvTPuo62RPkvhrbMDE+pQnw2xT8ax2kMx1D/A/IUZxCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1647e52f298ed4abb2347962f4c0997f2432141089985ef0c9e5e9d0cdf32dd7","last_reissued_at":"2026-05-18T00:30:15.733830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:15.733830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06754","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:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOtaRgv2inNwgUmSGGciyuBD1cfbYEfiU9szpjCcaThNfRZ/4a3h4gF24zOmxSzB7AVEMenMei6oXjJyPJ0eDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:58:49.856790Z"},"content_sha256":"1dbffb9e36d396ed0b2b85b2102627d2691f46fec0ab83568727c4998819a7ce","schema_version":"1.0","event_id":"sha256:1dbffb9e36d396ed0b2b85b2102627d2691f46fec0ab83568727c4998819a7ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CZD6KLZJR3KKXMRUPFRPJQEZP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and Data Structures to Accelerate Network Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alan Commike, Jordi Ros-Giralt, Peter Cullen, Richard Lethin","submitted_at":"2017-11-17T22:28:35Z","abstract_excerpt":"As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. In this paper we present five algorithms and data structures (long queue emulation, lockless bimodal queues, tail early dropping, LFN tables, and multiresolution priority queues) designed to optimize the process of analyzing network traffic. We integrated these optimizations on R-Scope, a high performance network appliance that runs the Bro network analyzer, and present benchmarks showcasing performance speed u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06754","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:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ja4wkzsFyb+mZSCqc81X2MBHsnpTP+4TWX5ZBuH8kJ4NTvV23R1LubSQxjtZ/1azZHiphIYj8CDZUcP/xlRpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:58:49.857487Z"},"content_sha256":"da3f60834fe4f12fd6254682aef3abcebeee86bf93b152ec74b7f6ce076ef959","schema_version":"1.0","event_id":"sha256:da3f60834fe4f12fd6254682aef3abcebeee86bf93b152ec74b7f6ce076ef959"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZD6KLZJR3KKXMRUPFRPJQEZP4/bundle.json","state_url":"https://pith.science/pith/CZD6KLZJR3KKXMRUPFRPJQEZP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZD6KLZJR3KKXMRUPFRPJQEZP4/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-10T22:58:49Z","links":{"resolver":"https://pith.science/pith/CZD6KLZJR3KKXMRUPFRPJQEZP4","bundle":"https://pith.science/pith/CZD6KLZJR3KKXMRUPFRPJQEZP4/bundle.json","state":"https://pith.science/pith/CZD6KLZJR3KKXMRUPFRPJQEZP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZD6KLZJR3KKXMRUPFRPJQEZP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CZD6KLZJR3KKXMRUPFRPJQEZP4","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":"5eb9ba754bf125442b38db8a83fc4c46ae3e9bdc76b4b09958609d26a94b940f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-17T22:28:35Z","title_canon_sha256":"825bf4cae70d6a608ec2401f82507b5b22dfefdf1070f77e56b94f0759acea83"},"schema_version":"1.0","source":{"id":"1711.06754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06754","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06754v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06754","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"CZD6KLZJR3KK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CZD6KLZJR3KKXMRU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CZD6KLZJ","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:da3f60834fe4f12fd6254682aef3abcebeee86bf93b152ec74b7f6ce076ef959","target":"graph","created_at":"2026-05-18T00:30:15Z","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":"As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. In this paper we present five algorithms and data structures (long queue emulation, lockless bimodal queues, tail early dropping, LFN tables, and multiresolution priority queues) designed to optimize the process of analyzing network traffic. We integrated these optimizations on R-Scope, a high performance network appliance that runs the Bro network analyzer, and present benchmarks showcasing performance speed u","authors_text":"Alan Commike, Jordi Ros-Giralt, Peter Cullen, Richard Lethin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-17T22:28:35Z","title":"Algorithms and Data Structures to Accelerate Network Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06754","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:1dbffb9e36d396ed0b2b85b2102627d2691f46fec0ab83568727c4998819a7ce","target":"record","created_at":"2026-05-18T00:30:15Z","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":"5eb9ba754bf125442b38db8a83fc4c46ae3e9bdc76b4b09958609d26a94b940f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-11-17T22:28:35Z","title_canon_sha256":"825bf4cae70d6a608ec2401f82507b5b22dfefdf1070f77e56b94f0759acea83"},"schema_version":"1.0","source":{"id":"1711.06754","kind":"arxiv","version":1}},"canonical_sha256":"1647e52f298ed4abb2347962f4c0997f2432141089985ef0c9e5e9d0cdf32dd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1647e52f298ed4abb2347962f4c0997f2432141089985ef0c9e5e9d0cdf32dd7","first_computed_at":"2026-05-18T00:30:15.733830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:15.733830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WdZRd090JcxXgI7eqoZw7Dm3XBkftDjhRpksdFP37FvTPuo62RPkvhrbMDE+pQnw2xT8ax2kMx1D/A/IUZxCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:15.734596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dbffb9e36d396ed0b2b85b2102627d2691f46fec0ab83568727c4998819a7ce","sha256:da3f60834fe4f12fd6254682aef3abcebeee86bf93b152ec74b7f6ce076ef959"],"state_sha256":"4145801035ac4e751fb7302df9b1513543e744c6a0f0f002b6150bb13df78b26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csodXm1TkiYD5Z64/4lARrG/fBsL8Ex5+Ta/PHeZ2lRE/mcKPzLXL9Jpscool3aziXmKtlgCa2skWhZHBXouDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:58:49.861185Z","bundle_sha256":"f586a3e6d78f450e90a1c044df3c08f240beefe6c1ad0ad3fca4f299f17f7598"}}