{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HCEQ3UUCVYXCEM537WMSGW273X","short_pith_number":"pith:HCEQ3UUC","schema_version":"1.0","canonical_sha256":"38890dd282ae2e2233bbfd99235b5fddf33834c290a7da6b84831cc96c6a7154","source":{"kind":"arxiv","id":"2003.00248","version":1},"attestation_state":"computed","paper":{"title":"Tightly Robust Optimization via Empirical Domain Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Akihiro Yabe, Takanori Maehara","submitted_at":"2020-02-29T12:24:56Z","abstract_excerpt":"Data-driven decision-making is performed by solving a parameterized optimization problem, and the optimal decision is given by an optimal solution for unknown true parameters. We often need a solution that satisfies true constraints even though these are unknown. Robust optimization is employed to obtain such a solution, where the uncertainty of the parameter is represented by an ellipsoid, and the scale of robustness is controlled by a coefficient. In this study, we propose an algorithm to determine the scale such that the solution has a good objective value and satisfies the true constraints"},"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":"2003.00248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-29T12:24:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b1312dc75b949f4d1a628df69f0a6fc33a67501d0e469ac2b2201522faeb2191","abstract_canon_sha256":"4a57ab968a19ca0cc0e2155620ab479c014bbb853ad55ca729ad7a62efa87f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:45.265017Z","signature_b64":"Il7vVZUF1Bu58MsqXMSnHkZEezUqcwxE6w/SsdJGi+CV2lnAaFdQQzGZt2TlPacIaceS6+qcafRmtRpSD0SxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38890dd282ae2e2233bbfd99235b5fddf33834c290a7da6b84831cc96c6a7154","last_reissued_at":"2026-07-05T00:44:45.264447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:45.264447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tightly Robust Optimization via Empirical Domain Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Akihiro Yabe, Takanori Maehara","submitted_at":"2020-02-29T12:24:56Z","abstract_excerpt":"Data-driven decision-making is performed by solving a parameterized optimization problem, and the optimal decision is given by an optimal solution for unknown true parameters. We often need a solution that satisfies true constraints even though these are unknown. Robust optimization is employed to obtain such a solution, where the uncertainty of the parameter is represented by an ellipsoid, and the scale of robustness is controlled by a coefficient. In this study, we propose an algorithm to determine the scale such that the solution has a good objective value and satisfies the true constraints"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00248","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/2003.00248/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":"2003.00248","created_at":"2026-07-05T00:44:45.264506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.00248v1","created_at":"2026-07-05T00:44:45.264506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00248","created_at":"2026-07-05T00:44:45.264506+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCEQ3UUCVYXC","created_at":"2026-07-05T00:44:45.264506+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCEQ3UUCVYXCEM53","created_at":"2026-07-05T00:44:45.264506+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCEQ3UUC","created_at":"2026-07-05T00:44:45.264506+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/HCEQ3UUCVYXCEM537WMSGW273X","json":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X.json","graph_json":"https://pith.science/api/pith-number/HCEQ3UUCVYXCEM537WMSGW273X/graph.json","events_json":"https://pith.science/api/pith-number/HCEQ3UUCVYXCEM537WMSGW273X/events.json","paper":"https://pith.science/paper/HCEQ3UUC"},"agent_actions":{"view_html":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X","download_json":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X.json","view_paper":"https://pith.science/paper/HCEQ3UUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.00248&json=true","fetch_graph":"https://pith.science/api/pith-number/HCEQ3UUCVYXCEM537WMSGW273X/graph.json","fetch_events":"https://pith.science/api/pith-number/HCEQ3UUCVYXCEM537WMSGW273X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X/action/storage_attestation","attest_author":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X/action/author_attestation","sign_citation":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X/action/citation_signature","submit_replication":"https://pith.science/pith/HCEQ3UUCVYXCEM537WMSGW273X/action/replication_record"}},"created_at":"2026-07-05T00:44:45.264506+00:00","updated_at":"2026-07-05T00:44:45.264506+00:00"}