{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IHNKZPLA6QWXSMWMG7B7ANBRLW","short_pith_number":"pith:IHNKZPLA","schema_version":"1.0","canonical_sha256":"41daacbd60f42d7932cc37c3f034315d848b911384475fb88f0abb80e9a4bf70","source":{"kind":"arxiv","id":"2302.11718","version":1},"attestation_state":"computed","paper":{"title":"AC-DC: Adaptive Ensemble Classification for Network Traffic Identification","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Francesco Bronzino, Nick Feamster, Paul Schmitt, Saloua Naama, Shinan Liu, Xi Jiang","submitted_at":"2023-02-23T00:45:48Z","abstract_excerpt":"Accurate and efficient network traffic classification is important for many network management tasks, from traffic prioritization to anomaly detection. Although classifiers using pre-computed flow statistics (e.g., packet sizes, inter-arrival times) can be efficient, they may experience lower accuracy than techniques based on raw traffic, including packet captures. Past work on representation learning-based classifiers applied to network traffic captures has shown to be more accurate, but slower and requiring considerable additional memory resources, due to the substantial costs in feature pre"},"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":"2302.11718","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2023-02-23T00:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"d3a5ce9e5c5d44dd1ef0532a78d48f570a9b7073935adbf8d37720e5a88685f6","abstract_canon_sha256":"b200db09df9866ebaefe8c8fc6bb4a7193df65f5845953ab26434477399c9599"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:55.267164Z","signature_b64":"fXYXi2w7/15JnJEpUulT6XtH8hIT7NAn3QoirKMSGn1OJt87LpIUAiuQXzEc/DXMLCS2O9ZQFR65jlSEovb7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41daacbd60f42d7932cc37c3f034315d848b911384475fb88f0abb80e9a4bf70","last_reissued_at":"2026-07-05T05:44:55.266679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:55.266679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AC-DC: Adaptive Ensemble Classification for Network Traffic Identification","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Francesco Bronzino, Nick Feamster, Paul Schmitt, Saloua Naama, Shinan Liu, Xi Jiang","submitted_at":"2023-02-23T00:45:48Z","abstract_excerpt":"Accurate and efficient network traffic classification is important for many network management tasks, from traffic prioritization to anomaly detection. Although classifiers using pre-computed flow statistics (e.g., packet sizes, inter-arrival times) can be efficient, they may experience lower accuracy than techniques based on raw traffic, including packet captures. Past work on representation learning-based classifiers applied to network traffic captures has shown to be more accurate, but slower and requiring considerable additional memory resources, due to the substantial costs in feature pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11718","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.11718/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":"2302.11718","created_at":"2026-07-05T05:44:55.266739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.11718v1","created_at":"2026-07-05T05:44:55.266739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11718","created_at":"2026-07-05T05:44:55.266739+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHNKZPLA6QWX","created_at":"2026-07-05T05:44:55.266739+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHNKZPLA6QWXSMWM","created_at":"2026-07-05T05:44:55.266739+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHNKZPLA","created_at":"2026-07-05T05:44:55.266739+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":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW","json":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW.json","graph_json":"https://pith.science/api/pith-number/IHNKZPLA6QWXSMWMG7B7ANBRLW/graph.json","events_json":"https://pith.science/api/pith-number/IHNKZPLA6QWXSMWMG7B7ANBRLW/events.json","paper":"https://pith.science/paper/IHNKZPLA"},"agent_actions":{"view_html":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW","download_json":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW.json","view_paper":"https://pith.science/paper/IHNKZPLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.11718&json=true","fetch_graph":"https://pith.science/api/pith-number/IHNKZPLA6QWXSMWMG7B7ANBRLW/graph.json","fetch_events":"https://pith.science/api/pith-number/IHNKZPLA6QWXSMWMG7B7ANBRLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW/action/storage_attestation","attest_author":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW/action/author_attestation","sign_citation":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW/action/citation_signature","submit_replication":"https://pith.science/pith/IHNKZPLA6QWXSMWMG7B7ANBRLW/action/replication_record"}},"created_at":"2026-07-05T05:44:55.266739+00:00","updated_at":"2026-07-05T05:44:55.266739+00:00"}