{"as_of":"2026-08-12T17:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fff8d02db92222d22c1ca23f3582f55541a89ee141c2cc8a081641e081182615","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:37:58.615202Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T17:38:15.689117Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"1909.05680","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05680","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"pForest: In-Network Inference with Random Forests","venue":null,"work_id":"d7dfd9b8-d4f7-40fa-9eed-32b621c7d12f","year":1909},"citing_paper":{"arxiv_id":"2411.18384","last_updated":"2025-04-29T16:33:52Z","snapshot_observed_at":"2026-07-06T19:58:00.412286Z","submitted_at":"2024-11-27T14:29:53Z","title":"Optimal In-Network Distribution of Learning Functions for a Secure-by-Design Programmable Data Plane of Next-Generation Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T17:37:17.485283Z"},"links":{"cited_paper":"/paper/1909.05680","citing_paper":"/paper/2411.18384"},"observation_digest":"sha256:14e1fcfdcd1abe944dbffafcba5c1616b16377762398360b0376f30878472c98","observation_id":"08496f91-34bc-44aa-b8bc-268b090ddd24","resolution":{"observed_at":"2026-05-23T17:38:15.692873Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-11T11:37:58.615202Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.15146","last_updated":"2025-09-02T12:40:34Z","snapshot_observed_at":"2026-08-11T22:33:20.215998Z","submitted_at":"2024-12-19T18:27:12Z","title":"Cruise Control: Dynamic Model Selection for ML-Based Network Traffic Analysis","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:58.615202Z"},"links":{"cited_paper":"/paper/1909.05680","citing_paper":"/paper/2412.15146"},"observation_digest":"sha256:c8106bfa1dc17d2b627da8849abbcedd290b5377d96287a82cacdda978641879","observation_id":"12088b28-59c4-474f-8c7f-4594c31aedcc","resolution":{"observed_at":"2026-08-11T11:37:58.615202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-06T12:04:14.619982Z","title":"pforest: In-network inference with random forests","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2507.22165","last_updated":"2025-07-29T18:55:58Z","snapshot_observed_at":"2026-08-12T15:46:09.779174Z","submitted_at":"2025-07-29T18:55:58Z","title":"Programmable Data Planes for Network Security","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T12:04:14.619982Z"},"links":{"cited_paper":"/paper/1909.05680","citing_paper":"/paper/2507.22165"},"observation_digest":"sha256:f09adcd42790560e220254e7b84f1d06a75c119b54d9b92b5e5f8d7d50de0c0d","observation_id":"be352c50-b286-4dc8-bc35-3df46ece169a","resolution":{"observed_at":"2026-08-06T12:04:14.619982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05680","last_updated":"2022-09-06T21:35:11Z","snapshot_observed_at":"2026-08-12T14:05:21.935630Z","submitted_at":"2019-09-12T13:58:31Z","title":"pForest: In-Network Inference with Random Forests","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05680","snapshot_observed_at":"2026-08-05T13:45:15.647845Z","title":"pForest: In- Network Inference with Random Forests","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2509.00397","last_updated":"2025-08-30T07:30:12Z","snapshot_observed_at":"2026-08-11T16:44:44.933375Z","submitted_at":"2025-08-30T07:30:12Z","title":"SpliDT: Partitioned Decision Trees for Scalable Stateful Inference at Line Rate","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:45:15.647845Z"},"links":{"cited_paper":"/paper/1909.05680","citing_paper":"/paper/2509.00397"},"observation_digest":"sha256:7272fb5a9717e182b681b2113951a913f51631e79db83adb4ae7225a3ed76a33","observation_id":"05d2fe06-b58d-4a5f-9a3a-59e4d0177cc2","resolution":{"observed_at":"2026-08-05T13:45:15.647845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"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-01T23:07:04.781343Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16348","last_updated":"2026-07-17T00:35:52Z","snapshot_observed_at":"2026-08-12T13:05:15.208033Z","submitted_at":"2026-07-17T00:35:52Z","title":"Boundary-Seeking GAN-Augmented TabTransformer for Adversarially Robust Intrusion Detection","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T23:07:04.781343Z"},"links":{"cited_paper":"/paper/1909.05680","citing_paper":"/paper/2607.16348"},"observation_digest":"sha256:b809f01f69e48d44dbf90650438cfdeb2e0d149debc888ed5d5844f4bd22fb8d","observation_id":"dec2f920-29c3-481d-813b-c7d594cf3036","resolution":{"observed_at":"2026-08-01T23:07:04.781343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-03T09:36:54.206157Z","title":"pfor- est: In-network inference with random forests.arXiv preprint arXiv:1909.05680, 2019","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2607.29306","last_updated":"2026-07-31T11:27:29Z","snapshot_observed_at":"2026-08-11T16:44:42.383172Z","submitted_at":"2026-07-31T11:27:29Z","title":"RIGEL: Real-time Optical Anomaly Diagnosis with Stateful In-Network Inference based on Distributed On-switch GNNs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:54.206157Z"},"links":{"cited_paper":"/paper/1909.05680","citing_paper":"/paper/2607.29306"},"observation_digest":"sha256:11205cb78511508024481bd043f42f21a00ca6606363eb916dcf9b8eb1d9b26b","observation_id":"5bda1fbd-177b-4c3f-900c-2be95182b0c1","resolution":{"observed_at":"2026-08-03T09:36:54.206157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1909.05680/citation-record","integrity":"/paper/1909.05680/integrity","json":"/paper/1909.05680/citation-record.json","paper":"/paper/1909.05680"},"outbound":[],"paper":{"arxiv_id":"1909.05680","last_updated":"2022-09-06T21:35:11Z","latest_version":2,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-12T14:05:21.935630Z","submitted_at":"2019-09-12T13:58:31Z","title":"pForest: In-Network Inference with Random Forests"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1909.05680."}