{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7UGUYP7VKY77XXY7TJJOS6LOJO","short_pith_number":"pith:7UGUYP7V","schema_version":"1.0","canonical_sha256":"fd0d4c3ff5563ffbdf1f9a52e9796e4b86ecce970fe0200c2c1f667b0775b356","source":{"kind":"arxiv","id":"1409.0153","version":1},"attestation_state":"computed","paper":{"title":"Approximations and Optimal Control for State-dependent Limited Processor Sharing Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.PR"],"primary_cat":"cs.SY","authors_text":"Jiheng Zhang, Varun Gupta","submitted_at":"2014-08-30T19:45:54Z","abstract_excerpt":"The paper studies approximations and control of a processor sharing (PS) server where the service rate depends on the number of jobs occupying the server. The control of such a system is implemented by imposing a limit on the number of jobs that can share the server concurrently, with the rest of the jobs waiting in a first-in-first-out (FIFO) buffer. A desirable control scheme should strike the right balance between efficiency (operating at a high service rate) and parallelism (preventing small jobs from getting stuck behind large ones).\n  We employ the framework of heavy-traffic diffusion an"},"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":"1409.0153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-08-30T19:45:54Z","cross_cats_sorted":["math.OC","math.PR"],"title_canon_sha256":"7318680496dac36208310e4de66a50e0f35fa256dbd28c2299882fd075c28a7e","abstract_canon_sha256":"2121d64cbc21493ece3e73f882876f42837e822ac19c1d503e6ebf494f01ba90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:53.238612Z","signature_b64":"Sry6toJrtMvmcOURntMnzk+VCvInDufBIRZwGDhNixIVMqveaSRicSPazrhZH4xblfKLQK0DQPGm4IR7o6NtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd0d4c3ff5563ffbdf1f9a52e9796e4b86ecce970fe0200c2c1f667b0775b356","last_reissued_at":"2026-05-18T02:43:53.238199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:53.238199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximations and Optimal Control for State-dependent Limited Processor Sharing Queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.PR"],"primary_cat":"cs.SY","authors_text":"Jiheng Zhang, Varun Gupta","submitted_at":"2014-08-30T19:45:54Z","abstract_excerpt":"The paper studies approximations and control of a processor sharing (PS) server where the service rate depends on the number of jobs occupying the server. The control of such a system is implemented by imposing a limit on the number of jobs that can share the server concurrently, with the rest of the jobs waiting in a first-in-first-out (FIFO) buffer. A desirable control scheme should strike the right balance between efficiency (operating at a high service rate) and parallelism (preventing small jobs from getting stuck behind large ones).\n  We employ the framework of heavy-traffic diffusion an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0153","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":""},"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":"1409.0153","created_at":"2026-05-18T02:43:53.238263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0153v1","created_at":"2026-05-18T02:43:53.238263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0153","created_at":"2026-05-18T02:43:53.238263+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UGUYP7VKY77","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UGUYP7VKY77XXY7","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UGUYP7V","created_at":"2026-05-18T12:28:19.803747+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/7UGUYP7VKY77XXY7TJJOS6LOJO","json":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO.json","graph_json":"https://pith.science/api/pith-number/7UGUYP7VKY77XXY7TJJOS6LOJO/graph.json","events_json":"https://pith.science/api/pith-number/7UGUYP7VKY77XXY7TJJOS6LOJO/events.json","paper":"https://pith.science/paper/7UGUYP7V"},"agent_actions":{"view_html":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO","download_json":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO.json","view_paper":"https://pith.science/paper/7UGUYP7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0153&json=true","fetch_graph":"https://pith.science/api/pith-number/7UGUYP7VKY77XXY7TJJOS6LOJO/graph.json","fetch_events":"https://pith.science/api/pith-number/7UGUYP7VKY77XXY7TJJOS6LOJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/action/storage_attestation","attest_author":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/action/author_attestation","sign_citation":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/action/citation_signature","submit_replication":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/action/replication_record"}},"created_at":"2026-05-18T02:43:53.238263+00:00","updated_at":"2026-05-18T02:43:53.238263+00:00"}