{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SYP2XWEV4LOSHF4YIFBD26DBHJ","short_pith_number":"pith:SYP2XWEV","schema_version":"1.0","canonical_sha256":"961fabd895e2dd23979841423d78613a5340e535a2bef827cb06fdee9d09e53b","source":{"kind":"arxiv","id":"1409.0776","version":3},"attestation_state":"computed","paper":{"title":"Escaping Local Optima in a Class of Multi-Agent Distributed Optimization Problems: A Boosting Function Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Kagan Gokbayrak, Xinmiao Sun","submitted_at":"2014-09-02T16:28:04Z","abstract_excerpt":"We address the problem of multiple local optima commonly arising in optimization problems for multi-agent systems, where objective functions are nonlinear and nonconvex. For the class of coverage control problems, we propose a systematic approach for escaping a local optimum, rather than randomly perturbing controllable variables away from it. We show that the objective function for these problems can be decomposed to facilitate the evaluation of the local partial derivative of each node in the system and to provide insights into its structure. This structure is exploited by defining \"boosting"},"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":"1409.0776","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-02T16:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"89c059a8ff397a02a3a3f1962804747a617a527ffcbc3dcea1ee19485aa57f4f","abstract_canon_sha256":"534aaa9bc28675ecc5f8305f9f4624f7e4924ebf591b35aa0633d78b11cccd60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:18.514174Z","signature_b64":"w7oF9cKKrQNXQyEjBnIs8wMjLgeXY8W9Sg4E9hfQgOQ3/F0cZ7hNyci4J+DHn8TcUnd+m7OiilHvMaCmlPUQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961fabd895e2dd23979841423d78613a5340e535a2bef827cb06fdee9d09e53b","last_reissued_at":"2026-05-18T02:43:18.513655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:18.513655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Escaping Local Optima in a Class of Multi-Agent Distributed Optimization Problems: A Boosting Function Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Kagan Gokbayrak, Xinmiao Sun","submitted_at":"2014-09-02T16:28:04Z","abstract_excerpt":"We address the problem of multiple local optima commonly arising in optimization problems for multi-agent systems, where objective functions are nonlinear and nonconvex. For the class of coverage control problems, we propose a systematic approach for escaping a local optimum, rather than randomly perturbing controllable variables away from it. We show that the objective function for these problems can be decomposed to facilitate the evaluation of the local partial derivative of each node in the system and to provide insights into its structure. This structure is exploited by defining \"boosting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0776","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1409.0776","created_at":"2026-05-18T02:43:18.513728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0776v3","created_at":"2026-05-18T02:43:18.513728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0776","created_at":"2026-05-18T02:43:18.513728+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYP2XWEV4LOS","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYP2XWEV4LOSHF4Y","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYP2XWEV","created_at":"2026-05-18T12:28:49.207871+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/SYP2XWEV4LOSHF4YIFBD26DBHJ","json":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ.json","graph_json":"https://pith.science/api/pith-number/SYP2XWEV4LOSHF4YIFBD26DBHJ/graph.json","events_json":"https://pith.science/api/pith-number/SYP2XWEV4LOSHF4YIFBD26DBHJ/events.json","paper":"https://pith.science/paper/SYP2XWEV"},"agent_actions":{"view_html":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ","download_json":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ.json","view_paper":"https://pith.science/paper/SYP2XWEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0776&json=true","fetch_graph":"https://pith.science/api/pith-number/SYP2XWEV4LOSHF4YIFBD26DBHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SYP2XWEV4LOSHF4YIFBD26DBHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ/action/storage_attestation","attest_author":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ/action/author_attestation","sign_citation":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ/action/citation_signature","submit_replication":"https://pith.science/pith/SYP2XWEV4LOSHF4YIFBD26DBHJ/action/replication_record"}},"created_at":"2026-05-18T02:43:18.513728+00:00","updated_at":"2026-05-18T02:43:18.513728+00:00"}