{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QJIPL6ADJBTS2L3XRSDLGRKB6P","short_pith_number":"pith:QJIPL6AD","canonical_record":{"source":{"id":"1707.00361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-02T22:11:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f2527ffd9ac59a192bbebd9dde58d049fd43ee4e8aa5a4e176f71120c6d2de92","abstract_canon_sha256":"01ac179cbc199f5bf12f61efddccd4dafc5c648b02c6b305c18c04e47728e38a"},"schema_version":"1.0"},"canonical_sha256":"8250f5f80348672d2f778c86b34541f3e3a558ffcd6ef3796709930d527cfab8","source":{"kind":"arxiv","id":"1707.00361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00361","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00361v2","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00361","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"QJIPL6ADJBTS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QJIPL6ADJBTS2L3X","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QJIPL6AD","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QJIPL6ADJBTS2L3XRSDLGRKB6P","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-02T22:11:55Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f2527ffd9ac59a192bbebd9dde58d049fd43ee4e8aa5a4e176f71120c6d2de92","abstract_canon_sha256":"01ac179cbc199f5bf12f61efddccd4dafc5c648b02c6b305c18c04e47728e38a"},"schema_version":"1.0"},"canonical_sha256":"8250f5f80348672d2f778c86b34541f3e3a558ffcd6ef3796709930d527cfab8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:43.351248Z","signature_b64":"iAOvkuPVC4vxXJQfqV2DvqcN81ey24KiG2wWnLa5qM+HalJKRWa1qsYT3I0hxbFU6fYniQcAB7v3tNoCaZ/QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8250f5f80348672d2f778c86b34541f3e3a558ffcd6ef3796709930d527cfab8","last_reissued_at":"2026-05-18T00:17:43.350631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:43.350631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00361","source_version":2,"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-18T00:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obkc6Zn0/FQS4iYao9DI+0HFVy+3CXauUNjKgJugUJV9kVVtmIYLPNH/OQTuULeG3+PQxjvozH61EdRjriT0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:25:45.102907Z"},"content_sha256":"86ede6495dfcb2fed4ce926b40e2972c15f1bdfdb3becc02d32b16fa56dbfa22","schema_version":"1.0","event_id":"sha256:86ede6495dfcb2fed4ce926b40e2972c15f1bdfdb3becc02d32b16fa56dbfa22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QJIPL6ADJBTS2L3XRSDLGRKB6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Pricing for Tandem Queues: Does It Have to Be Dynamic Pricing to Earn the Most?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Tonghoon Suk, Xinchang Wang","submitted_at":"2017-07-02T22:11:55Z","abstract_excerpt":"Tandem queueing systems are widely-used stochastic models that arise from many real-life service operations systems. Motivated by the desire to understand the trade-off between the performance and complexity of policies for capacity-constrained tandem queueing systems, we investigate the long-run expected time-average revenue, the gain, of the service provider for various pricing policies. The gain-maximization problem is formulated as a Markov decision process model but the optimal policy, which dynamically adjusts service prices, is hard to obtain due to the curse of dimensionality. For gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00361","kind":"arxiv","version":2},"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-18T00:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KICA2Xngoa7NPfPHir2/WfDYYrNeoO5HJz+L4ge9b85z5N/d093cMleFXZ+nvZbJ2CZ1o4h/+/8Uz1DYY+5nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:25:45.103261Z"},"content_sha256":"d9c9aabc46d7077363767a2908af1bed2dbb7516e2a481a27ac39fd564268024","schema_version":"1.0","event_id":"sha256:d9c9aabc46d7077363767a2908af1bed2dbb7516e2a481a27ac39fd564268024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJIPL6ADJBTS2L3XRSDLGRKB6P/bundle.json","state_url":"https://pith.science/pith/QJIPL6ADJBTS2L3XRSDLGRKB6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJIPL6ADJBTS2L3XRSDLGRKB6P/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-06-25T10:25:45Z","links":{"resolver":"https://pith.science/pith/QJIPL6ADJBTS2L3XRSDLGRKB6P","bundle":"https://pith.science/pith/QJIPL6ADJBTS2L3XRSDLGRKB6P/bundle.json","state":"https://pith.science/pith/QJIPL6ADJBTS2L3XRSDLGRKB6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJIPL6ADJBTS2L3XRSDLGRKB6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QJIPL6ADJBTS2L3XRSDLGRKB6P","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":"01ac179cbc199f5bf12f61efddccd4dafc5c648b02c6b305c18c04e47728e38a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-02T22:11:55Z","title_canon_sha256":"f2527ffd9ac59a192bbebd9dde58d049fd43ee4e8aa5a4e176f71120c6d2de92"},"schema_version":"1.0","source":{"id":"1707.00361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00361","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00361v2","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00361","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"QJIPL6ADJBTS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QJIPL6ADJBTS2L3X","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QJIPL6AD","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:d9c9aabc46d7077363767a2908af1bed2dbb7516e2a481a27ac39fd564268024","target":"graph","created_at":"2026-05-18T00:17:43Z","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":"Tandem queueing systems are widely-used stochastic models that arise from many real-life service operations systems. Motivated by the desire to understand the trade-off between the performance and complexity of policies for capacity-constrained tandem queueing systems, we investigate the long-run expected time-average revenue, the gain, of the service provider for various pricing policies. The gain-maximization problem is formulated as a Markov decision process model but the optimal policy, which dynamically adjusts service prices, is hard to obtain due to the curse of dimensionality. For gene","authors_text":"Tonghoon Suk, Xinchang Wang","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-02T22:11:55Z","title":"Optimal Pricing for Tandem Queues: Does It Have to Be Dynamic Pricing to Earn the Most?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00361","kind":"arxiv","version":2},"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:86ede6495dfcb2fed4ce926b40e2972c15f1bdfdb3becc02d32b16fa56dbfa22","target":"record","created_at":"2026-05-18T00:17:43Z","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":"01ac179cbc199f5bf12f61efddccd4dafc5c648b02c6b305c18c04e47728e38a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-02T22:11:55Z","title_canon_sha256":"f2527ffd9ac59a192bbebd9dde58d049fd43ee4e8aa5a4e176f71120c6d2de92"},"schema_version":"1.0","source":{"id":"1707.00361","kind":"arxiv","version":2}},"canonical_sha256":"8250f5f80348672d2f778c86b34541f3e3a558ffcd6ef3796709930d527cfab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8250f5f80348672d2f778c86b34541f3e3a558ffcd6ef3796709930d527cfab8","first_computed_at":"2026-05-18T00:17:43.350631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:43.350631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iAOvkuPVC4vxXJQfqV2DvqcN81ey24KiG2wWnLa5qM+HalJKRWa1qsYT3I0hxbFU6fYniQcAB7v3tNoCaZ/QDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:43.351248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86ede6495dfcb2fed4ce926b40e2972c15f1bdfdb3becc02d32b16fa56dbfa22","sha256:d9c9aabc46d7077363767a2908af1bed2dbb7516e2a481a27ac39fd564268024"],"state_sha256":"37af13a9a38cdb4125a7a688b1a64c085d47c83782e6747246dfb3f7927ff81a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"piblNDduq56lLMW+KihzT1aE/EaR7QWqs0Ue3F6dkW9hef+5qDecp18QRqdocZcP7bo0b2HGrbYaA4Q3/gnGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:25:45.105237Z","bundle_sha256":"94674d61ab8db36e9cd465a2b45019598ac9faad2622c07dd3f35bd2f0b3e625"}}