{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QGHQWM6FJEYMGBIDIZPWGFVKAO","short_pith_number":"pith:QGHQWM6F","canonical_record":{"source":{"id":"2503.22923","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-29T01:01:02Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"56977c8389ca4962491b5561f86d0f7a2cdb935b5977a0fa47bc671f9520dfbe","abstract_canon_sha256":"2e029a22c7d2c7eccb4cb853de667710e9b7f307b618addbe54ec5a285a13d76"},"schema_version":"1.0"},"canonical_sha256":"818f0b33c54930c30503465f6316aa03bcec9597128f48910c7f3f0efa37f0cb","source":{"kind":"arxiv","id":"2503.22923","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.22923","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"2503.22923v2","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.22923","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"QGHQWM6FJEYM","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"pith_short_16","alias_value":"QGHQWM6FJEYMGBID","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"pith_short_8","alias_value":"QGHQWM6F","created_at":"2026-07-05T11:27:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QGHQWM6FJEYMGBIDIZPWGFVKAO","target":"record","payload":{"canonical_record":{"source":{"id":"2503.22923","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-29T01:01:02Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"56977c8389ca4962491b5561f86d0f7a2cdb935b5977a0fa47bc671f9520dfbe","abstract_canon_sha256":"2e029a22c7d2c7eccb4cb853de667710e9b7f307b618addbe54ec5a285a13d76"},"schema_version":"1.0"},"canonical_sha256":"818f0b33c54930c30503465f6316aa03bcec9597128f48910c7f3f0efa37f0cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:53.534203Z","signature_b64":"w0zwOB7kTGxLTkv33Hkf/s1vwjvmp9kVKZECDH6yQykTYmaFIXM0dnQkMkBInVmhFbEFjhvKEobSyQVy9PSlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"818f0b33c54930c30503465f6316aa03bcec9597128f48910c7f3f0efa37f0cb","last_reissued_at":"2026-07-05T11:27:53.533704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:53.533704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.22923","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WoGn6hCPBeiSfgtKyZo9VSRkN0L51ThKbqWYd825YNYGwlFFicJINeUTOg+vYoUOnzeqadGn1cvWvciS1tnQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T13:56:36.822298Z"},"content_sha256":"88068661d072247d646938b00d95fdab2b0ff480eebcbb1e9dddda6215b1be1b","schema_version":"1.0","event_id":"sha256:88068661d072247d646938b00d95fdab2b0ff480eebcbb1e9dddda6215b1be1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QGHQWM6FJEYMGBIDIZPWGFVKAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Yi Zhou, Yufeng Yang, Zhaosong Lu","submitted_at":"2025-03-29T01:01:02Z","abstract_excerpt":"Distributionally robust optimization (DRO) is a powerful technique to train robust models against data distribution shift. This paper aims to solve regularized nonconvex DRO problems, where the uncertainty set is modeled by a so-called generalized Sinkhorn distance and the loss function is nonconvex and possibly unbounded. Such a distance allows to model uncertainty of distributions with different probability supports and divergence functions. For this class of regularized DRO problems, we derive a novel dual formulation taking the form of nested stochastic optimization, where the dual variabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.22923","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/2503.22923/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:27:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHVJ22zAYu2KVGU4rqUwylYNVPPPSv8ta9lIORWM/jXUATuXqvc/IrfORpmJ+y9tLfQwqTXD7mxwSO4hwHuzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T13:56:36.823238Z"},"content_sha256":"21bc24ddc7866f4b015b9a63a4c09390cf001e0d3f4a563730686acf6b5dd377","schema_version":"1.0","event_id":"sha256:21bc24ddc7866f4b015b9a63a4c09390cf001e0d3f4a563730686acf6b5dd377"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGHQWM6FJEYMGBIDIZPWGFVKAO/bundle.json","state_url":"https://pith.science/pith/QGHQWM6FJEYMGBIDIZPWGFVKAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGHQWM6FJEYMGBIDIZPWGFVKAO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-17T13:56:36Z","links":{"resolver":"https://pith.science/pith/QGHQWM6FJEYMGBIDIZPWGFVKAO","bundle":"https://pith.science/pith/QGHQWM6FJEYMGBIDIZPWGFVKAO/bundle.json","state":"https://pith.science/pith/QGHQWM6FJEYMGBIDIZPWGFVKAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGHQWM6FJEYMGBIDIZPWGFVKAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QGHQWM6FJEYMGBIDIZPWGFVKAO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2e029a22c7d2c7eccb4cb853de667710e9b7f307b618addbe54ec5a285a13d76","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-29T01:01:02Z","title_canon_sha256":"56977c8389ca4962491b5561f86d0f7a2cdb935b5977a0fa47bc671f9520dfbe"},"schema_version":"1.0","source":{"id":"2503.22923","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.22923","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"2503.22923v2","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.22923","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"QGHQWM6FJEYM","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"pith_short_16","alias_value":"QGHQWM6FJEYMGBID","created_at":"2026-07-05T11:27:53Z"},{"alias_kind":"pith_short_8","alias_value":"QGHQWM6F","created_at":"2026-07-05T11:27:53Z"}],"graph_snapshots":[{"event_id":"sha256:21bc24ddc7866f4b015b9a63a4c09390cf001e0d3f4a563730686acf6b5dd377","target":"graph","created_at":"2026-07-05T11:27:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.22923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Distributionally robust optimization (DRO) is a powerful technique to train robust models against data distribution shift. This paper aims to solve regularized nonconvex DRO problems, where the uncertainty set is modeled by a so-called generalized Sinkhorn distance and the loss function is nonconvex and possibly unbounded. Such a distance allows to model uncertainty of distributions with different probability supports and divergence functions. For this class of regularized DRO problems, we derive a novel dual formulation taking the form of nested stochastic optimization, where the dual variabl","authors_text":"Yi Zhou, Yufeng Yang, Zhaosong Lu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-29T01:01:02Z","title":"Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.22923","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:88068661d072247d646938b00d95fdab2b0ff480eebcbb1e9dddda6215b1be1b","target":"record","created_at":"2026-07-05T11:27:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2e029a22c7d2c7eccb4cb853de667710e9b7f307b618addbe54ec5a285a13d76","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-29T01:01:02Z","title_canon_sha256":"56977c8389ca4962491b5561f86d0f7a2cdb935b5977a0fa47bc671f9520dfbe"},"schema_version":"1.0","source":{"id":"2503.22923","kind":"arxiv","version":2}},"canonical_sha256":"818f0b33c54930c30503465f6316aa03bcec9597128f48910c7f3f0efa37f0cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"818f0b33c54930c30503465f6316aa03bcec9597128f48910c7f3f0efa37f0cb","first_computed_at":"2026-07-05T11:27:53.533704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:53.533704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w0zwOB7kTGxLTkv33Hkf/s1vwjvmp9kVKZECDH6yQykTYmaFIXM0dnQkMkBInVmhFbEFjhvKEobSyQVy9PSlBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:53.534203Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.22923","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88068661d072247d646938b00d95fdab2b0ff480eebcbb1e9dddda6215b1be1b","sha256:21bc24ddc7866f4b015b9a63a4c09390cf001e0d3f4a563730686acf6b5dd377"],"state_sha256":"660d5cd6d8cf95587b43b8767b03ad85df804fa2c0de355ba448f52f10605746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MK3F85aDEm8FRTXvRIN+CPvdU5QRsomefD4vpJEtrwM85bsb/+p7l7ES0Z0jE8Ip6nZnxB65jJfh4r7uAFUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T13:56:36.832619Z","bundle_sha256":"c5d8f3fd856f5198ac679079f9f05ee209c17469fe0bb146a5f179aea89ca6fc"}}