{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IV3Y7YVNIZAPIZLFSFW3OPUHNR","short_pith_number":"pith:IV3Y7YVN","schema_version":"1.0","canonical_sha256":"45778fe2ad4640f46565916db73e876c4b600b0ddcf431f1a54c9111f985dcf0","source":{"kind":"arxiv","id":"2105.10823","version":1},"attestation_state":"computed","paper":{"title":"High Dimensional Robust Consensus over Networks with Limited Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alberto Speranzon, Yasin Yazicioglu","submitted_at":"2021-05-22T22:46:59Z","abstract_excerpt":"We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge capacities are small compared to the dimensionality of the state vectors, it is not possible to instantaneously communicate full state information over every edge. We investigate how robust consensus (small steady state variance of the states) can be achieved within a linear time-invariant setting by optimally assigning edges to state-dimensions. We show that"},"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":"2105.10823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-05-22T22:46:59Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7e7b92476b83b1a1102dc8127b92181900637cbc32a2d5e9ac318f41379426f7","abstract_canon_sha256":"63d43ed555c413c22aabd7db8df0741e9a3cf2ec6fdce25c0f06aeed75f59a56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:32.179625Z","signature_b64":"mXvcnhYEkGB9wpObtUcxa931gBjmJH2fLCo09P7lOiVfCRBne5kilCm04ENQjmyt2MhOYSaMMIN41T8kcagGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45778fe2ad4640f46565916db73e876c4b600b0ddcf431f1a54c9111f985dcf0","last_reissued_at":"2026-07-05T02:42:32.179113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:32.179113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Robust Consensus over Networks with Limited Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Alberto Speranzon, Yasin Yazicioglu","submitted_at":"2021-05-22T22:46:59Z","abstract_excerpt":"We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge capacities are small compared to the dimensionality of the state vectors, it is not possible to instantaneously communicate full state information over every edge. We investigate how robust consensus (small steady state variance of the states) can be achieved within a linear time-invariant setting by optimally assigning edges to state-dimensions. We show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10823","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/2105.10823/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.10823","created_at":"2026-07-05T02:42:32.179179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.10823v1","created_at":"2026-07-05T02:42:32.179179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10823","created_at":"2026-07-05T02:42:32.179179+00:00"},{"alias_kind":"pith_short_12","alias_value":"IV3Y7YVNIZAP","created_at":"2026-07-05T02:42:32.179179+00:00"},{"alias_kind":"pith_short_16","alias_value":"IV3Y7YVNIZAPIZLF","created_at":"2026-07-05T02:42:32.179179+00:00"},{"alias_kind":"pith_short_8","alias_value":"IV3Y7YVN","created_at":"2026-07-05T02:42:32.179179+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.19078","citing_title":"GraphMind: Theorem Selection and Conclusion Generation Framework with Dynamic GNN for LLM Reasoning","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR","json":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR.json","graph_json":"https://pith.science/api/pith-number/IV3Y7YVNIZAPIZLFSFW3OPUHNR/graph.json","events_json":"https://pith.science/api/pith-number/IV3Y7YVNIZAPIZLFSFW3OPUHNR/events.json","paper":"https://pith.science/paper/IV3Y7YVN"},"agent_actions":{"view_html":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR","download_json":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR.json","view_paper":"https://pith.science/paper/IV3Y7YVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.10823&json=true","fetch_graph":"https://pith.science/api/pith-number/IV3Y7YVNIZAPIZLFSFW3OPUHNR/graph.json","fetch_events":"https://pith.science/api/pith-number/IV3Y7YVNIZAPIZLFSFW3OPUHNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR/action/storage_attestation","attest_author":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR/action/author_attestation","sign_citation":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR/action/citation_signature","submit_replication":"https://pith.science/pith/IV3Y7YVNIZAPIZLFSFW3OPUHNR/action/replication_record"}},"created_at":"2026-07-05T02:42:32.179179+00:00","updated_at":"2026-07-05T02:42:32.179179+00:00"}