{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3DA3YARPA2QVODNU2WRUQM2TMR","short_pith_number":"pith:3DA3YARP","schema_version":"1.0","canonical_sha256":"d8c1bc022f06a1570db4d5a34833536448a30871f40a7a0e996c22363200da8e","source":{"kind":"arxiv","id":"2401.00547","version":2},"attestation_state":"computed","paper":{"title":"On Learning for Ambiguous Chance Constrained Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"A Ch Madhusudanarao, Rahul Singh","submitted_at":"2023-12-31T17:25:43Z","abstract_excerpt":"We study chance constrained optimization problems $\\min_x f(x)$ s.t. $P(\\left\\{ \\theta: g(x,\\theta)\\le 0 \\right\\})\\ge 1-\\epsilon$ where $\\epsilon\\in (0,1)$ is the violation probability, when the distribution $P$ is not known to the decision maker (DM). When the DM has access to a set of distributions $\\mathcal{U}$ such that $P$ is contained in $\\mathcal{U}$, then the problem is known as the ambiguous chance-constrained problem \\cite{erdougan2006ambiguous}. We study ambiguous chance-constrained problem for the case when $\\mathcal{U}$ is of the form $\\left\\{\\mu:\\frac{\\mu (y)}{\\nu(y)}\\leq C, \\for"},"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":"2401.00547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-31T17:25:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"09c47b1d297795b92b25cf1a25e96b83071b81973c48860dd4b1f3e66a276d8b","abstract_canon_sha256":"23b9cdc69bc3627f9a62cd6cf8f0976834a0adcfed0d22fab01b10f44c7f88c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:59.369233Z","signature_b64":"H8+dEm12retbsKW/cKnh6LAw+m1aQ5kB/UWqctyPZ4Yd62BOEP/cpSPi2DVEGng7JgJhk7rhqSj3kOj5SxrTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8c1bc022f06a1570db4d5a34833536448a30871f40a7a0e996c22363200da8e","last_reissued_at":"2026-07-05T07:43:59.368800Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:59.368800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Learning for Ambiguous Chance Constrained Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"A Ch Madhusudanarao, Rahul Singh","submitted_at":"2023-12-31T17:25:43Z","abstract_excerpt":"We study chance constrained optimization problems $\\min_x f(x)$ s.t. $P(\\left\\{ \\theta: g(x,\\theta)\\le 0 \\right\\})\\ge 1-\\epsilon$ where $\\epsilon\\in (0,1)$ is the violation probability, when the distribution $P$ is not known to the decision maker (DM). When the DM has access to a set of distributions $\\mathcal{U}$ such that $P$ is contained in $\\mathcal{U}$, then the problem is known as the ambiguous chance-constrained problem \\cite{erdougan2006ambiguous}. We study ambiguous chance-constrained problem for the case when $\\mathcal{U}$ is of the form $\\left\\{\\mu:\\frac{\\mu (y)}{\\nu(y)}\\leq C, \\for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00547","kind":"arxiv","version":2},"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/2401.00547/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":"2401.00547","created_at":"2026-07-05T07:43:59.368860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.00547v2","created_at":"2026-07-05T07:43:59.368860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00547","created_at":"2026-07-05T07:43:59.368860+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DA3YARPA2QV","created_at":"2026-07-05T07:43:59.368860+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DA3YARPA2QVODNU","created_at":"2026-07-05T07:43:59.368860+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DA3YARP","created_at":"2026-07-05T07:43:59.368860+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/3DA3YARPA2QVODNU2WRUQM2TMR","json":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR.json","graph_json":"https://pith.science/api/pith-number/3DA3YARPA2QVODNU2WRUQM2TMR/graph.json","events_json":"https://pith.science/api/pith-number/3DA3YARPA2QVODNU2WRUQM2TMR/events.json","paper":"https://pith.science/paper/3DA3YARP"},"agent_actions":{"view_html":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR","download_json":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR.json","view_paper":"https://pith.science/paper/3DA3YARP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.00547&json=true","fetch_graph":"https://pith.science/api/pith-number/3DA3YARPA2QVODNU2WRUQM2TMR/graph.json","fetch_events":"https://pith.science/api/pith-number/3DA3YARPA2QVODNU2WRUQM2TMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR/action/storage_attestation","attest_author":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR/action/author_attestation","sign_citation":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR/action/citation_signature","submit_replication":"https://pith.science/pith/3DA3YARPA2QVODNU2WRUQM2TMR/action/replication_record"}},"created_at":"2026-07-05T07:43:59.368860+00:00","updated_at":"2026-07-05T07:43:59.368860+00:00"}