{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7UGUYP7VKY77XXY7TJJOS6LOJO","short_pith_number":"pith:7UGUYP7V","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"},"canonical_sha256":"fd0d4c3ff5563ffbdf1f9a52e9796e4b86ecce970fe0200c2c1f667b0775b356","source":{"kind":"arxiv","id":"1409.0153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0153","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0153v1","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0153","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"7UGUYP7VKY77","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7UGUYP7VKY77XXY7","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7UGUYP7V","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7UGUYP7VKY77XXY7TJJOS6LOJO","target":"record","payload":{"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"},"canonical_sha256":"fd0d4c3ff5563ffbdf1f9a52e9796e4b86ecce970fe0200c2c1f667b0775b356","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"},"source_kind":"arxiv","source_id":"1409.0153","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sy5P0HiMFIkEOp6CKt+LdYaxz12lMXaESVbHwSR7+tw7tqjCT6q6hLrvexgJdjdZhQeL5ZRCjN69edd96lfGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:25:32.733053Z"},"content_sha256":"b7d07d51a3414277d7cc86b937b96fc48922e5c41db9e5d568c0210530e26814","schema_version":"1.0","event_id":"sha256:b7d07d51a3414277d7cc86b937b96fc48922e5c41db9e5d568c0210530e26814"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7UGUYP7VKY77XXY7TJJOS6LOJO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+Ad1zA2ntXznavv38aTdozP8vddWJISzJMLMwANW7i/wPrmRHjWOIRAwhYG2FPwXvvB9m6TfN8HN03yQAqoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:25:32.733679Z"},"content_sha256":"86ea23c36499053bbe39e3767b8a1b5f6189e4739867084a0fddc7deba4739b8","schema_version":"1.0","event_id":"sha256:86ea23c36499053bbe39e3767b8a1b5f6189e4739867084a0fddc7deba4739b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/bundle.json","state_url":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T20:25:32Z","links":{"resolver":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO","bundle":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/bundle.json","state":"https://pith.science/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UGUYP7VKY77XXY7TJJOS6LOJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7UGUYP7VKY77XXY7TJJOS6LOJO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2121d64cbc21493ece3e73f882876f42837e822ac19c1d503e6ebf494f01ba90","cross_cats_sorted":["math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-08-30T19:45:54Z","title_canon_sha256":"7318680496dac36208310e4de66a50e0f35fa256dbd28c2299882fd075c28a7e"},"schema_version":"1.0","source":{"id":"1409.0153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0153","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0153v1","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0153","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"7UGUYP7VKY77","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7UGUYP7VKY77XXY7","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7UGUYP7V","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:86ea23c36499053bbe39e3767b8a1b5f6189e4739867084a0fddc7deba4739b8","target":"graph","created_at":"2026-05-18T02:43:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jiheng Zhang, Varun Gupta","cross_cats":["math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-08-30T19:45:54Z","title":"Approximations and Optimal Control for State-dependent Limited Processor Sharing Queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0153","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b7d07d51a3414277d7cc86b937b96fc48922e5c41db9e5d568c0210530e26814","target":"record","created_at":"2026-05-18T02:43:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2121d64cbc21493ece3e73f882876f42837e822ac19c1d503e6ebf494f01ba90","cross_cats_sorted":["math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-08-30T19:45:54Z","title_canon_sha256":"7318680496dac36208310e4de66a50e0f35fa256dbd28c2299882fd075c28a7e"},"schema_version":"1.0","source":{"id":"1409.0153","kind":"arxiv","version":1}},"canonical_sha256":"fd0d4c3ff5563ffbdf1f9a52e9796e4b86ecce970fe0200c2c1f667b0775b356","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd0d4c3ff5563ffbdf1f9a52e9796e4b86ecce970fe0200c2c1f667b0775b356","first_computed_at":"2026-05-18T02:43:53.238199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:53.238199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sry6toJrtMvmcOURntMnzk+VCvInDufBIRZwGDhNixIVMqveaSRicSPazrhZH4xblfKLQK0DQPGm4IR7o6NtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:53.238612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7d07d51a3414277d7cc86b937b96fc48922e5c41db9e5d568c0210530e26814","sha256:86ea23c36499053bbe39e3767b8a1b5f6189e4739867084a0fddc7deba4739b8"],"state_sha256":"6391c73c10ad89d5048e472def84758fb42809ae66da1ed671c3d5d60821216f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Pz8ts5x5AksHpBXy6Js7+ILA/T8XfLuZw18vekONB8OqyJWktIL/QL0nKFgXWYtTZvW36/sfVrUv1ZPQECCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:25:32.737234Z","bundle_sha256":"04cf914875acb9c1d49f04057b0e84d4c9d040f5c6c23bf1471c53441d4a607d"}}