{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UBBBCLORR46HXY34MA2X2O5PBT","short_pith_number":"pith:UBBBCLOR","canonical_record":{"source":{"id":"2103.12840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-23T21:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"57324641c148cef8f3f50a5ba3464c3685b8af063313bd87fd55700fc6732fce","abstract_canon_sha256":"29f277e44fb438c891ceebe47c269a5a1e0b32749a941f808e7201b9b6dd8da8"},"schema_version":"1.0"},"canonical_sha256":"a042112dd18f3c7be37c60357d3baf0cf147ebda3f7cb9be523a7dad080ef658","source":{"kind":"arxiv","id":"2103.12840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.12840","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"arxiv_version","alias_value":"2103.12840v1","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.12840","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"pith_short_12","alias_value":"UBBBCLORR46H","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"UBBBCLORR46HXY34","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"UBBBCLOR","created_at":"2026-07-05T02:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UBBBCLORR46HXY34MA2X2O5PBT","target":"record","payload":{"canonical_record":{"source":{"id":"2103.12840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-23T21:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"57324641c148cef8f3f50a5ba3464c3685b8af063313bd87fd55700fc6732fce","abstract_canon_sha256":"29f277e44fb438c891ceebe47c269a5a1e0b32749a941f808e7201b9b6dd8da8"},"schema_version":"1.0"},"canonical_sha256":"a042112dd18f3c7be37c60357d3baf0cf147ebda3f7cb9be523a7dad080ef658","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:52.563762Z","signature_b64":"+67T9HoC5TKnvWKeQFj+8V4V8WvbB+9o1pMfYYhreQ37FHp+HDYef9xWwBs3MQ3gXKll6DjMQlrmF085QWnvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a042112dd18f3c7be37c60357d3baf0cf147ebda3f7cb9be523a7dad080ef658","last_reissued_at":"2026-07-05T02:25:52.563279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:52.563279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.12840","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:25:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/evejGcX/AM3G9fWB1zapfS5a6ErbPWD/jn+8ra6MP9C9kvDMdx3t2dvdaGa113r5WZkMrA3DPRS6Vg6knz/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:19:33.382299Z"},"content_sha256":"d4414477d705a89d8c4700f26e8ef4b4a89974e42fab496f05ebe874352d381b","schema_version":"1.0","event_id":"sha256:d4414477d705a89d8c4700f26e8ef4b4a89974e42fab496f05ebe874352d381b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UBBBCLORR46HXY34MA2X2O5PBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey of Distributed Optimization Methods for Multi-Robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Javier Yu, Mac Schwager, Ola Shorinwa, Trevor Halsted","submitted_at":"2021-03-23T21:05:29Z","abstract_excerpt":"Distributed optimization consists of multiple computation nodes working together to minimize a common objective function through local computation iterations and network-constrained communication steps. In the context of robotics, distributed optimization algorithms can enable multi-robot systems to accomplish tasks in the absence of centralized coordination. We present a general framework for applying distributed optimization as a module in a robotics pipeline. We survey several classes of distributed optimization algorithms and assess their practical suitability for multi-robot applications."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.12840","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/2103.12840/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:25:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"djgwgaHGGM+bIc8kA1tzLMm0kkqKRja2egDh+jzxYiWHDUDzdL6H5fXwk2hrWxyQRKilH4C6aoxbiuS6XhWGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:19:33.382684Z"},"content_sha256":"e22d339e6b49074cef9283f71db51f0398b2d2d7c72caf63ba3532ac8b3ccb52","schema_version":"1.0","event_id":"sha256:e22d339e6b49074cef9283f71db51f0398b2d2d7c72caf63ba3532ac8b3ccb52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBBBCLORR46HXY34MA2X2O5PBT/bundle.json","state_url":"https://pith.science/pith/UBBBCLORR46HXY34MA2X2O5PBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBBBCLORR46HXY34MA2X2O5PBT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T15:19:33Z","links":{"resolver":"https://pith.science/pith/UBBBCLORR46HXY34MA2X2O5PBT","bundle":"https://pith.science/pith/UBBBCLORR46HXY34MA2X2O5PBT/bundle.json","state":"https://pith.science/pith/UBBBCLORR46HXY34MA2X2O5PBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBBBCLORR46HXY34MA2X2O5PBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UBBBCLORR46HXY34MA2X2O5PBT","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":"29f277e44fb438c891ceebe47c269a5a1e0b32749a941f808e7201b9b6dd8da8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-23T21:05:29Z","title_canon_sha256":"57324641c148cef8f3f50a5ba3464c3685b8af063313bd87fd55700fc6732fce"},"schema_version":"1.0","source":{"id":"2103.12840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.12840","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"arxiv_version","alias_value":"2103.12840v1","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.12840","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"pith_short_12","alias_value":"UBBBCLORR46H","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"UBBBCLORR46HXY34","created_at":"2026-07-05T02:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"UBBBCLOR","created_at":"2026-07-05T02:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:e22d339e6b49074cef9283f71db51f0398b2d2d7c72caf63ba3532ac8b3ccb52","target":"graph","created_at":"2026-07-05T02:25:52Z","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/2103.12840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Distributed optimization consists of multiple computation nodes working together to minimize a common objective function through local computation iterations and network-constrained communication steps. In the context of robotics, distributed optimization algorithms can enable multi-robot systems to accomplish tasks in the absence of centralized coordination. We present a general framework for applying distributed optimization as a module in a robotics pipeline. We survey several classes of distributed optimization algorithms and assess their practical suitability for multi-robot applications.","authors_text":"Javier Yu, Mac Schwager, Ola Shorinwa, Trevor Halsted","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-23T21:05:29Z","title":"A Survey of Distributed Optimization Methods for Multi-Robot Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.12840","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:d4414477d705a89d8c4700f26e8ef4b4a89974e42fab496f05ebe874352d381b","target":"record","created_at":"2026-07-05T02:25:52Z","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":"29f277e44fb438c891ceebe47c269a5a1e0b32749a941f808e7201b9b6dd8da8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-23T21:05:29Z","title_canon_sha256":"57324641c148cef8f3f50a5ba3464c3685b8af063313bd87fd55700fc6732fce"},"schema_version":"1.0","source":{"id":"2103.12840","kind":"arxiv","version":1}},"canonical_sha256":"a042112dd18f3c7be37c60357d3baf0cf147ebda3f7cb9be523a7dad080ef658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a042112dd18f3c7be37c60357d3baf0cf147ebda3f7cb9be523a7dad080ef658","first_computed_at":"2026-07-05T02:25:52.563279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:52.563279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+67T9HoC5TKnvWKeQFj+8V4V8WvbB+9o1pMfYYhreQ37FHp+HDYef9xWwBs3MQ3gXKll6DjMQlrmF085QWnvDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:52.563762Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.12840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4414477d705a89d8c4700f26e8ef4b4a89974e42fab496f05ebe874352d381b","sha256:e22d339e6b49074cef9283f71db51f0398b2d2d7c72caf63ba3532ac8b3ccb52"],"state_sha256":"fa2520205704532c3eee2b3cdcd29dae6ae81f8094e70900301d705130fe9d7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n//iUL5WaNhpZJgnD9fCf87W6qZh9rmwDx/ZQWg0x82Z3WpsuFMTTubLzMbW3KnCTof+vh74iRrURYvYNOFtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:19:33.384608Z","bundle_sha256":"b61fee05bf9378c926b6efcb21869d3ddee838ef38b160ad6eb9babef888bcb3"}}