{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IXUXYH6QXTIRYF5OJSBXBIXFTB","short_pith_number":"pith:IXUXYH6Q","schema_version":"1.0","canonical_sha256":"45e97c1fd0bcd11c17ae4c8370a2e5984f5c41a3e3002cc2ff7373c6ed51b397","source":{"kind":"arxiv","id":"1211.0618","version":3},"attestation_state":"computed","paper":{"title":"Queuing with future information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.PF"],"primary_cat":"math.PR","authors_text":"Joel Spencer, Kuang Xu, Madhu Sudan","submitted_at":"2012-11-03T15:44:07Z","abstract_excerpt":"We study an admissions control problem, where a queue with service rate $1-p$ receives incoming jobs at rate $\\lambda\\in(1-p,1)$, and the decision maker is allowed to redirect away jobs up to a rate of $p$, with the objective of minimizing the time-average queue length. We show that the amount of information about the future has a significant impact on system performance, in the heavy-traffic regime. When the future is unknown, the optimal average queue length diverges at rate $\\sim\\log_{1/(1-p)}\\frac{1}{1-\\lambda}$, as $\\lambda\\to 1$. In sharp contrast, when all future arrival and service tim"},"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":"1211.0618","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-03T15:44:07Z","cross_cats_sorted":["cs.NI","cs.PF"],"title_canon_sha256":"63824e511b0323b297fe5fbde8a0c2d1a83fa81075f87f11eeb2c18ce5ea57bd","abstract_canon_sha256":"83bb3b92f83dcf43ecc11608ae5094c321aad30319fc642b5a6fe5b828d7687c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:27.531153Z","signature_b64":"RgHeaAJo7BzTUGssQcRmudjfrYN4LBLSYvEl2gpQMvBHXbT9kcFOGlvOKuSdhigY0PrLoh/CBQ5Jyg4sE5reBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e97c1fd0bcd11c17ae4c8370a2e5984f5c41a3e3002cc2ff7373c6ed51b397","last_reissued_at":"2026-05-18T02:48:27.530433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:27.530433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Queuing with future information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.PF"],"primary_cat":"math.PR","authors_text":"Joel Spencer, Kuang Xu, Madhu Sudan","submitted_at":"2012-11-03T15:44:07Z","abstract_excerpt":"We study an admissions control problem, where a queue with service rate $1-p$ receives incoming jobs at rate $\\lambda\\in(1-p,1)$, and the decision maker is allowed to redirect away jobs up to a rate of $p$, with the objective of minimizing the time-average queue length. We show that the amount of information about the future has a significant impact on system performance, in the heavy-traffic regime. When the future is unknown, the optimal average queue length diverges at rate $\\sim\\log_{1/(1-p)}\\frac{1}{1-\\lambda}$, as $\\lambda\\to 1$. In sharp contrast, when all future arrival and service tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0618","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1211.0618","created_at":"2026-05-18T02:48:27.530546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0618v3","created_at":"2026-05-18T02:48:27.530546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0618","created_at":"2026-05-18T02:48:27.530546+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXUXYH6QXTIR","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXUXYH6QXTIRYF5O","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXUXYH6Q","created_at":"2026-05-18T12:27:09.501522+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/IXUXYH6QXTIRYF5OJSBXBIXFTB","json":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB.json","graph_json":"https://pith.science/api/pith-number/IXUXYH6QXTIRYF5OJSBXBIXFTB/graph.json","events_json":"https://pith.science/api/pith-number/IXUXYH6QXTIRYF5OJSBXBIXFTB/events.json","paper":"https://pith.science/paper/IXUXYH6Q"},"agent_actions":{"view_html":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB","download_json":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB.json","view_paper":"https://pith.science/paper/IXUXYH6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0618&json=true","fetch_graph":"https://pith.science/api/pith-number/IXUXYH6QXTIRYF5OJSBXBIXFTB/graph.json","fetch_events":"https://pith.science/api/pith-number/IXUXYH6QXTIRYF5OJSBXBIXFTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB/action/storage_attestation","attest_author":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB/action/author_attestation","sign_citation":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB/action/citation_signature","submit_replication":"https://pith.science/pith/IXUXYH6QXTIRYF5OJSBXBIXFTB/action/replication_record"}},"created_at":"2026-05-18T02:48:27.530546+00:00","updated_at":"2026-05-18T02:48:27.530546+00:00"}