{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NZENVYRUKWDN52IAKW2WMQHUO6","short_pith_number":"pith:NZENVYRU","schema_version":"1.0","canonical_sha256":"6e48dae2345586dee90055b56640f47780b23d42cffda1bd6a071b4bb3a2ef23","source":{"kind":"arxiv","id":"1903.04133","version":6},"attestation_state":"computed","paper":{"title":"Distributed Non-convex Optimization of Multi-agent Systems Using Boosting Functions to Escape Local Optima: Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Shirantha Welikala","submitted_at":"2019-03-11T05:40:14Z","abstract_excerpt":"We address the problem of multiple local optima arising due to non-convex objective functions in cooperative multi-agent optimization problems. To escape such local optima, we propose a systematic approach based on the concept of boosting functions. The underlying idea is to temporarily transform the gradient at a local optimum into a boosted gradient with a non-zero magnitude. We develop a Distributed Boosting Scheme (DBS) based on a gradient-based optimization algorithm using a novel optimal variable step size mechanism so as to guarantee convergence. Even though our motivation is based on t"},"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":"1903.04133","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T05:40:14Z","cross_cats_sorted":[],"title_canon_sha256":"6b1fdafd28412790e03dfcf20e5cd828783d9fb54397ec52a827e291cb835ed0","abstract_canon_sha256":"6b1921baf723a902acf8f0037f35bfc723ae563b560c35e32e49bea6e813d110"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:23.772191Z","signature_b64":"OUdIC3/5IC7A9Q4UorFXhqOLI9T6/sf9dgntrP8lz79iHECL+/3mAgfWtJwMUaCqP6B9D+9j238IrTMTfWxPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e48dae2345586dee90055b56640f47780b23d42cffda1bd6a071b4bb3a2ef23","last_reissued_at":"2026-07-05T01:19:23.771638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:23.771638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Non-convex Optimization of Multi-agent Systems Using Boosting Functions to Escape Local Optima: Theory and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Shirantha Welikala","submitted_at":"2019-03-11T05:40:14Z","abstract_excerpt":"We address the problem of multiple local optima arising due to non-convex objective functions in cooperative multi-agent optimization problems. To escape such local optima, we propose a systematic approach based on the concept of boosting functions. The underlying idea is to temporarily transform the gradient at a local optimum into a boosted gradient with a non-zero magnitude. We develop a Distributed Boosting Scheme (DBS) based on a gradient-based optimization algorithm using a novel optimal variable step size mechanism so as to guarantee convergence. Even though our motivation is based on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04133","kind":"arxiv","version":6},"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/1903.04133/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":"1903.04133","created_at":"2026-07-05T01:19:23.771698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04133v6","created_at":"2026-07-05T01:19:23.771698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04133","created_at":"2026-07-05T01:19:23.771698+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZENVYRUKWDN","created_at":"2026-07-05T01:19:23.771698+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZENVYRUKWDN52IA","created_at":"2026-07-05T01:19:23.771698+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZENVYRU","created_at":"2026-07-05T01:19:23.771698+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.08802","citing_title":"Distributed Global Optimization by Annealing","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6","json":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6.json","graph_json":"https://pith.science/api/pith-number/NZENVYRUKWDN52IAKW2WMQHUO6/graph.json","events_json":"https://pith.science/api/pith-number/NZENVYRUKWDN52IAKW2WMQHUO6/events.json","paper":"https://pith.science/paper/NZENVYRU"},"agent_actions":{"view_html":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6","download_json":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6.json","view_paper":"https://pith.science/paper/NZENVYRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04133&json=true","fetch_graph":"https://pith.science/api/pith-number/NZENVYRUKWDN52IAKW2WMQHUO6/graph.json","fetch_events":"https://pith.science/api/pith-number/NZENVYRUKWDN52IAKW2WMQHUO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6/action/storage_attestation","attest_author":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6/action/author_attestation","sign_citation":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6/action/citation_signature","submit_replication":"https://pith.science/pith/NZENVYRUKWDN52IAKW2WMQHUO6/action/replication_record"}},"created_at":"2026-07-05T01:19:23.771698+00:00","updated_at":"2026-07-05T01:19:23.771698+00:00"}