{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RF22LLABED63K2L7KYBT6GE55W","short_pith_number":"pith:RF22LLAB","canonical_record":{"source":{"id":"1005.1035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-06T16:33:33Z","cross_cats_sorted":[],"title_canon_sha256":"0179a232ad0d947b83428acdc38a7921da04ca4b3c9e4e28ac82328e5938991e","abstract_canon_sha256":"5819abcbb2585e5f615ecee3710f9555ae0c13906fd919e5419ec244864a2d31"},"schema_version":"1.0"},"canonical_sha256":"8975a5ac0120fdb5697f56033f189ded84c8c34e23de9041b3489200b68934cc","source":{"kind":"arxiv","id":"1005.1035","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1035","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1035v2","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1035","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"RF22LLABED63","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RF22LLABED63K2L7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RF22LLAB","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RF22LLABED63K2L7KYBT6GE55W","target":"record","payload":{"canonical_record":{"source":{"id":"1005.1035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-06T16:33:33Z","cross_cats_sorted":[],"title_canon_sha256":"0179a232ad0d947b83428acdc38a7921da04ca4b3c9e4e28ac82328e5938991e","abstract_canon_sha256":"5819abcbb2585e5f615ecee3710f9555ae0c13906fd919e5419ec244864a2d31"},"schema_version":"1.0"},"canonical_sha256":"8975a5ac0120fdb5697f56033f189ded84c8c34e23de9041b3489200b68934cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:13.842141Z","signature_b64":"c1EuE25vQ8+C8yVsG44rkycOS4SLeSqsD7so36y9YQDJc8OZtsYjTJI9uedRTbwAmb0r5fOcmO4Q11Gyw1MdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8975a5ac0120fdb5697f56033f189ded84c8c34e23de9041b3489200b68934cc","last_reissued_at":"2026-05-18T03:44:13.841617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:13.841617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.1035","source_version":2,"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-18T03:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VImNpAZM3zuD41bktgbFe5kshL67VjQGvYmWatWNMjtkvPclyzZ6H1Tn712MMm2q5EETTbTvZ8sT78lW7umBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:59:33.315038Z"},"content_sha256":"3c8a433f555b73ab221003818bfbdbf876732d49999174962c9afac75343e418","schema_version":"1.0","event_id":"sha256:3c8a433f555b73ab221003818bfbdbf876732d49999174962c9afac75343e418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RF22LLABED63K2L7KYBT6GE55W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diffusion limits for shortest remaining processing time queues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amber L. Puha, H. Christian Gromoll, {\\L}ukasz Kruk","submitted_at":"2010-05-06T16:33:33Z","abstract_excerpt":"We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy traffic assumptions, we prove a diffusion limit theorem for a measure-valued state descriptor, from which we conclude a similar theorem for the queue length process. These results allow us to make some observations on the queue length optimality of SRPT. In particular, they provide the sharpest illustration of the well-known tension between queue length optimality"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1035","kind":"arxiv","version":2},"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-18T03:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZ9qqWyDLBegDq54EwJ2z7VonjaX3F3BgPxxYGo/WVNUsHzuc7uh5AkOOhcCbTASYbXVUmRwgXW9vSkNJOUPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:59:33.315396Z"},"content_sha256":"65218d79d2743742f7113504ae9ae0f1f2f95be062b619e6f96acfc0ef4b0438","schema_version":"1.0","event_id":"sha256:65218d79d2743742f7113504ae9ae0f1f2f95be062b619e6f96acfc0ef4b0438"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RF22LLABED63K2L7KYBT6GE55W/bundle.json","state_url":"https://pith.science/pith/RF22LLABED63K2L7KYBT6GE55W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RF22LLABED63K2L7KYBT6GE55W/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-07-01T21:59:33Z","links":{"resolver":"https://pith.science/pith/RF22LLABED63K2L7KYBT6GE55W","bundle":"https://pith.science/pith/RF22LLABED63K2L7KYBT6GE55W/bundle.json","state":"https://pith.science/pith/RF22LLABED63K2L7KYBT6GE55W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RF22LLABED63K2L7KYBT6GE55W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RF22LLABED63K2L7KYBT6GE55W","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":"5819abcbb2585e5f615ecee3710f9555ae0c13906fd919e5419ec244864a2d31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-06T16:33:33Z","title_canon_sha256":"0179a232ad0d947b83428acdc38a7921da04ca4b3c9e4e28ac82328e5938991e"},"schema_version":"1.0","source":{"id":"1005.1035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1035","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1035v2","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1035","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"RF22LLABED63","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RF22LLABED63K2L7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RF22LLAB","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:65218d79d2743742f7113504ae9ae0f1f2f95be062b619e6f96acfc0ef4b0438","target":"graph","created_at":"2026-05-18T03:44:13Z","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":"We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy traffic assumptions, we prove a diffusion limit theorem for a measure-valued state descriptor, from which we conclude a similar theorem for the queue length process. These results allow us to make some observations on the queue length optimality of SRPT. In particular, they provide the sharpest illustration of the well-known tension between queue length optimality","authors_text":"Amber L. Puha, H. Christian Gromoll, {\\L}ukasz Kruk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-06T16:33:33Z","title":"Diffusion limits for shortest remaining processing time queues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1035","kind":"arxiv","version":2},"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:3c8a433f555b73ab221003818bfbdbf876732d49999174962c9afac75343e418","target":"record","created_at":"2026-05-18T03:44:13Z","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":"5819abcbb2585e5f615ecee3710f9555ae0c13906fd919e5419ec244864a2d31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-06T16:33:33Z","title_canon_sha256":"0179a232ad0d947b83428acdc38a7921da04ca4b3c9e4e28ac82328e5938991e"},"schema_version":"1.0","source":{"id":"1005.1035","kind":"arxiv","version":2}},"canonical_sha256":"8975a5ac0120fdb5697f56033f189ded84c8c34e23de9041b3489200b68934cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8975a5ac0120fdb5697f56033f189ded84c8c34e23de9041b3489200b68934cc","first_computed_at":"2026-05-18T03:44:13.841617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:13.841617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1EuE25vQ8+C8yVsG44rkycOS4SLeSqsD7so36y9YQDJc8OZtsYjTJI9uedRTbwAmb0r5fOcmO4Q11Gyw1MdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:13.842141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.1035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c8a433f555b73ab221003818bfbdbf876732d49999174962c9afac75343e418","sha256:65218d79d2743742f7113504ae9ae0f1f2f95be062b619e6f96acfc0ef4b0438"],"state_sha256":"d0f9b7a8e6e6a41af9d1f710a0e1e9895745b618e610386808f8e5fbc664694e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKtED+kfr+rGT/McWo0kcfQu44GKDZWHNAT04pnWEiJR16Tg2a4aeJk14PhPFHUuFQlnW6xCjrFPTbaIj3hPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:59:33.317367Z","bundle_sha256":"3cef995acad9484b2fb6aa333b7abb4f9174c2aa4e52f80a06a425cf512fb4ed"}}