{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4ZROV4ALCSKAPBOQL2NXSDHN2K","short_pith_number":"pith:4ZROV4AL","canonical_record":{"source":{"id":"2505.15212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-21T07:41:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6cc633a5d2b4f2858bb266d357d6dd4b3bf967c4165108a4dde09dcd252b871f","abstract_canon_sha256":"5173cfdb1fc7b0b88979b13d267fdba6c92528d0ad5ee002583d548cec2dee34"},"schema_version":"1.0"},"canonical_sha256":"e662eaf00b14940785d05e9b790cedd28a49fc774551562646e0d08366aede9e","source":{"kind":"arxiv","id":"2505.15212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.15212","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"2505.15212v1","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15212","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"4ZROV4ALCSKA","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"pith_short_16","alias_value":"4ZROV4ALCSKAPBOQ","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"pith_short_8","alias_value":"4ZROV4AL","created_at":"2026-07-05T11:06:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4ZROV4ALCSKAPBOQL2NXSDHN2K","target":"record","payload":{"canonical_record":{"source":{"id":"2505.15212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-21T07:41:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6cc633a5d2b4f2858bb266d357d6dd4b3bf967c4165108a4dde09dcd252b871f","abstract_canon_sha256":"5173cfdb1fc7b0b88979b13d267fdba6c92528d0ad5ee002583d548cec2dee34"},"schema_version":"1.0"},"canonical_sha256":"e662eaf00b14940785d05e9b790cedd28a49fc774551562646e0d08366aede9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:42.113584Z","signature_b64":"k8b+9OA+EGZn1SQ7pHGOsRGdRFf9E6VHQCWDceWGiPmTau3/rfHOJzKmidVQhHSTqOxYYNFcKdloo8MCo5DnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e662eaf00b14940785d05e9b790cedd28a49fc774551562646e0d08366aede9e","last_reissued_at":"2026-07-05T11:06:42.113129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:42.113129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.15212","source_version":1,"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:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEFvhIBKq7DUrNmJ0cv9jRVpNpJHBcM4PtasdaubNuOQZIweyvNN5jvUvTVNfNhEeVV6ooboG5u/cao9tV5vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T05:02:44.216360Z"},"content_sha256":"bee535a556411701e8d1787f52f8489a798eb9c3957cddfe27d48f4c1d3e46ac","schema_version":"1.0","event_id":"sha256:bee535a556411701e8d1787f52f8489a798eb9c3957cddfe27d48f4c1d3e46ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4ZROV4ALCSKAPBOQL2NXSDHN2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Distributionally Robust Optimization with Flexible Sample Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Dingzhi Yu, Haipeng Luo, Haomin Bai, Lijun Zhang, Shuai Li","submitted_at":"2025-05-21T07:41:16Z","abstract_excerpt":"Group distributionally robust optimization (GDRO) aims to develop models that perform well across $m$ distributions simultaneously. Existing GDRO algorithms can only process a fixed number of samples per iteration, either 1 or $m$, and therefore can not support scenarios where the sample size varies dynamically. To address this limitation, we investigate GDRO with flexible sample queries and cast it as a two-player game: one player solves an online convex optimization problem, while the other tackles a prediction with limited advice (PLA) problem. Within such a game, we propose a novel PLA alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15212","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/2505.15212/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:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeZ/zXbUTzSJc/wQmFNtNuDMIt8HInrRRVckGxRmI7PDoOPpb9ch03YYeIOXxrbdDllUHAnrgKhpRRT7nWF8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T05:02:44.217019Z"},"content_sha256":"3a53107df27999e1b46aa796f44018ee11019a1ba73c843ad95449015aba301a","schema_version":"1.0","event_id":"sha256:3a53107df27999e1b46aa796f44018ee11019a1ba73c843ad95449015aba301a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZROV4ALCSKAPBOQL2NXSDHN2K/bundle.json","state_url":"https://pith.science/pith/4ZROV4ALCSKAPBOQL2NXSDHN2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZROV4ALCSKAPBOQL2NXSDHN2K/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-11T05:02:44Z","links":{"resolver":"https://pith.science/pith/4ZROV4ALCSKAPBOQL2NXSDHN2K","bundle":"https://pith.science/pith/4ZROV4ALCSKAPBOQL2NXSDHN2K/bundle.json","state":"https://pith.science/pith/4ZROV4ALCSKAPBOQL2NXSDHN2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZROV4ALCSKAPBOQL2NXSDHN2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4ZROV4ALCSKAPBOQL2NXSDHN2K","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":"5173cfdb1fc7b0b88979b13d267fdba6c92528d0ad5ee002583d548cec2dee34","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-21T07:41:16Z","title_canon_sha256":"6cc633a5d2b4f2858bb266d357d6dd4b3bf967c4165108a4dde09dcd252b871f"},"schema_version":"1.0","source":{"id":"2505.15212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.15212","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"2505.15212v1","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15212","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"4ZROV4ALCSKA","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"pith_short_16","alias_value":"4ZROV4ALCSKAPBOQ","created_at":"2026-07-05T11:06:42Z"},{"alias_kind":"pith_short_8","alias_value":"4ZROV4AL","created_at":"2026-07-05T11:06:42Z"}],"graph_snapshots":[{"event_id":"sha256:3a53107df27999e1b46aa796f44018ee11019a1ba73c843ad95449015aba301a","target":"graph","created_at":"2026-07-05T11:06:42Z","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/2505.15212/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Group distributionally robust optimization (GDRO) aims to develop models that perform well across $m$ distributions simultaneously. Existing GDRO algorithms can only process a fixed number of samples per iteration, either 1 or $m$, and therefore can not support scenarios where the sample size varies dynamically. To address this limitation, we investigate GDRO with flexible sample queries and cast it as a two-player game: one player solves an online convex optimization problem, while the other tackles a prediction with limited advice (PLA) problem. Within such a game, we propose a novel PLA alg","authors_text":"Dingzhi Yu, Haipeng Luo, Haomin Bai, Lijun Zhang, Shuai Li","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15212","kind":"arxiv","version":1},"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:bee535a556411701e8d1787f52f8489a798eb9c3957cddfe27d48f4c1d3e46ac","target":"record","created_at":"2026-07-05T11:06:42Z","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":"5173cfdb1fc7b0b88979b13d267fdba6c92528d0ad5ee002583d548cec2dee34","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-21T07:41:16Z","title_canon_sha256":"6cc633a5d2b4f2858bb266d357d6dd4b3bf967c4165108a4dde09dcd252b871f"},"schema_version":"1.0","source":{"id":"2505.15212","kind":"arxiv","version":1}},"canonical_sha256":"e662eaf00b14940785d05e9b790cedd28a49fc774551562646e0d08366aede9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e662eaf00b14940785d05e9b790cedd28a49fc774551562646e0d08366aede9e","first_computed_at":"2026-07-05T11:06:42.113129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:06:42.113129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k8b+9OA+EGZn1SQ7pHGOsRGdRFf9E6VHQCWDceWGiPmTau3/rfHOJzKmidVQhHSTqOxYYNFcKdloo8MCo5DnBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:06:42.113584Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.15212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee535a556411701e8d1787f52f8489a798eb9c3957cddfe27d48f4c1d3e46ac","sha256:3a53107df27999e1b46aa796f44018ee11019a1ba73c843ad95449015aba301a"],"state_sha256":"27a6967826c19030165bd8fae44c8951d11b2c273acca1300ac81da5d1fa9b49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQwbaazIqYvi8QSorm6b0XGtcwmv50sZARi2AreqTIoc+ZFYrTJ3EA59C6aLtgfKPiwyMUlk3gxxH87kQHrrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T05:02:44.222682Z","bundle_sha256":"38a1037b3133e5e224ed66ee7325c4f36df9cbaae36ca6d56b63c7626a030da8"}}