{"as_of":"2026-08-15T03:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d52301984f164a51f7e3095deee6b368e8b3e7c64d18251bd6955e8d07e11ce7","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T04:10:33.880951Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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/2606.26544/citation-record","integrity":"/paper/2606.26544/integrity","json":"/paper/2606.26544/citation-record.json","paper":"/paper/2606.26544"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T04:10:33.880951Z","title":"Whittle index approach to multiserver scheduling with impatient customers and DHR service times,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:ee502e88c6cca2bd02fdcdcdea8fa32e9c1165b235015b48cc95b1ed818470c7","observation_id":"585eceef-9872-4b1b-a670-81b65a609063","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"On the Gittins index in the M/G/1 queue,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:235adf8b19fdd5bfcfdd239f06334ed357dff47dc95ff7fd3743055e85c167f5","observation_id":"6592e242-e66f-4142-80f2-4e6fddccd090","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Dynamic control of an M/M/1 service system with adjustable arrival and service rates,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:0c4ce998a8e467c875b3ee39c8a91fb338044d826737ff49225d65ce734a22db","observation_id":"518fd943-1ce9-4e33-83b7-0b031e13a417","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"and Shimkin N","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:36686dd82987ecc7bd3e6c55372a818da27d91163ada85857d9ef7388149a6b4","observation_id":"e7d3c420-0954-4b5e-9dd5-c441fd0a3fd8","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Scheduling of multi-class multi-server queueing systems with abandonments,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:571d11a49a7a1773450ed63e0b96fa6bc003aa2547c80fdf69209b28dc29eab7","observation_id":"64011aaa-0c54-413b-a44c-0178cbaf3b6c","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Kcompeting queues with customer abandonment: Optimality of a generalizedcµ- rule by the Smoothed Rate Truncation method","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:2286b0445e01d4d93853a20b2b68686ed7de28509c7711fd4cffc615eba1c221","observation_id":"7b975f20-53d6-4fde-8c57-a467f1ee3aa3","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Multiple server preemptive scheduling with impatience,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:fd54893558abe5ef05f13dd92621ed1693ec3f92c7c8c0049a562135b1cb531b","observation_id":"32be3df0-2c85-4216-8131-759fea3a9c20","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Stochastic scheduling with abandonment: Necessary and sufficient conditions for the optimality of a strict priority policy,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:b8648d739d3519c290cc99caf91f1924137284457ba210974ca890c898e43ac2","observation_id":"dd848bdf-136e-4f36-a414-f1781edb55a9","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"SRPT scheduling discipline in many-server queues with impatient customers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:20cfca46220bd8710abe8eb9f1616220b9b72d0d1f37a743a64823a27e49448d","observation_id":"59d9b1a2-c73c-42ba-ace2-97e4a9a7f652","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Dynamic control of a single-server system with abandonments,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:aca81cd261f2fc26480dbafd738bf9647bbbc5589ab641e5e96f0c32b22c7190","observation_id":"df54b35b-72d3-4283-aef9-03442db0a88e","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"C., Glazebrook, K., and Weber, R.Multi-armed Bandit Allocation Indices","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:55e03b1367ae07b031824fd44fd8c628d27212cbc60869d7b91ce8449d9136b2","observation_id":"1a35da76-c96e-4055-a70f-75e01e107c6c","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"SRPT for multi-server systems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:168c6b1a4b6a06ffb0a94d6c81d46fd4f120f6f36a76ceb9d0e382fdce3e185c","observation_id":"6defdb83-326f-47cc-8add-ebb0d9e538bc","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"A survey of recent results on continuous-time Markov decision processes,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:c8a367f8b7556dbc6a6ea68332a9fbe5070c6da0e20db4400f61a7e767861887","observation_id":"8146fcdd-cad1-4cbe-aa7c-aad31d4d68ea","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"and Hern´ andez-Lerma, O.Continuous-Time Markov Decision Processes: Theory and Ap- plications, Springer, Berlin, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:1889788f8f5251949ab3ae5ddd7ffcbbf02800a41e11d3d54ccba636abf87e37","observation_id":"9a5d9ea4-224b-447d-94cd-c15f697b1ce6","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Dynamic fluid-based scheduling in a multi-class abandonment queue,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:31d78e5b74af2531ae75deb5ea5bddc19dea50218ef12f644a924810306b60cb","observation_id":"0ac732c3-37f9-4e31-b20f-cb2f22b902d4","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:1e5ac7c450e48238d2b9b80320a8e261e381aa43e75e9fb8c3b351b5ecc66978","observation_id":"2e5c22d3-9aa5-45b7-b4e7-9c4e0ff30c73","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"On extremal service disciplines in single-stage queueing systems,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:338936d380e3eacff5ac6b3cb6877007c71a61d2b3a91c501d23865f8daf6941","observation_id":"b3a7f8ff-519b-4e42-8791-3c477b9da4dd","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"A proof of the optimality of the Shortest Remaining Processing Time discipline,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:5bd5b6d15a9cfd11c21cc14256b808d67455d55712f3e41a56f43928e058e789","observation_id":"449dbee1-ea8d-4573-89a1-79c52eb81e3f","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","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-06-26T04:10:33.880951Z","title":"Simple near-optimal scheduling for the M/G/1,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T04:10:33.880951Z"},"links":{"citing_paper":"/paper/2606.26544"},"observation_digest":"sha256:25e13072aeb03954438e416b9ab378aa19e778d21ea53e19769b03475647d3ef","observation_id":"9c1ac813-06fb-4e53-99a3-15edf7b81d1a","resolution":{"observed_at":"2026-06-26T04:10:33.880951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.26544","last_updated":"2026-06-25T02:39:08Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-03T21:15:26.525539Z","submitted_at":"2026-06-25T02:39:08Z","title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":19},"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 15 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2606.26544."}