{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZPGN7UQNPJ6OWS6VA4SPH6CR7E","short_pith_number":"pith:ZPGN7UQN","canonical_record":{"source":{"id":"1504.01248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-06T10:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"d7dd1513a472d80c8bfd2c3103cd77e8f5df496279d0f55e4dbd2231e58f708d","abstract_canon_sha256":"9f92bfa15d1b5689a12052c6753e7d029f49246d22ca2ee80121dc78dd67d7ae"},"schema_version":"1.0"},"canonical_sha256":"cbccdfd20d7a7ceb4bd50724f3f851f92555163b44614a93dd13f6f603a16cc3","source":{"kind":"arxiv","id":"1504.01248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01248","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01248v1","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01248","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZPGN7UQNPJ6O","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZPGN7UQNPJ6OWS6V","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZPGN7UQN","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZPGN7UQNPJ6OWS6VA4SPH6CR7E","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01248","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-06T10:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"d7dd1513a472d80c8bfd2c3103cd77e8f5df496279d0f55e4dbd2231e58f708d","abstract_canon_sha256":"9f92bfa15d1b5689a12052c6753e7d029f49246d22ca2ee80121dc78dd67d7ae"},"schema_version":"1.0"},"canonical_sha256":"cbccdfd20d7a7ceb4bd50724f3f851f92555163b44614a93dd13f6f603a16cc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:34.802110Z","signature_b64":"0DM4acEBGtvEPHOd/fBIUsVtS+wRqbpNe5Yddm8QKj50YiNrdFRxEc6OeIKmN8b+nm1wvBxivl8TrnFaO77/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbccdfd20d7a7ceb4bd50724f3f851f92555163b44614a93dd13f6f603a16cc3","last_reissued_at":"2026-05-18T02:19:34.801639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:34.801639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01248","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-05-18T02:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlnIRBPVJXuG+5jk7aZmIIuarEBRuKg9u+c0++eztcSiaIETaEwHJOF7FwLLriuXvJbYA/ysRGtNL27MXOkwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:07:42.652425Z"},"content_sha256":"a82a39c048d16a66e1b866ab401def2d433426d9b3d5ca8d54ef5e096ca3d9a8","schema_version":"1.0","event_id":"sha256:a82a39c048d16a66e1b866ab401def2d433426d9b3d5ca8d54ef5e096ca3d9a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZPGN7UQNPJ6OWS6VA4SPH6CR7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of the Optimal Resource Allocation for a Tandem Queueing System","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Chen Gang, Liu Zaiming, Wu Jinbiao","submitted_at":"2015-04-06T10:02:20Z","abstract_excerpt":"In this paper, we study a controllable tandem queueing system consisting of two nodes and a controller, in which customers arrive according to a Poisson process and must receive service at both nodes before leaving the system. A decision maker dynamically allocates the number of service resource to each node facility according to the number of customers in each node. In the model, the objective is to minimize the long-run average costs. We cast these problems as Markov decision problems by dynamic programming approach and derive the monotonicity of the optimal allocation policy and the relatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01248","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"},"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-05-18T02:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWHl8AotVnL9sg2bghOsQy1EJ69IuIT5mP4gx2EmwdknDpMqAmkTJI0bDVWP+AaWK1bzfZ/bjW2NsKANOm1qAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:07:42.652867Z"},"content_sha256":"d897f681ca2d43827ec8326c0282d15bebcd6c7ee51bb4fe58427c8c4d4c34ed","schema_version":"1.0","event_id":"sha256:d897f681ca2d43827ec8326c0282d15bebcd6c7ee51bb4fe58427c8c4d4c34ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPGN7UQNPJ6OWS6VA4SPH6CR7E/bundle.json","state_url":"https://pith.science/pith/ZPGN7UQNPJ6OWS6VA4SPH6CR7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPGN7UQNPJ6OWS6VA4SPH6CR7E/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-07-05T08:07:42Z","links":{"resolver":"https://pith.science/pith/ZPGN7UQNPJ6OWS6VA4SPH6CR7E","bundle":"https://pith.science/pith/ZPGN7UQNPJ6OWS6VA4SPH6CR7E/bundle.json","state":"https://pith.science/pith/ZPGN7UQNPJ6OWS6VA4SPH6CR7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPGN7UQNPJ6OWS6VA4SPH6CR7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZPGN7UQNPJ6OWS6VA4SPH6CR7E","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":"9f92bfa15d1b5689a12052c6753e7d029f49246d22ca2ee80121dc78dd67d7ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-06T10:02:20Z","title_canon_sha256":"d7dd1513a472d80c8bfd2c3103cd77e8f5df496279d0f55e4dbd2231e58f708d"},"schema_version":"1.0","source":{"id":"1504.01248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01248","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01248v1","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01248","created_at":"2026-05-18T02:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZPGN7UQNPJ6O","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZPGN7UQNPJ6OWS6V","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZPGN7UQN","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:d897f681ca2d43827ec8326c0282d15bebcd6c7ee51bb4fe58427c8c4d4c34ed","target":"graph","created_at":"2026-05-18T02:19:34Z","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"},"paper":{"abstract_excerpt":"In this paper, we study a controllable tandem queueing system consisting of two nodes and a controller, in which customers arrive according to a Poisson process and must receive service at both nodes before leaving the system. A decision maker dynamically allocates the number of service resource to each node facility according to the number of customers in each node. In the model, the objective is to minimize the long-run average costs. We cast these problems as Markov decision problems by dynamic programming approach and derive the monotonicity of the optimal allocation policy and the relatio","authors_text":"Chen Gang, Liu Zaiming, Wu Jinbiao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-06T10:02:20Z","title":"Analysis of the Optimal Resource Allocation for a Tandem Queueing System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01248","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:a82a39c048d16a66e1b866ab401def2d433426d9b3d5ca8d54ef5e096ca3d9a8","target":"record","created_at":"2026-05-18T02:19:34Z","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":"9f92bfa15d1b5689a12052c6753e7d029f49246d22ca2ee80121dc78dd67d7ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2015-04-06T10:02:20Z","title_canon_sha256":"d7dd1513a472d80c8bfd2c3103cd77e8f5df496279d0f55e4dbd2231e58f708d"},"schema_version":"1.0","source":{"id":"1504.01248","kind":"arxiv","version":1}},"canonical_sha256":"cbccdfd20d7a7ceb4bd50724f3f851f92555163b44614a93dd13f6f603a16cc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbccdfd20d7a7ceb4bd50724f3f851f92555163b44614a93dd13f6f603a16cc3","first_computed_at":"2026-05-18T02:19:34.801639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:34.801639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0DM4acEBGtvEPHOd/fBIUsVtS+wRqbpNe5Yddm8QKj50YiNrdFRxEc6OeIKmN8b+nm1wvBxivl8TrnFaO77/Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:34.802110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a82a39c048d16a66e1b866ab401def2d433426d9b3d5ca8d54ef5e096ca3d9a8","sha256:d897f681ca2d43827ec8326c0282d15bebcd6c7ee51bb4fe58427c8c4d4c34ed"],"state_sha256":"06332a5f30124c9fadf7b5d4a9e92322112921307d3bb0ca0f78b17e7d682deb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3i6lXly2/JSr8v1k+QSVgRiH5yd8gNb6eklr69NY1vu4YJN6uFy+hbzoSW9wUT+x3/Jpc1BrLE+YsxKvVeBkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:07:42.655002Z","bundle_sha256":"713db29e92ae4b2479db942d8c55087e62f8575cc807a7560436f5bc46e318f7"}}