{"id":"ff70e0d9-2d31-45d7-8917-fea3ff95d7cc","arxiv_id":"2606.26544","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"SREPT policy maximizes long-run average throughput in M/G/1 queues with exponential patience times for Erlang-K and hyperexponential services when phases are observable.","lead":"This paper shows that the Shortest Remaining Expected Processing Time policy maximizes long-run average throughput in single-server queues with customer abandonments for Erlang-K and hyperexponential service times when phases are observable. A smart generalist might read it to learn a simple rule for assigning servers in systems like call centers where customers leave if waiting too long.","discovery_kind":"new_application","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"Reader correctly extracted the conditional claim and weakest assumption directly from the abstract. With the full text now available but no evident gap in the stated conditions or result, the UNVERDICTED status and low confidence (due to abstract-only review) remain appropriate; no adjustment warranted.","tokens_in":1593,"tokens_out":212,"duration_ms":25502,"concrete_test":"Confirm that the full paper's proof (likely via MDP value-function properties or stochastic coupling) establishes optimality for arbitrary positive abandonment rates without additional restrictions on the rate parameter.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is explicitly restricted to Erlang-K or hyperexponential service times with observable phases; the abstract states that SREPT is optimal under precisely these conditions and is independent of the abandonment rate. No internal inconsistency, hidden assumption, or unsupported step is detectable in the stated result. The weakest_assumption identified by the reader matches the paper's own conditioning.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript claims that in an M/G/1 queue with Poisson arrivals and exponentially distributed patience times, when service times follow an Erlang-K or hyperexponential distribution and the decision maker can observe the current phase of each customer's service, the Shortest Remaining Expected Processing Time (SREPT) policy maximizes long-run average throughput; this optimality holds independently of the abandonment rate.","tokens_in":1642,"tokens_out":239,"duration_ms":32606,"significance":"If the result holds under the stated conditions, it would constitute a meaningful contribution to stochastic scheduling and queueing control by identifying an optimal policy for throughput maximization in abandonment systems for a restricted but practically relevant class of phase-type distributions. The independence from the abandonment rate, if rigorously established, would be a notable strengthening of the result with potential implications for policy robustness.","major_comments":[],"minor_comments":[{"comment":"The abstract would benefit from a one-sentence indication of the proof technique (e.g., sample-path comparison, dynamic programming, or index policy argument) to help readers assess the approach at a glance.","section":null}],"recommendation":"accept","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive evaluation of the manuscript and for recommending acceptance. No major comments were raised in the report.","responses":[],"tokens_in":1055,"tokens_out":44,"duration_ms":7547,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that this paper proves the Shortest Remaining Expected Processing Time policy maximizes long-run average throughput in an M/G/1 queue with Poisson arrivals and exponential patience, but only when service times are Erlang-K or hyperexponential and the server can observe the current phase of each customer. The optimality holds regardless of the abandonment rate.\n\nWhat is new is the extension of earlier phase-type optimality results to include customer abandonments while keeping the policy independent of the abandonment parameter. The paper sets up the standard single-server model and uses the phase structure to derive the result for these two families.\n\nThe work is solid on its own terms. It gives a clean statement and focuses on a setting where the phase-type representation allows explicit comparison of remaining expected times. That produces a usable policy without needing to know the abandonment rate in advance.\n\nThe soft spots are exactly the ones the abstract flags. The result does not apply to general service distributions, and it requires phase observability, which is a strong assumption. Those limits are real and keep the finding from covering most practical cases. The proof likely leans on the specific Markovian structure of Erlang-K and hyperexponential distributions, so broader extensions would need different tools.\n\nThis is for researchers in stochastic scheduling who already work with phase-type services and abandonments. A reader looking for exact optimality results in that narrow slice will get something concrete. It deserves peer review because the claim is precise, the setting is standard, and the independence from the abandonment rate is a useful property even if the scope stays limited.","headline":"SREPT is optimal for throughput under abandonments only for Erlang-K and hyperexponential services with observable phases.","tokens_in":2119,"tokens_out":389,"would_cite":false,"duration_ms":29798,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"The Shortest Remaining Expected Processing Time policy maximizes the long-run average throughput in an M/G/1 queue with customer abandonments when service times are Erlang-K or hyperexponential and phases are observable.","keywords":["M/G/1 queue","customer abandonment","throughput maximization","optimal policy","SREPT","Erlang distribution","hyperexponential distribution"],"falsifier":"A simulation or calculation showing that for an Erlang-K service time with observable phases, a policy other than SREPT achieves strictly higher long-run average throughput would disprove the claim.","tokens_in":2493,"feed_emoji":"📈","tokens_out":598,"duration_ms":40582,"temperature":0.7,"pith_summary":"This paper shows that the Shortest Remaining Expected Processing Time (SREPT) policy is optimal for maximizing throughput in a single-server queue with Poisson arrivals and exponential abandonment times. The optimality holds specifically when service times follow Erlang-K or hyperexponential distributions and the server can observe the service phase of each customer. The result is independent of the abandonment rate, meaning the policy performs best no matter how quickly customers leave. A reader would care because it gives a practical rule for server assignment that does not require knowing the abandonment rate in advance.","feed_headline":"SREPT policy maximizes queue throughput with abandonments","feed_subtitle":"It works for Erlang-K and hyperexponential services independent of abandonment rate when phases are observable.","key_machinery":"The Shortest Remaining Expected Processing Time (SREPT) policy that selects the customer with the shortest remaining expected processing time based on the observed phase.","core_discovery":"When service times follow either an Erlang-K or a hyperexponential distribution and the decision maker can observe the phase of a customer's service time, the Shortest Remaining Expected Processing Time (SREPT) policy maximizes the long-run average throughput, independent of the abandonment rate.","pith_inferences":["Without phase observability, the optimality may not hold and a different policy could be required.","The approach might extend to other phase-type distributions if similar phase information is available.","Testing the policy in simulation with these distributions could confirm the throughput gains."],"forward_implications":["The policy achieves maximum throughput regardless of the rate at which customers abandon.","Optimality requires the service time distribution to be either Erlang-K or hyperexponential.","Observability of the service phase is required to implement the policy.","The result applies to the M/G/1 queue setting with exponential patience times."],"fun_headline_variants":["SREPT maximizes throughput with abandonments","SREPT optimal for phased service distributions","SREPT policy for queues with observable phases","SREPT maximizes throughput regardless of abandonment rate"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The service times must be Erlang-K or hyperexponential and the decision maker must observe the current phase of each customer's service.","fun_headline_variants_meta":{"raw":{"variants":["SREPT maximizes throughput with abandonments","SREPT optimal for phased service distributions","SREPT policy for queues with observable phases","SREPT maximizes throughput regardless of abandonment rate"]},"model":"grok-4.3","cost_usd":0.004757,"raw_usage":{"total_tokens":2258,"prompt_tokens":495,"num_sources_used":0,"completion_tokens":55,"cost_in_usd_ticks":47574500,"prompt_tokens_details":{"text_tokens":495,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1708,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":495,"tokens_out":55,"duration_ms":14778,"temperature":1.0,"reasoning_tokens":1708,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T04:07:55.404789+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A simulation or calculation showing that for an Erlang-K service time with observable phases, a policy other than SREPT achieves strictly higher long-run average throughput would disprove the claim.","supporting_citations":[],"review_version":1}