{"as_of":"2026-08-14T21:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb129e916d953761c3945b51aaadf1d8679a2e0fd6617847c2aa025b04867299","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T13:04:57.830044Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2607.23772/citation-record","integrity":"/paper/2607.23772/integrity","json":"/paper/2607.23772/citation-record.json","paper":"/paper/2607.23772"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.641650Z","title":"Restless bandits: Activity allocation in a changing world,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.641650Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:50136429ebbe602174bb24a21ab4fd917bf99c26f2612a80f0123e6954673426","observation_id":"292e00d5-667e-4dc9-977e-e99210b0a42b","resolution":{"observed_at":"2026-07-30T13:04:57.641650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.647271Z","title":"On an index policy for restless bandits,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.647271Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:64d5c3fdee760370338b9541efd03a0150a0434990a703d85fcbb7862dad7197","observation_id":"3dc3e7b6-4aea-4055-8d4b-851f5aea452c","resolution":{"observed_at":"2026-07-30T13:04:57.647271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.651394Z","title":"Rested and restless bandits with constrained arms and hidden states: Applications in social networks and 5g networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.651394Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:2146e6c998a9d34b0fdd5f7ca4fa0d7f7dc7e370ec8f1b0dfa312a114fd01906","observation_id":"a9a4583d-2302-403c-a073-a02bb6cffd43","resolution":{"observed_at":"2026-07-30T13:04:57.651394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.655667Z","title":"Scheduling algorithms for minimizing age of information in wireless broadcast networks with random arrivals,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.655667Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:18ff2874809fd2ce5233c7162facbf339ae005a11e5c26919735eaf164dffde1","observation_id":"c3e3060d-a669-4f9c-81ac-aa570dda3e13","resolution":{"observed_at":"2026-07-30T13:04:57.655667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.659990Z","title":"Fresh caching of dynamic contents using restless multi-armed bandits over wireless access,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.659990Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:d58ddb4403575ae83c6804317a2e9175e7707338344cf750cdf1ed9d30d64cb5","observation_id":"1a0109c4-c729-4b04-86aa-cb6facd3368e","resolution":{"observed_at":"2026-07-30T13:04:57.659990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.664989Z","title":"Deadline scheduling as restless bandits,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.664989Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:8d4660fb33fa82ee87f5dd98e9fbf5f065ca003c4acc9a4366777d87eb29399b","observation_id":"421a9cc4-8592-4545-bb3a-260fe0943cf1","resolution":{"observed_at":"2026-07-30T13:04:57.664989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.670171Z","title":"Index policies for real-time multicast scheduling for wireless broadcast systems,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.670171Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:f95a7de6ddf00fd82984147f1284da306d26960ce423b50976c7f6eaf25751d6","observation_id":"eeee6898-53a5-4704-87d0-cce586e31532","resolution":{"observed_at":"2026-07-30T13:04:57.670171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.674790Z","title":"Scheduling policies for minimizing age of information in broadcast wireless networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.674790Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:96828dc58a3cbbc14441c5d31d2147cb4be05b8ade4d3e167640314f29aeed42","observation_id":"782a9ce8-b9a1-487b-9a6a-053e3c1b9d82","resolution":{"observed_at":"2026-07-30T13:04:57.674790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.13343","last_updated":"2022-07-27T07:56:32Z","snapshot_observed_at":"2026-08-14T13:43:40.373466Z","submitted_at":"2022-07-27T07:56:32Z","title":"Towards Soft Fairness in Restless Multi-Armed Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.13343","snapshot_observed_at":"2026-07-30T13:04:57.684412Z","title":"Towards soft fairness in restless multi- armed bandits,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.684412Z"},"links":{"cited_paper":"/paper/2207.13343","citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:bbf130af41f3ddd4276e8790033ad255cc46833fa5db7a536879a0ecf1b3a44f","observation_id":"a83331a4-2a64-444a-b3b9-cc8635d815de","resolution":{"observed_at":"2026-07-30T13:04:57.684412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.726376Z","title":"Fairness for workers who pull the arms: An index based policy for allocation of restless bandit tasks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.726376Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:531427f906c391d88aeae3aa1c3a98522656264a0d53d650f26dbd4d2777c3a1","observation_id":"b4f6804b-4924-49dc-bc6d-88e4c07ff71e","resolution":{"observed_at":"2026-07-30T13:04:57.726376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.746719Z","title":"Online restless multi-armed bandits with long-term fairness constraints,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.746719Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:73dee33ba59ef67a27004bb649f7b93a41b8f52144d8d37216a6e2f182da2121","observation_id":"c73bfd2c-605c-4bf3-a773-1a16636e5fd4","resolution":{"observed_at":"2026-07-30T13:04:57.746719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.752035Z","title":"Time-constrained restless multi-armed bandits with applications to city service scheduling.,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.752035Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:1435d7bf9467edd874e38e7cbd9270218e86a41d6048919170354ed351d8247e","observation_id":"29f52f0d-8fc4-452b-9f5a-6c8d47a0675a","resolution":{"observed_at":"2026-07-30T13:04:57.752035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.755995Z","title":"Fair scheduling with deadline guarantees in single-hop networks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.755995Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:2787651e24fba45dbdae4c8d4d92665845bb429a50a662e0bbd2c05e4c089afd","observation_id":"d0a6c02c-1f7f-4c42-98bc-59f5a7ef43cb","resolution":{"observed_at":"2026-07-30T13:04:57.755995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.760195Z","title":"A theory of QoS for wireless,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.760195Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:66b80a0b36a3441d6e92f03c25528ae2705ee5bf88deebd485395f3a3df52f6e","observation_id":"651cf250-2aef-49cc-a714-95d0e8135627","resolution":{"observed_at":"2026-07-30T13:04:57.760195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.763928Z","title":"Scheduling heterogeneous real- time traffic over fading wireless channels,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.763928Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:f87d0e0fae6501f9d0396d8e241b2025c37d0aae564745cd9028fd8567a1cc4f","observation_id":"b15e6458-2ea1-401f-ade8-74f0267103cf","resolution":{"observed_at":"2026-07-30T13:04:57.763928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.767963Z","title":"Scheduling multicast traffic with deadlines in wireless networks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.767963Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:dcebaa19c1d9cca2a355838c90bf1274441e2b09bacacbf8df9f86cd553615f1","observation_id":"3b63509b-0f92-47a2-8ea0-551b00c04b9a","resolution":{"observed_at":"2026-07-30T13:04:57.767963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.771608Z","title":"On an information and control architecture for future electric energy systems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.771608Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:c9e7941e7b000ac594372ce3a65371c51209578a6e85c2dbc8e55c8ea5306002","observation_id":"56cc651c-856e-4494-adae-ca499aba587b","resolution":{"observed_at":"2026-07-30T13:04:57.771608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.00410","last_updated":"2023-04-30T06:53:44Z","snapshot_observed_at":"2026-08-13T11:52:29.667501Z","submitted_at":"2023-04-30T06:53:44Z","title":"Indexability of Finite State Restless Multi-Armed Bandit and Rollout Policy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.00410","snapshot_observed_at":"2026-07-30T13:04:57.775399Z","title":"Indexability of finite state restless multi-armed bandit and rollout policy,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.775399Z"},"links":{"cited_paper":"/paper/2305.00410","citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:e7c0a920e8d26f6c7d9ec79a44739cef9335f77a246bbf0ffbe0057582db0075","observation_id":"54cfad24-1d22-4735-9d34-f8c2403c5c21","resolution":{"observed_at":"2026-07-30T13:04:57.775399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.783730Z","title":"Constrained restless bandits for dynamic scheduling in cyber-physical systems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.783730Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:962b587c3a9603c1741ffae00e8848b09bb4980044e587fe65d34d30242f8915","observation_id":"3b1027ac-ad17-4934-8bed-fa352d732c1f","resolution":{"observed_at":"2026-07-30T13:04:57.783730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.789791Z","title":"Lagrangian index policy for restless bandits with average reward,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.789791Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:64323c3bdafd91d6f8ead473abb32ab096b32e19e965ee14aca9c5c16048d6a1","observation_id":"2975f932-430f-47e3-bade-1917da317ebe","resolution":{"observed_at":"2026-07-30T13:04:57.789791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.795417Z","title":"Simulation based algorithms for Markov decision processes and multi-action restless bandits,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.795417Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:914244b5a8ce07f8dcae8fae035e6fe9acd1fd2b9a562c44777eb0a85becdc9f","observation_id":"d9b47ad7-fdff-4fbb-8446-25df243de98d","resolution":{"observed_at":"2026-07-30T13:04:57.795417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.807824Z","title":"Scheduling heterogeneous real-time traffic over fading wireless channels,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.807824Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:deb266e518e5531150ae202edb2bbdd10ef2f05bb38839ba8a0fc282bdfb777f","observation_id":"dcdd18a1-70d6-4517-9a86-a18259a609fc","resolution":{"observed_at":"2026-07-30T13:04:57.807824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.812406Z","title":"Here,F: Z+ →R + is an increasing function satisfyingF(0) = 0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.812406Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:9892078a2f641d2578629e60db90a97c1f08b1adac7644b4d91210947de31445","observation_id":"142a871a-9b33-490e-867f-d9c61f7ff458","resolution":{"observed_at":"2026-07-30T13:04:57.812406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.816622Z","title":"Since these resources do not produce a completed job, the scheduler incurs the additional penalty r(i) waste =−z ki Ei[t]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.816622Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:fb49551cb8963394019796d3bcf8c5c76e19aa7d27bcf91e057c63b52e6fa100","observation_id":"56bbb0ad-0da1-4462-8a9d-0cc759e16b76","resolution":{"observed_at":"2026-07-30T13:04:57.816622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.821669Z","title":"The scheduler then selects theMjobs with the largest values","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.821669Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:7074df373d4f9448a9698791f009baaa4347c7ce1c1244dac629ac29f1aefc4b","observation_id":"cb932fac-cbb8-49ee-a960-b1ea1074f0d6","resolution":{"observed_at":"2026-07-30T13:04:57.821669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.825901Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.825901Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:298e533a2557bbbdc5d755658dd0343394a1ce6d8abef31da2d979de1fd9d955","observation_id":"19abd5bb-83f2-482b-8e62-67386a987b53","resolution":{"observed_at":"2026-07-30T13:04:57.825901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:04:57.830044Z","title":"There are two classes are considered","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-30T13:04:57.830044Z"},"links":{"citing_paper":"/paper/2607.23772"},"observation_digest":"sha256:7c8d7e989a97fc1de82bcddbfac52e55303e54e30ee0dfbbf9dad8a400d0f971","observation_id":"c25ae2d1-f6a5-4581-b2d7-0ce3e88d245d","resolution":{"observed_at":"2026-07-30T13:04:57.830044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23772","last_updated":"2026-07-26T17:48:19Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-14T11:10:47.645439Z","submitted_at":"2026-07-26T17:48:19Z","title":"Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":27},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2607.23772."}