{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HCLNZJD2CZAGGZMNOF4IHFAQDJ","short_pith_number":"pith:HCLNZJD2","schema_version":"1.0","canonical_sha256":"3896dca47a164063658d71788394101a73a19c877f9598f0f98ca39eccb5ef83","source":{"kind":"arxiv","id":"2511.20126","version":2},"attestation_state":"computed","paper":{"title":"Scaling limits of multi-period distributionally robust optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Alessandro Sgarabottolo, Ariel Neufeld, Kyunghyun Park, Max Nendel","submitted_at":"2025-11-25T09:48:31Z","abstract_excerpt":"We examine the scaling limit of multi-period distributionally robust optimization (DRO) problems via a semigroup approach. Each period involves a worst-case maximization over distributions in a Wasserstein ball around the transition probability of a reference process with radius proportional to the length of the period, and the multi-period DRO problem arises through its sequential composition. We show that the scaling limit of the multi-period DRO, as the length of each period tends to zero, is a strongly continuous monotone semigroup on $\\mathrm{C_b}$. Furthermore, we show that its infinites"},"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":"2511.20126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-25T09:48:31Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"1c7e811f53cc547dbc6a5909bd1f72f6a9a8a12926999fffece3615d0276a97b","abstract_canon_sha256":"26d83da7b5271a6f145eafdcd218d382d52ee483f7db75fb321933d2d9289569"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:35.032726Z","signature_b64":"SVVHZxbRjY3uCzvVS6fEaH8nCqB0ZaL2Loy5MmMJnys+7ZaR9eGXTLo1y5EyhMAUK3itB9s1Du41odQlJWBkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3896dca47a164063658d71788394101a73a19c877f9598f0f98ca39eccb5ef83","last_reissued_at":"2026-06-09T02:08:35.031390Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:35.031390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling limits of multi-period distributionally robust optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Alessandro Sgarabottolo, Ariel Neufeld, Kyunghyun Park, Max Nendel","submitted_at":"2025-11-25T09:48:31Z","abstract_excerpt":"We examine the scaling limit of multi-period distributionally robust optimization (DRO) problems via a semigroup approach. Each period involves a worst-case maximization over distributions in a Wasserstein ball around the transition probability of a reference process with radius proportional to the length of the period, and the multi-period DRO problem arises through its sequential composition. We show that the scaling limit of the multi-period DRO, as the length of each period tends to zero, is a strongly continuous monotone semigroup on $\\mathrm{C_b}$. Furthermore, we show that its infinites"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.20126","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/2511.20126/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":"2511.20126","created_at":"2026-06-09T02:08:35.031578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.20126v2","created_at":"2026-06-09T02:08:35.031578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.20126","created_at":"2026-06-09T02:08:35.031578+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCLNZJD2CZAG","created_at":"2026-06-09T02:08:35.031578+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCLNZJD2CZAGGZMN","created_at":"2026-06-09T02:08:35.031578+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCLNZJD2","created_at":"2026-06-09T02:08:35.031578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21759","citing_title":"An optimal transport foundation for a class of dynamically consistent risk measures","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ","json":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ.json","graph_json":"https://pith.science/api/pith-number/HCLNZJD2CZAGGZMNOF4IHFAQDJ/graph.json","events_json":"https://pith.science/api/pith-number/HCLNZJD2CZAGGZMNOF4IHFAQDJ/events.json","paper":"https://pith.science/paper/HCLNZJD2"},"agent_actions":{"view_html":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ","download_json":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ.json","view_paper":"https://pith.science/paper/HCLNZJD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.20126&json=true","fetch_graph":"https://pith.science/api/pith-number/HCLNZJD2CZAGGZMNOF4IHFAQDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HCLNZJD2CZAGGZMNOF4IHFAQDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ/action/storage_attestation","attest_author":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ/action/author_attestation","sign_citation":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ/action/citation_signature","submit_replication":"https://pith.science/pith/HCLNZJD2CZAGGZMNOF4IHFAQDJ/action/replication_record"}},"created_at":"2026-06-09T02:08:35.031578+00:00","updated_at":"2026-06-09T02:08:35.031578+00:00"}