{"as_of":"2026-08-12T21:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8b6103a146348d05beb698c8ea5d53e0a46252e977b4bcf93b8b8f3b41a3840","coverage":[{"denominator":85,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":85,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:45:22.027286Z","state":"measured"},{"denominator":85,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":85,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.00397/citation-record","integrity":"/paper/2509.00397/integrity","json":"/paper/2509.00397/citation-record.json","paper":"/paper/2509.00397"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:14.551825Z","title":"Pensando","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:14.551825Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:028fcea7b0b54da1a3a5ad66dca68c444edfd125334ee236ee4105ab3d877bd3","observation_id":"808146ee-e4c6-443c-93d2-32ea135c0f1f","resolution":{"observed_at":"2026-08-05T13:45:14.551825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:14.619501Z","title":"Machine Learning for En- crypted Malware Traffic Classification: Accounting for Noisy Labels and Non-Stationarity","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:14.619501Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:cc6fbd2529979381d62047840024f6364d6c7cd4c379a4376aad64ca4edc402c","observation_id":"dadc3b3b-12c8-44ce-ba4d-26773d201d71","resolution":{"observed_at":"2026-08-05T13:45:14.619501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:14.744583Z","title":"Opentuner: An Extensible Framework for Program Autotuning","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:14.744583Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:7f17b7467ca7b05a15d1cc49f0572d55da6363dab2ee36c95c5fee1242b14fb4","observation_id":"97d3d645-b62b-4109-ad90-43c28fd5b9ef","resolution":{"observed_at":"2026-08-05T13:45:14.744583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:14.848848Z","title":"Practical Traffic Analysis Attacks on Secure Messaging Applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:14.848848Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:86d7d5f95cde4509fabcf3d6780edd28ebb0414ca0cec237a0093891ae8df24a","observation_id":"687fa6a5-a512-4bf4-bba2-0a943dc1a1a1","resolution":{"observed_at":"2026-08-05T13:45:14.848848Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:14.924866Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:14.924866Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:a8bda4944008d603d37ecde13e5d7059da777dc22e06fb21a24bb29c85831f6b","observation_id":"963e09f2-3ee3-4e90-98ea-1be18ce5a1ec","resolution":{"observed_at":"2026-08-05T13:45:14.924866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:35.253547Z","title":"Understanding data center traffic characteristics","venue":null,"work_id":"5a0c1423-ae02-4658-bbc7-99b643543075","year":2010},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.018076Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:f443b44d4b8d5119842968f83524cd0558c3ac07d0141a63ded1e22ee16f267f","observation_id":"617ece89-a22e-40e9-97c8-e025adcc4fee","resolution":{"observed_at":"2026-08-05T13:45:35.328483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:35.038313Z","title":"Bergstra, D","venue":null,"work_id":"6ae5c251-eafa-4b0d-8e05-3805991a0966","year":2013},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.123779Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:878bbbf2fdc2782852b639b79d7aba9df587a7e8562246eddbbd83045220e980","observation_id":"32c08f3b-cbc7-4729-b3c7-97b843652c3f","resolution":{"observed_at":"2026-08-05T13:45:35.161459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:34.875370Z","title":"P4: Programming Protocol-Independent Packet Processors","venue":null,"work_id":"f5db967d-acd4-466d-9762-93b0f11f3981","year":2014},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.199449Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:645acb182b4104af887431cff54e43732b135a4b596c803e0b4c3810dcb7effc","observation_id":"6e362a41-9021-43af-9341-a40c15626b2b","resolution":{"observed_at":"2026-08-05T13:45:34.949513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:34.645792Z","title":"Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware for SDN","venue":null,"work_id":"fad15394-d189-4727-ac30-debab0ed85ac","year":2013},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.353963Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:3e9f035c0819426950b1c7ac4e9cdfb821f374d0944651a7789f22cbfe2e178d","observation_id":"1316a1b3-5344-49e4-bc49-f32595919601","resolution":{"observed_at":"2026-08-05T13:45:34.755367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:34.449378Z","title":"Trident 5 / BCM78800 Series","venue":null,"work_id":"2ebf2a59-730b-405f-b695-7798a980907e","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.451869Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:0103c26d3858e83353f4fde873531c87844535ad326971092fbd817934520840","observation_id":"ca783d82-edb3-4da9-87ae-1a82fae2475e","resolution":{"observed_at":"2026-08-05T13:45:34.561128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:34.250340Z","title":"Trident4/BCM56880 Series","venue":null,"work_id":"7346d0ed-989f-4c48-a35b-59d0921b9b1c","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.563106Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:561e53c2888c8d9904ec9ff6978fd110f390a7bc9f58c990c98246fb135be1e2","observation_id":"bf655304-bd9b-4dc8-9a81-4dbee42ae0c1","resolution":{"observed_at":"2026-08-05T13:45:34.360681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05680","last_updated":"2022-09-06T21:35:11Z","snapshot_observed_at":"2026-08-12T14:05:21.935630Z","submitted_at":"2019-09-12T13:58:31Z","title":"pForest: In-Network Inference with Random Forests","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05680","snapshot_observed_at":"2026-08-05T13:45:15.647845Z","title":"pForest: In- Network Inference with Random Forests","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.647845Z"},"links":{"cited_paper":"/paper/1909.05680","citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:7272fb5a9717e182b681b2113951a913f51631e79db83adb4ae7225a3ed76a33","observation_id":"05d2fe06-b58d-4a5f-9a3a-59e4d0177cc2","resolution":{"observed_at":"2026-08-05T13:45:15.647845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:33.980347Z","title":"CIC IDS 2017 Dataset","venue":null,"work_id":"cbaf9215-38ec-4631-aacb-40f3dc398ec1","year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.772555Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:24b446428bb79fd146d098992f5af853da0d08c78695d61f1fb70bd7ee6511f0","observation_id":"237f2abb-00db-4ac2-a226-5870c1a63625","resolution":{"observed_at":"2026-08-05T13:45:34.095072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:33.729273Z","title":"CIC IDS 2018 Dataset","venue":null,"work_id":"49d86a59-b370-4f41-b0e6-311af6cd99a7","year":2018},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.880045Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:554e301df3b49e6474f875c3f520dc663deaa1821f2cfbbba4feace5121511af","observation_id":"bb1fd775-9cda-42f0-9884-f7dc01a3a21f","resolution":{"observed_at":"2026-08-05T13:45:33.841401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:33.485245Z","title":"CIC IoMT 2024 Dataset","venue":null,"work_id":"dd524c3b-6fa6-4b2d-b735-d52cbfcab0c4","year":2024},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.976328Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:7a9cba0ffc1cd2faf93c493c9ee9da39acb9aec7eccedcb01a54cacdb8595614","observation_id":"027f0a3a-35f7-4306-9fda-734e90f55112","resolution":{"observed_at":"2026-08-05T13:45:33.593958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:33.229616Z","title":"CIC IoT 2023 Dataset","venue":null,"work_id":"cfa2ed56-d82d-43d7-ad82-59cf84c27d03","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.074417Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:91e8c660ce3abfe8fbe68bffc198c48ae8cf8cbd516272284a81efa176e339d7","observation_id":"3952ffdc-076c-4bd3-a427-0b31a72762f7","resolution":{"observed_at":"2026-08-05T13:45:33.363639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:33.026886Z","title":"CIC VPN Dataset","venue":null,"work_id":"658d498e-8f99-47a9-837c-e1305d0a8be0","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.173635Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:14f6418bf073acdcba4b5371ddb5f3473a165e1f649a92822a60bb4d37f875a8","observation_id":"8674f8a3-a048-45a6-878f-1038911e2a5a","resolution":{"observed_at":"2026-08-05T13:45:33.114248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:32.795130Z","title":"Tensor Processing Units (TPUs)","venue":null,"work_id":"11159cda-5426-45b5-8a81-ab5384e38f72","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.290927Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:722dc859b73497f201a878fb300816dd47ea420d975b00f5b491d1f2969e8cd1","observation_id":"31ecd33f-d5fe-4a8f-923f-d6fecfce8a7a","resolution":{"observed_at":"2026-08-05T13:45:32.871545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:32.570468Z","title":"Intel P4 Insight","venue":null,"work_id":"6e109d3b-4508-48fa-833a-05e561c0ddf0","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.369018Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:c8a1373342d4bcb14f8d5f2ce7a25a47754001c26832f603ba5d0a49ec801f3e","observation_id":"627c3739-721e-4fb6-9c89-e77c8d280d8f","resolution":{"observed_at":"2026-08-05T13:45:32.690700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:32.331661Z","title":"Intel ® P4 Studio","venue":null,"work_id":"a19623df-c01c-4e0b-aa4f-336f3d446be3","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.482291Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:ee7bcf2741a237a0a201315e07bf0f516688260a377dc5de15b7796f2ccec420","observation_id":"ad111f03-27ff-4a6c-a7ff-a905a5607eb8","resolution":{"observed_at":"2026-08-05T13:45:32.449087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:32.132040Z","title":"NVIDIA T4 Tensor Core GPU","venue":null,"work_id":"6d7799f8-127b-4e3c-9522-4db74675173c","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.600791Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:f4981c76bc4c635979f4090456a637a34e645e7843e51c9b17d26324f07f95a8","observation_id":"f6d3a88f-1f21-4ac0-9cc3-2ecdfd79489d","resolution":{"observed_at":"2026-08-05T13:45:32.213554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:32.103578Z","title":null,"venue":null,"work_id":"c0d135ff-3c73-4740-a76e-7eb21fb7bb0b","year":null},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.723102Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:213e9bd040329c0018636fcb4e6b11908b13dbffd668d88169c55ffb9de0922a","observation_id":"79aea255-d9d3-44ca-a3be-b678d3370a14","resolution":{"observed_at":"2026-08-05T13:45:32.108315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:31.934547Z","title":"Brighten Godfrey, and Michael Schapira","venue":null,"work_id":"a4391696-4208-43ec-b557-9c9acee83cea","year":2015},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.878446Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:290e87b77c0dbb02cff3c7fe1ba0fbf57acb58d24cb820ec1426fc64afa88d1e","observation_id":"681c94fa-f3c4-4d48-a507-756ec66db875","resolution":{"observed_at":"2026-08-05T13:45:32.017685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:31.772516Z","title":"HorusEye: A Realtime IoT Malicious Traffic Detec- tion Framework using Programmable Switches","venue":null,"work_id":"d8f272ea-f1e0-413a-a360-38d36ad16dae","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:16.955177Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:7c953f925dee5d38b55ab451852c59c04a07943e0531e5cfaba7259d127f5613","observation_id":"4ef27ebb-3d19-4a8b-a3f3-6951a972910d","resolution":{"observed_at":"2026-08-05T13:45:31.828227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:31.582869Z","title":"Doriguzzi-Corin, S","venue":null,"work_id":"c3b705c4-45c9-400e-8097-eb3381e4cc12","year":2020},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.038347Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:2b72045e777106acab7cd65dbfb2b75a1d39b7ba7a6985e567b23e21b96331b6","observation_id":"d75a6c65-7630-475c-bf2a-102e603afec8","resolution":{"observed_at":"2026-08-05T13:45:31.679376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:31.460182Z","title":"Moongen: A Scriptable High- Speed Packet Generator","venue":null,"work_id":"bccc1de7-e208-481d-9b3a-a6846cf8c7aa","year":2015},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.088403Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:18229959f1b7bc635ba6dbbc49f5008f64ce66bf093b32ff3d7f8b9a8bc3c62d","observation_id":"f2e3230b-55d4-48c7-86ca-a95def77673d","resolution":{"observed_at":"2026-08-05T13:45:31.499877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:31.298619Z","title":"BOHB: Robust and efficient hyperparameter optimization at scale","venue":null,"work_id":"2755b293-db31-4e73-8dc7-dff13bdaef54","year":2018},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.174082Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:f57ca6c6ec8aa2397920362c521fecd9a86e49fe12c2f27e8058a02f50c8ffe1","observation_id":"665756db-67d5-4d54-af5f-8a2adb1f8148","resolution":{"observed_at":"2026-08-05T13:45:31.391719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:31.159452Z","title":"Stratum OS","venue":null,"work_id":"754daeb9-1fa3-460c-ba4f-ec4a0e884cd4","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.264369Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:1dc59be314d40af68356690af1f3343be198019b3d353241f6fc449af403d4b9","observation_id":"61a228ef-9c52-4300-a5f3-a582ab5e725f","resolution":{"observed_at":"2026-08-05T13:45:31.225380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:31.037391Z","title":"Detecting Unknown Encrypted Malicious Traffic in Real Time via Flow Interaction Graph Analysis","venue":null,"work_id":"96c5cf23-c798-4d46-bc6a-a2ca5a097b63","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.341890Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:343e3daff0517e6d83b043be2262c8a0ce3002a23ac1822bb80de3a2a3c1c497","observation_id":"6752a8a9-1dc3-4797-9685-62a0b20868b2","resolution":{"observed_at":"2026-08-05T13:45:31.118771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"document/4300829","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:22.929191Z","title":"Network Pro- gramming Language (NPL) Specification","venue":null,"work_id":"7e94287b-2835-4003-b8ed-d9331bdad676","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.397767Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:f1b6d3abbb241a20570348d3f3895a791cb20dd8ad8120d0e0ba4012399e2c2f","observation_id":"909ad67c-5ff8-46e3-92d0-c3ffd09d2e4a","resolution":{"observed_at":"2026-08-05T13:45:22.990057Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.930810Z","title":"Characterization of encrypted and VPN traffic using time-related features","venue":null,"work_id":"c3363697-0f67-4633-b6fd-70014c0a0832","year":2016},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.482104Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:954d881a73823a58d9e882b301fedbfd4afb6d2a3b349dfe08cacedc878d88ae","observation_id":"f7bc04bb-4be8-4fcd-8453-b10e4379463c","resolution":{"observed_at":"2026-08-05T13:45:30.984614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.808287Z","title":"CICFlowMeter","venue":null,"work_id":"df8a4310-1444-4f48-9770-7b2286804eb0","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.538690Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:299566af8b54c6edbb0ac658496171b22e5ca1150259734bdd127bde18fcbd1b","observation_id":"b0f07b16-dad3-41cd-a02f-92b5f16d125f","resolution":{"observed_at":"2026-08-05T13:45:30.839238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.669913Z","title":"PostgreSQL","venue":null,"work_id":"8821356d-f944-4422-a3b9-59814c8000f9","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.595077Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:164409d7f5222e62e3fdd2460c641f3b41959163a4c12b121c670e9e9956533b","observation_id":"10c75ba9-75f0-4a70-a254-b9d840b3f936","resolution":{"observed_at":"2026-08-05T13:45:30.727005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.526981Z","title":"Gupta, R","venue":null,"work_id":"da328dd7-2811-49bc-a834-c48fc8ec2566","year":2018},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.681576Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:fa8c3f5455f070e3e709895b90374213e78bbcebd0e53efab8cc5066444bb528","observation_id":"4eec58aa-cb0a-417e-9b1b-70de1629af72","resolution":{"observed_at":"2026-08-05T13:45:30.611022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17025","last_updated":"2026-05-12T17:50:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-25T22:04:57Z","title":"netFound: Principled Design for Network Foundation Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17025","snapshot_observed_at":"2026-08-05T13:45:17.761178Z","title":"netFound: Foundation Model for Network Security","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.761178Z"},"links":{"cited_paper":"/paper/2310.17025","citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:5d1acd4dd2f79708815c332fc6c549e944d3cdc9483c51bb01f9ae8e967b4d7d","observation_id":"27f123ae-f313-4594-99e7-18a3075eacae","resolution":{"observed_at":"2026-08-05T13:45:17.761178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.423458Z","title":"CUBIC: A New TCP- Friendly High-Speed TCP Variant","venue":null,"work_id":"19291d40-c365-490c-8d03-8cbbf7ee2190","year":2008},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.833104Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:7c33ed929fd859783a28dec25558a6eca29a5d905c02d831a28c8730e15a6840","observation_id":"0dc098d3-1f61-415f-bac4-16d01e3eb220","resolution":{"observed_at":"2026-08-05T13:45:30.486041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.337163Z","title":"Moore, Gianni Antichi, and Marcin Wój- cik","venue":null,"work_id":"8d60be95-6d30-422d-9393-0e9d9cbb786d","year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.897413Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:cc441f3d2d5cdcd44e254ae4fb987f9ebcb501c8e9f3d8240bf24eddc4818008","observation_id":"d39b64df-3f74-4ca7-bf91-23f221a39b3b","resolution":{"observed_at":"2026-08-05T13:45:30.367260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.184597Z","title":"Understanding the CRC32 Hash: A Comprehensive Guide","venue":null,"work_id":"d1e9dccf-f8e9-4699-b691-02ef519b60a9","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:17.984683Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:77b4d5e91141c7f487a9bc1faaca38700a65026e83c8ffd0727a7d54f660aff1","observation_id":"39e26a03-c9a5-4718-ab56-e77258a2a7d5","resolution":{"observed_at":"2026-08-05T13:45:30.241542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:30.043110Z","title":null,"venue":null,"work_id":"9127a801-aa08-4359-9fe5-57d209174481","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.036928Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:758addeb99ce3408c8d672a5be3daf14d840d1152681b7be149e378adff0a625","observation_id":"17ec53f9-01ad-465d-9c1d-04fcb657f665","resolution":{"observed_at":"2026-08-05T13:45:30.098838Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:29.901006Z","title":"Intel Ethernet Network Adapter X710","venue":null,"work_id":"684cd759-5334-463f-81f6-da068df3d0d6","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.108327Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:4d69db312b9272eb33dc37d6cc40b19a002ca0ceb7b88c0f68b149831167b422","observation_id":"c27e5d5a-2c47-4c01-8fdf-4587c36f91a8","resolution":{"observed_at":"2026-08-05T13:45:29.983704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:29.774605Z","title":"Tofino: P4-programmable Ethernet switch ASIC that delivers better performance at lower power","venue":null,"work_id":"7185faaf-d768-466f-829d-3dd80fad5137","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.167784Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:a7d7844c3b2c2828ce150b000a29285d2d165e64f90def2ad30b19be4c95197c","observation_id":"bcb2d14d-9136-4523-92eb-954c6c9200a3","resolution":{"observed_at":"2026-08-05T13:45:29.852578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:29.596624Z","title":"Tofino2: Second-generation P4-programmable Ethernet Switch ASIC that Continues to De- liver Programmability without Compromise","venue":null,"work_id":"15864c57-9be9-467c-8b37-dcabc07d6b9d","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.232948Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:6fdf1aa246a1f472e1b051ad4583dff4f9dea85193fa0b15eda71c60cb157a6b","observation_id":"1de7dec6-d868-4873-8c86-b72d8d9fe2a7","resolution":{"observed_at":"2026-08-05T13:45:29.708640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:29.475220Z","title":"Leo: Online ML-based Traffic Classification at Multi-Terabit Line Rate","venue":null,"work_id":"80b206da-aefa-4571-ad2a-01a335a40324","year":2024},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.306268Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:b4cc3227d8cead1ac64a6fbc263447351e33e2ce15946307fcffb85d7aeb73c5","observation_id":"5416891b-ae8c-4be9-a527-842057a29c46","resolution":{"observed_at":"2026-08-05T13:45:29.560049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11718","last_updated":"2023-02-23T00:45:48Z","snapshot_observed_at":"2026-08-05T18:56:43.464750Z","submitted_at":"2023-02-23T00:45:48Z","title":"AC-DC: Adaptive Ensemble Classification for Network Traffic Identification","version":1},"cited_work":{"arxiv_id":"2302.11718","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.11718","snapshot_observed_at":"2026-08-05T13:45:22.719337Z","title":"AC-DC: Adaptive Ensemble Classification for Network Traffic Identification","venue":"cs.NI","work_id":"3c7668f0-c71f-4232-b82a-db31d88a53db","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.370037Z"},"links":{"cited_paper":"/paper/2302.11718","citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:0a67d88ec9d33079901236802780691ed32504886986bfa9eff9f4215c2c377a","observation_id":"bea22191-251b-48c0-82ba-cc43a86cf898","resolution":{"observed_at":"2026-08-05T13:45:22.782341Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.03845","last_updated":"2017-11-10T15:00:54Z","snapshot_observed_at":"2026-07-06T06:08:48.494464Z","submitted_at":"2017-11-10T15:00:54Z","title":"GPflowOpt: A Bayesian Optimization Library using TensorFlow","version":1},"cited_work":{"arxiv_id":"1711.03845","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.03845","snapshot_observed_at":"2026-08-05T13:45:22.525850Z","title":"GPflowOpt: A Bayesian Optimization Library using TensorFlow","venue":"stat.ML","work_id":"4c7cc21d-5f2f-4c79-9189-c317e17e0eed","year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.445106Z"},"links":{"cited_paper":"/paper/1711.03845","citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:05fb01613f01c1dc9f3d79d105f47ea32b4aa711f2b7ddf0fb108ef4b838f7f4","observation_id":"1369be95-4706-4508-b38f-cff54a32e534","resolution":{"observed_at":"2026-08-05T13:45:22.613928Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"post/1335081","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:22.403738Z","title":"The IPU: A New, Strate- gic Resource for Cloud Service Providers","venue":null,"work_id":"f580bf8c-5749-4a32-b130-219388647293","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.520638Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:beb63492bb8926edec5a24aed9a6d29770b6a5b18f98bb9c3ff9bff314a72b49","observation_id":"f0d7eb92-8b22-4a0d-9a69-94e4f235a27b","resolution":{"observed_at":"2026-08-05T13:45:22.465472Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:29.375451Z","title":"Characterization of tor traffic using time based features","venue":null,"work_id":"43574877-4a07-44c2-b519-f4fe92b0b5c9","year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.615821Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:910ff34996c7ee43d39061cf67dc57e7b99d7dda2269d78073fda645f6929a05","observation_id":"4de58cdc-3f2f-4c45-a6e4-99df39e0ee15","resolution":{"observed_at":"2026-08-05T13:45:29.414068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:29.256191Z","title":"HPCC: High Precision Congestion Control","venue":null,"work_id":"8267ec01-8cac-47d7-aa29-5fad8bf32515","year":2019},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.715144Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:896d98c4ad5df15974151a89fd119c4b66ca978343d9170aa53d0599e3b83394","observation_id":"96720761-d142-4e96-b7b6-dc9eaf710d97","resolution":{"observed_at":"2026-08-05T13:45:29.298770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:29.133375Z","title":"SMAC3: A versatile Bayesian optimization package for hyperparameter optimiza- tion","venue":null,"work_id":"dc45dcc6-a7df-4702-b743-e718c90ba3a9","year":2022},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.823519Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:9ce0d89f784e30ea8f57756d9a877479d6d291d6914242249cff44905dddf581","observation_id":"1950a001-48ff-465a-94e7-d9fcf3fea4b5","resolution":{"observed_at":"2026-08-05T13:45:29.190622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03694","last_updated":"2024-10-24T14:15:42Z","snapshot_observed_at":"2026-08-10T14:54:31.829546Z","submitted_at":"2024-02-06T04:28:33Z","title":"ServeFlow: A Fast-Slow Model Architecture for Network Traffic Analysis","version":2},"cited_work":{"arxiv_id":"2402.03694","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.03694","snapshot_observed_at":"2026-08-05T13:45:22.122757Z","title":"ServeFlow: A Fast-Slow Model Architecture for Network Traffic Analysis","venue":"cs.NI","work_id":"dc70c683-8ee8-4430-9eea-c6e2c7ac1dee","year":2024},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:18.944491Z"},"links":{"cited_paper":"/paper/2402.03694","citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:0c70afeda7d8b4c3906baedc08eda68e57e74df6c7402b060281c8b70378cbdb","observation_id":"664147f6-555a-4613-a885-553dac66eca5","resolution":{"observed_at":"2026-08-05T13:45:22.179777Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:28.985482Z","title":"Neural Adaptive Video Streaming with Pensieve","venue":null,"work_id":"a94b03d4-a9d4-4863-8805-4fb5e3724765","year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.047569Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:0b9e4a7e298c163ed50477c90f2cd92a128f99048cdbe663e13498e392b90fa7","observation_id":"c4d95599-d8f6-4373-8465-7270f7117b6e","resolution":{"observed_at":"2026-08-05T13:45:29.073444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:28.889455Z","title":"Homa: A Receiver-Driven Low-Latency Transport Protocol Using Network Priorities","venue":null,"work_id":"c36a5718-8756-4d26-b6a9-02c22a29d384","year":2018},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.151703Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:bfc45375ae416512523880ccb13abaebeac69885698f9795a8db7bb0e78e8697","observation_id":"05248c1a-a765-48b7-9dca-1a615088ca80","resolution":{"observed_at":"2026-08-05T13:45:28.934399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:28.779910Z","title":"Algorithmic Performance- accuracy Trade-off in 3D Vision Applications using Hyper- mapper","venue":null,"work_id":"36f6af5f-17ef-415e-8b5e-0858f768f980","year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.243830Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:8adf108db790ad7f36103af285d94c14a56eb55c47bf15a8ead00924451d93ed","observation_id":"7a5ba5b7-903b-4eaf-a2cb-ce5c39fae37a","resolution":{"observed_at":"2026-08-05T13:45:28.823446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:28.663569Z","title":"ConnectX-6 Network Adapters","venue":null,"work_id":"b45998df-126b-4163-b84e-cd056f08050e","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.313833Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:9dcecbfcb225def030637860e00f9c719a8e12f5d4b6e64a4b2a67cf4da101bf","observation_id":"98907fd1-56a3-48ba-a7e3-6463c2cebfe1","resolution":{"observed_at":"2026-08-05T13:45:28.719366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:28.531418Z","title":"DOCA Documentation","venue":null,"work_id":"ea0ee35c-d585-4c25-b616-0a1a0715efc1","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.398282Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:92664040350317ad0fb83e3d34a10ee5a786192243b3359bb081843bacd877ef","observation_id":"a9c1de6a-b9a1-4209-a2b0-74f5c7c96177","resolution":{"observed_at":"2026-08-05T13:45:28.612437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:28.183730Z","title":"Nvidia BlueField Data Processing Units","venue":null,"work_id":"48cb2075-b979-4ce7-8e4c-151deee21ae1","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.463800Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:d8ec3fed21937e802b62cea1ee20a5768ef07bac85a4c2982653ec85c544ba95","observation_id":"40fc3a25-8286-4dc2-9451-ca28e57bdc90","resolution":{"observed_at":"2026-08-05T13:45:28.374338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.975940Z","title":"NVIDIA Spectrum-X: Ethernet Networking Platform for AI","venue":null,"work_id":"c759d774-a83f-4f65-ab0b-3a81d08c2e76","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.554337Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:bb165d1d7da8a0ceedf942c39f5b8d7b72f1db2175e9e0d41a9fc3e8ebd45ca1","observation_id":"4f7e175a-6c3c-4af9-8959-985f4f7352fd","resolution":{"observed_at":"2026-08-05T13:45:28.033527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.834490Z","title":null,"venue":null,"work_id":"cc3c82c5-866d-4f82-8ce9-cf082d57a1a4","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.626642Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:aa75292b4e096d4a33319df76f81aca1ed5257067f5d514f727569c6d89da733","observation_id":"514f7972-2fd1-4799-b9a7-d8d46c908cf0","resolution":{"observed_at":"2026-08-05T13:45:27.893249Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.678430Z","title":"Scikit-learn: Machine learning in Python","venue":null,"work_id":"c9724307-b323-449e-86b7-edb06d00e67d","year":2011},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.670380Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:1165d1619c24f5698037a68dd4d4e49b2125e0a4e7b9a44126c9cf6d00a37a83","observation_id":"9be831dc-268a-4808-9135-f8b5463468c0","resolution":{"observed_at":"2026-08-05T13:45:27.765428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.583460Z","title":null,"venue":null,"work_id":"f6d864a7-795b-4cba-bccc-9970e0c812e6","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.744699Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:addfb5447066f4a59a9447ae1ce8dbbbdb9bea5faee9d40492c5f118cf5c2b9a","observation_id":"d0a50a44-2eaa-44bf-a1cb-0703bf507742","resolution":{"observed_at":"2026-08-05T13:45:27.640731Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.441627Z","title":null,"venue":null,"work_id":"3f67c448-8207-4c61-b4a9-b79443505488","year":2015},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.830754Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:27192bcf1516ccfbae0b6967b4fbca8879449e180b945479a86a0a41a1b6011a","observation_id":"d4e03497-10c5-426b-829a-d2d0d6973517","resolution":{"observed_at":"2026-08-05T13:45:27.485303Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.279481Z","title":"Elastic RSS: Co-Scheduling Packets and Cores Using Programmable NICs","venue":null,"work_id":"aafb05f3-8b4f-4c1a-bf41-5b6c87a045af","year":2019},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:19.907983Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:8774cd4748490fd7d433e1df2dc7ee06b7fffe8880c21ac98f8e4cae1e0134a8","observation_id":"84e876dd-1ef8-4b05-9252-d3782d8dfc31","resolution":{"observed_at":"2026-08-05T13:45:27.357372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.103494Z","title":"The case for an intermediate representation for programmable data planes","venue":null,"work_id":"5ceff644-87d5-44ac-910e-ff94714cf399","year":2015},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.047613Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:4df50fc40ab8081d0b93642a21f9ad7e00bb850e9613ad48753ae014d2e82dc9","observation_id":"82e2a517-9082-4590-b13b-dec04df60ee8","resolution":{"observed_at":"2026-08-05T13:45:27.203207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:27.007434Z","title":"Query planning for robust and scalable hybrid network telemetry systems","venue":null,"work_id":"4e317d0c-7469-4d44-bcdc-84649508133d","year":2024},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.166244Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:233da4eb8dc5767fe90070cc6d18398a206d0219b0ac33a06e17641fcecfe870","observation_id":"d23be946-2366-4ad7-b7b6-68ad4c3e9666","resolution":{"observed_at":"2026-08-05T13:45:27.061473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:26.848221Z","title":"Exploring Hyperparameter Usage and Tuning in Machine Learning Re- search","venue":null,"work_id":"bc68d20f-7b9e-4819-a7c7-661bfffd43e4","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.293409Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:012d2022e1b7586304e681d2522cf2fec57cb86f4161c2c4754e2cf2a90b07af","observation_id":"abf60c31-84e1-47f0-99ad-48c12873d829","resolution":{"observed_at":"2026-08-05T13:45:26.920523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:26.724000Z","title":"Re-architecting Traffic Analysis with Neural Network Interface Cards","venue":null,"work_id":"d854a0b6-2e39-46bb-9ab8-ed29327280e8","year":2022},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.382155Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:aa500dd0f6b0b6162084ded71bf8c93fb22ecbd8ba0250b0bbe7222600b8e440","observation_id":"c09589b8-7830-4fcf-8bd1-8ba7c4f4075d","resolution":{"observed_at":"2026-08-05T13:45:26.749518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:26.545882Z","title":"Taurus: A Data Plane Architecture for Per-Packet ML","venue":null,"work_id":"b93a4423-0bac-4b0c-9bd0-aefa29cdb276","year":2022},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.451488Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:27ad3373d1db459db3f3901eec61c550b432faebe81c6903361a1cd9d867d282","observation_id":"b942314a-cae7-4e09-96bf-890e8dfff44d","resolution":{"observed_at":"2026-08-05T13:45:26.636939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:26.333933Z","title":"Homunculus: Auto-Generating Ef- ficient Data-Plane ML Pipelines for Datacenter Networks","venue":null,"work_id":"0a04d514-04f4-4e39-baa9-4414bddc4003","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.554337Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:56d9cf7600a0bdc220865ce7169d9a7a2f8da4db4778e4de97fd9f3c72682fb8","observation_id":"da7010ac-5166-44a0-aaf8-2f15c0077484","resolution":{"observed_at":"2026-08-05T13:45:26.445323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:26.027869Z","title":"Tensorflow","venue":null,"work_id":"6671068e-5533-43dd-b428-1e9369427179","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.655981Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:5e83dfec88dc11322c20c01c28f652c95c38925ccbeabc67151e40744b3d5451","observation_id":"2d928422-0bfd-49d2-8592-eeb83889e34b","resolution":{"observed_at":"2026-08-05T13:45:26.149665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:25.816047Z","title":"Malware traffic classification using convo- lutional neural network for representation learning","venue":null,"work_id":"f9fe0e7c-1280-43ce-83e4-eab719508b51","year":2017},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.733084Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:0445060d175bffa6a509f72098ca64580f59f183a5b864fe6bd0d8297ef6d845","observation_id":"d8c862b8-c7cd-498c-b190-9f82f0681430","resolution":{"observed_at":"2026-08-05T13:45:25.862689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:25.712948Z","title":"xNIDS: Explaining Deep Learning-based Network Intrusion Detection Systems for Active Intrusion Responses","venue":null,"work_id":"4239a0d7-a1c1-4dd7-965f-b1947dd7d727","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.823352Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:c63396dc2737e384cf5b069bf87375da5c1d85b78d6331c72abf27b6f707b699","observation_id":"6f698f23-b943-4d39-9a10-c467554e7e38","resolution":{"observed_at":"2026-08-05T13:45:25.765123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:25.599388Z","title":"Bayesian Optimization","venue":null,"work_id":"26ccc25d-450b-4578-b9be-e5faeac71bf0","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:20.928027Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:2a86e4a5deca1663d30d85605510851945cccd3be6e697622b3ebbbd3df8c276","observation_id":"d30a3bb7-c8b2-458e-9d65-bf542ec79cdd","resolution":{"observed_at":"2026-08-05T13:45:25.662325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:25.387752Z","title":"TCP ex machina: Computer-generated Congestion Control","venue":null,"work_id":"40263c9a-20b9-4d6c-bde6-8daa7a9a9fd3","year":2013},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.021679Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:b12619cfc69a81d8236a7d28ca20b56f1534ba6b83ab46111f1980b87106911e","observation_id":"f99a18e4-c995-4ec1-83df-63ffb336f878","resolution":{"observed_at":"2026-08-05T13:45:25.469326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:25.195051Z","title":"A GPU-accelerated network traf- fic monitoring and analysis system","venue":null,"work_id":"8735127f-a7b5-451e-b490-f1c142867d37","year":2013},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.123041Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:5e2a7f57f0937f074a81571a9e223b9811b79cc096310eac22fc99452eb4bbf5","observation_id":"d07ce629-9a4b-455a-8d82-0e27e9d7e768","resolution":{"observed_at":"2026-08-05T13:45:25.292798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:24.897834Z","title":"Mousika: Enable General In-Network Intel- ligence in Programmable Switches by Knowledge Distillation","venue":null,"work_id":"4c8b67ad-7349-4eef-8663-edee6a154e1a","year":2022},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.232594Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:3b5ba436c79731609e1c72028847f27ca4e17ec74067cb5e3c8e934460cfb8d2","observation_id":"55254f05-b1a4-4fbf-a4e4-030a5e043c9c","resolution":{"observed_at":"2026-08-05T13:45:25.049125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:24.582935Z","title":"Rosetta: Enabling Robust TLS Encrypted Traffic Classification in Diverse Net- work Environments with TCP-Aware Traffic Augmentation","venue":null,"work_id":"fb8a320b-7300-4e95-8bbd-5d45c3138222","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.320640Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:e7514630a27c6304960f2d8cb48323a8b43c2a31f027c61a3427151618fdc259","observation_id":"789c6f2a-7269-483b-9e89-681ee183363e","resolution":{"observed_at":"2026-08-05T13:45:24.744171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:24.304391Z","title":"Alveo SN1000 SmartNICs","venue":null,"work_id":"4325bdd1-e1c7-4bdd-8744-37cede3e661a","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.414824Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:d0e03fcbb6f6fb46602385236f315e2a0d337951165684e13e3f86a04d90a250","observation_id":"431cbf71-b0af-4edb-8c67-11accd4349bc","resolution":{"observed_at":"2026-08-05T13:45:24.413963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:24.148576Z","title":"Alveo U250 Data Center Accelerator Card","venue":null,"work_id":"ffbfb2da-f36c-40ed-8945-b3d1b67c947c","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.502939Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:25fe5c1703861ac8fcdd6203eaae509b4596458cd8fe6ce2ad4c596b2c5037c4","observation_id":"968cf07c-4fea-4950-baa3-d4bec2164def","resolution":{"observed_at":"2026-08-05T13:45:24.221561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:23.986992Z","title":"Do Switches Dream of Machine Learning? Toward In-Network Classification","venue":null,"work_id":"aa97c15a-236b-4832-9095-743fb877978b","year":2019},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.570990Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:7ae1fb28a2a65dfc79bb4d5fca089f5c0c2b53ce4ffaa15fe854a91c1d4a932a","observation_id":"04093fc1-d0b6-4150-9abc-9d690cf2a8af","resolution":{"observed_at":"2026-08-05T13:45:24.042193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:23.840385Z","title":"X2 Programmable Ethernet Switch","venue":null,"work_id":"8eeb10d5-3dcb-43e4-82e1-41a31e65b95b","year":2025},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.648145Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:c2c792eca18dd5b0b4e1ac5d90fa03800d045a991b2c770a0e52cbacb4a30228","observation_id":"bbf77c45-b561-4618-93c8-14b7e6a12eb3","resolution":{"observed_at":"2026-08-05T13:45:23.923411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:23.683430Z","title":"Yan, Hudson Ayers, Chenzhi Zhu, Sadjad Fouladi, James Hong, Keyi Zhang, Philip Levis, and Keith Winstein","venue":null,"work_id":"53dd5e43-a8df-44a5-bfca-7de6543fb238","year":2020},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.725718Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:1912f3fd7c2a5785b73bd199f2621465cb1beeeac7c42bf2612cdda4ef8561d6","observation_id":"133521e3-3ee9-4ec1-b80e-8cdcac38cd80","resolution":{"observed_at":"2026-08-05T13:45:23.742085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:23.493865Z","title":"Pantheon: The Training Ground for Internet Congestion-Control Research","venue":null,"work_id":"e319f42b-153b-4231-bc23-17aa1b743ddf","year":2018},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.799138Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:ae4da59e8c52caae45add851db5eeb5c680142be54eeb93c995e12ae1570d7fb","observation_id":"ef6795ee-84c0-43aa-9674-d033837aded4","resolution":{"observed_at":"2026-08-05T13:45:23.581985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:23.368848Z","title":"Brain-on-switch: towards advanced intelligent network data plane via NN-driven traffic analysis at line-speed","venue":null,"work_id":"6ab09c47-a888-47fa-8c54-ddb2413c46ea","year":2024},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.870854Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:1b5a8867cecc0ac6334a74ed17442ef8e44fd9ddbe211f95ee791a352291f3cb","observation_id":"f76b5e96-186a-48e9-a369-040175af36e5","resolution":{"observed_at":"2026-08-05T13:45:23.418855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:23.199523Z","title":"Planter: Rapid prototyping of in-network machine learning inference","venue":null,"work_id":"c4db3663-35e0-43c0-9394-307b8502958b","year":2024},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:21.956057Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:c04c889efdef118576830e444b5a7a757267b7edc9ce952bcb5d5d7ab5d2537b","observation_id":"156998ce-7612-4db1-a24b-6955e5f1ac8f","resolution":{"observed_at":"2026-08-05T13:45:23.282629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:45:23.075439Z","title":"An Efficient Design of Intelligent Network Data Plane","venue":null,"work_id":"775a33f4-8347-4f6a-b8aa-a89d2a343f56","year":2023},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:22.027286Z"},"links":{"citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:a7d2732c1a780f754dfa463b0f84b015edaf80d154f010f8336f8255a9e868cf","observation_id":"da5e728f-7137-4b8a-a110-d60b50863a3f","resolution":{"observed_at":"2026-08-05T13:45:23.119357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate"},"reference_resolution":{"displayed":85,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":5,"verified_fuzzy":68},"total_outbound_references":85},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 0 inbound Pith citation observations for arXiv:2509.00397."}