{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C2MPQQBSGDDBFMJY7EMQTT6RLQ","short_pith_number":"pith:C2MPQQBS","schema_version":"1.0","canonical_sha256":"1698f8403230c612b138f91909cfd15c3a1444bbcadfc931502385a4b1fac25f","source":{"kind":"arxiv","id":"2402.03694","version":2},"attestation_state":"computed","paper":{"title":"ServeFlow: A Fast-Slow Model Architecture for Network Traffic Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Gerry Wan, Jeewon Chae, Jonatas Marques, Nick Feamster, Sanjay Krishnan, Shinan Liu, Ted Shaowang","submitted_at":"2024-02-06T04:28:33Z","abstract_excerpt":"Network traffic analysis increasingly uses complex machine learning models as the internet consolidates and traffic gets more encrypted. However, over high-bandwidth networks, flows can easily arrive faster than model inference rates. The temporal nature of network flows limits simple scale-out approaches leveraged in other high-traffic machine learning applications. Accordingly, this paper presents ServeFlow, a solution for machine-learning model serving aimed at network traffic analysis tasks, which carefully selects the number of packets to collect and the models to apply for individual flo"},"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":"2402.03694","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2024-02-06T04:28:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b967b4bf64c992dfb6b8fb29bc3a2f510bd4e08222f13331f5535e1ef7d98026","abstract_canon_sha256":"2bd865db84052ebe1d865e864d21fe5140feba7639a826ce3c9988dfb4596454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:56.502845Z","signature_b64":"0rm56Ee02ly92W3XHRMbfb8+xKT1UCBUcL7A7vjxWCL1X+NcQxyL/BTRdMy8ZRX5rg4Up+ha6fan8pCTlRxGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1698f8403230c612b138f91909cfd15c3a1444bbcadfc931502385a4b1fac25f","last_reissued_at":"2026-07-05T09:24:56.502468Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:56.502468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ServeFlow: A Fast-Slow Model Architecture for Network Traffic Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Gerry Wan, Jeewon Chae, Jonatas Marques, Nick Feamster, Sanjay Krishnan, Shinan Liu, Ted Shaowang","submitted_at":"2024-02-06T04:28:33Z","abstract_excerpt":"Network traffic analysis increasingly uses complex machine learning models as the internet consolidates and traffic gets more encrypted. However, over high-bandwidth networks, flows can easily arrive faster than model inference rates. The temporal nature of network flows limits simple scale-out approaches leveraged in other high-traffic machine learning applications. Accordingly, this paper presents ServeFlow, a solution for machine-learning model serving aimed at network traffic analysis tasks, which carefully selects the number of packets to collect and the models to apply for individual flo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03694","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.03694/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.03694","created_at":"2026-07-05T09:24:56.502515+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.03694v2","created_at":"2026-07-05T09:24:56.502515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03694","created_at":"2026-07-05T09:24:56.502515+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2MPQQBSGDDB","created_at":"2026-07-05T09:24:56.502515+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2MPQQBSGDDBFMJY","created_at":"2026-07-05T09:24:56.502515+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2MPQQBS","created_at":"2026-07-05T09:24:56.502515+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00397","citing_title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ","json":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ.json","graph_json":"https://pith.science/api/pith-number/C2MPQQBSGDDBFMJY7EMQTT6RLQ/graph.json","events_json":"https://pith.science/api/pith-number/C2MPQQBSGDDBFMJY7EMQTT6RLQ/events.json","paper":"https://pith.science/paper/C2MPQQBS"},"agent_actions":{"view_html":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ","download_json":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ.json","view_paper":"https://pith.science/paper/C2MPQQBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.03694&json=true","fetch_graph":"https://pith.science/api/pith-number/C2MPQQBSGDDBFMJY7EMQTT6RLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/C2MPQQBSGDDBFMJY7EMQTT6RLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ/action/storage_attestation","attest_author":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ/action/author_attestation","sign_citation":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ/action/citation_signature","submit_replication":"https://pith.science/pith/C2MPQQBSGDDBFMJY7EMQTT6RLQ/action/replication_record"}},"created_at":"2026-07-05T09:24:56.502515+00:00","updated_at":"2026-07-05T09:24:56.502515+00:00"}