{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VBRXM3PMY73D2446NOUQ4WLFRN","short_pith_number":"pith:VBRXM3PM","canonical_record":{"source":{"id":"2102.11386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-22T22:23:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aae21201f174b78cb2747fd1cddc66be8c951eed801bb6be41c81fc1f2199d37","abstract_canon_sha256":"31c3d9eaeeef2a0b648e85da123039a14d610950fa6b74e134a7547fbd4f47c2"},"schema_version":"1.0"},"canonical_sha256":"a863766decc7f63d739e6ba90e59658b695a85d2657a9b54069b60de5f4bf47a","source":{"kind":"arxiv","id":"2102.11386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.11386","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"2102.11386v2","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11386","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"VBRXM3PMY73D","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"pith_short_16","alias_value":"VBRXM3PMY73D2446","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"pith_short_8","alias_value":"VBRXM3PM","created_at":"2026-07-05T02:32:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VBRXM3PMY73D2446NOUQ4WLFRN","target":"record","payload":{"canonical_record":{"source":{"id":"2102.11386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-22T22:23:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aae21201f174b78cb2747fd1cddc66be8c951eed801bb6be41c81fc1f2199d37","abstract_canon_sha256":"31c3d9eaeeef2a0b648e85da123039a14d610950fa6b74e134a7547fbd4f47c2"},"schema_version":"1.0"},"canonical_sha256":"a863766decc7f63d739e6ba90e59658b695a85d2657a9b54069b60de5f4bf47a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:03.437918Z","signature_b64":"VdKF7sMqrkaKLEvUsqr0WXlmSu7OGGvIHjVkEhg8jbhW3NUDA4QzaHlm/rkGW8Q3TgAgoOfp2pSNvgyCXS92BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a863766decc7f63d739e6ba90e59658b695a85d2657a9b54069b60de5f4bf47a","last_reissued_at":"2026-07-05T02:32:03.437506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:03.437506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.11386","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-05T02:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0HP6KptsYNAABWwWND2oDxkBgXJXm367mZcGif1KySkZ9l7TaqGPsFR9mQA3NL/N6oW7QU8oKZhNSx1llddkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:38:10.155007Z"},"content_sha256":"18e3c95ffeb108e9f745630db7b491cae3604754a6b23e69cbe44082f18ad81a","schema_version":"1.0","event_id":"sha256:18e3c95ffeb108e9f745630db7b491cae3604754a6b23e69cbe44082f18ad81a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VBRXM3PMY73D2446NOUQ4WLFRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Direct-Search for a Class of Stochastic Min-Max Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Aurelien Lucchi, Sotiris Anagnostidis, Youssef Diouane","submitted_at":"2021-02-22T22:23:58Z","abstract_excerpt":"Recent applications in machine learning have renewed the interest of the community in min-max optimization problems. While gradient-based optimization methods are widely used to solve such problems, there are however many scenarios where these techniques are not well-suited, or even not applicable when the gradient is not accessible. We investigate the use of direct-search methods that belong to a class of derivative-free techniques that only access the objective function through an oracle. In this work, we design a novel algorithm in the context of min-max saddle point games where one sequent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11386","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/2102.11386/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-05T02:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uobxLnkhYTAYjX5aZ6tbIwhtlyENgCUi6S+DdQIFCHuTtZ+vEi3rWNCOTYbJo6A6rqqYjv7IiEtOssAG3aX3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:38:10.155543Z"},"content_sha256":"fa92be21a53a0e9f640bf3b8cd044ec0f52527900d050b1b19ec431a9e12109b","schema_version":"1.0","event_id":"sha256:fa92be21a53a0e9f640bf3b8cd044ec0f52527900d050b1b19ec431a9e12109b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBRXM3PMY73D2446NOUQ4WLFRN/bundle.json","state_url":"https://pith.science/pith/VBRXM3PMY73D2446NOUQ4WLFRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBRXM3PMY73D2446NOUQ4WLFRN/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-07T10:38:10Z","links":{"resolver":"https://pith.science/pith/VBRXM3PMY73D2446NOUQ4WLFRN","bundle":"https://pith.science/pith/VBRXM3PMY73D2446NOUQ4WLFRN/bundle.json","state":"https://pith.science/pith/VBRXM3PMY73D2446NOUQ4WLFRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBRXM3PMY73D2446NOUQ4WLFRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VBRXM3PMY73D2446NOUQ4WLFRN","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":"31c3d9eaeeef2a0b648e85da123039a14d610950fa6b74e134a7547fbd4f47c2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-22T22:23:58Z","title_canon_sha256":"aae21201f174b78cb2747fd1cddc66be8c951eed801bb6be41c81fc1f2199d37"},"schema_version":"1.0","source":{"id":"2102.11386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.11386","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"2102.11386v2","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11386","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"VBRXM3PMY73D","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"pith_short_16","alias_value":"VBRXM3PMY73D2446","created_at":"2026-07-05T02:32:03Z"},{"alias_kind":"pith_short_8","alias_value":"VBRXM3PM","created_at":"2026-07-05T02:32:03Z"}],"graph_snapshots":[{"event_id":"sha256:fa92be21a53a0e9f640bf3b8cd044ec0f52527900d050b1b19ec431a9e12109b","target":"graph","created_at":"2026-07-05T02:32:03Z","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/2102.11386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent applications in machine learning have renewed the interest of the community in min-max optimization problems. While gradient-based optimization methods are widely used to solve such problems, there are however many scenarios where these techniques are not well-suited, or even not applicable when the gradient is not accessible. We investigate the use of direct-search methods that belong to a class of derivative-free techniques that only access the objective function through an oracle. In this work, we design a novel algorithm in the context of min-max saddle point games where one sequent","authors_text":"Aurelien Lucchi, Sotiris Anagnostidis, Youssef Diouane","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-22T22:23:58Z","title":"Direct-Search for a Class of Stochastic Min-Max Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11386","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:18e3c95ffeb108e9f745630db7b491cae3604754a6b23e69cbe44082f18ad81a","target":"record","created_at":"2026-07-05T02:32:03Z","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":"31c3d9eaeeef2a0b648e85da123039a14d610950fa6b74e134a7547fbd4f47c2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-22T22:23:58Z","title_canon_sha256":"aae21201f174b78cb2747fd1cddc66be8c951eed801bb6be41c81fc1f2199d37"},"schema_version":"1.0","source":{"id":"2102.11386","kind":"arxiv","version":2}},"canonical_sha256":"a863766decc7f63d739e6ba90e59658b695a85d2657a9b54069b60de5f4bf47a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a863766decc7f63d739e6ba90e59658b695a85d2657a9b54069b60de5f4bf47a","first_computed_at":"2026-07-05T02:32:03.437506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:32:03.437506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VdKF7sMqrkaKLEvUsqr0WXlmSu7OGGvIHjVkEhg8jbhW3NUDA4QzaHlm/rkGW8Q3TgAgoOfp2pSNvgyCXS92BA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:32:03.437918Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.11386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18e3c95ffeb108e9f745630db7b491cae3604754a6b23e69cbe44082f18ad81a","sha256:fa92be21a53a0e9f640bf3b8cd044ec0f52527900d050b1b19ec431a9e12109b"],"state_sha256":"a28404c7ece0392e6be7fa62ac8bc237e3513e847e13f2deaa05e112f7bba2f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5vz25NYnSngJEK5Ru/Ui5kPb63yvxwKdY/nIFeCCZeINbm203J26TDHFwWLqGuGIRjSw3PDEM9PQwiVl9KjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:38:10.159729Z","bundle_sha256":"653073830ad9a95f78560b783ef47c42d21b55ca53f6ea7da6fe46250b7e168f"}}