{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NH5QW6NPVD65YWMIAGD4Q5KFGD","short_pith_number":"pith:NH5QW6NP","schema_version":"1.0","canonical_sha256":"69fb0b79afa8fddc59880187c8754530c35d010c29b0e18124c92533765a7e85","source":{"kind":"arxiv","id":"2606.07029","version":1},"attestation_state":"computed","paper":{"title":"A Min-Max Gradient Search Method for Constrained Simulation Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Henry Lam, Ruiyang Jin, Siyang Gao","submitted_at":"2026-06-05T08:18:49Z","abstract_excerpt":"Constrained simulation optimization (CSO) is a general framework for optimizing stochastic systems under performance constraints. It arises widely in practice where objective and constraint evaluations are available only through noisy simulation outputs. Compared with the unconstrained setting, the lack of accessible analytical gradients for simulation-based constraints makes it more challenging to develop efficient solution methods and establish non-asymptotic guarantees. To address this gap, we propose a novel single-loop algorithm, called min-max gradient search (MGS), which integrates a pr"},"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":"2606.07029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-05T08:18:49Z","cross_cats_sorted":[],"title_canon_sha256":"0e497fde6877577216b084feef1c8588932356e7d0d9afb8ee00652055e09627","abstract_canon_sha256":"11b22a746fabd5294fcb329d5da4a16f44b543a11de9fabaf6b6ee331839ef88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:42.171384Z","signature_b64":"q/D0uMEVUD6NyBe5d+9G8Hxf2DdghmBJtk5S1YxWrgCMmRuV9sWFgPmVgiBj8JJVSl4/CEmMU9PnrFCLMiGmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69fb0b79afa8fddc59880187c8754530c35d010c29b0e18124c92533765a7e85","last_reissued_at":"2026-06-08T01:04:42.170621Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:42.170621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Min-Max Gradient Search Method for Constrained Simulation Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Henry Lam, Ruiyang Jin, Siyang Gao","submitted_at":"2026-06-05T08:18:49Z","abstract_excerpt":"Constrained simulation optimization (CSO) is a general framework for optimizing stochastic systems under performance constraints. It arises widely in practice where objective and constraint evaluations are available only through noisy simulation outputs. Compared with the unconstrained setting, the lack of accessible analytical gradients for simulation-based constraints makes it more challenging to develop efficient solution methods and establish non-asymptotic guarantees. To address this gap, we propose a novel single-loop algorithm, called min-max gradient search (MGS), which integrates a pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07029","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.07029/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.07029","created_at":"2026-06-08T01:04:42.170734+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07029v1","created_at":"2026-06-08T01:04:42.170734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07029","created_at":"2026-06-08T01:04:42.170734+00:00"},{"alias_kind":"pith_short_12","alias_value":"NH5QW6NPVD65","created_at":"2026-06-08T01:04:42.170734+00:00"},{"alias_kind":"pith_short_16","alias_value":"NH5QW6NPVD65YWMI","created_at":"2026-06-08T01:04:42.170734+00:00"},{"alias_kind":"pith_short_8","alias_value":"NH5QW6NP","created_at":"2026-06-08T01:04:42.170734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD","json":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD.json","graph_json":"https://pith.science/api/pith-number/NH5QW6NPVD65YWMIAGD4Q5KFGD/graph.json","events_json":"https://pith.science/api/pith-number/NH5QW6NPVD65YWMIAGD4Q5KFGD/events.json","paper":"https://pith.science/paper/NH5QW6NP"},"agent_actions":{"view_html":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD","download_json":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD.json","view_paper":"https://pith.science/paper/NH5QW6NP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07029&json=true","fetch_graph":"https://pith.science/api/pith-number/NH5QW6NPVD65YWMIAGD4Q5KFGD/graph.json","fetch_events":"https://pith.science/api/pith-number/NH5QW6NPVD65YWMIAGD4Q5KFGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD/action/storage_attestation","attest_author":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD/action/author_attestation","sign_citation":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD/action/citation_signature","submit_replication":"https://pith.science/pith/NH5QW6NPVD65YWMIAGD4Q5KFGD/action/replication_record"}},"created_at":"2026-06-08T01:04:42.170734+00:00","updated_at":"2026-06-08T01:04:42.170734+00:00"}