{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V3SAXLGKN6OS4BTF7ADC5WTVQH","short_pith_number":"pith:V3SAXLGK","schema_version":"1.0","canonical_sha256":"aee40bacca6f9d2e0665f8062eda7581e8858b047f8b6128e149b615b52ac3fc","source":{"kind":"arxiv","id":"1603.03413","version":1},"attestation_state":"computed","paper":{"title":"A service system with randomly behaving on-demand agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Stolyar, Lam Nguyen","submitted_at":"2016-03-10T20:32:37Z","abstract_excerpt":"We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects. First, they can be invited into the system exogenously, and join the agent queue after a random time. Second, with some probability they rejoin the agent queue after a service completion, and otherwise leave the system. The objective is to design a real-time adaptive agent invitation scheme that keeps both customer and agent queues/waiting-times small. We study a"},"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":"1603.03413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-10T20:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"72ee4093fcd24abfa0aa67d3cfeb728cb916f2c56624dc84b6efbc831d9dd973","abstract_canon_sha256":"cdad22146b66dee571ef332bd7679fd2341c7b882a7fb81f8597a5bccd08ea12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:55.891247Z","signature_b64":"xqRMXjzEVeSg+bpCzOK9Cng38l3IRMlKQgJ5IlvoySmIhBQE2nayHoKgofz6gOMGNMx5YsczpeSRLLP4E9ZwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aee40bacca6f9d2e0665f8062eda7581e8858b047f8b6128e149b615b52ac3fc","last_reissued_at":"2026-05-18T01:04:55.890562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:55.890562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A service system with randomly behaving on-demand agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alexander Stolyar, Lam Nguyen","submitted_at":"2016-03-10T20:32:37Z","abstract_excerpt":"We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects. First, they can be invited into the system exogenously, and join the agent queue after a random time. Second, with some probability they rejoin the agent queue after a service completion, and otherwise leave the system. The objective is to design a real-time adaptive agent invitation scheme that keeps both customer and agent queues/waiting-times small. We study a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03413","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":"1603.03413","created_at":"2026-05-18T01:04:55.890678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03413v1","created_at":"2026-05-18T01:04:55.890678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03413","created_at":"2026-05-18T01:04:55.890678+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3SAXLGKN6OS","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3SAXLGKN6OS4BTF","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3SAXLGK","created_at":"2026-05-18T12:30:46.583412+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/V3SAXLGKN6OS4BTF7ADC5WTVQH","json":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH.json","graph_json":"https://pith.science/api/pith-number/V3SAXLGKN6OS4BTF7ADC5WTVQH/graph.json","events_json":"https://pith.science/api/pith-number/V3SAXLGKN6OS4BTF7ADC5WTVQH/events.json","paper":"https://pith.science/paper/V3SAXLGK"},"agent_actions":{"view_html":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH","download_json":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH.json","view_paper":"https://pith.science/paper/V3SAXLGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03413&json=true","fetch_graph":"https://pith.science/api/pith-number/V3SAXLGKN6OS4BTF7ADC5WTVQH/graph.json","fetch_events":"https://pith.science/api/pith-number/V3SAXLGKN6OS4BTF7ADC5WTVQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH/action/storage_attestation","attest_author":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH/action/author_attestation","sign_citation":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH/action/citation_signature","submit_replication":"https://pith.science/pith/V3SAXLGKN6OS4BTF7ADC5WTVQH/action/replication_record"}},"created_at":"2026-05-18T01:04:55.890678+00:00","updated_at":"2026-05-18T01:04:55.890678+00:00"}