{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FTGMZGTOJ2L7FHL4BHD5E3SI74","short_pith_number":"pith:FTGMZGTO","schema_version":"1.0","canonical_sha256":"2ccccc9a6e4e97f29d7c09c7d26e48ff3973b21d2c07e0c616bb3c8d4ffa7ddf","source":{"kind":"arxiv","id":"1909.05680","version":2},"attestation_state":"computed","paper":{"title":"pForest: In-Network Inference with Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alexander Dietm\\\"uller, Coralie Busse-Grawitz, Laurent Vanbever, Roland Meier, Tobias B\\\"uhler","submitted_at":"2019-09-12T13:58:31Z","abstract_excerpt":"When classifying network traffic, a key challenge is deciding when to perform the classification, i.e., after how many packets. Too early, and the decision basis is too thin to classify a flow confidently; too late, and the tardy labeling delays crucial actions (e.g., shutting down an attack) and invests computational resources for too long (e.g., tracking and storing features). Moreover, the optimal decision timing varies across flows.\n  We present pForest, a system for \"As Soon As Possible\" (ASAP) in-network classification according to supervised machine learning models on top of programmabl"},"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":"1909.05680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-09-12T13:58:31Z","cross_cats_sorted":[],"title_canon_sha256":"555e1cb477a8446292df2308867c54f189d3d8f7ed6b0b4249690688b3b551dd","abstract_canon_sha256":"e717b8838ae30bb6aa1d0879fa1dcb25965181a47eb278532f27df329988d724"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:14.358067Z","signature_b64":"NnKWo17IQw71JXXJlXtAapNMLQQ0jZLLATlBkjNG5u6eRVCELz+0IY8Ynbu4T8dF9TEvRsoFLGmP5VEPhW//CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ccccc9a6e4e97f29d7c09c7d26e48ff3973b21d2c07e0c616bb3c8d4ffa7ddf","last_reissued_at":"2026-07-05T04:55:14.357677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:14.357677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"pForest: In-Network Inference with Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alexander Dietm\\\"uller, Coralie Busse-Grawitz, Laurent Vanbever, Roland Meier, Tobias B\\\"uhler","submitted_at":"2019-09-12T13:58:31Z","abstract_excerpt":"When classifying network traffic, a key challenge is deciding when to perform the classification, i.e., after how many packets. Too early, and the decision basis is too thin to classify a flow confidently; too late, and the tardy labeling delays crucial actions (e.g., shutting down an attack) and invests computational resources for too long (e.g., tracking and storing features). Moreover, the optimal decision timing varies across flows.\n  We present pForest, a system for \"As Soon As Possible\" (ASAP) in-network classification according to supervised machine learning models on top of programmabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05680","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/1909.05680/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":"1909.05680","created_at":"2026-07-05T04:55:14.357739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05680v2","created_at":"2026-07-05T04:55:14.357739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05680","created_at":"2026-07-05T04:55:14.357739+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTGMZGTOJ2L7","created_at":"2026-07-05T04:55:14.357739+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTGMZGTOJ2L7FHL4","created_at":"2026-07-05T04:55:14.357739+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTGMZGTO","created_at":"2026-07-05T04:55:14.357739+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.18384","citing_title":"Optimal In-Network Distribution of Learning Functions for a Secure-by-Design Programmable Data Plane of Next-Generation Networks","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74","json":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74.json","graph_json":"https://pith.science/api/pith-number/FTGMZGTOJ2L7FHL4BHD5E3SI74/graph.json","events_json":"https://pith.science/api/pith-number/FTGMZGTOJ2L7FHL4BHD5E3SI74/events.json","paper":"https://pith.science/paper/FTGMZGTO"},"agent_actions":{"view_html":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74","download_json":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74.json","view_paper":"https://pith.science/paper/FTGMZGTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05680&json=true","fetch_graph":"https://pith.science/api/pith-number/FTGMZGTOJ2L7FHL4BHD5E3SI74/graph.json","fetch_events":"https://pith.science/api/pith-number/FTGMZGTOJ2L7FHL4BHD5E3SI74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74/action/storage_attestation","attest_author":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74/action/author_attestation","sign_citation":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74/action/citation_signature","submit_replication":"https://pith.science/pith/FTGMZGTOJ2L7FHL4BHD5E3SI74/action/replication_record"}},"created_at":"2026-07-05T04:55:14.357739+00:00","updated_at":"2026-07-05T04:55:14.357739+00:00"}