{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XLXR32H3OHSXAPGACTR47Q553Y","short_pith_number":"pith:XLXR32H3","schema_version":"1.0","canonical_sha256":"baef1de8fb71e5703cc014e3cfc3bdde244dc4871b4dab3bcaea5232aea78aac","source":{"kind":"arxiv","id":"1404.5556","version":1},"attestation_state":"computed","paper":{"title":"M/G/$\\infty$ polling systems with random visit times","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Maria Vlasiou, Uri Yechiali","submitted_at":"2014-04-22T17:00:07Z","abstract_excerpt":"We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues comprising the system is, in isolation, an M/G/$\\infty$-type queue. A job that is not completed during a visit will have a new service time requirement sampled from the service-time distribution of the corresponding queue. To the best of our knowledge, "},"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":"1404.5556","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2014-04-22T17:00:07Z","cross_cats_sorted":[],"title_canon_sha256":"568744e7562fa2a79b8591cc799629eb0a0e069d9d87495252d2bd69d6cd5525","abstract_canon_sha256":"d9372f572617ff34903f4895b657391e7d747caa78408818dfcb4ff80e0834f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:30.922295Z","signature_b64":"hCpp0/uSqWwEQ9cv5GD5F4XvjH9av5UdljJrXnvw7yfDd+G9+Hj873iwCIHVdpaycYLIf1yTkOEmxjFI2ceWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baef1de8fb71e5703cc014e3cfc3bdde244dc4871b4dab3bcaea5232aea78aac","last_reissued_at":"2026-05-18T02:53:30.921534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:30.921534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"M/G/$\\infty$ polling systems with random visit times","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Maria Vlasiou, Uri Yechiali","submitted_at":"2014-04-22T17:00:07Z","abstract_excerpt":"We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues comprising the system is, in isolation, an M/G/$\\infty$-type queue. A job that is not completed during a visit will have a new service time requirement sampled from the service-time distribution of the corresponding queue. To the best of our knowledge, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5556","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":"1404.5556","created_at":"2026-05-18T02:53:30.921664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5556v1","created_at":"2026-05-18T02:53:30.921664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5556","created_at":"2026-05-18T02:53:30.921664+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLXR32H3OHSX","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLXR32H3OHSXAPGA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLXR32H3","created_at":"2026-05-18T12:28:57.508820+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/XLXR32H3OHSXAPGACTR47Q553Y","json":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y.json","graph_json":"https://pith.science/api/pith-number/XLXR32H3OHSXAPGACTR47Q553Y/graph.json","events_json":"https://pith.science/api/pith-number/XLXR32H3OHSXAPGACTR47Q553Y/events.json","paper":"https://pith.science/paper/XLXR32H3"},"agent_actions":{"view_html":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y","download_json":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y.json","view_paper":"https://pith.science/paper/XLXR32H3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5556&json=true","fetch_graph":"https://pith.science/api/pith-number/XLXR32H3OHSXAPGACTR47Q553Y/graph.json","fetch_events":"https://pith.science/api/pith-number/XLXR32H3OHSXAPGACTR47Q553Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y/action/storage_attestation","attest_author":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y/action/author_attestation","sign_citation":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y/action/citation_signature","submit_replication":"https://pith.science/pith/XLXR32H3OHSXAPGACTR47Q553Y/action/replication_record"}},"created_at":"2026-05-18T02:53:30.921664+00:00","updated_at":"2026-05-18T02:53:30.921664+00:00"}