{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6CSWQPSL6QADSJKYEJDXPQOSUU","short_pith_number":"pith:6CSWQPSL","canonical_record":{"source":{"id":"1201.2978","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-14T02:13:38Z","cross_cats_sorted":[],"title_canon_sha256":"3e14a355d1b8d22c5ec7b21db95fabc256847742136832fc871ee97d87ead609","abstract_canon_sha256":"4406be8fa8f7af5079a07724c4d31954e92109b238f9d5ff090a9771f2192fac"},"schema_version":"1.0"},"canonical_sha256":"f0a5683e4bf400392558224777c1d2a53baa4ebf60b084b8ae713fca4ffb758a","source":{"kind":"arxiv","id":"1201.2978","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2978","created_at":"2026-05-18T02:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2978v4","created_at":"2026-05-18T02:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2978","created_at":"2026-05-18T02:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"6CSWQPSL6QAD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6CSWQPSL6QADSJKY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6CSWQPSL","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6CSWQPSL6QADSJKYEJDXPQOSUU","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2978","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-14T02:13:38Z","cross_cats_sorted":[],"title_canon_sha256":"3e14a355d1b8d22c5ec7b21db95fabc256847742136832fc871ee97d87ead609","abstract_canon_sha256":"4406be8fa8f7af5079a07724c4d31954e92109b238f9d5ff090a9771f2192fac"},"schema_version":"1.0"},"canonical_sha256":"f0a5683e4bf400392558224777c1d2a53baa4ebf60b084b8ae713fca4ffb758a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:03.411681Z","signature_b64":"q2RObniKZ6xSb+f8PvaUrF8quZdcieAgY5YkHBvHjBOy0n13++pKGwWNwnm+Xtnh3CHg3FeWpvf7j2ZVkc3HAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a5683e4bf400392558224777c1d2a53baa4ebf60b084b8ae713fca4ffb758a","last_reissued_at":"2026-05-18T02:46:03.411180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:03.411180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2978","source_version":4,"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:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tk85RWtyefI6mW3CEeUl+sO53H6/W1gTNfpVxJmDCWcDqmcpLgWlKSVCVJL+nAba0fTVVosP6ixfVo1B/SxmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:37:41.934189Z"},"content_sha256":"223d292bdb2a04bed12a3f428114bf4f4ea93ef096499bcc981fd8a334442e50","schema_version":"1.0","event_id":"sha256:223d292bdb2a04bed12a3f428114bf4f4ea93ef096499bcc981fd8a334442e50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6CSWQPSL6QADSJKYEJDXPQOSUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tightness of invariant distributions of a large-scale flexible service system under a priority discipline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Stolyar, Elena Yudovina","submitted_at":"2012-01-14T02:13:38Z","abstract_excerpt":"We consider large-scale service systems with multiple customer classes and multiple server pools; interarrival and service times are exponentially distributed, and mean service times depend both on the customer class and server pool. It is assumed that the allowed activities (routing choices) form a tree (in the graph with vertices being both customer classes and server pools). We study the behavior of the system under a Leaf Activity Priority (LAP) policy, which assigns static priorities to the activities in the order of sequential \"elimination\" of the tree leaves.\n  We consider the scaling l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2978","kind":"arxiv","version":4},"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:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KT+NzG8aV7bLDa75nWSnC6MztIsmEIVNn6CDii2G8JNfnzeCv5OPfmZXO0NA92pnAyx9NJ6ASPiUCaVMK2WBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:37:41.934547Z"},"content_sha256":"01b38345d26d0405b8dcfce757bdf58e0e4ff99df2a3b03615ad10f8b85ded2a","schema_version":"1.0","event_id":"sha256:01b38345d26d0405b8dcfce757bdf58e0e4ff99df2a3b03615ad10f8b85ded2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CSWQPSL6QADSJKYEJDXPQOSUU/bundle.json","state_url":"https://pith.science/pith/6CSWQPSL6QADSJKYEJDXPQOSUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CSWQPSL6QADSJKYEJDXPQOSUU/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-20T14:37:41Z","links":{"resolver":"https://pith.science/pith/6CSWQPSL6QADSJKYEJDXPQOSUU","bundle":"https://pith.science/pith/6CSWQPSL6QADSJKYEJDXPQOSUU/bundle.json","state":"https://pith.science/pith/6CSWQPSL6QADSJKYEJDXPQOSUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CSWQPSL6QADSJKYEJDXPQOSUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6CSWQPSL6QADSJKYEJDXPQOSUU","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":"4406be8fa8f7af5079a07724c4d31954e92109b238f9d5ff090a9771f2192fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-14T02:13:38Z","title_canon_sha256":"3e14a355d1b8d22c5ec7b21db95fabc256847742136832fc871ee97d87ead609"},"schema_version":"1.0","source":{"id":"1201.2978","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2978","created_at":"2026-05-18T02:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2978v4","created_at":"2026-05-18T02:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2978","created_at":"2026-05-18T02:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"6CSWQPSL6QAD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6CSWQPSL6QADSJKY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6CSWQPSL","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:01b38345d26d0405b8dcfce757bdf58e0e4ff99df2a3b03615ad10f8b85ded2a","target":"graph","created_at":"2026-05-18T02:46:03Z","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 large-scale service systems with multiple customer classes and multiple server pools; interarrival and service times are exponentially distributed, and mean service times depend both on the customer class and server pool. It is assumed that the allowed activities (routing choices) form a tree (in the graph with vertices being both customer classes and server pools). We study the behavior of the system under a Leaf Activity Priority (LAP) policy, which assigns static priorities to the activities in the order of sequential \"elimination\" of the tree leaves.\n  We consider the scaling l","authors_text":"Alexander Stolyar, Elena Yudovina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-14T02:13:38Z","title":"Tightness of invariant distributions of a large-scale flexible service system under a priority discipline"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2978","kind":"arxiv","version":4},"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:223d292bdb2a04bed12a3f428114bf4f4ea93ef096499bcc981fd8a334442e50","target":"record","created_at":"2026-05-18T02:46:03Z","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":"4406be8fa8f7af5079a07724c4d31954e92109b238f9d5ff090a9771f2192fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-14T02:13:38Z","title_canon_sha256":"3e14a355d1b8d22c5ec7b21db95fabc256847742136832fc871ee97d87ead609"},"schema_version":"1.0","source":{"id":"1201.2978","kind":"arxiv","version":4}},"canonical_sha256":"f0a5683e4bf400392558224777c1d2a53baa4ebf60b084b8ae713fca4ffb758a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a5683e4bf400392558224777c1d2a53baa4ebf60b084b8ae713fca4ffb758a","first_computed_at":"2026-05-18T02:46:03.411180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:03.411180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q2RObniKZ6xSb+f8PvaUrF8quZdcieAgY5YkHBvHjBOy0n13++pKGwWNwnm+Xtnh3CHg3FeWpvf7j2ZVkc3HAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:03.411681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2978","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:223d292bdb2a04bed12a3f428114bf4f4ea93ef096499bcc981fd8a334442e50","sha256:01b38345d26d0405b8dcfce757bdf58e0e4ff99df2a3b03615ad10f8b85ded2a"],"state_sha256":"0370897aa374654c3d25ee138745bf23094804b5e9638f24c2a30184bbb3474f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8Pd9dI+YZnMUhEu1Bhcjno/K9zESqFUMrnYiCkD158rQTngUPGHhcCwdAvzbVZarLPCK2eP47oEoaU6noMwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:37:41.936784Z","bundle_sha256":"154c48458b32f8118671f5b0b9abad4978d2b2e44660160ecb427b9a2f2287c8"}}