{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KAQXP2JDXFMU3NWYAYQF4C7R3M","short_pith_number":"pith:KAQXP2JD","canonical_record":{"source":{"id":"1104.3192","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-16T03:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"4764c705e91b111ab9675105d8356ee0c992ce264a787cf91aac76d578c764a8","abstract_canon_sha256":"984ace98718a076bdcbd0b32400d895f08b5ec81c68c2b821f50d755231cadd8"},"schema_version":"1.0"},"canonical_sha256":"502177e923b9594db6d806205e0bf1db00f27d0394a54627ebf0f26e048fc111","source":{"kind":"arxiv","id":"1104.3192","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3192","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3192v2","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3192","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"pith_short_12","alias_value":"KAQXP2JDXFMU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KAQXP2JDXFMU3NWY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KAQXP2JD","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KAQXP2JDXFMU3NWYAYQF4C7R3M","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3192","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-16T03:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"4764c705e91b111ab9675105d8356ee0c992ce264a787cf91aac76d578c764a8","abstract_canon_sha256":"984ace98718a076bdcbd0b32400d895f08b5ec81c68c2b821f50d755231cadd8"},"schema_version":"1.0"},"canonical_sha256":"502177e923b9594db6d806205e0bf1db00f27d0394a54627ebf0f26e048fc111","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:28.345693Z","signature_b64":"YHoxIhXHAiSQq75PwXBuyt8f/X4kHX3LdVNIZGkhSyQVgN+wi18qiE1leBGZ9A0caZF5FsN8alZUbOCu/0lKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502177e923b9594db6d806205e0bf1db00f27d0394a54627ebf0f26e048fc111","last_reissued_at":"2026-05-18T03:30:28.344796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:28.344796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3192","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:30:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C3bsEh5urtasfdUEuBWjbGQg3RhxrW+I8q2Sz+jFcFfeNSPyf5DGMHjPVrqUTPJImwss+W2Vc4dfs9Ei5yNoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:05:50.351705Z"},"content_sha256":"ffd63c68f7c0826deea1665da32c3d94d429e2d4ac9ea5ed7c8868904f518fc7","schema_version":"1.0","event_id":"sha256:ffd63c68f7c0826deea1665da32c3d94d429e2d4ac9ea5ed7c8868904f518fc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KAQXP2JDXFMU3NWYAYQF4C7R3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Large Delays in Multi-Server Queues with Heavy Tails","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dmitry Korshunov, Sergey Foss","submitted_at":"2011-04-16T03:44:09Z","abstract_excerpt":"We present upper and lower bounds for the tail distribution of the stationary waiting time $D$ in the stable $GI/GI/s$ FCFS queue. These bounds depend on the value of the traffic load $\\rho$ which is the ratio of mean service and mean interarrival times. For service times with intermediate regularly varying tail distribution the bounds are exact up to a constant, and we are able to establish a `principle of $s-k$ big jumps' in this case (here $k$ is the integer part of $\\rho$), which gives the most probable way for the stationary waiting time to be large.\n  Another corollary of the bounds obta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3192","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:30:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/xrzOZk5W8/CL5+tD25bRbOUoDYuFHbURd/t0aW9TgMp7Bms01919cAG4m1+wjhZnEFL8wb7V9tVN/Sej0xCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:05:50.352048Z"},"content_sha256":"c63935bc44cabbb0665c688cf534fdbc38acdef580ff4ded48de0a820a0592c0","schema_version":"1.0","event_id":"sha256:c63935bc44cabbb0665c688cf534fdbc38acdef580ff4ded48de0a820a0592c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAQXP2JDXFMU3NWYAYQF4C7R3M/bundle.json","state_url":"https://pith.science/pith/KAQXP2JDXFMU3NWYAYQF4C7R3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAQXP2JDXFMU3NWYAYQF4C7R3M/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-28T04:05:50Z","links":{"resolver":"https://pith.science/pith/KAQXP2JDXFMU3NWYAYQF4C7R3M","bundle":"https://pith.science/pith/KAQXP2JDXFMU3NWYAYQF4C7R3M/bundle.json","state":"https://pith.science/pith/KAQXP2JDXFMU3NWYAYQF4C7R3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAQXP2JDXFMU3NWYAYQF4C7R3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KAQXP2JDXFMU3NWYAYQF4C7R3M","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":"984ace98718a076bdcbd0b32400d895f08b5ec81c68c2b821f50d755231cadd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-16T03:44:09Z","title_canon_sha256":"4764c705e91b111ab9675105d8356ee0c992ce264a787cf91aac76d578c764a8"},"schema_version":"1.0","source":{"id":"1104.3192","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3192","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3192v2","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3192","created_at":"2026-05-18T03:30:28Z"},{"alias_kind":"pith_short_12","alias_value":"KAQXP2JDXFMU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KAQXP2JDXFMU3NWY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KAQXP2JD","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:c63935bc44cabbb0665c688cf534fdbc38acdef580ff4ded48de0a820a0592c0","target":"graph","created_at":"2026-05-18T03:30:28Z","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 upper and lower bounds for the tail distribution of the stationary waiting time $D$ in the stable $GI/GI/s$ FCFS queue. These bounds depend on the value of the traffic load $\\rho$ which is the ratio of mean service and mean interarrival times. For service times with intermediate regularly varying tail distribution the bounds are exact up to a constant, and we are able to establish a `principle of $s-k$ big jumps' in this case (here $k$ is the integer part of $\\rho$), which gives the most probable way for the stationary waiting time to be large.\n  Another corollary of the bounds obta","authors_text":"Dmitry Korshunov, Sergey Foss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-16T03:44:09Z","title":"On Large Delays in Multi-Server Queues with Heavy Tails"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3192","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:ffd63c68f7c0826deea1665da32c3d94d429e2d4ac9ea5ed7c8868904f518fc7","target":"record","created_at":"2026-05-18T03:30:28Z","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":"984ace98718a076bdcbd0b32400d895f08b5ec81c68c2b821f50d755231cadd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-16T03:44:09Z","title_canon_sha256":"4764c705e91b111ab9675105d8356ee0c992ce264a787cf91aac76d578c764a8"},"schema_version":"1.0","source":{"id":"1104.3192","kind":"arxiv","version":2}},"canonical_sha256":"502177e923b9594db6d806205e0bf1db00f27d0394a54627ebf0f26e048fc111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"502177e923b9594db6d806205e0bf1db00f27d0394a54627ebf0f26e048fc111","first_computed_at":"2026-05-18T03:30:28.344796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:28.344796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YHoxIhXHAiSQq75PwXBuyt8f/X4kHX3LdVNIZGkhSyQVgN+wi18qiE1leBGZ9A0caZF5FsN8alZUbOCu/0lKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:28.345693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3192","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffd63c68f7c0826deea1665da32c3d94d429e2d4ac9ea5ed7c8868904f518fc7","sha256:c63935bc44cabbb0665c688cf534fdbc38acdef580ff4ded48de0a820a0592c0"],"state_sha256":"1e8e208b356f7b7642469b1f153b4f074b3a505d5912f6497ed352661a9f7b9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N72EsXhpvkFgnzI9ZC4AwIYQClxtQTYbcKXoMVqRCDRmCd+87r+kddGPX2/uipip+ex7UV3VL91gDUO0J5FRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:05:50.353989Z","bundle_sha256":"feb18faf4d3c609c0bf6a9bf86e3fac7b137260b34db3d1164fddb0b15fb6ad7"}}