{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BTMSZ4UUMUPYRGT2CF6LY4X6VU","short_pith_number":"pith:BTMSZ4UU","canonical_record":{"source":{"id":"1111.0060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"80d037d374dfef7bb0d4fe7e7a47564ba48dab4e2140cdcfb03dd7043e78fc24","abstract_canon_sha256":"90e1459fe24eec62de79bb50205ab46ce92f17f2f5c45d5cc80869a22dd35de1"},"schema_version":"1.0"},"canonical_sha256":"0cd92cf294651f889a7a117cbc72fead19490d6d3bfa18351b15f4c7b80941c4","source":{"kind":"arxiv","id":"1111.0060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0060","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0060v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0060","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"BTMSZ4UUMUPY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BTMSZ4UUMUPYRGT2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BTMSZ4UU","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BTMSZ4UUMUPYRGT2CF6LY4X6VU","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"80d037d374dfef7bb0d4fe7e7a47564ba48dab4e2140cdcfb03dd7043e78fc24","abstract_canon_sha256":"90e1459fe24eec62de79bb50205ab46ce92f17f2f5c45d5cc80869a22dd35de1"},"schema_version":"1.0"},"canonical_sha256":"0cd92cf294651f889a7a117cbc72fead19490d6d3bfa18351b15f4c7b80941c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.522127Z","signature_b64":"eChoHKsM4b9JtIzAcldYx5QdA/tKJrn9xUXnU0wy/Ng+GuwrLiMdnQd5UxyIXJzm3pMbs9VsEzJquzYA+hSMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cd92cf294651f889a7a117cbc72fead19490d6d3bfa18351b15f4c7b80941c4","last_reissued_at":"2026-05-18T04:09:46.521690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.521690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0060","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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgGlkeNaidUbAqbczIM3TU/PQtG6mI75YEurldztGPaoF8EcHfe2nWr7kgoziczF9eAHUKFkAFb5G63wRErGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:17:43.745905Z"},"content_sha256":"88a50daf48ff20b843cd937b480efed536d9d50f1a36afc61ab28499cd95e631","schema_version":"1.0","event_id":"sha256:88a50daf48ff20b843cd937b480efed536d9d50f1a36afc61ab28499cd95e631"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BTMSZ4UUMUPYRGT2CF6LY4X6VU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constraint Programming Approach for Solving a Queueing Control Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daria Terekhov, J. Christopher Beck","submitted_at":"2011-10-31T22:16:41Z","abstract_excerpt":"In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic customer arrival and service times, we seek a policy for switching workers such that the expected customer waiting time is minimized while the expected back room staffing is sufficient to perform all work. Three novel constraint programming models and several shaving procedures for these models are presented. Experimental results show that a model based on closed-form expressions together with a combination of shaving proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0060","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-18T04:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ns2DIHSmNNDeKFXbJDY/LAsRkTk2587DKWXqLLfUSzTcwctQeZ3hd57T90/Ny+hjngXNg9Nj++ItC3/ueXxAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:17:43.746575Z"},"content_sha256":"9482d5c6ae6178403df8acd846a01c32b480411be341d0fd9c1659660e8d4d42","schema_version":"1.0","event_id":"sha256:9482d5c6ae6178403df8acd846a01c32b480411be341d0fd9c1659660e8d4d42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTMSZ4UUMUPYRGT2CF6LY4X6VU/bundle.json","state_url":"https://pith.science/pith/BTMSZ4UUMUPYRGT2CF6LY4X6VU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTMSZ4UUMUPYRGT2CF6LY4X6VU/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-05-25T20:17:43Z","links":{"resolver":"https://pith.science/pith/BTMSZ4UUMUPYRGT2CF6LY4X6VU","bundle":"https://pith.science/pith/BTMSZ4UUMUPYRGT2CF6LY4X6VU/bundle.json","state":"https://pith.science/pith/BTMSZ4UUMUPYRGT2CF6LY4X6VU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTMSZ4UUMUPYRGT2CF6LY4X6VU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BTMSZ4UUMUPYRGT2CF6LY4X6VU","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":"90e1459fe24eec62de79bb50205ab46ce92f17f2f5c45d5cc80869a22dd35de1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:16:41Z","title_canon_sha256":"80d037d374dfef7bb0d4fe7e7a47564ba48dab4e2140cdcfb03dd7043e78fc24"},"schema_version":"1.0","source":{"id":"1111.0060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0060","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0060v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0060","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"BTMSZ4UUMUPY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BTMSZ4UUMUPYRGT2","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BTMSZ4UU","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:9482d5c6ae6178403df8acd846a01c32b480411be341d0fd9c1659660e8d4d42","target":"graph","created_at":"2026-05-18T04:09:46Z","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 a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic customer arrival and service times, we seek a policy for switching workers such that the expected customer waiting time is minimized while the expected back room staffing is sufficient to perform all work. Three novel constraint programming models and several shaving procedures for these models are presented. Experimental results show that a model based on closed-form expressions together with a combination of shaving proce","authors_text":"Daria Terekhov, J. Christopher Beck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:16:41Z","title":"A Constraint Programming Approach for Solving a Queueing Control Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0060","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:88a50daf48ff20b843cd937b480efed536d9d50f1a36afc61ab28499cd95e631","target":"record","created_at":"2026-05-18T04:09:46Z","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":"90e1459fe24eec62de79bb50205ab46ce92f17f2f5c45d5cc80869a22dd35de1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:16:41Z","title_canon_sha256":"80d037d374dfef7bb0d4fe7e7a47564ba48dab4e2140cdcfb03dd7043e78fc24"},"schema_version":"1.0","source":{"id":"1111.0060","kind":"arxiv","version":1}},"canonical_sha256":"0cd92cf294651f889a7a117cbc72fead19490d6d3bfa18351b15f4c7b80941c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cd92cf294651f889a7a117cbc72fead19490d6d3bfa18351b15f4c7b80941c4","first_computed_at":"2026-05-18T04:09:46.521690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:46.521690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eChoHKsM4b9JtIzAcldYx5QdA/tKJrn9xUXnU0wy/Ng+GuwrLiMdnQd5UxyIXJzm3pMbs9VsEzJquzYA+hSMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:46.522127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88a50daf48ff20b843cd937b480efed536d9d50f1a36afc61ab28499cd95e631","sha256:9482d5c6ae6178403df8acd846a01c32b480411be341d0fd9c1659660e8d4d42"],"state_sha256":"655ba962a7115cf0987da82f606b820fd64f996fb53ad06c944220901e010455"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFNwJK7FnhASIvKmop/LfWx6qeC/9x4UmiuuSTWc/v9K+UTEy6YeMi4/uiCK2VH8xyI1LWTC5MTTzaSBbn0VCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:17:43.750170Z","bundle_sha256":"248cc8720c5989c0355e99fd508738a59ef5ea4136b3d450bc5f5f7303e1d38f"}}