{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZCKJ2F7GSZFCECZ7IADBN3PDWT","short_pith_number":"pith:ZCKJ2F7G","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"},"canonical_sha256":"c8949d17e6964a220b3f400616ede3b4f929d07258540333292418644ea67a5b","source":{"kind":"arxiv","id":"1706.08591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08591","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08591v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08591","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZCKJ2F7GSZFC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZCKJ2F7GSZFCECZ7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZCKJ2F7G","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZCKJ2F7GSZFCECZ7IADBN3PDWT","target":"record","payload":{"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"},"canonical_sha256":"c8949d17e6964a220b3f400616ede3b4f929d07258540333292418644ea67a5b","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"},"source_kind":"arxiv","source_id":"1706.08591","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-18T00:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFG9Sy9iieUCMYTFbD+N9XS1yvWe5UhZhBujGq0v7mPVNU8cjJMKWHS4z18dEwSRPSX8ZdOGoPaVlm6gI1wZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:51:31.460356Z"},"content_sha256":"95bdc76cc33cf74614137fe89ab54f0907dc41a1ffd2439c4f342acb6b7e5859","schema_version":"1.0","event_id":"sha256:95bdc76cc33cf74614137fe89ab54f0907dc41a1ffd2439c4f342acb6b7e5859"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZCKJ2F7GSZFCECZ7IADBN3PDWT","target":"graph","payload":{"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"},"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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bQ+K05gBqEDayCthsD0cqa4jw4TXM8MoO5HVcpeUen6Pcl1/o+iKbLwSm39n3R/ohRvPER+zxbmzpaOKazOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:51:31.460781Z"},"content_sha256":"f9fb61ecc0ea9ad1166d32d59d8507c1b081138154c9be4fd111b2bb9fc04cfb","schema_version":"1.0","event_id":"sha256:f9fb61ecc0ea9ad1166d32d59d8507c1b081138154c9be4fd111b2bb9fc04cfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/bundle.json","state_url":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/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-20T13:51:31Z","links":{"resolver":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT","bundle":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/bundle.json","state":"https://pith.science/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCKJ2F7GSZFCECZ7IADBN3PDWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZCKJ2F7GSZFCECZ7IADBN3PDWT","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":"3aeb0d4aef91f02e4e9189a3c2d26c5600d25fea01ea5c64025b314709c45070","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-26T20:53:33Z","title_canon_sha256":"904ccea4f3ef3cb6e09ef7e266f0895bf3b58a9b99db22357d693c9cf89b9c9b"},"schema_version":"1.0","source":{"id":"1706.08591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08591","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08591v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08591","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZCKJ2F7GSZFC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZCKJ2F7GSZFCECZ7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZCKJ2F7G","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:f9fb61ecc0ea9ad1166d32d59d8507c1b081138154c9be4fd111b2bb9fc04cfb","target":"graph","created_at":"2026-05-18T00:41:31Z","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":"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","authors_text":"Bikram Sharda, Nikolaos V. Sahinidis, Satyajith Amaran, Scott J. Bury","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-26T20:53:33Z","title":"Simulation optimization: A review of algorithms and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08591","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:95bdc76cc33cf74614137fe89ab54f0907dc41a1ffd2439c4f342acb6b7e5859","target":"record","created_at":"2026-05-18T00:41:31Z","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":"3aeb0d4aef91f02e4e9189a3c2d26c5600d25fea01ea5c64025b314709c45070","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-26T20:53:33Z","title_canon_sha256":"904ccea4f3ef3cb6e09ef7e266f0895bf3b58a9b99db22357d693c9cf89b9c9b"},"schema_version":"1.0","source":{"id":"1706.08591","kind":"arxiv","version":1}},"canonical_sha256":"c8949d17e6964a220b3f400616ede3b4f929d07258540333292418644ea67a5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8949d17e6964a220b3f400616ede3b4f929d07258540333292418644ea67a5b","first_computed_at":"2026-05-18T00:41:31.634335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.634335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohiBBTbMqCH4yQY2H05ZxZJMJmHCfPIKrz4dSBUzf0YtLOO/p4EcQ6xF0mlUQ8VgxR2+Tn5C4h8dTz5aMKTxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.634917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95bdc76cc33cf74614137fe89ab54f0907dc41a1ffd2439c4f342acb6b7e5859","sha256:f9fb61ecc0ea9ad1166d32d59d8507c1b081138154c9be4fd111b2bb9fc04cfb"],"state_sha256":"fff8c7c86e432cdaa1d0b471e75d6f71beddbefc24e940a7c4a24df64d19e8f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cywx8WPEHOUD1uCTM3CmNFrHhrbOpwhlJCj0tWrZUz4F+X56KWgxt850FQhJiSvW9QDkAbH9iH0ss3dAbUyuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T13:51:31.463764Z","bundle_sha256":"d210e8686f6e77099dbcfa931f69e899ffae64c8a700ee0afa7630c7f694d7e6"}}