{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MVUFTM2Z6NOE6MWGSXOYPTUBX6","short_pith_number":"pith:MVUFTM2Z","canonical_record":{"source":{"id":"1609.09634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-30T08:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"deb42d5b6e5957374ef180e3a975787925676e10675a61e5924cd7fa3f133302","abstract_canon_sha256":"d3883955c6b5e30a155d9dd1b99b5f30f942d22ecf907ecd71d1ec13b00673be"},"schema_version":"1.0"},"canonical_sha256":"656859b359f35c4f32c695dd87ce81bf96566d8a2d1e283852dc707abc39d245","source":{"kind":"arxiv","id":"1609.09634","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09634","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09634v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09634","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"MVUFTM2Z6NOE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVUFTM2Z6NOE6MWG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVUFTM2Z","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MVUFTM2Z6NOE6MWGSXOYPTUBX6","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-30T08:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"deb42d5b6e5957374ef180e3a975787925676e10675a61e5924cd7fa3f133302","abstract_canon_sha256":"d3883955c6b5e30a155d9dd1b99b5f30f942d22ecf907ecd71d1ec13b00673be"},"schema_version":"1.0"},"canonical_sha256":"656859b359f35c4f32c695dd87ce81bf96566d8a2d1e283852dc707abc39d245","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:35.496756Z","signature_b64":"yJrLW2WVrrUCbMb32pl88ZD/f6yIpjlPgxkj3Jh+wCk0teg+eKE8BXKCFfpgLU5FyragvYEtuMdd8KkhJFA5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656859b359f35c4f32c695dd87ce81bf96566d8a2d1e283852dc707abc39d245","last_reissued_at":"2026-05-18T01:03:35.496135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:35.496135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09634","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-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1glGCJVZyUhcJLmjaZEb1VvKBDTQP/fKkOdMG9AovTdvUGWGADOCJ7HTyFvzJ8llWxuY4gzrAUsF/aj9znq5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:39:21.468372Z"},"content_sha256":"d399e45784b7829408721e6cbd6311a4a54a08a222d4e96b25cad79af637c736","schema_version":"1.0","event_id":"sha256:d399e45784b7829408721e6cbd6311a4a54a08a222d4e96b25cad79af637c736"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MVUFTM2Z6NOE6MWGSXOYPTUBX6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the rate of convergence for inhomogeneous $M/M/S$ systems with either state-dependent transitions, or batch arrivals and service, or both","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Zeifman, Anna Korotysheva, Ksenia Kiseleva, Rostislav Razumchik, Victor Korolev, Yacov Satin","submitted_at":"2016-09-30T08:45:21Z","abstract_excerpt":"In this paper one presents method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically one considers inhomogeneous $M/M/S$ queueing system with possibly state-dependent arrival and service intensities and additionally possible batch arrivals and batch service. The unified approach based on logarithmic norm of linear operators for obtaining sharp upper and lower bounds on the rate of convergence and corresponding sharp perturbation bounds is described. As a side result, one shows by virtue of numerical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09634","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-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8fMdq9CRLAapuA4yrnutghz+0SBOxhMGNQLTkRmLNB0tXdiCUkR04/dMtVlphCX8vWlOVNG9vdZ88Yf26a3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:39:21.468724Z"},"content_sha256":"5b34a60523189f3d166f515ec41b0b9ad7b0399f47c9570c376e0f9e1edf7a81","schema_version":"1.0","event_id":"sha256:5b34a60523189f3d166f515ec41b0b9ad7b0399f47c9570c376e0f9e1edf7a81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVUFTM2Z6NOE6MWGSXOYPTUBX6/bundle.json","state_url":"https://pith.science/pith/MVUFTM2Z6NOE6MWGSXOYPTUBX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVUFTM2Z6NOE6MWGSXOYPTUBX6/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-27T22:39:21Z","links":{"resolver":"https://pith.science/pith/MVUFTM2Z6NOE6MWGSXOYPTUBX6","bundle":"https://pith.science/pith/MVUFTM2Z6NOE6MWGSXOYPTUBX6/bundle.json","state":"https://pith.science/pith/MVUFTM2Z6NOE6MWGSXOYPTUBX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVUFTM2Z6NOE6MWGSXOYPTUBX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MVUFTM2Z6NOE6MWGSXOYPTUBX6","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":"d3883955c6b5e30a155d9dd1b99b5f30f942d22ecf907ecd71d1ec13b00673be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-30T08:45:21Z","title_canon_sha256":"deb42d5b6e5957374ef180e3a975787925676e10675a61e5924cd7fa3f133302"},"schema_version":"1.0","source":{"id":"1609.09634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09634","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09634v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09634","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"MVUFTM2Z6NOE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVUFTM2Z6NOE6MWG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVUFTM2Z","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:5b34a60523189f3d166f515ec41b0b9ad7b0399f47c9570c376e0f9e1edf7a81","target":"graph","created_at":"2026-05-18T01:03: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":"In this paper one presents method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically one considers inhomogeneous $M/M/S$ queueing system with possibly state-dependent arrival and service intensities and additionally possible batch arrivals and batch service. The unified approach based on logarithmic norm of linear operators for obtaining sharp upper and lower bounds on the rate of convergence and corresponding sharp perturbation bounds is described. As a side result, one shows by virtue of numerical","authors_text":"Alexander Zeifman, Anna Korotysheva, Ksenia Kiseleva, Rostislav Razumchik, Victor Korolev, Yacov Satin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-30T08:45:21Z","title":"Bounds on the rate of convergence for inhomogeneous $M/M/S$ systems with either state-dependent transitions, or batch arrivals and service, or both"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09634","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:d399e45784b7829408721e6cbd6311a4a54a08a222d4e96b25cad79af637c736","target":"record","created_at":"2026-05-18T01:03: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":"d3883955c6b5e30a155d9dd1b99b5f30f942d22ecf907ecd71d1ec13b00673be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-30T08:45:21Z","title_canon_sha256":"deb42d5b6e5957374ef180e3a975787925676e10675a61e5924cd7fa3f133302"},"schema_version":"1.0","source":{"id":"1609.09634","kind":"arxiv","version":1}},"canonical_sha256":"656859b359f35c4f32c695dd87ce81bf96566d8a2d1e283852dc707abc39d245","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"656859b359f35c4f32c695dd87ce81bf96566d8a2d1e283852dc707abc39d245","first_computed_at":"2026-05-18T01:03:35.496135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:35.496135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJrLW2WVrrUCbMb32pl88ZD/f6yIpjlPgxkj3Jh+wCk0teg+eKE8BXKCFfpgLU5FyragvYEtuMdd8KkhJFA5CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:35.496756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d399e45784b7829408721e6cbd6311a4a54a08a222d4e96b25cad79af637c736","sha256:5b34a60523189f3d166f515ec41b0b9ad7b0399f47c9570c376e0f9e1edf7a81"],"state_sha256":"44cdc81ae166786f8626b9db5966a7c004c50244e6fa538a346a313a993d47f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUCP7qy8b/ZxLK5ngkUZJ5C+EYEHrzb7BT7rZB3RgfoQoc68fGq3ZDF74ogOiHJuOvhM2Esg1IvgO1N8Hkj3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:39:21.471042Z","bundle_sha256":"c8966925273fba41ff7bff6cd3b1236868a385a18eb9e0c31bbf3056353b7588"}}