{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SJIZ6DLBJYMWA7SQVPUOPRHDE3","short_pith_number":"pith:SJIZ6DLB","canonical_record":{"source":{"id":"1410.0956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-10-03T18:52:00Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ee16d826fd3a767bddf459f47e9b6cad9121e57f3f0043a1d78b0972280329d","abstract_canon_sha256":"b1ba42d0217faee4cae2f8a36cb1a833669182c7b917e3078ced0ca47a59fe8e"},"schema_version":"1.0"},"canonical_sha256":"92519f0d614e19607e50abe8e7c4e326d3008addcd56e4b16200c37f8c788e70","source":{"kind":"arxiv","id":"1410.0956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0956","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0956v1","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0956","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"SJIZ6DLBJYMW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SJIZ6DLBJYMWA7SQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SJIZ6DLB","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SJIZ6DLBJYMWA7SQVPUOPRHDE3","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-10-03T18:52:00Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ee16d826fd3a767bddf459f47e9b6cad9121e57f3f0043a1d78b0972280329d","abstract_canon_sha256":"b1ba42d0217faee4cae2f8a36cb1a833669182c7b917e3078ced0ca47a59fe8e"},"schema_version":"1.0"},"canonical_sha256":"92519f0d614e19607e50abe8e7c4e326d3008addcd56e4b16200c37f8c788e70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:03.125787Z","signature_b64":"P2ion35Fu4Rih0DIxwbikdx8R3TRPCg8ML2070RK15j2FtalIBQdtkyU3hNYhJPvcIoSw3+GHzPWM2KhS72MCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92519f0d614e19607e50abe8e7c4e326d3008addcd56e4b16200c37f8c788e70","last_reissued_at":"2026-05-18T02:41:03.125183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:03.125183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0956","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-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5dv7eC4M4JEYlqZASgvG85+0Gz0xkqX3TVokRySXqc5M/NEzVZMQEsfITbqgOsVFOML5QK3eDQ/x2fCsIyOoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:53:48.289589Z"},"content_sha256":"d024e830ed198635ee119ed548af67030000fac2b00655287b4fc9925d035012","schema_version":"1.0","event_id":"sha256:d024e830ed198635ee119ed548af67030000fac2b00655287b4fc9925d035012"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SJIZ6DLBJYMWA7SQVPUOPRHDE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed consensus with mixed time/communication bandwidth performance metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"Federico Rossi, Marco Pavone","submitted_at":"2014-10-03T18:52:00Z","abstract_excerpt":"In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as bandwidth complexity, is related to the frequency bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for dense robotic networks. We prove a lower bound on the ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0956","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-18T02:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AVJ2ITXmeAQzBz+7C4jZlVwQzQTZuuvNQBod8VTDKaO++UUNFxdAY5Dj4cvJEab8ihUOksZ+i+0UX7DSUGpxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:53:48.290233Z"},"content_sha256":"bf4e04ed7c02244e7bde0dacdd0812fd64669e42c8959da16754a7dd4635d55e","schema_version":"1.0","event_id":"sha256:bf4e04ed7c02244e7bde0dacdd0812fd64669e42c8959da16754a7dd4635d55e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJIZ6DLBJYMWA7SQVPUOPRHDE3/bundle.json","state_url":"https://pith.science/pith/SJIZ6DLBJYMWA7SQVPUOPRHDE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJIZ6DLBJYMWA7SQVPUOPRHDE3/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-27T04:53:48Z","links":{"resolver":"https://pith.science/pith/SJIZ6DLBJYMWA7SQVPUOPRHDE3","bundle":"https://pith.science/pith/SJIZ6DLBJYMWA7SQVPUOPRHDE3/bundle.json","state":"https://pith.science/pith/SJIZ6DLBJYMWA7SQVPUOPRHDE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJIZ6DLBJYMWA7SQVPUOPRHDE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SJIZ6DLBJYMWA7SQVPUOPRHDE3","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":"b1ba42d0217faee4cae2f8a36cb1a833669182c7b917e3078ced0ca47a59fe8e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-10-03T18:52:00Z","title_canon_sha256":"0ee16d826fd3a767bddf459f47e9b6cad9121e57f3f0043a1d78b0972280329d"},"schema_version":"1.0","source":{"id":"1410.0956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0956","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0956v1","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0956","created_at":"2026-05-18T02:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"SJIZ6DLBJYMW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SJIZ6DLBJYMWA7SQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SJIZ6DLB","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:bf4e04ed7c02244e7bde0dacdd0812fd64669e42c8959da16754a7dd4635d55e","target":"graph","created_at":"2026-05-18T02:41:03Z","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":"In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as bandwidth complexity, is related to the frequency bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for dense robotic networks. We prove a lower bound on the ba","authors_text":"Federico Rossi, Marco Pavone","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-10-03T18:52:00Z","title":"Distributed consensus with mixed time/communication bandwidth performance metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0956","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:d024e830ed198635ee119ed548af67030000fac2b00655287b4fc9925d035012","target":"record","created_at":"2026-05-18T02:41:03Z","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":"b1ba42d0217faee4cae2f8a36cb1a833669182c7b917e3078ced0ca47a59fe8e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-10-03T18:52:00Z","title_canon_sha256":"0ee16d826fd3a767bddf459f47e9b6cad9121e57f3f0043a1d78b0972280329d"},"schema_version":"1.0","source":{"id":"1410.0956","kind":"arxiv","version":1}},"canonical_sha256":"92519f0d614e19607e50abe8e7c4e326d3008addcd56e4b16200c37f8c788e70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92519f0d614e19607e50abe8e7c4e326d3008addcd56e4b16200c37f8c788e70","first_computed_at":"2026-05-18T02:41:03.125183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:03.125183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P2ion35Fu4Rih0DIxwbikdx8R3TRPCg8ML2070RK15j2FtalIBQdtkyU3hNYhJPvcIoSw3+GHzPWM2KhS72MCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:03.125787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d024e830ed198635ee119ed548af67030000fac2b00655287b4fc9925d035012","sha256:bf4e04ed7c02244e7bde0dacdd0812fd64669e42c8959da16754a7dd4635d55e"],"state_sha256":"ccf627c5f197cae837b0b9fa2a9dd998b66cda806596be4b115b62163fb63b3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrMQ4jdSBoeeF2YgCcCzRvb8C/ox1/dduIGvv5b0QoWoPR7EOAgweGYQ/97gzfmu4DMQyyiMLm04IsToUaUNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:53:48.293206Z","bundle_sha256":"2f4a91cf71621319f474a86cb7766dfe434f1433f475d84e6da10234cec43f7a"}}