{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AGS3LBRTM6UDTWJH6UGCGODNCE","short_pith_number":"pith:AGS3LBRT","schema_version":"1.0","canonical_sha256":"01a5b5863367a839d927f50c23386d11282b199388b0035fa2110cf7f0b0d1db","source":{"kind":"arxiv","id":"1609.07996","version":1},"attestation_state":"computed","paper":{"title":"An Infinite Dimensional Model for A Single Server Priority Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Neal Master, Nicholas Bambos, Zhengyuan Zhou","submitted_at":"2016-09-26T14:49:07Z","abstract_excerpt":"We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability measure rather than a discrete one. Because the priority levels are drawn from a continuum, the queue is modeled by a measure-valued stochastic process. We analyze the steady state behavior of this process and provide several results. We derive a measure that describes the average distribution of customer priority levels in the system; we provide a formula for t"},"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":"1609.07996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-09-26T14:49:07Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"8bd83b6a9e04fc9215c20e68e296ae002251dd76d355f3a93c5c9cec72befb8b","abstract_canon_sha256":"6f20ec846801e2059998d3e34ac08c7faa62e2f67fb53bb41f070bff16a3ae3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.173618Z","signature_b64":"wDxn0ddW8KJxeL0jtgyHMXdSrGLUqxlrg05viKfpQqQiRkMG/nvHNE64PPaf4rawdSbHNyZK7XDk7WcI0aabCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01a5b5863367a839d927f50c23386d11282b199388b0035fa2110cf7f0b0d1db","last_reissued_at":"2026-05-18T00:53:17.173130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.173130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Infinite Dimensional Model for A Single Server Priority Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Neal Master, Nicholas Bambos, Zhengyuan Zhou","submitted_at":"2016-09-26T14:49:07Z","abstract_excerpt":"We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability measure rather than a discrete one. Because the priority levels are drawn from a continuum, the queue is modeled by a measure-valued stochastic process. We analyze the steady state behavior of this process and provide several results. We derive a measure that describes the average distribution of customer priority levels in the system; we provide a formula for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07996","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":"1609.07996","created_at":"2026-05-18T00:53:17.173211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07996v1","created_at":"2026-05-18T00:53:17.173211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07996","created_at":"2026-05-18T00:53:17.173211+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGS3LBRTM6UD","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGS3LBRTM6UDTWJH","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGS3LBRT","created_at":"2026-05-18T12:30:07.202191+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/AGS3LBRTM6UDTWJH6UGCGODNCE","json":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE.json","graph_json":"https://pith.science/api/pith-number/AGS3LBRTM6UDTWJH6UGCGODNCE/graph.json","events_json":"https://pith.science/api/pith-number/AGS3LBRTM6UDTWJH6UGCGODNCE/events.json","paper":"https://pith.science/paper/AGS3LBRT"},"agent_actions":{"view_html":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE","download_json":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE.json","view_paper":"https://pith.science/paper/AGS3LBRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07996&json=true","fetch_graph":"https://pith.science/api/pith-number/AGS3LBRTM6UDTWJH6UGCGODNCE/graph.json","fetch_events":"https://pith.science/api/pith-number/AGS3LBRTM6UDTWJH6UGCGODNCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE/action/storage_attestation","attest_author":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE/action/author_attestation","sign_citation":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE/action/citation_signature","submit_replication":"https://pith.science/pith/AGS3LBRTM6UDTWJH6UGCGODNCE/action/replication_record"}},"created_at":"2026-05-18T00:53:17.173211+00:00","updated_at":"2026-05-18T00:53:17.173211+00:00"}