{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ","short_pith_number":"pith:Y5ZGZ4LR","schema_version":"1.0","canonical_sha256":"c7726cf171f68dd3c391b8133cfc594427e0f991bf1d85665f833af73572318f","source":{"kind":"arxiv","id":"2306.00149","version":1},"attestation_state":"computed","paper":{"title":"Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Karl H. Johansson, Lihua Xie, Tao Yang, Tianyou Chai, Xinlei Yi, Xiuxian Li, Yiguang Hong","submitted_at":"2023-05-31T19:39:15Z","abstract_excerpt":"This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an $\\mathcal{O}(T^{\\max\\{c,1-c\\}})$ network regret bound and an $\\mathca"},"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":"2306.00149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-31T19:39:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b7fac1b5e0d072627abc291ab711d416fe7b48d6e2c30cae72e7a09ea67fc1be","abstract_canon_sha256":"c8091e1496328cd6a95a73bfdc496277bfb36458acbd61753bd44ca07e81de6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:22.344849Z","signature_b64":"zKDdzLLg2K5q146COk7Amwr18exOTFESr1viKgE1dUkNZyRXiH/BRIZiD11QBb0jb4g/trUXyNmYmMxXKbNUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7726cf171f68dd3c391b8133cfc594427e0f991bf1d85665f833af73572318f","last_reissued_at":"2026-07-05T06:16:22.344424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:22.344424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Karl H. Johansson, Lihua Xie, Tao Yang, Tianyou Chai, Xinlei Yi, Xiuxian Li, Yiguang Hong","submitted_at":"2023-05-31T19:39:15Z","abstract_excerpt":"This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an $\\mathcal{O}(T^{\\max\\{c,1-c\\}})$ network regret bound and an $\\mathca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.00149","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/2306.00149/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":"2306.00149","created_at":"2026-07-05T06:16:22.344487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.00149v1","created_at":"2026-07-05T06:16:22.344487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.00149","created_at":"2026-07-05T06:16:22.344487+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5ZGZ4LR62G5","created_at":"2026-07-05T06:16:22.344487+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5ZGZ4LR62G5HQ4R","created_at":"2026-07-05T06:16:22.344487+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5ZGZ4LR","created_at":"2026-07-05T06:16:22.344487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21107","citing_title":"A Geometric Approach to Constrained Online Learning","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06190","citing_title":"Constrained Contextual Bandits with Adversarial Contexts","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07386","citing_title":"Convex Optimization with Nested Evolving Feasible Sets","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ","json":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ.json","graph_json":"https://pith.science/api/pith-number/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/graph.json","events_json":"https://pith.science/api/pith-number/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/events.json","paper":"https://pith.science/paper/Y5ZGZ4LR"},"agent_actions":{"view_html":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ","download_json":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ.json","view_paper":"https://pith.science/paper/Y5ZGZ4LR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.00149&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/action/storage_attestation","attest_author":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/action/author_attestation","sign_citation":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/action/citation_signature","submit_replication":"https://pith.science/pith/Y5ZGZ4LR62G5HQ4RXAJTZ7CZIQ/action/replication_record"}},"created_at":"2026-07-05T06:16:22.344487+00:00","updated_at":"2026-07-05T06:16:22.344487+00:00"}