{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MAK7HODK4SUWILFZRPY5OFM26E","short_pith_number":"pith:MAK7HODK","schema_version":"1.0","canonical_sha256":"6015f3b86ae4a9642cb98bf1d7159af122fe502107fa7c57adfef3299c9e85e6","source":{"kind":"arxiv","id":"2011.08990","version":1},"attestation_state":"computed","paper":{"title":"Consensus of Multi-Agent Systems Using Back-Tracking and History Following Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Indrani Kar, Somanath Majhi, Yanumula V. Karteek","submitted_at":"2020-11-17T22:39:20Z","abstract_excerpt":"This paper proposes two algorithms, namely \"back-tracking\" and \"history following\", to reach consensus in case of communication loss for a network of distributed agents with switching topologies. To reach consensus in distributed control, considered communication topology forms a strongly connected graph. The graph is no more strongly connected whenever an agent loses communication.Whenever an agent loses communication, the topology is no more strongly connected. The proposed back-tracking algorithm makes sure that the agent backtracks its position unless the communication is reestablished, an"},"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":"2011.08990","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2020-11-17T22:39:20Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"0920b2290837e414835a97ae6c8e625a1b10fda65cd8ead7ee83c77d86e53ba7","abstract_canon_sha256":"e42a450907551486d7cbef101c27891a7d5a3fccabcdda661448cb78d39714ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:48.880817Z","signature_b64":"UNNj11mZ190uYY8WNlpd23OIslfJCziAVResF+70eN2e7Euh3/Syh/dtUhiP2pTfMv6vC+kQirjMAgZD7cCkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6015f3b86ae4a9642cb98bf1d7159af122fe502107fa7c57adfef3299c9e85e6","last_reissued_at":"2026-07-05T01:52:48.880469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:48.880469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consensus of Multi-Agent Systems Using Back-Tracking and History Following Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"eess.SY","authors_text":"Indrani Kar, Somanath Majhi, Yanumula V. Karteek","submitted_at":"2020-11-17T22:39:20Z","abstract_excerpt":"This paper proposes two algorithms, namely \"back-tracking\" and \"history following\", to reach consensus in case of communication loss for a network of distributed agents with switching topologies. To reach consensus in distributed control, considered communication topology forms a strongly connected graph. The graph is no more strongly connected whenever an agent loses communication.Whenever an agent loses communication, the topology is no more strongly connected. The proposed back-tracking algorithm makes sure that the agent backtracks its position unless the communication is reestablished, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08990","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/2011.08990/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":"2011.08990","created_at":"2026-07-05T01:52:48.880525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.08990v1","created_at":"2026-07-05T01:52:48.880525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08990","created_at":"2026-07-05T01:52:48.880525+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAK7HODK4SUW","created_at":"2026-07-05T01:52:48.880525+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAK7HODK4SUWILFZ","created_at":"2026-07-05T01:52:48.880525+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAK7HODK","created_at":"2026-07-05T01:52:48.880525+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/MAK7HODK4SUWILFZRPY5OFM26E","json":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E.json","graph_json":"https://pith.science/api/pith-number/MAK7HODK4SUWILFZRPY5OFM26E/graph.json","events_json":"https://pith.science/api/pith-number/MAK7HODK4SUWILFZRPY5OFM26E/events.json","paper":"https://pith.science/paper/MAK7HODK"},"agent_actions":{"view_html":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E","download_json":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E.json","view_paper":"https://pith.science/paper/MAK7HODK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.08990&json=true","fetch_graph":"https://pith.science/api/pith-number/MAK7HODK4SUWILFZRPY5OFM26E/graph.json","fetch_events":"https://pith.science/api/pith-number/MAK7HODK4SUWILFZRPY5OFM26E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E/action/storage_attestation","attest_author":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E/action/author_attestation","sign_citation":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E/action/citation_signature","submit_replication":"https://pith.science/pith/MAK7HODK4SUWILFZRPY5OFM26E/action/replication_record"}},"created_at":"2026-07-05T01:52:48.880525+00:00","updated_at":"2026-07-05T01:52:48.880525+00:00"}