{"as_of":"2026-08-17T07:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09d630e327721be223b9b4901d054851aa6ab1135ab41e7245606a84c28cb888","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:53:34.437383Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T18:41:32.709816Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.07419","last_updated":"2018-09-17T02:26:14Z","snapshot_observed_at":"2026-08-14T20:01:45.503729Z","submitted_at":"2017-12-20T11:23:04Z","title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.07419","snapshot_observed_at":"2026-08-14T10:53:34.437383Z","title":"Scheduling algorithms for minimizing age of information in wireless broadcast networks with random arrivals: The no-buffer case,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.10438","last_updated":"2023-06-20T14:15:34Z","snapshot_observed_at":"2026-08-16T21:09:29.248283Z","submitted_at":"2019-08-27T19:56:26Z","title":"A Whittle Index Approach to Minimizing Functions of Age of Information","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:53:34.437383Z"},"links":{"cited_paper":"/paper/1712.07419","citing_paper":"/paper/1908.10438"},"observation_digest":"sha256:cb3419c0f6c072cf37bbdd5946cbc859ad4a2d2c7e114f8178de9bf266a2323f","observation_id":"b41e8ea7-2beb-43cd-b3c5-3642f93a258e","resolution":{"observed_at":"2026-08-14T10:53:34.437383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.07419","last_updated":"2018-09-17T02:26:14Z","snapshot_observed_at":"2026-08-14T20:01:45.503729Z","submitted_at":"2017-12-20T11:23:04Z","title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case","version":4},"cited_work":{"arxiv_id":"1712.07419","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.07419","snapshot_observed_at":"2026-08-10T18:41:32.709816Z","title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case","venue":"math.OC","work_id":"ba5e311d-709c-4f35-9308-df9e04950dec","year":2017},"citing_paper":{"arxiv_id":"2501.11136","last_updated":"2025-01-19T18:14:12Z","snapshot_observed_at":"2026-08-17T05:24:19.863250Z","submitted_at":"2025-01-19T18:14:12Z","title":"A Novel Switch-Type Policy Network for Resource Allocation Problems: Technical Report","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T18:41:32.322186Z"},"links":{"cited_paper":"/paper/1712.07419","citing_paper":"/paper/2501.11136"},"observation_digest":"sha256:0c12a45651f18fc8ad9d9f8f9c77fa028fe2c1e35ad8e417bc25c2e072707c61","observation_id":"680c0180-b7c5-49b2-9d3d-57bffb4e1966","resolution":{"observed_at":"2026-08-10T18:41:32.721137Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1712.07419/citation-record","integrity":"/paper/1712.07419/integrity","json":"/paper/1712.07419/citation-record.json","paper":"/paper/1712.07419"},"outbound":[],"paper":{"arxiv_id":"1712.07419","last_updated":"2018-09-17T02:26:14Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T20:01:45.503729Z","submitted_at":"2017-12-20T11:23:04Z","title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1712.07419."}