{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3GHKJPL2F6ZFBCQBD77QSCUSWM","short_pith_number":"pith:3GHKJPL2","canonical_record":{"source":{"id":"1409.4863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-09-17T03:44:20Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"55c1e90f02c98ae30f75ef883a00f357aeead501bb7f0759515c4fb1c7490f22","abstract_canon_sha256":"e57b5c15cc0b2bdde68901fb9b3c0c3a31eaf3b6d0ff868ae4a5e18a00bb850f"},"schema_version":"1.0"},"canonical_sha256":"d98ea4bd7a2fb2508a011fff090a92b311d2a2f49bb7e21f267b799e80e4fdac","source":{"kind":"arxiv","id":"1409.4863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4863","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4863v1","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4863","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"3GHKJPL2F6ZF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GHKJPL2F6ZFBCQB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GHKJPL2","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3GHKJPL2F6ZFBCQBD77QSCUSWM","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-09-17T03:44:20Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"55c1e90f02c98ae30f75ef883a00f357aeead501bb7f0759515c4fb1c7490f22","abstract_canon_sha256":"e57b5c15cc0b2bdde68901fb9b3c0c3a31eaf3b6d0ff868ae4a5e18a00bb850f"},"schema_version":"1.0"},"canonical_sha256":"d98ea4bd7a2fb2508a011fff090a92b311d2a2f49bb7e21f267b799e80e4fdac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:12.003424Z","signature_b64":"4yvYlkCrJHCN91S7zHrl/GjIv8tiOVGCsloz7lQ+D6BwDhcOdmasC6fhYNmIhfSMb+dq4Xk2DPLdnlrTH7CQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98ea4bd7a2fb2508a011fff090a92b311d2a2f49bb7e21f267b799e80e4fdac","last_reissued_at":"2026-05-18T00:38:12.002705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:12.002705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4863","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-05-18T00:38:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzCpbeEhEUT2GKMWyvk5tUSa2cCKLbB3noHZF8Ay0kerJcqbNLaYagX5hCY522FMiGXjm0VoTtd8gHmjkkciDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:40.138005Z"},"content_sha256":"0a19af26504ac3aa2d15a477d02ff38d34d7b4af411804cb43310352948132df","schema_version":"1.0","event_id":"sha256:0a19af26504ac3aa2d15a477d02ff38d34d7b4af411804cb43310352948132df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3GHKJPL2F6ZFBCQBD77QSCUSWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the fundamental limitations of performance for distributed decision-making in robotic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Federico Rossi, Marco Pavone","submitted_at":"2014-09-17T03:44:20Z","abstract_excerpt":"This paper studies fundamental limitations of performance for distributed decision-making in robotic networks. The class of decision-making problems we consider encompasses a number of prototypical problems such as average-based consensus as well as distributed optimization, leader election, majority voting, MAX, MIN, and logical formulas. We first propose a formal model for distributed computation on robotic networks that is based on the concept of I/O automata and is inspired by the Computer Science literature on distributed computing clusters. Then, we present a number of bounds on time, me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4863","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"},"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-05-18T00:38:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axh3tUQ156s1YMSdt8+3EmRsjJPEHTp/gwPFe4vYE/xxIRGj6ujT295UlppzgwRnZbrfVPmoAFHgU1xFwj4sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:40.138701Z"},"content_sha256":"35db3d2af83e47097672c4393c31a650cc0216b5171005edb19aaeb9943aaebf","schema_version":"1.0","event_id":"sha256:35db3d2af83e47097672c4393c31a650cc0216b5171005edb19aaeb9943aaebf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GHKJPL2F6ZFBCQBD77QSCUSWM/bundle.json","state_url":"https://pith.science/pith/3GHKJPL2F6ZFBCQBD77QSCUSWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GHKJPL2F6ZFBCQBD77QSCUSWM/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-05-27T03:17:40Z","links":{"resolver":"https://pith.science/pith/3GHKJPL2F6ZFBCQBD77QSCUSWM","bundle":"https://pith.science/pith/3GHKJPL2F6ZFBCQBD77QSCUSWM/bundle.json","state":"https://pith.science/pith/3GHKJPL2F6ZFBCQBD77QSCUSWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GHKJPL2F6ZFBCQBD77QSCUSWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3GHKJPL2F6ZFBCQBD77QSCUSWM","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":"e57b5c15cc0b2bdde68901fb9b3c0c3a31eaf3b6d0ff868ae4a5e18a00bb850f","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-09-17T03:44:20Z","title_canon_sha256":"55c1e90f02c98ae30f75ef883a00f357aeead501bb7f0759515c4fb1c7490f22"},"schema_version":"1.0","source":{"id":"1409.4863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4863","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4863v1","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4863","created_at":"2026-05-18T00:38:12Z"},{"alias_kind":"pith_short_12","alias_value":"3GHKJPL2F6ZF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GHKJPL2F6ZFBCQB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GHKJPL2","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:35db3d2af83e47097672c4393c31a650cc0216b5171005edb19aaeb9943aaebf","target":"graph","created_at":"2026-05-18T00:38:12Z","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"},"paper":{"abstract_excerpt":"This paper studies fundamental limitations of performance for distributed decision-making in robotic networks. The class of decision-making problems we consider encompasses a number of prototypical problems such as average-based consensus as well as distributed optimization, leader election, majority voting, MAX, MIN, and logical formulas. We first propose a formal model for distributed computation on robotic networks that is based on the concept of I/O automata and is inspired by the Computer Science literature on distributed computing clusters. Then, we present a number of bounds on time, me","authors_text":"Federico Rossi, Marco Pavone","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-09-17T03:44:20Z","title":"On the fundamental limitations of performance for distributed decision-making in robotic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4863","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:0a19af26504ac3aa2d15a477d02ff38d34d7b4af411804cb43310352948132df","target":"record","created_at":"2026-05-18T00:38:12Z","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":"e57b5c15cc0b2bdde68901fb9b3c0c3a31eaf3b6d0ff868ae4a5e18a00bb850f","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-09-17T03:44:20Z","title_canon_sha256":"55c1e90f02c98ae30f75ef883a00f357aeead501bb7f0759515c4fb1c7490f22"},"schema_version":"1.0","source":{"id":"1409.4863","kind":"arxiv","version":1}},"canonical_sha256":"d98ea4bd7a2fb2508a011fff090a92b311d2a2f49bb7e21f267b799e80e4fdac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d98ea4bd7a2fb2508a011fff090a92b311d2a2f49bb7e21f267b799e80e4fdac","first_computed_at":"2026-05-18T00:38:12.002705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:12.002705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4yvYlkCrJHCN91S7zHrl/GjIv8tiOVGCsloz7lQ+D6BwDhcOdmasC6fhYNmIhfSMb+dq4Xk2DPLdnlrTH7CQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:12.003424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a19af26504ac3aa2d15a477d02ff38d34d7b4af411804cb43310352948132df","sha256:35db3d2af83e47097672c4393c31a650cc0216b5171005edb19aaeb9943aaebf"],"state_sha256":"5eff8476aa6c1d0b25ff6299e8bb60df54a1be47f2983013b04e47ab103e5623"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UMqGDfS68JFre/ceDXFZRjwQQb7Cfw955kuoozC5SzoaEyFFQWc9Xhb4cZVO/XGnmM0jb1bSaNNadIrnFMOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:17:40.142540Z","bundle_sha256":"e08fbe3ad1eb05e9724229d749b90c92dfe9d2e574a523002d8eb57c9b2e3b6f"}}