{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BXCD2H2TC6OWXWZHRBQVW32UCN","short_pith_number":"pith:BXCD2H2T","schema_version":"1.0","canonical_sha256":"0dc43d1f53179d6bdb2788615b6f54135af8b5077603555d2dd219f820e71080","source":{"kind":"arxiv","id":"2509.07901","version":1},"attestation_state":"computed","paper":{"title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jian-Wei Liu, Qing-xin Meng, Xia Lei","submitted_at":"2025-09-09T16:33:38Z","abstract_excerpt":"This paper investigates the problem of Online Convex-Concave Optimization, which extends Online Convex Optimization to two-player time-varying convex-concave games. The goal is to minimize the dynamic duality gap (D-DGap), a critical performance measure that evaluates players' strategies against arbitrary comparator sequences. Existing algorithms fail to deliver optimal performance, particularly in stationary or predictable environments. To address this, we propose a novel modular algorithm with three core components: an Adaptive Module that dynamically adjusts to varying levels of non-station"},"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":"2509.07901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-09T16:33:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"59c511b5e757a5ca7a3b55a9b2b34232fa10414f46f4f1efc7ae394417873dad","abstract_canon_sha256":"f76e08bc616cdc0900dfdf411b1a126124c2a26640e00fae1bbe6c842c27f123"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:42.016245Z","signature_b64":"n02JJbS1IqziJok71NSBET6/N0oBna9Alxb2CWXrJhY3EQdD4roNDkGHtoKsKs/2PTq3DlSpLhwYNdLilgrnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc43d1f53179d6bdb2788615b6f54135af8b5077603555d2dd219f820e71080","last_reissued_at":"2026-07-05T12:07:42.015671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:42.015671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jian-Wei Liu, Qing-xin Meng, Xia Lei","submitted_at":"2025-09-09T16:33:38Z","abstract_excerpt":"This paper investigates the problem of Online Convex-Concave Optimization, which extends Online Convex Optimization to two-player time-varying convex-concave games. The goal is to minimize the dynamic duality gap (D-DGap), a critical performance measure that evaluates players' strategies against arbitrary comparator sequences. Existing algorithms fail to deliver optimal performance, particularly in stationary or predictable environments. To address this, we propose a novel modular algorithm with three core components: an Adaptive Module that dynamically adjusts to varying levels of non-station"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07901","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/2509.07901/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":"2509.07901","created_at":"2026-07-05T12:07:42.015739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07901v1","created_at":"2026-07-05T12:07:42.015739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07901","created_at":"2026-07-05T12:07:42.015739+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXCD2H2TC6OW","created_at":"2026-07-05T12:07:42.015739+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXCD2H2TC6OWXWZH","created_at":"2026-07-05T12:07:42.015739+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXCD2H2T","created_at":"2026-07-05T12:07:42.015739+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/BXCD2H2TC6OWXWZHRBQVW32UCN","json":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN.json","graph_json":"https://pith.science/api/pith-number/BXCD2H2TC6OWXWZHRBQVW32UCN/graph.json","events_json":"https://pith.science/api/pith-number/BXCD2H2TC6OWXWZHRBQVW32UCN/events.json","paper":"https://pith.science/paper/BXCD2H2T"},"agent_actions":{"view_html":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN","download_json":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN.json","view_paper":"https://pith.science/paper/BXCD2H2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07901&json=true","fetch_graph":"https://pith.science/api/pith-number/BXCD2H2TC6OWXWZHRBQVW32UCN/graph.json","fetch_events":"https://pith.science/api/pith-number/BXCD2H2TC6OWXWZHRBQVW32UCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN/action/storage_attestation","attest_author":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN/action/author_attestation","sign_citation":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN/action/citation_signature","submit_replication":"https://pith.science/pith/BXCD2H2TC6OWXWZHRBQVW32UCN/action/replication_record"}},"created_at":"2026-07-05T12:07:42.015739+00:00","updated_at":"2026-07-05T12:07:42.015739+00:00"}