{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K4M4V5VE7O4CYSCZFYQD5BG4DQ","short_pith_number":"pith:K4M4V5VE","canonical_record":{"source":{"id":"1309.2700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-11T00:31:43Z","cross_cats_sorted":[],"title_canon_sha256":"4a16bb0f47c180d7199b5096cd02ae7df447623995bf9458b72bb348b0c3ac78","abstract_canon_sha256":"08383894b63f431f4d3b34236587bff8fad467a923b31d1a1e67b79cf4d83de4"},"schema_version":"1.0"},"canonical_sha256":"5719caf6a4fbb82c48592e203e84dc1c3e5a285ffc36449c18d72806e2345268","source":{"kind":"arxiv","id":"1309.2700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2700","created_at":"2026-05-18T03:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2700v1","created_at":"2026-05-18T03:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2700","created_at":"2026-05-18T03:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"K4M4V5VE7O4C","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K4M4V5VE7O4CYSCZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K4M4V5VE","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K4M4V5VE7O4CYSCZFYQD5BG4DQ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.2700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-11T00:31:43Z","cross_cats_sorted":[],"title_canon_sha256":"4a16bb0f47c180d7199b5096cd02ae7df447623995bf9458b72bb348b0c3ac78","abstract_canon_sha256":"08383894b63f431f4d3b34236587bff8fad467a923b31d1a1e67b79cf4d83de4"},"schema_version":"1.0"},"canonical_sha256":"5719caf6a4fbb82c48592e203e84dc1c3e5a285ffc36449c18d72806e2345268","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:35.153072Z","signature_b64":"bk9JRQuDEfqYZjxEkXZFBKMH5UV2JkBYUnDomZw7yjv1OY77+X2VTT2turPo+OWikzDThMyDV3po2ZfYXJrzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5719caf6a4fbb82c48592e203e84dc1c3e5a285ffc36449c18d72806e2345268","last_reissued_at":"2026-05-18T03:13:35.152485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:35.152485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.2700","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-18T03:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORyI54/QfXivTdg/TWleE45rc/+2z9ud/1+AVaa0CjWITt+Ep1/J9KoB7L8vMs0CO89JFYjZwoNoNqJ5oxFXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:01:14.247422Z"},"content_sha256":"f567d4fd5df750756eedb66360c4bddf3a85ef840b968df8c8c534b88dbfa206","schema_version":"1.0","event_id":"sha256:f567d4fd5df750756eedb66360c4bddf3a85ef840b968df8c8c534b88dbfa206"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K4M4V5VE7O4CYSCZFYQD5BG4DQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sojourn Time Distribution in a Finite Population Markovian Processor Sharing Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles Knessl, Johan S.H. van Leeuwaarden, Qiang Zhen","submitted_at":"2013-09-11T00:31:43Z","abstract_excerpt":"We consider a finite population processor-sharing (PS) queue, with Markovian arrivals and an exponential server. Such a queue can model an interactive computer system consisting of a bank of terminals in series with a central processing unit (CPU). For systems with a large population $N$ and a commensurately rapid service rate, or infrequent arrivals, we obtain various asymptotic results. We analyze the conditional sojourn time distribution of a tagged customer, conditioned on the number $n$ of others in the system at the tagged customer's arrival instant, and also the unconditional distributi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2700","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-18T03:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivx+gxTQDES3Vw2insvyMX+vqn46658bGy2/MIQH9uEedFCDwfWvMsX+dAuoBGi3kApJpdXvYRaMP1QBIUvGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:01:14.247768Z"},"content_sha256":"9b9af4982189b63daf1c91080a05b3b0c285871626bbbb2d9202e2ac6adb9355","schema_version":"1.0","event_id":"sha256:9b9af4982189b63daf1c91080a05b3b0c285871626bbbb2d9202e2ac6adb9355"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4M4V5VE7O4CYSCZFYQD5BG4DQ/bundle.json","state_url":"https://pith.science/pith/K4M4V5VE7O4CYSCZFYQD5BG4DQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4M4V5VE7O4CYSCZFYQD5BG4DQ/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-06-25T15:01:14Z","links":{"resolver":"https://pith.science/pith/K4M4V5VE7O4CYSCZFYQD5BG4DQ","bundle":"https://pith.science/pith/K4M4V5VE7O4CYSCZFYQD5BG4DQ/bundle.json","state":"https://pith.science/pith/K4M4V5VE7O4CYSCZFYQD5BG4DQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4M4V5VE7O4CYSCZFYQD5BG4DQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K4M4V5VE7O4CYSCZFYQD5BG4DQ","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":"08383894b63f431f4d3b34236587bff8fad467a923b31d1a1e67b79cf4d83de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-11T00:31:43Z","title_canon_sha256":"4a16bb0f47c180d7199b5096cd02ae7df447623995bf9458b72bb348b0c3ac78"},"schema_version":"1.0","source":{"id":"1309.2700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2700","created_at":"2026-05-18T03:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2700v1","created_at":"2026-05-18T03:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2700","created_at":"2026-05-18T03:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"K4M4V5VE7O4C","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K4M4V5VE7O4CYSCZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K4M4V5VE","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:9b9af4982189b63daf1c91080a05b3b0c285871626bbbb2d9202e2ac6adb9355","target":"graph","created_at":"2026-05-18T03:13:35Z","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 consider a finite population processor-sharing (PS) queue, with Markovian arrivals and an exponential server. Such a queue can model an interactive computer system consisting of a bank of terminals in series with a central processing unit (CPU). For systems with a large population $N$ and a commensurately rapid service rate, or infrequent arrivals, we obtain various asymptotic results. We analyze the conditional sojourn time distribution of a tagged customer, conditioned on the number $n$ of others in the system at the tagged customer's arrival instant, and also the unconditional distributi","authors_text":"Charles Knessl, Johan S.H. van Leeuwaarden, Qiang Zhen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-11T00:31:43Z","title":"On the Sojourn Time Distribution in a Finite Population Markovian Processor Sharing Queue"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2700","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:f567d4fd5df750756eedb66360c4bddf3a85ef840b968df8c8c534b88dbfa206","target":"record","created_at":"2026-05-18T03:13:35Z","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":"08383894b63f431f4d3b34236587bff8fad467a923b31d1a1e67b79cf4d83de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-11T00:31:43Z","title_canon_sha256":"4a16bb0f47c180d7199b5096cd02ae7df447623995bf9458b72bb348b0c3ac78"},"schema_version":"1.0","source":{"id":"1309.2700","kind":"arxiv","version":1}},"canonical_sha256":"5719caf6a4fbb82c48592e203e84dc1c3e5a285ffc36449c18d72806e2345268","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5719caf6a4fbb82c48592e203e84dc1c3e5a285ffc36449c18d72806e2345268","first_computed_at":"2026-05-18T03:13:35.152485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:35.152485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bk9JRQuDEfqYZjxEkXZFBKMH5UV2JkBYUnDomZw7yjv1OY77+X2VTT2turPo+OWikzDThMyDV3po2ZfYXJrzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:35.153072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f567d4fd5df750756eedb66360c4bddf3a85ef840b968df8c8c534b88dbfa206","sha256:9b9af4982189b63daf1c91080a05b3b0c285871626bbbb2d9202e2ac6adb9355"],"state_sha256":"d26f6c5bc9ef1689d997fd0b100ffeccaf7302599c614d657b5f03fffc0bd68a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9EVVhNayhkup1wZ0z6vMj4RHGsOKnmhFXjpZ4TYadN9nQH9UJ1BFvDvjyE8eCR6qtE767wYr7XFW5xmWdAPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T15:01:14.249840Z","bundle_sha256":"04a2e280b7cb937c576d047e07e2879430133c93d5f2535980d3064de6a1b376"}}