{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZCKJ2F7GSZFCECZ7IADBN3PDWT","short_pith_number":"pith:ZCKJ2F7G","schema_version":"1.0","canonical_sha256":"c8949d17e6964a220b3f400616ede3b4f929d07258540333292418644ea67a5b","source":{"kind":"arxiv","id":"1706.08591","version":1},"attestation_state":"computed","paper":{"title":"Simulation optimization: A review of algorithms and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Bikram Sharda, Nikolaos V. Sahinidis, Satyajith Amaran, Scott J. Bury","submitted_at":"2017-06-26T20:53:33Z","abstract_excerpt":"Simulation Optimization (SO) refers to the optimization of an objective function subject to constraints, both of which can be evaluated through a stochastic simulation. To address specific features of a particular simulation---discrete or continuous decisions, expensive or cheap simulations, single or multiple outputs, homogeneous or heterogeneous noise---various algorithms have been proposed in the literature. As one can imagine, there exist several competing algorithms for each of these classes of problems. This document emphasizes the difficulties in simulation optimization as compared to m"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.08591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-26T20:53:33Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"904ccea4f3ef3cb6e09ef7e266f0895bf3b58a9b99db22357d693c9cf89b9c9b","abstract_canon_sha256":"3aeb0d4aef91f02e4e9189a3c2d26c5600d25fea01ea5c64025b314709c45070"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.634917Z","signature_b64":"ohiBBTbMqCH4yQY2H05ZxZJMJmHCfPIKrz4dSBUzf0YtLOO/p4EcQ6xF0mlUQ8VgxR2+Tn5C4h8dTz5aMKTxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8949d17e6964a220b3f400616ede3b4f929d07258540333292418644ea67a5b","last_reissued_at":"2026-05-18T00:41:31.634335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.634335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulation optimization: A review of algorithms and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Bikram Sharda, Nikolaos V. Sahinidis, Satyajith Amaran, Scott J. Bury","submitted_at":"2017-06-26T20:53:33Z","abstract_excerpt":"Simulation Optimization (SO) refers to the optimization of an objective function subject to constraints, both of which can be evaluated through a stochastic simulation. To address specific features of a particular simulation---discrete or continuous decisions, expensive or cheap simulations, single or multiple outputs, homogeneous or heterogeneous noise---various algorithms have been proposed in the literature. As one can imagine, there exist several competing algorithms for each of these classes of problems. This document emphasizes the difficulties in simulation optimization as compared to m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08591","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08591","created_at":"2026-05-18T00:41:31.634430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08591v1","created_at":"2026-05-18T00:41:31.634430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08591","created_at":"2026-05-18T00:41:31.634430+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCKJ2F7GSZFC","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCKJ2F7GSZFCECZ7","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCKJ2F7G","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12818","citing_title":"Taking the GP Out of the Loop","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT","json":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT.json","graph_json":"https://pith.science/api/pith-number/ZCKJ2F7GSZFCECZ7IADBN3PDWT/graph.json","events_json":"https://pith.science/api/pith-number/ZCKJ2F7GSZFCECZ7IADBN3PDWT/events.json","paper":"https://pith.science/paper/ZCKJ2F7G"},"agent_actions":{"view_html":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT","download_json":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT.json","view_paper":"https://pith.science/paper/ZCKJ2F7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08591&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCKJ2F7GSZFCECZ7IADBN3PDWT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCKJ2F7GSZFCECZ7IADBN3PDWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/action/storage_attestation","attest_author":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/action/author_attestation","sign_citation":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/action/citation_signature","submit_replication":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/action/replication_record"}},"created_at":"2026-05-18T00:41:31.634430+00:00","updated_at":"2026-05-18T00:41:31.634430+00:00"}