{"as_of":"2026-08-17T00:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2f54455d07dda13e885c7e50efaca48cc4726e1a4390d8d8028c8a3669513d4","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:17:26.830951Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01503/citation-record","integrity":"/paper/1908.01503/integrity","json":"/paper/1908.01503/citation-record.json","paper":"/paper/1908.01503"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:17:27.113300Z","title":"Cyber physical systems: Design challenges,","venue":null,"work_id":"264452ca-11f5-4d69-b455-ee39588e3554","year":2008},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.752051Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:4df2c0f415b8b6fe4feba8a2af39bca6b33b4f1ce0e9c8b0331e15143f0d5c12","observation_id":"cc2b0135-93e4-4899-9309-f79461390d18","resolution":{"observed_at":"2026-08-14T15:17:27.118644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:27.096243Z","title":"Real-time status: How often should one update?","venue":null,"work_id":"7dc33a7b-d879-45f4-8715-767257795b01","year":2012},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.758245Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:9274ce8cbc972f66e157371968088ff2690418f3819b835abad6f45cf90426bb","observation_id":"e703622a-f1cc-4368-b012-bf454cccd0e3","resolution":{"observed_at":"2026-08-14T15:17:27.101770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:27.079308Z","title":"Status updates through queues,","venue":null,"work_id":"ed6a1418-4d95-41b1-8b45-ac7fce22a72b","year":2012},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.763523Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:4d4ac67083296782ecc28e3157392d251f0d6f0172d10789c78cbfe502a1b8a2","observation_id":"ed6eab79-3da6-494f-a53b-4965982ed186","resolution":{"observed_at":"2026-08-14T15:17:27.084660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:27.063096Z","title":"Age of information with packet management,","venue":null,"work_id":"84602c25-ffbe-4361-81bc-c3d66b288b31","year":2014},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.768819Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:387c07e0c6193d9ba0ffce4669985b36b8ce7f1c0578661e39fb268b219d3fe3","observation_id":"84707d14-4d36-4ae8-a193-45a1332f4ca3","resolution":{"observed_at":"2026-08-14T15:17:27.068170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:27.046853Z","title":"Optimizing age-of-information in a multi- class queueing system,","venue":null,"work_id":"4d42da42-f3bf-4f35-a0dd-77e47961feb6","year":2015},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.773733Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:c3467a77ea7a4c4ecc51a91a891e9dd57299a34ce474d30692f1dbda430af3a4","observation_id":"0d743861-eb91-4880-8842-b82fb292acc8","resolution":{"observed_at":"2026-08-14T15:17:27.051812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:17:26.779313Z","title":"Update or wait: How to keep your data fresh,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.779313Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:277522c40024427378cc2e9757d6ea10227984c9ce56d4f658e15d42bc55f1ac","observation_id":"bc6e4e5b-9fe4-4e12-beda-3384a47f36cf","resolution":{"observed_at":"2026-08-14T15:17:26.779313Z","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-14T15:17:27.017914Z","title":"Age-optimal information updates in multihop networks,","venue":null,"work_id":"867c430a-ceac-45a8-a87e-52c33b7c0d07","year":2017},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.785499Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:275123df416286151ccdfebe4cd8cd9bcbdf7a9c784f7797bac63aeff6805f61","observation_id":"ff027bd0-4dbb-4c27-852e-ebb3d24589a9","resolution":{"observed_at":"2026-08-14T15:17:27.023180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.999323Z","title":"Minimizing age-of-information in multi-hop wireless networks,","venue":null,"work_id":"37a02951-3eb0-421a-860c-37d224dbb306","year":2017},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.790463Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:c34cf76f30c7950ded34166c4a51eb9145417929bdef4c09e098b6781acd4369","observation_id":"7d9a30ff-035d-4ff3-b55f-a5644938bc41","resolution":{"observed_at":"2026-08-14T15:17:27.004722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.983477Z","title":"Minimizing the age of information in broadcast wireless networks,","venue":null,"work_id":"4e579093-d140-4516-9a77-74254c7208d5","year":2016},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.795391Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:4454fc1ac11193c6b00379b12a5c2c6e1f85164a84a3c2c3fefd0d8975f16129","observation_id":"8ba3f6e5-27ba-4ec9-bd5a-3c43d71c020d","resolution":{"observed_at":"2026-08-14T15:17:26.988698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.967350Z","title":"Age of information: Design and analysis of optimal scheduling algorithms,","venue":null,"work_id":"e6c490d7-c7a7-4829-8cf4-d1e6999e58cc","year":2017},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.800780Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:6785a64fa281038f80f881c8aba112007fb89bace0804b884e7dde84193e5869","observation_id":"e6c2d81c-6b43-449f-b9e6-1de5316ab5f3","resolution":{"observed_at":"2026-08-14T15:17:26.972709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.949400Z","title":"Age and value of information: Non-linear age case,","venue":null,"work_id":"5f6cad92-6767-4923-a71b-0b4bb9c53cc1","year":2017},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.805828Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:f083b4881fac67252fd3397c5f0935c8a8b876c76476044404fef693a723d6c7","observation_id":"bb48055d-dd33-46eb-b93b-0e2781f76468","resolution":{"observed_at":"2026-08-14T15:17:26.955379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.931260Z","title":"Age-of- information vs. value-of-information scheduling for cellular networked control systems,","venue":null,"work_id":"9fd329bd-553c-43d9-b5c9-c91ba6ae044f","year":2019},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.811313Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:95b25a8cb5abd9f61b9ab534f8fdfd6c22918b7f249983afb848941728453f32","observation_id":"46d92059-ff5e-41fe-8ea1-27c8e7298842","resolution":{"observed_at":"2026-08-14T15:17:26.936545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.914638Z","title":"Aoi-penalty minimization for networked control systems with packet loss,","venue":null,"work_id":"58d9a44a-2b5c-4feb-b75b-54624246d9a6","year":2019},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.816025Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:f40f363c982c1f821012a33087b45f91a8e07c470eb48990decb40e99cbf3cb5","observation_id":"577f35f5-9b3f-43df-9849-fefa8940467d","resolution":{"observed_at":"2026-08-14T15:17:26.920030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.895892Z","title":"Control-aware uplink resource allocation for cyber-physical systems in wireless networks,","venue":null,"work_id":"32bc6ebf-f198-44a0-ac31-a45ef73f9b9a","year":2017},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.821245Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:a34068983bd15786ceb8017fe61ae257fb2587beea3b1a06738ad74264759eff","observation_id":"0d95328f-7bac-46dd-8885-9554dab63ea9","resolution":{"observed_at":"2026-08-14T15:17:26.903091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.879295Z","title":null,"venue":null,"work_id":"a72ae065-84a9-437c-943c-ff49a4fe82f1","year":2017},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.826050Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:15b596fc9be3a1fb6e22a2f8cdac0e74edeecc39120df4fd3d0dd22341ca1ffa","observation_id":"d0b3be40-edfc-4c69-aa3d-b6c512185225","resolution":{"observed_at":"2026-08-14T15:17:26.884371Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:17:26.861338Z","title":null,"venue":null,"work_id":"5d9c63c7-9898-43c3-81ba-b8f1e1b4085d","year":1999},"citing_paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:17:26.830951Z"},"links":{"citing_paper":"/paper/1908.01503"},"observation_digest":"sha256:f9b622b0c5eb89ac4e35f5e717971dc06698109d62272fdab95b45dd5da06fbc","observation_id":"5326c3c5-ee2a-42bb-8d70-f7c462d5d19c","resolution":{"observed_at":"2026-08-14T15:17:26.867392Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01503","last_updated":"2019-11-22T09:48:21Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T15:08:36.956090Z","submitted_at":"2019-08-05T07:58:19Z","title":"Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":16},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:1908.01503."}