{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3BQHXBG4NRPGNNC657R3NDRORP","short_pith_number":"pith:3BQHXBG4","schema_version":"1.0","canonical_sha256":"d8607b84dc6c5e66b45eefe3b68e2e8bdcb54f66354d4ea600e1cbbb5f0f8318","source":{"kind":"arxiv","id":"1512.02929","version":3},"attestation_state":"computed","paper":{"title":"Ergodicity of an SPDE Associated with a Many-Server Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Kavita Ramanan, Reza Aghajani","submitted_at":"2015-12-09T16:29:58Z","abstract_excerpt":"We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a First-Come-First-Serve manner. We introduce a two-component infinite-dimensional Markov process that serves as a diffusion model for this network, in the regime where the number of servers goes to infinity and the load on the network scales as $1 - \\beta N^{-1/2}+ o(N^{-1/2})$ for some $\\beta > 0$. Under suitable assumptions, we characterize this process as the unique "},"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":"1512.02929","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-12-09T16:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"b59225a8c70f3bd7d32f82450bfd4939f402050855e77e2eab790db1bdf8f3b4","abstract_canon_sha256":"8b28c21cbd05aa748e4ba6297d5d5a698d72a8e8cd78102c0e65897ca48b2e55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:57.171968Z","signature_b64":"W1RlONVuJCdUgSOPcwJ+3VpGcjI/kW1G3bRA2nBfTfjWyzvaPCy58bMScKHyqC/tBu/UiGsF3l60lrIf9m/YDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8607b84dc6c5e66b45eefe3b68e2e8bdcb54f66354d4ea600e1cbbb5f0f8318","last_reissued_at":"2026-05-18T00:28:57.171363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:57.171363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ergodicity of an SPDE Associated with a Many-Server Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Kavita Ramanan, Reza Aghajani","submitted_at":"2015-12-09T16:29:58Z","abstract_excerpt":"We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a First-Come-First-Serve manner. We introduce a two-component infinite-dimensional Markov process that serves as a diffusion model for this network, in the regime where the number of servers goes to infinity and the load on the network scales as $1 - \\beta N^{-1/2}+ o(N^{-1/2})$ for some $\\beta > 0$. Under suitable assumptions, we characterize this process as the unique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02929","kind":"arxiv","version":3},"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":"1512.02929","created_at":"2026-05-18T00:28:57.171452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02929v3","created_at":"2026-05-18T00:28:57.171452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02929","created_at":"2026-05-18T00:28:57.171452+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BQHXBG4NRPG","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BQHXBG4NRPGNNC6","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BQHXBG4","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP","json":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP.json","graph_json":"https://pith.science/api/pith-number/3BQHXBG4NRPGNNC657R3NDRORP/graph.json","events_json":"https://pith.science/api/pith-number/3BQHXBG4NRPGNNC657R3NDRORP/events.json","paper":"https://pith.science/paper/3BQHXBG4"},"agent_actions":{"view_html":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP","download_json":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP.json","view_paper":"https://pith.science/paper/3BQHXBG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02929&json=true","fetch_graph":"https://pith.science/api/pith-number/3BQHXBG4NRPGNNC657R3NDRORP/graph.json","fetch_events":"https://pith.science/api/pith-number/3BQHXBG4NRPGNNC657R3NDRORP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP/action/storage_attestation","attest_author":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP/action/author_attestation","sign_citation":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP/action/citation_signature","submit_replication":"https://pith.science/pith/3BQHXBG4NRPGNNC657R3NDRORP/action/replication_record"}},"created_at":"2026-05-18T00:28:57.171452+00:00","updated_at":"2026-05-18T00:28:57.171452+00:00"}