{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6NIOVPIFEW5CNO4MCNF5Y6SSEK","short_pith_number":"pith:6NIOVPIF","schema_version":"1.0","canonical_sha256":"f350eabd0525ba26bb8c134bdc7a5222a7435bbbd6bae596041cafa26b2b8861","source":{"kind":"arxiv","id":"1704.08398","version":1},"attestation_state":"computed","paper":{"title":"Stein's method for steady-state diffusion approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Braverman","submitted_at":"2017-04-27T01:10:31Z","abstract_excerpt":"Diffusion approximations have been a popular tool for performance analysis in queueing theory, with the main reason being tractability and computational efficiency. This dissertation is concerned with establishing theoretical guarantees on the performance of steady-state diffusion approximations of queueing systems. We develop a modular framework based on Stein's method that allows us to establish error bounds, or convergence rates, for the approximations. We apply this framework three queueing systems: the Erlang-C, Erlang-A, and $M/Ph/n+M$ systems.\n  The former two systems are simpler and al"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1704.08398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-27T01:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"30afb861c6cee8fd273c6cab35bdfb542bf0528ee8224ff8b8d83094fef0e86a","abstract_canon_sha256":"5ff6f5a39040fd6b4b521d809f994fd38dd3863bc18801e64de88b29c057d195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.789338Z","signature_b64":"0Yhj7Csa9tBm8/JW8ctW0orE1uatn0ataof1kB/1HRMMq5cDYPU80Kvh1LL1zyae6rS4icG1ZnfeN54oA/bsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f350eabd0525ba26bb8c134bdc7a5222a7435bbbd6bae596041cafa26b2b8861","last_reissued_at":"2026-05-18T00:45:27.788880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.788880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stein's method for steady-state diffusion approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Braverman","submitted_at":"2017-04-27T01:10:31Z","abstract_excerpt":"Diffusion approximations have been a popular tool for performance analysis in queueing theory, with the main reason being tractability and computational efficiency. This dissertation is concerned with establishing theoretical guarantees on the performance of steady-state diffusion approximations of queueing systems. We develop a modular framework based on Stein's method that allows us to establish error bounds, or convergence rates, for the approximations. We apply this framework three queueing systems: the Erlang-C, Erlang-A, and $M/Ph/n+M$ systems.\n  The former two systems are simpler and al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08398","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.08398","created_at":"2026-05-18T00:45:27.788952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08398v1","created_at":"2026-05-18T00:45:27.788952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08398","created_at":"2026-05-18T00:45:27.788952+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NIOVPIFEW5C","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NIOVPIFEW5CNO4M","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NIOVPIF","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.11015","citing_title":"A new $1/(1-\\rho)$-scaling bound for multiserver queues via a leave-one-out technique","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK","json":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK.json","graph_json":"https://pith.science/api/pith-number/6NIOVPIFEW5CNO4MCNF5Y6SSEK/graph.json","events_json":"https://pith.science/api/pith-number/6NIOVPIFEW5CNO4MCNF5Y6SSEK/events.json","paper":"https://pith.science/paper/6NIOVPIF"},"agent_actions":{"view_html":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK","download_json":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK.json","view_paper":"https://pith.science/paper/6NIOVPIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08398&json=true","fetch_graph":"https://pith.science/api/pith-number/6NIOVPIFEW5CNO4MCNF5Y6SSEK/graph.json","fetch_events":"https://pith.science/api/pith-number/6NIOVPIFEW5CNO4MCNF5Y6SSEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK/action/storage_attestation","attest_author":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK/action/author_attestation","sign_citation":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK/action/citation_signature","submit_replication":"https://pith.science/pith/6NIOVPIFEW5CNO4MCNF5Y6SSEK/action/replication_record"}},"created_at":"2026-05-18T00:45:27.788952+00:00","updated_at":"2026-05-18T00:45:27.788952+00:00"}