{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4TWF7KLLJOY7M2XYWY2DOAFN4H","short_pith_number":"pith:4TWF7KLL","schema_version":"1.0","canonical_sha256":"e4ec5fa96b4bb1f66af8b6343700ade1c5513a9e49b980047732237dd0aabe6c","source":{"kind":"arxiv","id":"2606.26544","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Douglas G. Down, Hayriye Ayhan, Runhua Wu","submitted_at":"2026-06-25T02:39:08Z","abstract_excerpt":"This paper studies the problem of identifying the optimal server assignment policy in single-server queues with customer abandonment. We consider a system with Poisson arrivals and exponentially distributed patience times. We show that 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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.26544","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-25T02:39:08Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2b91315da90d568d41cd1f33fe23c8015a642cc224f10db6a705cd99602cad7f","abstract_canon_sha256":"a3355aa0dba878b801cba57d9e7c28a5527c1817df454d33cffe7bc5e925cd39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:34.160754Z","signature_b64":"Elv3+yAJR1MsOP8qcnlE0p1a5N+Zuon6PLlsEA1lozj2vbwJhbOknAMxDi5f68rBKGt1V4XTtwKI21OrwfcCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ec5fa96b4bb1f66af8b6343700ade1c5513a9e49b980047732237dd0aabe6c","last_reissued_at":"2026-06-26T01:15:34.160227Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:34.160227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Throughput in an M/G/1 Queue with Customer Abandonments","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Douglas G. Down, Hayriye Ayhan, Runhua Wu","submitted_at":"2026-06-25T02:39:08Z","abstract_excerpt":"This paper studies the problem of identifying the optimal server assignment policy in single-server queues with customer abandonment. We consider a system with Poisson arrivals and exponentially distributed patience times. We show that 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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26544","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.26544/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.26544","created_at":"2026-06-26T01:15:34.160321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26544v1","created_at":"2026-06-26T01:15:34.160321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26544","created_at":"2026-06-26T01:15:34.160321+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TWF7KLLJOY7","created_at":"2026-06-26T01:15:34.160321+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TWF7KLLJOY7M2XY","created_at":"2026-06-26T01:15:34.160321+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TWF7KLL","created_at":"2026-06-26T01:15:34.160321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H","json":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H.json","graph_json":"https://pith.science/api/pith-number/4TWF7KLLJOY7M2XYWY2DOAFN4H/graph.json","events_json":"https://pith.science/api/pith-number/4TWF7KLLJOY7M2XYWY2DOAFN4H/events.json","paper":"https://pith.science/paper/4TWF7KLL"},"agent_actions":{"view_html":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H","download_json":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H.json","view_paper":"https://pith.science/paper/4TWF7KLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26544&json=true","fetch_graph":"https://pith.science/api/pith-number/4TWF7KLLJOY7M2XYWY2DOAFN4H/graph.json","fetch_events":"https://pith.science/api/pith-number/4TWF7KLLJOY7M2XYWY2DOAFN4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H/action/storage_attestation","attest_author":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H/action/author_attestation","sign_citation":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H/action/citation_signature","submit_replication":"https://pith.science/pith/4TWF7KLLJOY7M2XYWY2DOAFN4H/action/replication_record"}},"created_at":"2026-06-26T01:15:34.160321+00:00","updated_at":"2026-06-26T01:15:34.160321+00:00"}