{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C6Y34Q66VEIEESI2Q5HHR2Y2DT","short_pith_number":"pith:C6Y34Q66","schema_version":"1.0","canonical_sha256":"17b1be43dea91042491a874e78eb1a1cdf79755f485ab43ad8b250d0f461b76c","source":{"kind":"arxiv","id":"1711.02931","version":2},"attestation_state":"computed","paper":{"title":"Coupling in the queue with impatience: case of several servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Pascal Moyal","submitted_at":"2017-11-08T13:10:41Z","abstract_excerpt":"We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic recursions, we propose a sufficient condition of existence of a unique stationary state of the system using Renovation theory. Whenever this condition is relaxed we use extension techniques to prove the existence of a stationary state in some cases."},"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":"1711.02931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-11-08T13:10:41Z","cross_cats_sorted":[],"title_canon_sha256":"c497050afe5b9e6a40b91957fff7b2f0e5091029146026f28fa96dcc785c0212","abstract_canon_sha256":"f1777d7839925351714c08bab5d103faf1be17d945a9b97c389c854ae06d083b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.716870Z","signature_b64":"JjX9MtB00Z7duM0H1THlWXvZ+MqhDagr8Et+c0K52V2eah/htpvMceMbj3C71r2u8IKN/CRq2XlQQdKTc3nRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17b1be43dea91042491a874e78eb1a1cdf79755f485ab43ad8b250d0f461b76c","last_reissued_at":"2026-05-18T00:30:21.716176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.716176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coupling in the queue with impatience: case of several servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Pascal Moyal","submitted_at":"2017-11-08T13:10:41Z","abstract_excerpt":"We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic recursions, we propose a sufficient condition of existence of a unique stationary state of the system using Renovation theory. Whenever this condition is relaxed we use extension techniques to prove the existence of a stationary state in some cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02931","kind":"arxiv","version":2},"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":"1711.02931","created_at":"2026-05-18T00:30:21.716288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02931v2","created_at":"2026-05-18T00:30:21.716288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02931","created_at":"2026-05-18T00:30:21.716288+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6Y34Q66VEIE","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6Y34Q66VEIEESI2","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6Y34Q66","created_at":"2026-05-18T12:31:08.081275+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/C6Y34Q66VEIEESI2Q5HHR2Y2DT","json":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT.json","graph_json":"https://pith.science/api/pith-number/C6Y34Q66VEIEESI2Q5HHR2Y2DT/graph.json","events_json":"https://pith.science/api/pith-number/C6Y34Q66VEIEESI2Q5HHR2Y2DT/events.json","paper":"https://pith.science/paper/C6Y34Q66"},"agent_actions":{"view_html":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT","download_json":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT.json","view_paper":"https://pith.science/paper/C6Y34Q66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02931&json=true","fetch_graph":"https://pith.science/api/pith-number/C6Y34Q66VEIEESI2Q5HHR2Y2DT/graph.json","fetch_events":"https://pith.science/api/pith-number/C6Y34Q66VEIEESI2Q5HHR2Y2DT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT/action/storage_attestation","attest_author":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT/action/author_attestation","sign_citation":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT/action/citation_signature","submit_replication":"https://pith.science/pith/C6Y34Q66VEIEESI2Q5HHR2Y2DT/action/replication_record"}},"created_at":"2026-05-18T00:30:21.716288+00:00","updated_at":"2026-05-18T00:30:21.716288+00:00"}