{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GSTDZMCI3D6ZMRYVNK56OSWWGF","short_pith_number":"pith:GSTDZMCI","schema_version":"1.0","canonical_sha256":"34a63cb048d8fd9647156abbe74ad631475cee43d534f4ee7733aeeb8d83553a","source":{"kind":"arxiv","id":"2107.12022","version":2},"attestation_state":"computed","paper":{"title":"Distributed Neighbor Selection in Multi-agent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Dewei Li, Haibin Shao, Lulu Pan, Mehran Mesbahi, Yugeng Xi","submitted_at":"2021-07-26T08:23:04Z","abstract_excerpt":"Achieving consensus via nearest neighbor rules is an important prerequisite for multi-agent networks to accomplish collective tasks. A common assumption in consensus setup is that each agent interacts with all its neighbors. This paper examines whether network functionality and performance can be maintained-and even enhanced-when agents interact only with a subset of their respective (available) neighbors. As shown in the paper, the answer to this inquiry is affirmative. In this direction, we show that by exploring the monotonicity property of the Laplacian eigenvectors, a neighbor selection r"},"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":"2107.12022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-07-26T08:23:04Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"3a239ce15132953290e51e234bd03a1f34f90808ceb5c35a78dfff8882de3d0d","abstract_canon_sha256":"cd6fd70ffded3dbef083eac85e6770925f9ca32f9535e09aaff833c3fd503031"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:02.457913Z","signature_b64":"+xhuYW+c/FZK5GyjA/5Was2RbdAKQnFyoC6Xej8f0ku9/61BkXB2PLpDAfJnznXbfmkrvh9vtph/Cv7m4qajDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a63cb048d8fd9647156abbe74ad631475cee43d534f4ee7733aeeb8d83553a","last_reissued_at":"2026-07-05T04:34:02.457516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:02.457516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Neighbor Selection in Multi-agent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Dewei Li, Haibin Shao, Lulu Pan, Mehran Mesbahi, Yugeng Xi","submitted_at":"2021-07-26T08:23:04Z","abstract_excerpt":"Achieving consensus via nearest neighbor rules is an important prerequisite for multi-agent networks to accomplish collective tasks. A common assumption in consensus setup is that each agent interacts with all its neighbors. This paper examines whether network functionality and performance can be maintained-and even enhanced-when agents interact only with a subset of their respective (available) neighbors. As shown in the paper, the answer to this inquiry is affirmative. In this direction, we show that by exploring the monotonicity property of the Laplacian eigenvectors, a neighbor selection r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.12022","kind":"arxiv","version":2},"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/2107.12022/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":"2107.12022","created_at":"2026-07-05T04:34:02.457571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.12022v2","created_at":"2026-07-05T04:34:02.457571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.12022","created_at":"2026-07-05T04:34:02.457571+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSTDZMCI3D6Z","created_at":"2026-07-05T04:34:02.457571+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSTDZMCI3D6ZMRYV","created_at":"2026-07-05T04:34:02.457571+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSTDZMCI","created_at":"2026-07-05T04:34:02.457571+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF","json":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF.json","graph_json":"https://pith.science/api/pith-number/GSTDZMCI3D6ZMRYVNK56OSWWGF/graph.json","events_json":"https://pith.science/api/pith-number/GSTDZMCI3D6ZMRYVNK56OSWWGF/events.json","paper":"https://pith.science/paper/GSTDZMCI"},"agent_actions":{"view_html":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF","download_json":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF.json","view_paper":"https://pith.science/paper/GSTDZMCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.12022&json=true","fetch_graph":"https://pith.science/api/pith-number/GSTDZMCI3D6ZMRYVNK56OSWWGF/graph.json","fetch_events":"https://pith.science/api/pith-number/GSTDZMCI3D6ZMRYVNK56OSWWGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF/action/storage_attestation","attest_author":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF/action/author_attestation","sign_citation":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF/action/citation_signature","submit_replication":"https://pith.science/pith/GSTDZMCI3D6ZMRYVNK56OSWWGF/action/replication_record"}},"created_at":"2026-07-05T04:34:02.457571+00:00","updated_at":"2026-07-05T04:34:02.457571+00:00"}