{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UTPPH26D7NJZHPVQBPUIA4GAFH","short_pith_number":"pith:UTPPH26D","schema_version":"1.0","canonical_sha256":"a4def3ebc3fb5393beb00be88070c029c89b46ac4a26620c60c5fd46c892b860","source":{"kind":"arxiv","id":"1602.02866","version":1},"attestation_state":"computed","paper":{"title":"High order steady-state diffusion approximation of the Erlang-C system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Braverman, J.G. Dai","submitted_at":"2016-02-09T05:42:57Z","abstract_excerpt":"In this paper we introduce a new diffusion approximation for the steady-state customer count of the Erlang-C system. Unlike previous diffusion approximations, which use the steady-state distribution of a diffusion process with a constant diffusion coefficient, our approximation uses the steady-state distribution of a diffusion process with a \\textit{state-dependent} diffusion coefficient. We show, both analytically and numerically, that our new approximation is an order of magnitude better than its counterpart. To obtain the analytical results, we use Stein's to show that a variant of the Wass"},"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":"1602.02866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-09T05:42:57Z","cross_cats_sorted":[],"title_canon_sha256":"5edf7cc2d941b3bf4eb3f6d0f0ec11e1dfa00bf539375a35d0bad343768be4ff","abstract_canon_sha256":"c027b06aadf491e3e7b7abb01bd59ca34fb52870568e49987a759bd13806683b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:07.929542Z","signature_b64":"EKvNAXoQm5WN2jxAqhSmO9LwmKrVnlzp43R45R0wklc5NDxw54uXYBBzfmIEWYQO/UBrmpK+waOtmcpH40cDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4def3ebc3fb5393beb00be88070c029c89b46ac4a26620c60c5fd46c892b860","last_reissued_at":"2026-05-18T01:21:07.928844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:07.928844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High order steady-state diffusion approximation of the Erlang-C system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anton Braverman, J.G. Dai","submitted_at":"2016-02-09T05:42:57Z","abstract_excerpt":"In this paper we introduce a new diffusion approximation for the steady-state customer count of the Erlang-C system. Unlike previous diffusion approximations, which use the steady-state distribution of a diffusion process with a constant diffusion coefficient, our approximation uses the steady-state distribution of a diffusion process with a \\textit{state-dependent} diffusion coefficient. We show, both analytically and numerically, that our new approximation is an order of magnitude better than its counterpart. To obtain the analytical results, we use Stein's to show that a variant of the Wass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02866","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":"1602.02866","created_at":"2026-05-18T01:21:07.928941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02866v1","created_at":"2026-05-18T01:21:07.928941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02866","created_at":"2026-05-18T01:21:07.928941+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTPPH26D7NJZ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTPPH26D7NJZHPVQ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTPPH26D","created_at":"2026-05-18T12:30:46.583412+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":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH","json":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH.json","graph_json":"https://pith.science/api/pith-number/UTPPH26D7NJZHPVQBPUIA4GAFH/graph.json","events_json":"https://pith.science/api/pith-number/UTPPH26D7NJZHPVQBPUIA4GAFH/events.json","paper":"https://pith.science/paper/UTPPH26D"},"agent_actions":{"view_html":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH","download_json":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH.json","view_paper":"https://pith.science/paper/UTPPH26D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02866&json=true","fetch_graph":"https://pith.science/api/pith-number/UTPPH26D7NJZHPVQBPUIA4GAFH/graph.json","fetch_events":"https://pith.science/api/pith-number/UTPPH26D7NJZHPVQBPUIA4GAFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH/action/storage_attestation","attest_author":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH/action/author_attestation","sign_citation":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH/action/citation_signature","submit_replication":"https://pith.science/pith/UTPPH26D7NJZHPVQBPUIA4GAFH/action/replication_record"}},"created_at":"2026-05-18T01:21:07.928941+00:00","updated_at":"2026-05-18T01:21:07.928941+00:00"}