{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JDNTICI2PTN6QXUDQTYM4Y35PC","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":"4c18eeb4a7f90cc36abc1813ab43e079d8402cf324af3a867e68da331836f745","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-10-18T22:52:25Z","title_canon_sha256":"d6133d4c40211b4cb113b52d3dd394ee52f5ef82123c398181313bdca62325d9"},"schema_version":"1.0","source":{"id":"1510.05324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05324","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05324v1","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05324","created_at":"2026-05-18T01:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"JDNTICI2PTN6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JDNTICI2PTN6QXUD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JDNTICI2","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:d6f6a37350c4baa638b588f993a3cdd8ba35e239c780efcc71fc1afb0dca624c","target":"graph","created_at":"2026-05-18T01:29: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"},"paper":{"abstract_excerpt":"This paper presents adaptive link selection algorithms for distributed estimation and considers their application to wireless sensor networks and smart grids. In particular, exhaustive search--based least--mean--squares(LMS)/recursive least squares(RLS) link selection algorithms and sparsity--inspired LMS/RLS link selection algorithms that can exploit the topology of networks with poor--quality links are considered. The proposed link selection algorithms are then analyzed in terms of their stability, steady--state and tracking performance, and computational complexity. In comparison with exist","authors_text":"H. V. Poor, R. C. de Lamare, S. Xu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-10-18T22:52:25Z","title":"Dynamic Topology Adaptation Based on Adaptive Link Selection Algorithms for Distributed Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05324","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:c9ad108f85d5f0367b451474f2e365a13256cdf38629d13dd7acb2ecf8b95e13","target":"record","created_at":"2026-05-18T01:29: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":"4c18eeb4a7f90cc36abc1813ab43e079d8402cf324af3a867e68da331836f745","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-10-18T22:52:25Z","title_canon_sha256":"d6133d4c40211b4cb113b52d3dd394ee52f5ef82123c398181313bdca62325d9"},"schema_version":"1.0","source":{"id":"1510.05324","kind":"arxiv","version":1}},"canonical_sha256":"48db34091a7cdbe85e8384f0ce637d788c3f35a8042bd8c3f49c8f5fc5116743","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48db34091a7cdbe85e8384f0ce637d788c3f35a8042bd8c3f49c8f5fc5116743","first_computed_at":"2026-05-18T01:29:52.545249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:52.545249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7qml82cOqT4XxRp17TATDk61d2ThhwWzfo8N2v5zTSKYWeuBknC4iCwcR7QgFG06ieRic/RPEMw0CHsTrBxBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:52.545806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9ad108f85d5f0367b451474f2e365a13256cdf38629d13dd7acb2ecf8b95e13","sha256:d6f6a37350c4baa638b588f993a3cdd8ba35e239c780efcc71fc1afb0dca624c"],"state_sha256":"d088206ce61dc28af8d26baf50c0486e23f6f8b56acdfa79160b640033d9b9e9"}