{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LWK7QGVPKBZCRIQCCD7ZCSOXD2","short_pith_number":"pith:LWK7QGVP","schema_version":"1.0","canonical_sha256":"5d95f81aaf507228a20210ff9149d71ea92a82a7ca505472cbbeca20f9731b91","source":{"kind":"arxiv","id":"1711.03875","version":3},"attestation_state":"computed","paper":{"title":"Nonconcave Robust Optimization with Discrete Strategies under Knightian Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-fin.MF"],"primary_cat":"math.OC","authors_text":"Ariel Neufeld, Mario Sikic","submitted_at":"2017-11-09T15:46:41Z","abstract_excerpt":"We study robust stochastic optimization problems in the quasi-sure setting in discrete-time. The strategies in the multi-period-case are restricted to those taking values in a discrete set. The optimization problems under consideration are not concave. We provide conditions under which a maximizer exists. The class of problems covered by our robust optimization problem includes optimal stopping and semi-static trading under Knightian uncertainty."},"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":"1711.03875","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-09T15:46:41Z","cross_cats_sorted":["math.PR","q-fin.MF"],"title_canon_sha256":"bf13c6d0be11646eb16f028da0d388a4fab1cc34a30d0f931f1c240c8532eed9","abstract_canon_sha256":"a44892df2e484e24cdcbf50711519794cc7ca34a0b7f20da85e26d262cd5229a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:54.008232Z","signature_b64":"eLpM+7l+OhQsahoQWvwN5Yye6q+80Qi0dpa9T5H9SUj/3depqEojPkB2+aEgFQHjHIIa6n7ztxzp8ZPYCgB2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d95f81aaf507228a20210ff9149d71ea92a82a7ca505472cbbeca20f9731b91","last_reissued_at":"2026-05-17T23:47:54.007613Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:54.007613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonconcave Robust Optimization with Discrete Strategies under Knightian Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-fin.MF"],"primary_cat":"math.OC","authors_text":"Ariel Neufeld, Mario Sikic","submitted_at":"2017-11-09T15:46:41Z","abstract_excerpt":"We study robust stochastic optimization problems in the quasi-sure setting in discrete-time. The strategies in the multi-period-case are restricted to those taking values in a discrete set. The optimization problems under consideration are not concave. We provide conditions under which a maximizer exists. The class of problems covered by our robust optimization problem includes optimal stopping and semi-static trading under Knightian uncertainty."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03875","kind":"arxiv","version":3},"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":"1711.03875","created_at":"2026-05-17T23:47:54.007706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03875v3","created_at":"2026-05-17T23:47:54.007706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03875","created_at":"2026-05-17T23:47:54.007706+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWK7QGVPKBZC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWK7QGVPKBZCRIQC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWK7QGVP","created_at":"2026-05-18T12:31:28.150371+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/LWK7QGVPKBZCRIQCCD7ZCSOXD2","json":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2.json","graph_json":"https://pith.science/api/pith-number/LWK7QGVPKBZCRIQCCD7ZCSOXD2/graph.json","events_json":"https://pith.science/api/pith-number/LWK7QGVPKBZCRIQCCD7ZCSOXD2/events.json","paper":"https://pith.science/paper/LWK7QGVP"},"agent_actions":{"view_html":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2","download_json":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2.json","view_paper":"https://pith.science/paper/LWK7QGVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03875&json=true","fetch_graph":"https://pith.science/api/pith-number/LWK7QGVPKBZCRIQCCD7ZCSOXD2/graph.json","fetch_events":"https://pith.science/api/pith-number/LWK7QGVPKBZCRIQCCD7ZCSOXD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2/action/storage_attestation","attest_author":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2/action/author_attestation","sign_citation":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2/action/citation_signature","submit_replication":"https://pith.science/pith/LWK7QGVPKBZCRIQCCD7ZCSOXD2/action/replication_record"}},"created_at":"2026-05-17T23:47:54.007706+00:00","updated_at":"2026-05-17T23:47:54.007706+00:00"}