{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T3XPFEVKWR3IDFUXLJ63ABOEOK","short_pith_number":"pith:T3XPFEVK","schema_version":"1.0","canonical_sha256":"9eeef292aab4768196975a7db005c472b265e1c0d4ea05ede8910048fc8ac90d","source":{"kind":"arxiv","id":"2508.09411","version":1},"attestation_state":"computed","paper":{"title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Baoyong Zhang, Deming Yuan, Shengyuan Xu, Vincent K. N. Lau, Wentao Zhang","submitted_at":"2025-08-13T01:03:08Z","abstract_excerpt":"This paper considers the distributed online convex-concave optimization with constraint sets over a multiagent network, in which each agent autonomously generates a series of decision pairs through a designable mechanism to cooperatively minimize the global loss function. To this end, under no-Euclidean distance metrics, we propose a distributed online stochastic mirror descent convex-concave optimization algorithm with time-varying predictive mappings. Taking dynamic saddle point regret as a performance metric, it is proved that the proposed algorithm achieves the regret upper-bound in $\\math"},"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":"2508.09411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-13T01:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"e02febb5df769c2e4d1ab5275c9319e7c57005320e64a66a750fb714034cb5da","abstract_canon_sha256":"24f061d311ffe2fa3a43fea98a459d2f1813d045061c55409e72aec2020183a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:14.416838Z","signature_b64":"uQT+yyKxipdb9ID3fE9gK0xflLoIlgN1ITIF4ih5/A4Gya40waBM9jD/f2/Drxn6unoAleKN9Z/3dl61mvBSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eeef292aab4768196975a7db005c472b265e1c0d4ea05ede8910048fc8ac90d","last_reissued_at":"2026-07-05T11:53:14.416357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:14.416357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Baoyong Zhang, Deming Yuan, Shengyuan Xu, Vincent K. N. Lau, Wentao Zhang","submitted_at":"2025-08-13T01:03:08Z","abstract_excerpt":"This paper considers the distributed online convex-concave optimization with constraint sets over a multiagent network, in which each agent autonomously generates a series of decision pairs through a designable mechanism to cooperatively minimize the global loss function. To this end, under no-Euclidean distance metrics, we propose a distributed online stochastic mirror descent convex-concave optimization algorithm with time-varying predictive mappings. Taking dynamic saddle point regret as a performance metric, it is proved that the proposed algorithm achieves the regret upper-bound in $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09411","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/2508.09411/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":"2508.09411","created_at":"2026-07-05T11:53:14.416426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.09411v1","created_at":"2026-07-05T11:53:14.416426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09411","created_at":"2026-07-05T11:53:14.416426+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3XPFEVKWR3I","created_at":"2026-07-05T11:53:14.416426+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3XPFEVKWR3IDFUX","created_at":"2026-07-05T11:53:14.416426+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3XPFEVK","created_at":"2026-07-05T11:53:14.416426+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/T3XPFEVKWR3IDFUXLJ63ABOEOK","json":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK.json","graph_json":"https://pith.science/api/pith-number/T3XPFEVKWR3IDFUXLJ63ABOEOK/graph.json","events_json":"https://pith.science/api/pith-number/T3XPFEVKWR3IDFUXLJ63ABOEOK/events.json","paper":"https://pith.science/paper/T3XPFEVK"},"agent_actions":{"view_html":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK","download_json":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK.json","view_paper":"https://pith.science/paper/T3XPFEVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.09411&json=true","fetch_graph":"https://pith.science/api/pith-number/T3XPFEVKWR3IDFUXLJ63ABOEOK/graph.json","fetch_events":"https://pith.science/api/pith-number/T3XPFEVKWR3IDFUXLJ63ABOEOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK/action/storage_attestation","attest_author":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK/action/author_attestation","sign_citation":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK/action/citation_signature","submit_replication":"https://pith.science/pith/T3XPFEVKWR3IDFUXLJ63ABOEOK/action/replication_record"}},"created_at":"2026-07-05T11:53:14.416426+00:00","updated_at":"2026-07-05T11:53:14.416426+00:00"}