{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HLU4VFYA5FSKVXFIJU4VTK7JRD","short_pith_number":"pith:HLU4VFYA","canonical_record":{"source":{"id":"2203.08019","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T12:38:13Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"e4d155fca8195d688b9299184dd9622ab3688413b3f4be72fac6a9418f3e6996","abstract_canon_sha256":"b00f6d2c4ca072bf0ca6847c23911c4bb361830bab8d34defa0446afa71bcfd8"},"schema_version":"1.0"},"canonical_sha256":"3ae9ca9700e964aadca84d3959abe988cbfe4b531bdbeac586ebca0c0e70594e","source":{"kind":"arxiv","id":"2203.08019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.08019","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"2203.08019v1","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.08019","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"HLU4VFYA5FSK","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"HLU4VFYA5FSKVXFI","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"HLU4VFYA","created_at":"2026-07-05T04:05:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HLU4VFYA5FSKVXFIJU4VTK7JRD","target":"record","payload":{"canonical_record":{"source":{"id":"2203.08019","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T12:38:13Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"e4d155fca8195d688b9299184dd9622ab3688413b3f4be72fac6a9418f3e6996","abstract_canon_sha256":"b00f6d2c4ca072bf0ca6847c23911c4bb361830bab8d34defa0446afa71bcfd8"},"schema_version":"1.0"},"canonical_sha256":"3ae9ca9700e964aadca84d3959abe988cbfe4b531bdbeac586ebca0c0e70594e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:05:25.163724Z","signature_b64":"MqI88MfUGW9pZCcHJclTxZipq3UwdwcC1uHXYd6Lg/zmGcRl+VjvLhPcKFwKrVhWiyBQ08SYbEQZW0KN2GsECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae9ca9700e964aadca84d3959abe988cbfe4b531bdbeac586ebca0c0e70594e","last_reissued_at":"2026-07-05T04:05:25.163232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:05:25.163232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.08019","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2F+mET/x8RfblXT+PCVmg7Y+9qzzmPU1FPsOn6weUnsul1aduNPo9yH5YpjsoJCUSj1td9mxjU5v3ycDtmTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:55:33.903045Z"},"content_sha256":"b3ade7648991fd27d468ea30e1b17194bca8beaa3c3ec6c9a124c0d5fc8b084d","schema_version":"1.0","event_id":"sha256:b3ade7648991fd27d468ea30e1b17194bca8beaa3c3ec6c9a124c0d5fc8b084d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HLU4VFYA5FSKVXFIJU4VTK7JRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Danial Dervovic, Daniele Magazzeni, Jason Long, Marc Rigter, Parisa Hassanzadeh, Parisa Zehtabi","submitted_at":"2022-03-14T12:38:13Z","abstract_excerpt":"We consider a novel queuing problem where the decision-maker must choose to accept or reject randomly arriving tasks into a no buffer queue which are processed by $N$ identical servers. Each task has a price, which is a positive real number, and a class. Each class of task has a different price distribution and service rate, and arrives according to an inhomogenous Poisson process. The objective is to decide which tasks to accept so that the total price of tasks processed is maximised over a finite horizon. We formulate the problem as a discrete time Markov Decision Process (MDP) with a hybrid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.08019","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.08019/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"inkpsO2txB8qCmaaJK7zO2rpENDCa+JbsnAx3e81t8ja3BuRRYiCvATGJGbRHorZA+q7xNPy6xYAZeTpY/RvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:55:33.903582Z"},"content_sha256":"5a3dbaceb14bc9d87e45c09be8532717abc51cd59b92a0e1bfaebf5cd52892bc","schema_version":"1.0","event_id":"sha256:5a3dbaceb14bc9d87e45c09be8532717abc51cd59b92a0e1bfaebf5cd52892bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLU4VFYA5FSKVXFIJU4VTK7JRD/bundle.json","state_url":"https://pith.science/pith/HLU4VFYA5FSKVXFIJU4VTK7JRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLU4VFYA5FSKVXFIJU4VTK7JRD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T04:55:33Z","links":{"resolver":"https://pith.science/pith/HLU4VFYA5FSKVXFIJU4VTK7JRD","bundle":"https://pith.science/pith/HLU4VFYA5FSKVXFIJU4VTK7JRD/bundle.json","state":"https://pith.science/pith/HLU4VFYA5FSKVXFIJU4VTK7JRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLU4VFYA5FSKVXFIJU4VTK7JRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HLU4VFYA5FSKVXFIJU4VTK7JRD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b00f6d2c4ca072bf0ca6847c23911c4bb361830bab8d34defa0446afa71bcfd8","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T12:38:13Z","title_canon_sha256":"e4d155fca8195d688b9299184dd9622ab3688413b3f4be72fac6a9418f3e6996"},"schema_version":"1.0","source":{"id":"2203.08019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.08019","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"2203.08019v1","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.08019","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"HLU4VFYA5FSK","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"HLU4VFYA5FSKVXFI","created_at":"2026-07-05T04:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"HLU4VFYA","created_at":"2026-07-05T04:05:25Z"}],"graph_snapshots":[{"event_id":"sha256:5a3dbaceb14bc9d87e45c09be8532717abc51cd59b92a0e1bfaebf5cd52892bc","target":"graph","created_at":"2026-07-05T04:05:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.08019/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a novel queuing problem where the decision-maker must choose to accept or reject randomly arriving tasks into a no buffer queue which are processed by $N$ identical servers. Each task has a price, which is a positive real number, and a class. Each class of task has a different price distribution and service rate, and arrives according to an inhomogenous Poisson process. The objective is to decide which tasks to accept so that the total price of tasks processed is maximised over a finite horizon. We formulate the problem as a discrete time Markov Decision Process (MDP) with a hybrid","authors_text":"Danial Dervovic, Daniele Magazzeni, Jason Long, Marc Rigter, Parisa Hassanzadeh, Parisa Zehtabi","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T12:38:13Z","title":"Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.08019","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3ade7648991fd27d468ea30e1b17194bca8beaa3c3ec6c9a124c0d5fc8b084d","target":"record","created_at":"2026-07-05T04:05:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b00f6d2c4ca072bf0ca6847c23911c4bb361830bab8d34defa0446afa71bcfd8","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-14T12:38:13Z","title_canon_sha256":"e4d155fca8195d688b9299184dd9622ab3688413b3f4be72fac6a9418f3e6996"},"schema_version":"1.0","source":{"id":"2203.08019","kind":"arxiv","version":1}},"canonical_sha256":"3ae9ca9700e964aadca84d3959abe988cbfe4b531bdbeac586ebca0c0e70594e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ae9ca9700e964aadca84d3959abe988cbfe4b531bdbeac586ebca0c0e70594e","first_computed_at":"2026-07-05T04:05:25.163232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:05:25.163232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MqI88MfUGW9pZCcHJclTxZipq3UwdwcC1uHXYd6Lg/zmGcRl+VjvLhPcKFwKrVhWiyBQ08SYbEQZW0KN2GsECQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:05:25.163724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.08019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3ade7648991fd27d468ea30e1b17194bca8beaa3c3ec6c9a124c0d5fc8b084d","sha256:5a3dbaceb14bc9d87e45c09be8532717abc51cd59b92a0e1bfaebf5cd52892bc"],"state_sha256":"261d92d4cbbff432c839846fe1972fef0af065398d16e2bd5bc0e7596b7b43a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVJF7GKtfDGb8XP+QavFR96qEz5RA/N1qiubK37mEib6cIf5WDpIkrxin5+wnNMst6IRUVKj+6nOxvO82/qTBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T04:55:33.916792Z","bundle_sha256":"9f5c77b789974df3b50f08840b3405c3d5f4dd687e04ec7edef6a71514ca9a61"}}