{"as_of":"2026-08-18T04:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7254b5f3930d9222488d7abc5701202cb6525f792e8a232c1a5e8f40dfe785be","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-17T06:30:58.91139+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-15T20:50:06.919785Z","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:3c4ee470a51bc751b80b25527be2d1efbbd3803a42bf5d7bd38b7efdeb27764b","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-15T20:50:06.919785Z","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:dcfae5fd2f45c16bef3d0f30effeb9863b12972f845ad5cb1ea19df7d2be4ecf","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-15T20:50:06.919785Z","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:7accaaf6dc5a0878581179264bf50a02930f3504b07a4335c8404821cb27a9f4","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-15T20:50:06.919785Z","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:eec028826a415ee72fd02825fd803dafd0f9ce3fb0fefe18a5acabc8e09dd909","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-15T20:50:06.919785Z","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:ce968245916a0930c3bb12ef5485d775e1f35aff4504461b1f4ab333333d0fb2","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-15T20:50:06.919785Z","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:af266e1c1d4d200183981ece79fc64e50bb1af593106aea321e1af7a336330b7","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:60c6ad5683457855b6ea4c0da4b5c85020fea8be5df27bd0517802fd5e62ebdb","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:07be3d566bf1f063d20e7717ce61d9154f5b3dffe06b48f0f93011ffbd3ad2d4","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:8e4a1bb2f26e66d1315d6b9deb2a55068807e8670784819de79532979c65630e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:d837e397965aca086d6a7b5cebd0c2bd978d831c427475447358ac7ad7bd7d75","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:b9fe42f5e20a12d8ff6c62aabe59a4613430efa6720f1bb7f4ad9aced3ac819c","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:1b728cfee475940b1dd3dc53c01365c3bf3386c01fceebd237007fc496d0cf6b","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-15T20:50:06.919785Z","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:71a8e8613369d471ed8aaed31983e74d21c55e78f50286bbec27c359b627dfa9","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:1ea73e03b5febbda7673eec7595144111039e57f28171001e574ba319aab09db","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:f276b677c23c1842e3e39ca0f8c7121f23d14f05334a042a9917402cfc7de525","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:3bb6a42d50f8e336737e35fa7577eb1b0db9bf39f0ab63dabe40fab4f5902e99","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:24c2fb6db7b3a796fe4ac0d6085db5ea9332ac58d434d6b8393a93ce65f79c70","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:79a60f8ebc5db87b0a10ee72feec67d36554b21bfbefe2aa69cd8a792679dcd1","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:e161171480648f65e432a9c70977aebbf134687c997ca34234a7e7e7c9896427","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:82ea0656b88b991b7d36728a60411a0570f7577b0b0f2199c44dde3fffe067ba","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:5412a428ef8821432419fe64e0266259290a5a1e0f5c58b5c9487b3855752fcd","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:abe46b8c1b2e39f61f6cea2b7c8c3e2140d636f6cf12911883df935f5681cd9e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:6025c6c20c501a703a3073f4bcb94d82ee75973ea2860035c523d7d28744bbef","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:71140719679d6ffa005bb427fd99156c5436086659649ac18c7ba5b29cd2d577","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:572beb0f2346061659d55e438b0af10a21e6ca447ddc7ea2f13339baa18f6014","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:2aa469a53e5f1f8f81b9d5f4f13b1fd56b7c276ca3d62218a7c79f66c59cbaae","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:8f0c8f76de5d2a51a5511477356405f89a59605748d10fe12b6a7b75fa8fba4f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:13bfb0e538d3c359185ae8b9126fef7881ddc3691249cb5c5e25ef95947c2810","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:a027221d961ade0a833555e1cd331944478a8208a4fb0e9905d777ded43fb9ec","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:1ce772aad6567836264634df8746a0b08c824f85e94c8a8dbb106ca39a2e346b","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:8e95e2e1dcf28868787a9d5abfa1d9e5453efc931a759a02ef0c5cf858bc9034","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:f4cb649104d86731737bedf1694af57b39d788040bc0cc99af002661ffb779e7","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:bf26bbaab0c6466f9d5062126c663514f10c5c085e0380c723b9a2e45252ad31","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:fbf1eac1bbe8d65c730bf56fe97f9e7b87f5d4701fdd35ff5dec9169589c46cb","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-15T20:49:19.703891Z","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-15T20:50:06.919785Z","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:0e496fd1d2e6ab4790c82a5157809257083e0552c7e8705dee018cb36f84117e","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-15T20:50:06.919785Z","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:f808d1598ed2acaa7313f2082f85fc1a93751f91c3acad6e114d540ec37579dc","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:f8ef10412d6528f6a547e5e384727ff4543f7b2256f6c867306f5451dfff32fb","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:a997610e92bca9c7a8ffae384b0507971ecbaeed6bbe8c9c0df083eb1d0fe42f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:32ca61188f4dabfa93c6a7eaec24460e3e388e1fb850db8d76be606dc5a8207d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:d15cd001612c28b740750c705da9170cdd1bb63187dd10c1de5b5043bc46775a","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:37d5f512799cc174ad4224139e31dd5b8c453e53b938ae254e85eeecab0cf2ba","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:c30831178eaac825a23d2cf2d8783c380d11b27b97cba6c238832c4ca1e70532","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:59df73291f00f7939033a1234b245be64ef6800a3f03176b9a55857f14572d80","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T15:53:23.691640Z","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-15T20:50:06.919785Z","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:841b94b7563621a29ffe28d526423bd744eed412e66f71d0125ac3c8046a6972","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-14T20:14:55.259031Z","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-15T20:50:06.919785Z","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:7c012d5918ac2a54837d5bc8069a19a819b91d95d0b577f8f888507fa6fb9648","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:de4f176ae2b61cc081e1cd5591f6df3c33f104f7111d98e75b981695a0518059","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:a7aba0b8ea52f05c0fcc856ced7f49f7c5e148525a810a77e752cc98d85b2d24","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:305ef00a47afbb6d2500e5b43c0246bf54ee9745a5af584a4ef3ab1c44f3c0f0","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:f5fcfdb68aec5677e38b5d5ca3136714855005df3ccd1ff8d3ea45a9e50a8755","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T14:21:09.555417Z","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-15T20:50:06.919785Z","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:c35a02d9372bdbbe615ab4d309ce81a983600472a1168b6c8a0db60350217881","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:95587bf5d81ddf73b2e990f30707ce16355e1a1e575590c31c9490e32cf2af88","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:d833e97f9e147646cb0e251c359f6525d4d26575bcdbdbcddd7cfeb7f0097cd8","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:d249330505b9568935f83004eaa2cfe8c152d0d0c9028b53a26972a41d1d34c4","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:281cbb8b80a38bd41c2869b75fb9b7ac3baef090bab184c6c60a8f9ef9d2849b","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:033714e10ba8feddac9b1e72b3cf7fd06d9c3959893721156b39f684668065fb","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:92d2c80768c7d3cf169df81d4d3383a7dc63f4cdffeed070da8df0c734349b90","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:7eb01fb42ab4d069a2f96f0379899524ed5947582e3a613ab6f8ff74809abca6","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:b0dfca866d9a1c421813b154de6f4ae3dc6866348fdf2166da425bfaeb12a925","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:bc9a95ed2f55f877c842fa5c8fe791606b92db464490173594e167e4d60ab4ac","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:b37fdddef35ae20c4e90cb343f9275dc203f607af7fb08329bd7d2f32869f9ca","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:ffd256de14c599da0d3cd2404ed983343c3947e6f886e491fc8a34ac3c539ec4","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:7ccffe5dbc507a24bc61fceac1e0c1d7ece83704cdfafbcbee884ceb18eaae7f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:9f1235eb172c5947744f7a5467ac150dcfc976ed988a7f8b48f87baf8e47a7e8","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:0fcd71001b2d4a5719012699b3249a93ea981e7f19871a55139302b90f49bce3","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:8db6e583b4c9dc59044153f131fdd2d1a6e88d80d272461f1cbf0fe43dafc7d3","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:ea0a7663dbff4e0e0995be866b78e490dc0af963cd2138c62778896c49181cff","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:e016282a40615172e00902e12d18ddd5748d72b7250387e1915ae2998059aec6","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:9268a8ff6bfb1dd100471b65f12958979e0f11bcd05275c50737012045acf65d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:3e1587cde415ffd3426a3be6e071a38f5dd77ecf1c57d26b738a4a611afe2e36","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:4631b21ab7fabc48b87d11739c1f1c0ee82370849ca8304b9921bb3b7968aca9","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:e3475ef6464aea64b99802b81acae6d77304cb4b7709c874c9464bffc9f1a806","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:7d2389442d6fe11bd533f1db0d093a553e93d95ba222a6c7018639fcfe5c5e32","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:e8615cb3ae461fce8012d85ae05b2ac2473d337d810ae2a82376b4ea1ceee98d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:af55f7e4831b1299e8eb60c5f7e2254024d180daaabb6d7d17b73c6a1bf8eb60","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:cfd2ed138586ac0af31c62766a3f60bb558605df7a2427c655286c7c219ee849","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:a0951bec9d84dd4130d142958fc0469e36cddd869f44769d5e87f7549b7ed0b5","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:90d75554bf181ae76b67ba4f8e267d5a1a9ee775d447086cba0abd3753165ec0","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:a89a2f4bde6c1ad95b9f15d4431c924ebd0afce9feee3df56e70c8653c973bec","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:4adffe0e69a9401030feb6a4253358042a0a69d6c45c0ff3b194447eb92d3b6e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:fd347b286eed820e8710198a67ab74d7e038da83d2b4db9d9a3d1233daf8a04c","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:be2a924a1d038af46a576e53f8a4675d3b14d55c6a87ace89f54afb296082a3c","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:221b948e7668e69779beeb81e121383bce7d5434ba58f9d7f0b51ee1ce998967","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:29c477b20701f83ab41768e477576cbbf841374a0f6cc766d0b5f4b266c1b76f","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:d53147ad9766eb90158a7d56befa955a3fb32de47a1038418bc7d982ec688592","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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:e4e0cc99ed1104332f90126bfcd41eb5d25222e8b503a1eea71049723b1f2bfc","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T20:50:06.919785Z","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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 0 inbound Pith citation observations for arXiv:2509.00397."}