{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UGVYW3WSEO3CSFTQSOCFFXGSCA","short_pith_number":"pith:UGVYW3WS","schema_version":"1.0","canonical_sha256":"a1ab8b6ed223b6291670938452dcd2101a4664a0d6f3557bb6cb5f58c2be33a1","source":{"kind":"arxiv","id":"1503.07143","version":1},"attestation_state":"computed","paper":{"title":"Robust Connectivity Analysis for Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitris Boskos, Dimos V. Dimarogonas","submitted_at":"2015-03-24T19:12:51Z","abstract_excerpt":"In this report we provide a decentralized robust control approach, which guarantees that connectivity of a multi-agent network is maintained when certain bounded input terms are added to the control strategy. Our main motivation for this framework is to determine abstractions for multi-agent systems under coupled constraints which are further exploited for high level plan generation."},"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":"1503.07143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T19:12:51Z","cross_cats_sorted":[],"title_canon_sha256":"7d55740e26d12eac93ade5a00aabeb6e1b0faf24485fd30af8e959eedbe983e3","abstract_canon_sha256":"fa81b6ead76025147c32f24abd9f531bd5d97822532d8c3ada1e74af70e77647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:29.308972Z","signature_b64":"T6wijBdFX+XB+fmCX7r4/u231aSfWAfQqdeGkxw3RlZomHoCSS/Z+YfdGXhQ73nb0wIbf5q1aEm+rpSp/5eHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ab8b6ed223b6291670938452dcd2101a4664a0d6f3557bb6cb5f58c2be33a1","last_reissued_at":"2026-05-18T02:20:29.308511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:29.308511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Connectivity Analysis for Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitris Boskos, Dimos V. Dimarogonas","submitted_at":"2015-03-24T19:12:51Z","abstract_excerpt":"In this report we provide a decentralized robust control approach, which guarantees that connectivity of a multi-agent network is maintained when certain bounded input terms are added to the control strategy. Our main motivation for this framework is to determine abstractions for multi-agent systems under coupled constraints which are further exploited for high level plan generation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07143","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.07143","created_at":"2026-05-18T02:20:29.308581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07143v1","created_at":"2026-05-18T02:20:29.308581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07143","created_at":"2026-05-18T02:20:29.308581+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGVYW3WSEO3C","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGVYW3WSEO3CSFTQ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGVYW3WS","created_at":"2026-05-18T12:29:44.643036+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/UGVYW3WSEO3CSFTQSOCFFXGSCA","json":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA.json","graph_json":"https://pith.science/api/pith-number/UGVYW3WSEO3CSFTQSOCFFXGSCA/graph.json","events_json":"https://pith.science/api/pith-number/UGVYW3WSEO3CSFTQSOCFFXGSCA/events.json","paper":"https://pith.science/paper/UGVYW3WS"},"agent_actions":{"view_html":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA","download_json":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA.json","view_paper":"https://pith.science/paper/UGVYW3WS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07143&json=true","fetch_graph":"https://pith.science/api/pith-number/UGVYW3WSEO3CSFTQSOCFFXGSCA/graph.json","fetch_events":"https://pith.science/api/pith-number/UGVYW3WSEO3CSFTQSOCFFXGSCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA/action/storage_attestation","attest_author":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA/action/author_attestation","sign_citation":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA/action/citation_signature","submit_replication":"https://pith.science/pith/UGVYW3WSEO3CSFTQSOCFFXGSCA/action/replication_record"}},"created_at":"2026-05-18T02:20:29.308581+00:00","updated_at":"2026-05-18T02:20:29.308581+00:00"}