{"as_of":"2026-08-16T18:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25e2904fc1ed27077b08bae6cb8b2b5bc07783ab725420b090534f47e4755407","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:28:00.110807Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"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.01334/citation-record","integrity":"/paper/1908.01334/integrity","json":"/paper/1908.01334/citation-record.json","paper":"/paper/1908.01334"},"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:28:00.741363Z","title":"Real-time status: How often should one update?","venue":null,"work_id":"027886cc-6085-45fa-9bf6-41153ae5f5a2","year":2012},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.835972Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:dcd562226ac53284b0dbe6f5643865315f4177f7c0fc7b19943a17747f36f849","observation_id":"3d5a1cba-fae0-4657-82ee-75ff575312a6","resolution":{"observed_at":"2026-08-14T15:28:00.746577Z","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:28:00.724210Z","title":"Lazy is timely: Status updates by an energy harvesting source,","venue":null,"work_id":"702ab247-c61c-4c1b-9efd-392ac3431f26","year":2015},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.842744Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:16ecd6aabbd412da6fd2e7f0de8638b67c6da758acc6f1efc5c14765176a46da","observation_id":"c2f2df11-da31-4f23-8d39-14b2306aad14","resolution":{"observed_at":"2026-08-14T15:28:00.729717Z","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:28:00.706786Z","title":"Update or wait: How to keep your data fresh,","venue":null,"work_id":"84d7caae-e9ec-4427-8921-0535e3390d1c","year":2016},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.850829Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:46153568b5ec4123ea0126b66d6a7859ca8930f73626595b01c9759714a24143","observation_id":"a58bdb4a-5103-447a-aaba-3d760ae3dfe5","resolution":{"observed_at":"2026-08-14T15:28:00.712228Z","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:27:59.858567Z","title":"Update or wait: How to keep your data fresh,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.858567Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:8fc2632dbce9ee7f79e833aca7a12a4f3e7788be31966b27b5e58682b44d25f5","observation_id":"0b4533b5-2ded-475c-9e75-ecd753303bb9","resolution":{"observed_at":"2026-08-14T15:27:59.858567Z","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:28:00.678301Z","title":"Age-minimal online policies for energy harvesting sensors with random battery recharges,","venue":null,"work_id":"f678e2d4-abb3-4f62-80db-00d7aaa809e5","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.865164Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:9b6c62da231bdf9ec2d775783a865c301e5f67993757ffcf99f4880e5405ff30","observation_id":"a691830e-39d9-47a1-9d9d-41b8f916afa1","resolution":{"observed_at":"2026-08-14T15:28:00.683429Z","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:28:00.662665Z","title":"Optimal transmission for energy harvesting nodes under battery size and usage constraints,","venue":null,"work_id":"96fe6703-43c2-4fe6-9a09-55ca4dd4ac5e","year":2017},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.878981Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:f4a28628cdeab393358f04fff16447518867a614a09cf99df1e806ac9497c638","observation_id":"487bce75-4186-48bd-af61-91b1f40c44bb","resolution":{"observed_at":"2026-08-14T15:28:00.667528Z","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:28:00.644293Z","title":"Average age of information with hybrid arq under a resource constraint,","venue":null,"work_id":"0c16104c-d549-42a4-bdd4-ff54f3c2ba85","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.886623Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:99884ae7cd6e6a15fef98c44cd0f8ca755b674c283098d3439a0dd02f2c83fc1","observation_id":"495a9f22-064e-4be6-a564-cb6efe8b1d12","resolution":{"observed_at":"2026-08-14T15:28:00.651493Z","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:28:00.623841Z","title":"Sening infor- mation through status updates,","venue":null,"work_id":"7e8ba06e-c435-463c-98a3-6da6cca3bfc8","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.896501Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:fb169cb761ada1b32991a1e8a6046e9c49519e133633af672dea52f97951ce3a","observation_id":"94ac2de3-4070-416c-94dd-3a7abef1689a","resolution":{"observed_at":"2026-08-14T15:28:00.630858Z","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:28:00.605389Z","title":"Minimizing the age of information in broadcast wireless networks,","venue":null,"work_id":"2938863c-53b7-49e2-b5be-1b418cfaeaf8","year":2016},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.911651Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:e4537af38f2731cf6f62a3459582cc1003c2d86a1dc6e621849c567f3346d2fc","observation_id":"379a2b7f-3fa5-4b6e-a0db-570a51e0340e","resolution":{"observed_at":"2026-08-14T15:28:00.610995Z","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:28:00.587949Z","title":"Scheduling policies for minimizing age of information in broadcast wireless networks,","venue":null,"work_id":"6f7aacb1-a249-4995-94ca-874096cd2471","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.918287Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:201a59a44144bd550d8e6acc6614b96689f633604c44f35289c8020e4c78ba86","observation_id":"d84bdd2a-87ad-41a4-b556-bbe7377252f7","resolution":{"observed_at":"2026-08-14T15:28:00.593480Z","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:28:00.571717Z","title":"Minimizing age-of-information in multi-hop wireless networks,","venue":null,"work_id":"3099ffdf-d90e-43a1-85b5-c757916a2f9b","year":2017},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.924684Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:100cc42c70a6ee766d6abb9e864909bb4c3c2e757a114595a62eafc6dde12e1d","observation_id":"808863a2-5da7-400e-9791-80ee085e8374","resolution":{"observed_at":"2026-08-14T15:28:00.576779Z","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:28:00.555568Z","title":"Scheduling policies for age minimization in wireless networks with unknown channel state,","venue":null,"work_id":"b914cff1-3f74-4312-af53-68bcac0171fc","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.931307Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:e13c1b6aa8c6bc06f97b019238e82cca4f8e57b599ead80fa28bea15b43e8ec1","observation_id":"1b10b894-dd3e-4ce0-9a69-3aefe3bda842","resolution":{"observed_at":"2026-08-14T15:28:00.560931Z","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:28:00.539780Z","title":"Optimizing age of information in wireless networks with perfect channel state information,","venue":null,"work_id":"0717652a-016a-4cb7-a991-556960575e4a","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.938032Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:de9838a68e32be1ae81cf0e93cddc706c057c1e213eead51d101464805139371","observation_id":"3b222532-b6d8-47b2-8e57-49f6687dd6aa","resolution":{"observed_at":"2026-08-14T15:28:00.544718Z","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:28:00.522211Z","title":"Age of information: Design and analysis of optimal scheduling algorithms,","venue":null,"work_id":"40129fdd-c88f-4389-9265-411624b93a59","year":2017},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.949969Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:30d001e4f71c450e106897bda4d684f0d942c23936f4435dc11c9e06c7cb57a1","observation_id":"920fa3ad-0a0e-45d1-8937-cb9981b75a1b","resolution":{"observed_at":"2026-08-14T15:28:00.528199Z","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:28:00.503870Z","title":"Decen- tralized status update for age-of-information optimization in wireless multiaccess channels,","venue":null,"work_id":"9fe8a56b-a2f6-4519-adad-bb1ce593a346","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.958181Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:d19f18e4f10206f687e03da2f1725a572c7cf59230dde9aede4ad65dcbf3a0b6","observation_id":"c5d3d63f-2895-4996-8e6a-84ddeac2dd72","resolution":{"observed_at":"2026-08-14T15:28:00.510241Z","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:28:00.484350Z","title":"Age-based scheduling: Improving data freshness for wireless real-time traffic,","venue":null,"work_id":"7e3b36e6-8e41-420d-b7ca-e81ed5c9d027","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.967487Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:a0a0456ab251adca457b87df3a7521915ffb488e72c1081fed2744760ae335e2","observation_id":"70df1111-a5b2-4861-8f31-87f04324b577","resolution":{"observed_at":"2026-08-14T15:28:00.490896Z","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:28:00.465354Z","title":"Optimizing age of information in wireless networks with throughput constraints,","venue":null,"work_id":"87ac28dc-34f5-492f-b5a3-e456b6d64752","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.985553Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:deee05dbb25915b9744f65809c5e3ab46ba11bae6277c708ce9cd85ceb4b0a4a","observation_id":"22f55bf0-b190-460f-9840-1d7957d17c70","resolution":{"observed_at":"2026-08-14T15:28:00.471847Z","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:28:00.445975Z","title":"Oppor- tunistic scheduling as restless bandits,","venue":null,"work_id":"d3d518b0-75d1-42a4-a442-b9fb271229dd","year":1952},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:59.998633Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:65570477dad323feb3d96cb862f782167388b5e84fd3faa2d8c19f633d0f4f31","observation_id":"b5648662-63ef-4dcf-88ca-e0668613ef7d","resolution":{"observed_at":"2026-08-14T15:28:00.451365Z","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:28:00.428394Z","title":"Timely-throughput optimal scheduling with prediction,","venue":null,"work_id":"c70c441a-49ac-46c8-b6df-51043c34c0ad","year":2018},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.004248Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:2f0edb9bd5e6fa844f5c471441b6112a2911bbbd601d6977ef071e1c3a1d58c4","observation_id":"6e2398a3-29be-4cd4-a55f-c3ed268f4f65","resolution":{"observed_at":"2026-08-14T15:28:00.433524Z","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:28:00.409972Z","title":"On delay-power tradeoff of rate adaptive wireless communications with random arrivals,","venue":null,"work_id":"e3b51615-2d85-4d98-b716-fc4c863a9979","year":2017},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.016361Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:3996fb6cf1d315aebb3a27bd6fcdd8ea1546c9c818f9a0fd52af8e6240ae39a3","observation_id":"d28e836b-541a-45c9-b046-463bb5bdd4a4","resolution":{"observed_at":"2026-08-14T15:28:00.416580Z","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:28:00.387558Z","title":"Joint queue-aware and channel-aware delay optimal scheduling of arbitrarily bursty traffic over multi-state time-varying channels,","venue":null,"work_id":"453f5eaf-c1e1-460f-878e-8851b4898b7a","year":2019},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.021620Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:96d3454e9cd2af377343beaefa9e50d7278ab63b8a4fd00d677a2e6f90cc5358","observation_id":"2d8ef3e1-bcad-4ada-a85c-f86d84d2f95b","resolution":{"observed_at":"2026-08-14T15:28:00.394837Z","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:28:00.368006Z","title":"Delay-minimal transmission for average power constrained multi-access communications,","venue":null,"work_id":"92fe7ca5-4010-4bec-8a70-a0a1e635c4d7","year":2010},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.027981Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:69e8a5027b6701449b65cb25266ee9ebae05ccb77b986e089ea90a60532afba9","observation_id":"ed343034-e62d-4f03-b31d-9f89f4cad46c","resolution":{"observed_at":"2026-08-14T15:28:00.374089Z","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:28:00.346885Z","title":"Energy-efficient packet transmission over a wireless link,","venue":null,"work_id":"f10f53c4-ebae-4e32-87c2-e3fa98fa7958","year":2002},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.034189Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:a16cfa217a679dbc9942c89739d88b3687f31a2081099e84a5443fa0d5478b87","observation_id":"f753e7e3-8f7e-4173-b001-e4ad22dbe12b","resolution":{"observed_at":"2026-08-14T15:28:00.352490Z","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:28:00.329469Z","title":"Communication over fading channels with delay constraints,","venue":null,"work_id":"b152e6e1-f8d0-4c05-aacf-197b6f2091ce","year":2002},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.048759Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:1cc000c0d09663cad2a9edb69664aa8d1066b7b581cd146a75a2c88a6c605726","observation_id":"442a45ff-7827-4e3b-b032-2ceed32319c7","resolution":{"observed_at":"2026-08-14T15:28:00.334761Z","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:28:00.312549Z","title":"Throughput optimal decentralized schedul- ing of multihop networks with end-to-end deadline constraints: Unreli- able links,","venue":null,"work_id":"8d1c97b3-bcb6-41f2-949e-305a6db9e04d","year":2019},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.056223Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:b613307a43ec3921be24e71dcdc46e3df784033b1f190e0a2d28f484b753abbb","observation_id":"3f5a54df-e21b-4264-b535-6835d4545c67","resolution":{"observed_at":"2026-08-14T15:28:00.318461Z","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:28:00.284381Z","title":"Transmission policies for time varying channels with average delay constraints,","venue":null,"work_id":"5f87f38f-a1a9-451d-ad1e-58b1a18190f4","year":1998},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.066163Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:f5ce458f5f6d6ca1a7a520bf34a8590577161b2975c43763136ba763e224fe48","observation_id":"3bad2ec7-8664-4dfa-803d-0f1cb770e731","resolution":{"observed_at":"2026-08-14T15:28:00.293994Z","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:28:00.263115Z","title":"Age-optimal con- strained cache updating,","venue":null,"work_id":"eca0476f-1d50-45cb-83df-42c3bb583eb3","year":2017},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.074873Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:728277ab2c3df36cf9e0f60a0d58bf3de6ce67d6720b7005b4123df289dd9402","observation_id":"35fa902a-1098-4523-8099-d4da1f42459a","resolution":{"observed_at":"2026-08-14T15:28:00.269345Z","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:28:00.236894Z","title":"Altman, Constrained Markov decision processes","venue":null,"work_id":"bba76787-ec55-436c-ac35-83f15349131a","year":1999},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.082959Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:daee5d86a84eae6f05b7d9750dc27c3f61881e52f6421ba40a171d72183c8aa3","observation_id":"f682b655-a87d-47c6-bea2-5897b7aef9a2","resolution":{"observed_at":"2026-08-14T15:28:00.244394Z","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:28:00.207629Z","title":null,"venue":null,"work_id":"f8213fc2-3e79-4e09-8f20-cfc6333fec94","year":2015},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.090737Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:3cfb42bcce55d722d8b350c77d8597dabfe7737c5ee9dd7845d7a32fc7b51998","observation_id":"5202e644-c203-417c-8f61-13a3b3b97b56","resolution":{"observed_at":"2026-08-14T15:28:00.214978Z","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:28:00.180003Z","title":"Average cost optimal stationary policies in infinite state markov decision processes with unbounded costs,","venue":null,"work_id":"be88ac46-46d1-40ca-9a64-35d098043d6b","year":1989},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.100377Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:142ab39603794e703842ea3270546a365ccbdfb0c0f07455a1199492b93e1dd9","observation_id":"28d98969-0d2e-4cfc-b3e6-6f7a5845ab77","resolution":{"observed_at":"2026-08-14T15:28:00.187912Z","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:28:00.153027Z","title":"Closed form summation for classical distributions: variations on a theme of de moivre,","venue":null,"work_id":"572ae415-f36a-4e04-9f95-9b7a9f10df1f","year":1991},"citing_paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints","version":6},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:28:00.110807Z"},"links":{"citing_paper":"/paper/1908.01334"},"observation_digest":"sha256:0976e3fcf31b63569dc94741d4ce48732f0818a6defd716d3f01bb63b2da9931","observation_id":"add0f122-e330-430e-80b6-e9f0452820c5","resolution":{"observed_at":"2026-08-14T15:28:00.162506Z","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"}}],"paper":{"arxiv_id":"1908.01334","last_updated":"2019-11-26T03:51:15Z","latest_version":6,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T15:33:08.025321Z","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":31},"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 16 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:1908.01334."}