{"as_of":"2026-08-17T04:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0d2651873dfb34b8e62351b11a0f5426812f30f6031e6f7897fe02e8034b183","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:01:24.774037Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"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.06211/citation-record","integrity":"/paper/1908.06211/integrity","json":"/paper/1908.06211/citation-record.json","paper":"/paper/1908.06211"},"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-14T13:01:26.299965Z","title":"PRO: Progress-aware GPU Warp Scheduling Algorithm","venue":null,"work_id":"cfad2ebd-4540-4fd9-9167-efb84cfc741a","year":2015},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.384929Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:d9af8e7c8cd247a35ed8b02b38154161d9799152bed16f83aafe2fded32cfd01","observation_id":"e07741c8-d75d-4d2f-bbe1-46246f40ee97","resolution":{"observed_at":"2026-08-14T13:01:26.306823Z","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-14T13:01:26.280387Z","title":"On Priority Assignment in Fixed Priority Scheduling","venue":null,"work_id":"7304fe9f-1950-4fa9-89d8-c8864da81ef7","year":2001},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.391321Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:e73787f08a5357bcb0af688d009e41db4e07615fa95ca38fbd0acd9d33919877","observation_id":"a082f0ad-9463-40d3-ac43-15030467874e","resolution":{"observed_at":"2026-08-14T13:01:26.286309Z","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-14T13:01:26.260747Z","title":"Fixed-priority Scheduling of Dual-criticality Systems","venue":null,"work_id":"b02c3f6a-f8d7-42e0-898e-424cab083c6b","year":2013},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.396363Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:68c43b514c66d3d070816cc4706f1dd0aa362f035dd237ebed0da3412cd833d3","observation_id":"bf097942-b6db-4967-8bb2-b2c06c7edf3f","resolution":{"observed_at":"2026-08-14T13:01:26.267572Z","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-14T13:01:26.239367Z","title":"Scheduling Mixed-criticality Systems to Guarantee Some Service under All Non-erroneous Behaviors","venue":null,"work_id":"5f528dca-11d0-4c91-8d34-f43d81991578","year":2016},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.402652Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:e854f9b4b3717ba3e3120685d3286b72214b85c91f220a5ea82c715bfc88c738","observation_id":"4d9b7148-70e1-4057-bbb6-6f9582561806","resolution":{"observed_at":"2026-08-14T13:01:26.245891Z","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-14T13:01:26.207900Z","title":"Towards the Design of Certifiable Mixed-criticality Systems","venue":null,"work_id":"546d0ca7-d6a2-49fa-a0c0-5ba3a002cfb5","year":2010},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.411430Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:8ec05f8f1176a0bc36a28e017d72715ba131f795535206eeb6100733ada29438","observation_id":"477f347d-2155-4c94-ba5e-d7c289368de8","resolution":{"observed_at":"2026-08-14T13:01:26.220377Z","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-14T13:01:26.182005Z","title":"Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications","venue":null,"work_id":"cc10309b-f4fe-4fc8-a1c2-9d188800f09d","year":2008},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.417270Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:f364dc89b13682a145fcf570158108b91df558c264f73ffd77693f6ce9de493f","observation_id":"d0930582-1c06-4830-85e0-3ea44ef57638","resolution":{"observed_at":"2026-08-14T13:01:26.187917Z","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-14T13:01:26.153499Z","title":"Response-time Analysis for Mixed Criticality Systems","venue":null,"work_id":"1fc53cce-eca3-4f27-9633-43cb660d3e81","year":2011},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.423121Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:56a148f2d5f3458bc895a137e27d44f31bbfa75625a64df9914550cd8ebf718a","observation_id":"ff815dd6-7b6e-4e92-bade-1bffb48645be","resolution":{"observed_at":"2026-08-14T13:01:26.167850Z","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-14T13:01:26.131390Z","title":"https://www.bigbuckbunny.org, 2018","venue":null,"work_id":"d8d15a74-a4ed-4800-b9d2-db8c727c006e","year":2018},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.430804Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:f4a5a99ff2b754cd451be887f2aa609a48ab3c7b063435e2f777e822c3f2634e","observation_id":"3ba70f1c-9742-43c0-a215-eed7b32b2968","resolution":{"observed_at":"2026-08-14T13:01:26.139875Z","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-14T13:01:26.111833Z","title":"Measuring the Performance of Schedulability Tests","venue":null,"work_id":"20895458-e1cc-4ef7-b6f0-91ffd5defd53","year":2005},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.437281Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:885609e908bf9b027157fd1a1c86bb9ad14cae305953f94a0124db2a08f2d015","observation_id":"ed1bd5d9-ab6b-44d3-b511-ad1b16047030","resolution":{"observed_at":"2026-08-14T13:01:26.117681Z","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-14T13:01:26.087761Z","title":"Scheduling and Locking in Multiprocessor Real-time Operating Systems","venue":null,"work_id":"eae39e0a-642b-4dbb-8d62-ebaf9fc42817","year":2011},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.443320Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:da6cb8227069ece4c777b279f96d7290b8d2e773196237f4fb5166f2207cac4e","observation_id":"f4bd35d0-0ae0-4aa6-99c0-778371813ef5","resolution":{"observed_at":"2026-08-14T13:01:26.093742Z","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-14T13:01:26.064739Z","title":"Towards a more practical model for mixed criticality systems","venue":null,"work_id":"cc471177-5b4b-4dd8-bdaa-080c8d4fcdcf","year":2013},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.449579Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:c37decdd677f8cee91897cd3be32402cfea25350d18acba7767587cf5fa7a7f6","observation_id":"fae10d3e-8955-4235-8e84-3723fac9a315","resolution":{"observed_at":"2026-08-14T13:01:26.073171Z","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-14T13:01:24.457880Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.457880Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:138ca869f63689744d303322be06c45d5ab0b1151681dd98c676a463b6b054bd","observation_id":"8ff31b78-7712-448e-b45c-6fe22278b03d","resolution":{"observed_at":"2026-08-14T13:01:24.457880Z","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-14T13:01:26.047287Z","title":"Combinatorial Test Techniques: Table-based Automation, Test Generation and Code Coverage","venue":null,"work_id":"d3b3e7f9-7d66-4e7d-b2da-b272e83c7cd5","year":1998},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.465391Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:89a8f8dc254c8ff2ccaa2f85cfbc9e02e3c98f2be52b454a587ba3317da16b86","observation_id":"4a8a4c5f-947d-4502-bc66-2d4784cb8be0","resolution":{"observed_at":"2026-08-14T13:01:26.052756Z","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-14T13:01:26.030294Z","title":"LITMUS RT : A Testbed for Empirically Comparing Real-time Multiprocessor Schedulers","venue":null,"work_id":"736f8458-265d-4d4a-8ed3-260ce2a280af","year":2006},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.472179Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:6aceb3a72efc505be4e120e688e18ff19b92377be5df012bccff2bd3d2d918ab","observation_id":"d95f8df5-49f5-4db9-a9b2-6a116dcc2152","resolution":{"observed_at":"2026-08-14T13:01:26.035508Z","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-14T13:01:26.007436Z","title":"On the Scheduling of Mixed-criticality Real-time Task Sets","venue":null,"work_id":"f3b22382-547c-4959-a57f-a8780141137c","year":2009},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.479344Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:ecbc3814d095d07207ed77cb62f755c9a1e77e2942d0174fdfeb55cc049bf248","observation_id":"cd06cec7-b1ff-4f9a-9f61-c21a631540e6","resolution":{"observed_at":"2026-08-14T13:01:26.013928Z","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-14T13:01:25.982292Z","title":"dlib: Video Tracking","venue":null,"work_id":"72981c6a-5e28-4197-9661-92b26fa1297c","year":2019},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.486972Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:c1e9b85652b350381972b67c4aefc0975aeb2f077641ded70c9a1ed23e080008","observation_id":"310b8d82-0e53-4887-ab1a-1729cda22208","resolution":{"observed_at":"2026-08-14T13:01:25.988830Z","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-14T13:01:25.961958Z","title":"Per-thread Cycle Accounting in SMT Processors","venue":null,"work_id":"6b2c6074-699d-4c1e-95f5-88c08dc05883","year":2009},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.493324Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:f746ee141204506a12f7592dac6eab78d53cd10d3dd0b832c950c7ce8bb49692","observation_id":"14389a8d-0c12-4d9d-9397-2ec9063bf39e","resolution":{"observed_at":"2026-08-14T13:01:25.968134Z","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-14T13:01:25.941005Z","title":"Addressing Fairness in SMT Multicores with a Progress-aware Scheduler","venue":null,"work_id":"772e6cb0-a6c7-4a34-ab33-30faf2f64201","year":2015},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.499193Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:f9d61bee4fb81b86e2b3869fbe2d962f6475b931372b6cadef1f1210717fc3aa","observation_id":"73d521aa-3358-4eed-8ba7-a4f5c565436c","resolution":{"observed_at":"2026-08-14T13:01:25.947989Z","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-14T13:01:25.913203Z","title":"Perf&Fair: A Progress-aware Scheduler to Enhance Performance and Fairness in SMT Multicores","venue":null,"work_id":"a71f5233-a074-4264-84a1-2064c136ee75","year":2017},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.506699Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:386e59fa8751c8bde48d19dd791bc6a92b6e8d65ef82ae2321605fd967496a6a","observation_id":"2ad84006-a3ac-4fe1-8d57-f2c7d0a7d9ba","resolution":{"observed_at":"2026-08-14T13:01:25.923381Z","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-14T13:01:25.891650Z","title":"https://www.ffmpeg.org/, 2019","venue":null,"work_id":"3f646b19-0ccd-4f05-a3bd-39eaf4d01acd","year":2019},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.512613Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:cdb69549f0524cd0b7df4f8694971123a9d41354491e36f54b65244d8310c906","observation_id":"f4100be0-a1f4-43fc-8cd6-afa6d2f70aa1","resolution":{"observed_at":"2026-08-14T13:01:25.897122Z","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-14T13:01:25.870147Z","title":"Supporting Graceful Degradation through Elasticity in Mixed-Criticality Federated Scheduling","venue":null,"work_id":"1e10e20e-72b0-4429-a912-744bc07d21da","year":2018},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.521628Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:4a5dbfc5160ff5ec734455876049fb2f0447ab9c8ef58cb474ef717b59228e53","observation_id":"6e3cd300-fbc2-4194-90a4-ced9c5af0745","resolution":{"observed_at":"2026-08-14T13:01:25.876981Z","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-14T13:01:25.852933Z","title":null,"venue":null,"work_id":"1f766849-fe39-42de-b0ef-da39707c5a7f","year":2018},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.527769Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:49ac6d7df0bf56de12ae8ff364e213b14b9caebfb1d5332d2059572b5d15d522","observation_id":"c4d148d8-c0e3-49f1-bd28-a8d39bc6375e","resolution":{"observed_at":"2026-08-14T13:01:25.858075Z","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-14T13:01:25.825361Z","title":"Implementation and Evaluation of Mixed-criticality Scheduling Approaches for Sporadic Tasks","venue":null,"work_id":"192f4ee3-010c-47e8-a402-7bd2e2bbc118","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.533703Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:2382cd1cfbca4230457631a213938d569e4151173195b3d6c663602a9bf8d89b","observation_id":"c6cc6a95-3543-437b-8898-72f3fce2c8ed","resolution":{"observed_at":"2026-08-14T13:01:25.833989Z","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-14T13:01:25.769925Z","title":"Intel NUC Kit NUC6i7KYK (Skull Canyon): Features and Configurations","venue":null,"work_id":"a98dc21d-9421-4037-99a8-b5f1d15c528d","year":2019},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.539687Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:0097d95d01f557e4356bf5e1da2274e2a66c25de707b2bf2e4229af4202cb1b4","observation_id":"4b26a380-5891-44f7-a8d2-9548bd182b00","resolution":{"observed_at":"2026-08-14T13:01:25.785687Z","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-14T13:01:25.748914Z","title":"A QoS-aware Memory Controller for Dynamically Balancing GPU and CPU Bandwidth Use in an MPSoC","venue":null,"work_id":"f403f75b-5570-4f84-80c6-ebe37ec0eef2","year":2012},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.547720Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:32b8383f35304c6a517afddbbe4a8cf4b2178a01c2500f490384e04d6929d109","observation_id":"2347e534-5487-4694-a0ba-4b5586cc70a0","resolution":{"observed_at":"2026-08-14T13:01:25.756939Z","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-14T13:01:25.718683Z","title":"Run-time Control to Increase Task Parallelism in Mixed-critical Systems","venue":null,"work_id":"e2ca5959-e18b-430c-8598-7dafe6fe1a52","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.554288Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:bd0c10494b44cc96a43b9d3a401b57ad045e34cf82cffdd18609500e1d880616","observation_id":"2477f180-6647-4fff-9604-51936b415e5e","resolution":{"observed_at":"2026-08-14T13:01:25.725938Z","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-14T13:01:25.695671Z","title":"DYNASCORE: DYNAmic Software COntroller to increase REsource Utilization in Mixed-critical Systems","venue":null,"work_id":"209b6932-9eaa-4b5e-84d1-534c35560241","year":2017},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.561870Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:02a076dcb9d6bb6c7b308d1bd271bc47a464b72839ee5dce16880b18af698bc9","observation_id":"0de8298c-293e-4fb9-bf76-14b8ee5b5fef","resolution":{"observed_at":"2026-08-14T13:01:25.703128Z","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-14T13:01:25.646185Z","title":"Distributed Run-time WCET Controller for Concurrent Critical Tasks in Mixed-critical Systems","venue":null,"work_id":"08b58dcf-8351-4999-b2ca-bd26798fb9d6","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.567849Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:7e48c2f70f716a8cda5208162fdbf32e746b9f9ccbef9a0fa8c1c82e5a257ce6","observation_id":"f368b888-ca12-44dd-9f10-566d2b8d06e0","resolution":{"observed_at":"2026-08-14T13:01:25.657513Z","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-14T13:01:25.616867Z","title":"LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation","venue":null,"work_id":"7cf2df74-5501-45a6-91a8-c174f5102a65","year":2004},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.573723Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:47c4e7b53b17cf29b793638b4bb1c4482b2fb48fb78f4b17a135649fae8cff95","observation_id":"1acaed31-2369-40ba-b20b-26f582299a74","resolution":{"observed_at":"2026-08-14T13:01:25.625091Z","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-14T13:01:25.568039Z","title":"An Efficient and Scalable Implementation of Global EDF in Linux","venue":null,"work_id":"010c69b4-73c3-4251-bc61-ec9dc8fbde7c","year":2011},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.579459Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:251a5b07fff2c8be98149ccd4c3969ad15815eb67606fe5a1e2b66318e570a39","observation_id":"bb0fd958-1466-481f-a705-71ad4f9eec52","resolution":{"observed_at":"2026-08-14T13:01:25.584953Z","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-14T13:01:25.544421Z","title":"Deadline Scheduling in the Linux kernel","venue":null,"work_id":"e3cd5b1d-2701-4416-8df5-3ed058dca204","year":2016},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.585104Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:bc9b7ab31632e2204663c156aa225b0e469f6495a980bee55acf79561d5e96f0","observation_id":"8cb68a42-777d-4b1b-aff4-d9dc7848e314","resolution":{"observed_at":"2026-08-14T13:01:25.551421Z","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-14T13:01:25.520167Z","title":"Microsoft COCO: Common Objects in Context","venue":null,"work_id":"67176c41-1c67-4060-b899-b9cefb797da4","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.592317Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:a282ae154f12c164e6e019d87190447e302ff0a8d230758a26281d662a85ba9d","observation_id":"acc466ac-d63e-43f7-84ba-056de590a5a5","resolution":{"observed_at":"2026-08-14T13:01:25.528367Z","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-14T13:01:25.494820Z","title":"hrtimers - Subsystem for High-resolution Kernel Timers","venue":null,"work_id":"c6855b27-e241-4358-b931-30804b9f34f9","year":2019},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.597825Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:cb621d77ff0fc994aee40a75566bf27e4fe6c45062f0be45ff9d94328c935c96","observation_id":"a00e006c-6186-47dd-92f8-0d40c1162542","resolution":{"observed_at":"2026-08-14T13:01:25.503113Z","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-14T13:01:25.466528Z","title":"SCHED\\_DEADLINE Scheduling Policy","venue":null,"work_id":"5d5f8073-6463-4793-a754-5772156ce879","year":2019},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.603437Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:d8e68ba81d1d7b61fafbfb412be8fbc65c783263871f3997bbf88cd878eb5d18","observation_id":"b3c7b28c-055c-402c-9c33-07baf28af56f","resolution":{"observed_at":"2026-08-14T13:01:25.478397Z","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-14T13:01:25.434019Z","title":"Scheduling analysis of imprecise mixed-criticality real-time tasks","venue":null,"work_id":"a4ea6f87-d8c5-424e-ab47-f5bbaddbc1c1","year":2018},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.610571Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:70662be672dc767d8da4a90645fa9804bf9aab83243d5bfdfa030ea8144656ac","observation_id":"0302a897-c5ba-4b06-b272-698315da1354","resolution":{"observed_at":"2026-08-14T13:01:25.447759Z","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-14T13:01:25.412403Z","title":"Edf-vd scheduling of mixed-criticality systems with degraded quality guarantees","venue":null,"work_id":"6b823f7c-e78e-49c5-b385-bdd1f4e8d5b1","year":2016},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.622895Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:02652a99b10748b949bec3fbc1b0cb3dbba477531e044612fb56117aaddc77c1","observation_id":"a73013ee-8749-4f20-b8fd-9331b0d76254","resolution":{"observed_at":"2026-08-14T13:01:25.421325Z","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-14T13:01:25.377613Z","title":"https://llvm.org/doxygen/LoopInfo_8h_source.html, Last Accessed: May 2019","venue":null,"work_id":"9a8a658a-319b-4289-8db4-9df96ccc641f","year":2019},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.628832Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:22db55e5337896d2b906af96e3447183b67431f4473fabeea4d83612c6751ebf","observation_id":"1f3d9bea-fef9-493a-9de0-743298a8474b","resolution":{"observed_at":"2026-08-14T13:01:25.390091Z","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-14T13:01:25.342128Z","title":"Light-PREM: Automated Software Refactoring for Predictable Execution on COTS Embedded Systems","venue":null,"work_id":"43478154-70eb-4958-9611-54dbc5ee9c03","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.636898Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:83c5bdbaf1cadb23ef3ddf76c6d8ac7ca42502fd92a2b585a7a2802499693251","observation_id":"afeb1564-895c-4ac9-95b7-20f1f79eed74","resolution":{"observed_at":"2026-08-14T13:01:25.359482Z","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-14T13:01:25.294845Z","title":"Mixed-criticality scheduling with i/o","venue":null,"work_id":"1b3aec92-7e2b-4c84-abb9-f180a7f0b9fb","year":2016},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.642374Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:56ce99dbb44cf4695f0e82226bf14498d8c791040a3ce9dd76ee0eb0e30a44ec","observation_id":"e313d104-effd-4712-8c1b-c3ab8aa94531","resolution":{"observed_at":"2026-08-14T13:01:25.310116Z","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-14T13:01:25.258099Z","title":"AdaptMC: A control-theoretic approach for achieving resilience in mixed-criticality systems","venue":null,"work_id":"43138f5c-3d7d-45bd-8f5f-f35f8e4c8f31","year":2018},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.647293Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:ddfa40008cbf553901a306acf173117da415dd6f839648aebfbee5426db7cce5","observation_id":"17a508fd-116e-421a-bf7b-560ab9f1ebf8","resolution":{"observed_at":"2026-08-14T13:01:25.271683Z","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-14T13:01:25.230676Z","title":"Source Code","venue":null,"work_id":"1bd6fc74-e0b9-4b97-9fd9-34a84a5edd01","year":2020},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.652987Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:fa35890aebaa72cd1a341a168530bb661309258cdd6812651f5e0733321a214b","observation_id":"fabc53ae-a982-4a90-a383-458854339c84","resolution":{"observed_at":"2026-08-14T13:01:25.237864Z","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-14T13:01:25.201123Z","title":"A Predictable Execution Model for COTS-based Embedded Systems","venue":null,"work_id":"84c21b45-170c-4998-bb37-f9aa58ee69c8","year":2011},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.664220Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:bf948ed0c7cae695ad1c99edb2c6115bd8981e8832744a0c58b462b26f7a7713","observation_id":"18dfb79d-00ad-498a-a4fc-f23eb0cb39e2","resolution":{"observed_at":"2026-08-14T13:01:25.211460Z","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-14T13:01:25.173048Z","title":"Multi-rate Fluid Scheduling of Mixed-criticality Systems on Multiprocessors","venue":null,"work_id":"322996aa-0cc9-4ef4-9738-c0bb6d47f9be","year":2018},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.672741Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:47aaf9b8a2ed84ae8a11fad7c3a1b50c64c8e37e8bf84f798b72e456cbc2768e","observation_id":"5f2e62bf-5d3e-47e7-b604-c2be73821c82","resolution":{"observed_at":"2026-08-14T13:01:25.179403Z","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-14T13:01:25.154654Z","title":"Darknet: Open Source Neural Networks in C","venue":null,"work_id":"c1b54a47-83e0-48a0-8999-a41753a21749","year":2013},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.679882Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:c72f182c2b64bcaf2ef1e62420510d4ba14b99c72c02e137bc9e15412b1d2745","observation_id":"42fffff1-ac5a-4fc6-ae76-7ded4251cbc3","resolution":{"observed_at":"2026-08-14T13:01:25.162592Z","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-14T13:01:25.125224Z","title":"Relaxing mixed-criticality scheduling strictness for task sets scheduled with fp","venue":null,"work_id":"115a855b-603a-430f-a535-c74bdba5c098","year":2012},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.689423Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:7aafc92f3012d1bb142b93e852f8b7da931ea14dc2da5c70c89fb643545ff023","observation_id":"6fb83428-27f5-4104-be3e-6e6e8f7b30c1","resolution":{"observed_at":"2026-08-14T13:01:25.132342Z","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-14T13:01:25.103085Z","title":"Fixed-priority Dual-rate Mixed-criticality Systems: Schedulability Analysis and Performance Optimization","venue":null,"work_id":"27880703-26dc-4041-81c6-0a0f2a1f2919","year":2016},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.698097Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:d2cc3ab24c116474866456942196d9886f8e6569fdb1a2fa99d83dd06ffdceef","observation_id":"19084894-4355-4cfb-9e44-a51ebac30477","resolution":{"observed_at":"2026-08-14T13:01:25.108663Z","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-14T13:01:25.073191Z","title":"Service guarantee exploration for mixed-criticality systems","venue":null,"work_id":"aae0527e-55a3-4661-956b-b235dbb4a8ca","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.711996Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:90bdda50a50bd9cfc4c98e97964d5816e603083165aff00fdcba02347bc261c8","observation_id":"602d93de-234f-4e67-acbf-36a3080fa1c8","resolution":{"observed_at":"2026-08-14T13:01:25.082917Z","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-14T13:01:25.045666Z","title":"An Elastic Mixed-criticality Task Model and its Scheduling Algorithm","venue":null,"work_id":"fc1afe88-e505-430d-9726-c6671167e93f","year":2013},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.723648Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:6ba9e39c07e237b7bfca60080c48bea8f33d34afbb07d32066f9729ce575cdf7","observation_id":"d27891ba-5ff8-458e-92c9-b7a77827c1f1","resolution":{"observed_at":"2026-08-14T13:01:25.052075Z","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-14T13:01:25.025447Z","title":"An Elastic Mixed-Criticality Task Model and Early-Release EDF Scheduling Algorithms","venue":null,"work_id":"d918a60e-0c19-4907-bd33-e57e1259c102","year":2017},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.729471Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:babb802e1fda42e0351aaa1264ef5ef2eba6f1a9d33312b941891bf1c5db7579","observation_id":"e04d8904-5e99-46db-9e50-1c6759b0cc2e","resolution":{"observed_at":"2026-08-14T13:01:25.033971Z","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-14T13:01:24.993685Z","title":"Efficient Instrumentation for Code Coverage Testing","venue":null,"work_id":"8b00d0d0-6881-4708-98ed-39a32f185ef9","year":2002},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.735617Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:c82646b255893d4378653a20d5b6ac8fd7c36b33d49f67424d20a99ac6a172fc","observation_id":"5f03e7b0-3a49-4a16-b445-625295f2e26c","resolution":{"observed_at":"2026-08-14T13:01:25.005381Z","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-14T13:01:24.950601Z","title":"Supporting Low-Latency, Low-Criticality Tasks in A Certified Mixed-Criticality OS","venue":null,"work_id":"92c12195-2f20-4f50-8e50-9b10b26d7971","year":2017},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.740941Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:bd1affbda40db6df7454dc79800db6b58a624d83f48c1bf703e9d65010d71787","observation_id":"36f85c6d-6143-4e3f-abc0-bad874e2d51a","resolution":{"observed_at":"2026-08-14T13:01:24.965998Z","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-14T13:01:24.927214Z","title":"Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance","venue":null,"work_id":"381f2cb4-6336-43cb-bc9d-82c51152831b","year":2007},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.747128Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:ea53f270d60c1564574c40224bf92b1c8d553595082e31db0055ee23fde63fa8","observation_id":"4c2b14a8-113c-42a9-908d-faebb46635f5","resolution":{"observed_at":"2026-08-14T13:01:24.934508Z","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-14T13:01:24.902628Z","title":"Online Cache Modeling for Commodity Multicore Processors","venue":null,"work_id":"1d1688e1-481d-47f9-a32c-d79e7eb67ea0","year":2010},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.752961Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:2fe309414318d4d1dc15c7a8bef6f8557739fff2eccb30fe5d7efe73ecc701a0","observation_id":"eaee1aff-308c-44b0-97de-381d3aa51575","resolution":{"observed_at":"2026-08-14T13:01:24.910375Z","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-14T13:01:24.877880Z","title":"The Worst-case Execution-time Problem - Overview of Methods and Survey of Tools","venue":null,"work_id":"cff2035a-8ace-40ad-bb5b-bb661f7b9a6e","year":2008},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.758578Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:dca2fd9d282c27ad61836670d3df36826f92dc7f91ce760bc2a418131ff91f9b","observation_id":"f282898b-63de-4247-95ff-6b374821554c","resolution":{"observed_at":"2026-08-14T13:01:24.885081Z","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-14T13:01:24.856609Z","title":"COLORIS: A Dynamic Cache Partitioning System using Page Coloring","venue":null,"work_id":"0b930609-1fed-45c3-a85a-054b79702c16","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.765186Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:39635466e520f45e2d0b1e9a0edaef0511fd6295b8412596608d6c3bd5f54e12","observation_id":"1f1a53b9-db17-43ea-a5d0-27e4f0731d38","resolution":{"observed_at":"2026-08-14T13:01:24.863970Z","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-14T13:01:24.836036Z","title":"PALLOC: DRAM Bank-aware Memory Allocator for Performance Isolation on Multicore Platforms","venue":null,"work_id":"79d98f35-56b6-4035-a79f-a85b96cc706d","year":2014},"citing_paper":{"arxiv_id":"1908.06211","last_updated":"2021-05-31T15:53:06Z","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-14T13:01:24.774037Z"},"links":{"citing_paper":"/paper/1908.06211"},"observation_digest":"sha256:1a9fc911e003ce8ffe6a4203c35b3757fa6a674b333bb0b51395f75778011a40","observation_id":"c060a4a7-52f6-4e6c-85f7-3dc58f4507f0","resolution":{"observed_at":"2026-08-14T13:01:24.843528Z","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.06211","last_updated":"2021-05-31T15:53:06Z","latest_version":2,"primary_category":"cs.OS","snapshot_observed_at":"2026-08-14T12:50:39.759601Z","submitted_at":"2019-08-17T00:24:07Z","title":"PAStime: Progress-aware Scheduling for Time-critical Computing"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":54},"total_outbound_references":56},"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 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:1908.06211."}