{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YNJB77Q4QTUUYLTALHXL4BOPFP","short_pith_number":"pith:YNJB77Q4","canonical_record":{"source":{"id":"1308.0039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T21:08:31Z","cross_cats_sorted":[],"title_canon_sha256":"7dcd7bafcea62f0709174135c60f3970266f089e19dce183e927d0c48c76151a","abstract_canon_sha256":"6884b738c54ea1133dec5acd92d232d7f9e3daf9073b253553717a4a6a6ce95f"},"schema_version":"1.0"},"canonical_sha256":"c3521ffe1c84e94c2e6059eebe05cf2bc3bb415f11d367b7c5637218b2caabe4","source":{"kind":"arxiv","id":"1308.0039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0039","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0039v2","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0039","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"pith_short_12","alias_value":"YNJB77Q4QTUU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YNJB77Q4QTUUYLTA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YNJB77Q4","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YNJB77Q4QTUUYLTALHXL4BOPFP","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T21:08:31Z","cross_cats_sorted":[],"title_canon_sha256":"7dcd7bafcea62f0709174135c60f3970266f089e19dce183e927d0c48c76151a","abstract_canon_sha256":"6884b738c54ea1133dec5acd92d232d7f9e3daf9073b253553717a4a6a6ce95f"},"schema_version":"1.0"},"canonical_sha256":"c3521ffe1c84e94c2e6059eebe05cf2bc3bb415f11d367b7c5637218b2caabe4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:47.207570Z","signature_b64":"5o/EqUiJsRzfh8axTa3hCvJUD01iYnH00ckVCmTO5FPeDDdcxJ12piwXzEhgdzWKzqZ+86JyIZDA56+8CADYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3521ffe1c84e94c2e6059eebe05cf2bc3bb415f11d367b7c5637218b2caabe4","last_reissued_at":"2026-05-18T01:29:47.206842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:47.206842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0039","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-18T01:29:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mwyJdhswvE2WNFx59LM462p7BYqm1UQlVu91oJcMe+yuSZCgBZNKrWJUgACtGG52eUdB5hL3fYeDYzE+ncfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:10.788509Z"},"content_sha256":"5eec9b25cd26f5fd3b879a714d761f5721a99eb37465c15425ce0564d969c9b1","schema_version":"1.0","event_id":"sha256:5eec9b25cd26f5fd3b879a714d761f5721a99eb37465c15425ce0564d969c9b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YNJB77Q4QTUUYLTALHXL4BOPFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Switching On and Off the Entire Service Capacity of a Parallel Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eugene Feinberg, Xiaoxuan Zhang","submitted_at":"2013-07-31T21:08:31Z","abstract_excerpt":"This paper studies optimal switching on and o? of the entire service capacity of an M/M/Infinity queue with holding, running and switching costs where the running costs depend only on whether the system is running or not. The goal is to minimize average costs per unit time. The main result is that an average-optimal policy either always runs the system or is an (M, N)-policy defined by two thresholds M and N, such that the system is switched on upon an arrival epoch when the system size accumulates to N and is switched off upon a departure epoch when the system size decreases to M. It is shown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0039","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-18T01:29:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0w3jO44BhoxTV1flXkBddklyDam0wyGMNGOaf5MjTOxFRlGPCOMVwqOc8EEkDhvbjTQeUsPaANopA+ohWLCRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:24:10.789157Z"},"content_sha256":"a9f9858a29f689820ca8aa9c783469f02f87064b49677285b7b8a9bfae151620","schema_version":"1.0","event_id":"sha256:a9f9858a29f689820ca8aa9c783469f02f87064b49677285b7b8a9bfae151620"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNJB77Q4QTUUYLTALHXL4BOPFP/bundle.json","state_url":"https://pith.science/pith/YNJB77Q4QTUUYLTALHXL4BOPFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNJB77Q4QTUUYLTALHXL4BOPFP/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-09T07:24:10Z","links":{"resolver":"https://pith.science/pith/YNJB77Q4QTUUYLTALHXL4BOPFP","bundle":"https://pith.science/pith/YNJB77Q4QTUUYLTALHXL4BOPFP/bundle.json","state":"https://pith.science/pith/YNJB77Q4QTUUYLTALHXL4BOPFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNJB77Q4QTUUYLTALHXL4BOPFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YNJB77Q4QTUUYLTALHXL4BOPFP","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":"6884b738c54ea1133dec5acd92d232d7f9e3daf9073b253553717a4a6a6ce95f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T21:08:31Z","title_canon_sha256":"7dcd7bafcea62f0709174135c60f3970266f089e19dce183e927d0c48c76151a"},"schema_version":"1.0","source":{"id":"1308.0039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0039","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0039v2","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0039","created_at":"2026-05-18T01:29:47Z"},{"alias_kind":"pith_short_12","alias_value":"YNJB77Q4QTUU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YNJB77Q4QTUUYLTA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YNJB77Q4","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:a9f9858a29f689820ca8aa9c783469f02f87064b49677285b7b8a9bfae151620","target":"graph","created_at":"2026-05-18T01:29:47Z","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":"This paper studies optimal switching on and o? of the entire service capacity of an M/M/Infinity queue with holding, running and switching costs where the running costs depend only on whether the system is running or not. The goal is to minimize average costs per unit time. The main result is that an average-optimal policy either always runs the system or is an (M, N)-policy defined by two thresholds M and N, such that the system is switched on upon an arrival epoch when the system size accumulates to N and is switched off upon a departure epoch when the system size decreases to M. It is shown","authors_text":"Eugene Feinberg, Xiaoxuan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T21:08:31Z","title":"Optimal Switching On and Off the Entire Service Capacity of a Parallel Queue"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0039","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:5eec9b25cd26f5fd3b879a714d761f5721a99eb37465c15425ce0564d969c9b1","target":"record","created_at":"2026-05-18T01:29:47Z","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":"6884b738c54ea1133dec5acd92d232d7f9e3daf9073b253553717a4a6a6ce95f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-31T21:08:31Z","title_canon_sha256":"7dcd7bafcea62f0709174135c60f3970266f089e19dce183e927d0c48c76151a"},"schema_version":"1.0","source":{"id":"1308.0039","kind":"arxiv","version":2}},"canonical_sha256":"c3521ffe1c84e94c2e6059eebe05cf2bc3bb415f11d367b7c5637218b2caabe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3521ffe1c84e94c2e6059eebe05cf2bc3bb415f11d367b7c5637218b2caabe4","first_computed_at":"2026-05-18T01:29:47.206842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:47.206842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5o/EqUiJsRzfh8axTa3hCvJUD01iYnH00ckVCmTO5FPeDDdcxJ12piwXzEhgdzWKzqZ+86JyIZDA56+8CADYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:47.207570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eec9b25cd26f5fd3b879a714d761f5721a99eb37465c15425ce0564d969c9b1","sha256:a9f9858a29f689820ca8aa9c783469f02f87064b49677285b7b8a9bfae151620"],"state_sha256":"8aacc3da38a047305e16eecfb071bc2621c9fee462ceb757e9cbcc7a4b71bc8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EPlyPy2v/Dab2TKsVw+fAoMaWPH77ZogfwzP8AzdiItgrYpruVKcY73lGKg/HuKOwM7YLSXMOhxQMkUyi9W8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:24:10.792960Z","bundle_sha256":"47979f8e0be6dd7d5d69f48a960ee4b86ac701c8cedbe3b2adf6e4235841d020"}}