{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T3XPFEVKWR3IDFUXLJ63ABOEOK","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":"24f061d311ffe2fa3a43fea98a459d2f1813d045061c55409e72aec2020183a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-13T01:03:08Z","title_canon_sha256":"e02febb5df769c2e4d1ab5275c9319e7c57005320e64a66a750fb714034cb5da"},"schema_version":"1.0","source":{"id":"2508.09411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.09411","created_at":"2026-07-05T11:53:14Z"},{"alias_kind":"arxiv_version","alias_value":"2508.09411v1","created_at":"2026-07-05T11:53:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09411","created_at":"2026-07-05T11:53:14Z"},{"alias_kind":"pith_short_12","alias_value":"T3XPFEVKWR3I","created_at":"2026-07-05T11:53:14Z"},{"alias_kind":"pith_short_16","alias_value":"T3XPFEVKWR3IDFUX","created_at":"2026-07-05T11:53:14Z"},{"alias_kind":"pith_short_8","alias_value":"T3XPFEVK","created_at":"2026-07-05T11:53:14Z"}],"graph_snapshots":[{"event_id":"sha256:3bf71b63cfa4313ba738b6a44fa78a7284640594f9b8bfcff0eb2a2e97f6fbbc","target":"graph","created_at":"2026-07-05T11:53:14Z","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/2508.09411/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Baoyong Zhang, Deming Yuan, Shengyuan Xu, Vincent K. N. Lau, Wentao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09411","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:15c9fa1efb65626ef395f35fdec532542ab30bb02a9d7a2d48beeea5ef40043e","target":"record","created_at":"2026-07-05T11:53:14Z","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":"24f061d311ffe2fa3a43fea98a459d2f1813d045061c55409e72aec2020183a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-13T01:03:08Z","title_canon_sha256":"e02febb5df769c2e4d1ab5275c9319e7c57005320e64a66a750fb714034cb5da"},"schema_version":"1.0","source":{"id":"2508.09411","kind":"arxiv","version":1}},"canonical_sha256":"9eeef292aab4768196975a7db005c472b265e1c0d4ea05ede8910048fc8ac90d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eeef292aab4768196975a7db005c472b265e1c0d4ea05ede8910048fc8ac90d","first_computed_at":"2026-07-05T11:53:14.416357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:53:14.416357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uQT+yyKxipdb9ID3fE9gK0xflLoIlgN1ITIF4ih5/A4Gya40waBM9jD/f2/Drxn6unoAleKN9Z/3dl61mvBSAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:53:14.416838Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.09411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15c9fa1efb65626ef395f35fdec532542ab30bb02a9d7a2d48beeea5ef40043e","sha256:3bf71b63cfa4313ba738b6a44fa78a7284640594f9b8bfcff0eb2a2e97f6fbbc"],"state_sha256":"a76143b267facc054d37ab54e5eec9cac3c054991c4560f9011279131fdfda7a"}