{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6ZLHVPY4RZBCXMN7YQAF4WD7VI","short_pith_number":"pith:6ZLHVPY4","schema_version":"1.0","canonical_sha256":"f6567abf1c8e422bb1bfc4005e587faa1f8beb565fd3ddcd138a99becbabf278","source":{"kind":"arxiv","id":"1509.01864","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Multi-Agent Optimization: Part III","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Lili Su, Nitin Vaidya","submitted_at":"2015-09-06T23:07:36Z","abstract_excerpt":"We study fault-tolerant distributed optimization of a sum of convex (cost) functions with real-valued scalar input/output in the presence of crash faults or Byzantine faults. In particular, the goal is to optimize a global cost function $\\frac{1}{n}\\sum_{i\\in \\mathcal{V}} h_i(x)$, where $\\mathcal{V}=\\{1, \\ldots, n\\}$ is the collection of agents, and $h_i(x)$ is agent $i$'s local cost function, which is initially known only to agent $i$. Since the above global cost function cannot be optimized exactly in presence of crash faults or Byzantine faults, we define two weaker versions of the problem "},"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":"1509.01864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-06T23:07:36Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"739cb6efe51b6d5722d324cef2a72ffe0f35dde1be4ceb85837f3e638920db93","abstract_canon_sha256":"f0a94fa33f307b338c23383573e16e12cc38ca185d630dac87fc208c769f2947"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:50.340040Z","signature_b64":"PBATRLjsytYrUyfpMINOnl/xSFngtoVgclTn34xcxzGESdTZBuWFi5NRqmxf6++M/1kNfdKVUQt5ZHcMiTt9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6567abf1c8e422bb1bfc4005e587faa1f8beb565fd3ddcd138a99becbabf278","last_reissued_at":"2026-05-18T01:33:50.339343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:50.339343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Multi-Agent Optimization: Part III","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Lili Su, Nitin Vaidya","submitted_at":"2015-09-06T23:07:36Z","abstract_excerpt":"We study fault-tolerant distributed optimization of a sum of convex (cost) functions with real-valued scalar input/output in the presence of crash faults or Byzantine faults. In particular, the goal is to optimize a global cost function $\\frac{1}{n}\\sum_{i\\in \\mathcal{V}} h_i(x)$, where $\\mathcal{V}=\\{1, \\ldots, n\\}$ is the collection of agents, and $h_i(x)$ is agent $i$'s local cost function, which is initially known only to agent $i$. Since the above global cost function cannot be optimized exactly in presence of crash faults or Byzantine faults, we define two weaker versions of the problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01864","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":""},"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":"1509.01864","created_at":"2026-05-18T01:33:50.339454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01864v1","created_at":"2026-05-18T01:33:50.339454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01864","created_at":"2026-05-18T01:33:50.339454+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZLHVPY4RZBC","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZLHVPY4RZBCXMN7","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZLHVPY4","created_at":"2026-05-18T12:29:07.941421+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/6ZLHVPY4RZBCXMN7YQAF4WD7VI","json":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI.json","graph_json":"https://pith.science/api/pith-number/6ZLHVPY4RZBCXMN7YQAF4WD7VI/graph.json","events_json":"https://pith.science/api/pith-number/6ZLHVPY4RZBCXMN7YQAF4WD7VI/events.json","paper":"https://pith.science/paper/6ZLHVPY4"},"agent_actions":{"view_html":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI","download_json":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI.json","view_paper":"https://pith.science/paper/6ZLHVPY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01864&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZLHVPY4RZBCXMN7YQAF4WD7VI/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZLHVPY4RZBCXMN7YQAF4WD7VI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI/action/storage_attestation","attest_author":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI/action/author_attestation","sign_citation":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI/action/citation_signature","submit_replication":"https://pith.science/pith/6ZLHVPY4RZBCXMN7YQAF4WD7VI/action/replication_record"}},"created_at":"2026-05-18T01:33:50.339454+00:00","updated_at":"2026-05-18T01:33:50.339454+00:00"}