{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SUSBACENIQYYOWM7T5DSSBTPHS","short_pith_number":"pith:SUSBACEN","schema_version":"1.0","canonical_sha256":"952410088d443187599f9f4729066f3c9c9f01d8cdb9250878c35c5bc01aad25","source":{"kind":"arxiv","id":"1507.04778","version":2},"attestation_state":"computed","paper":{"title":"Fully Distributed Flocking with a Moving Leader for Lagrange Networks with Parametric Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Mei, Sheida Ghapani, Wei Ren, Yongduan Song","submitted_at":"2015-07-16T21:35:29Z","abstract_excerpt":"This paper addresses the leader-follower flocking problem with a moving leader for networked Lagrange systems with parametric uncertainties under a proximity graph. Here a group of followers move cohesively with the moving leader to maintain connectivity and avoid collisions for all time and also eventually achieve velocity matching. In the proximity graph, the neighbor relationship is defined according to the relative distance between each pair of agents. Each follower is able to obtain information from only the neighbors in its proximity, involving only local interaction. We consider two cas"},"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":"1507.04778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-16T21:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"476023b3c3f51833b63e4c8fe3575076f109c50e2f08839b91727e3cb7021983","abstract_canon_sha256":"f8fa243e20bca4e2678c38e772abf63109ebf9605b5fbaf2a7af5e851eb5217d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:27.162373Z","signature_b64":"UpfzcDBMitu7LlwQ/gwtSPKciTSzpm2AzVQt6PLSlgBLMp/HlRdtBUsuc1npPsmlYC120kg12eiHaWQQlAlHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"952410088d443187599f9f4729066f3c9c9f01d8cdb9250878c35c5bc01aad25","last_reissued_at":"2026-05-18T01:36:27.161724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:27.161724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Distributed Flocking with a Moving Leader for Lagrange Networks with Parametric Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Mei, Sheida Ghapani, Wei Ren, Yongduan Song","submitted_at":"2015-07-16T21:35:29Z","abstract_excerpt":"This paper addresses the leader-follower flocking problem with a moving leader for networked Lagrange systems with parametric uncertainties under a proximity graph. Here a group of followers move cohesively with the moving leader to maintain connectivity and avoid collisions for all time and also eventually achieve velocity matching. In the proximity graph, the neighbor relationship is defined according to the relative distance between each pair of agents. Each follower is able to obtain information from only the neighbors in its proximity, involving only local interaction. We consider two cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04778","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":""},"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":"1507.04778","created_at":"2026-05-18T01:36:27.161810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04778v2","created_at":"2026-05-18T01:36:27.161810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04778","created_at":"2026-05-18T01:36:27.161810+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUSBACENIQYY","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUSBACENIQYYOWM7","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUSBACEN","created_at":"2026-05-18T12:29:42.218222+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/SUSBACENIQYYOWM7T5DSSBTPHS","json":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS.json","graph_json":"https://pith.science/api/pith-number/SUSBACENIQYYOWM7T5DSSBTPHS/graph.json","events_json":"https://pith.science/api/pith-number/SUSBACENIQYYOWM7T5DSSBTPHS/events.json","paper":"https://pith.science/paper/SUSBACEN"},"agent_actions":{"view_html":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS","download_json":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS.json","view_paper":"https://pith.science/paper/SUSBACEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04778&json=true","fetch_graph":"https://pith.science/api/pith-number/SUSBACENIQYYOWM7T5DSSBTPHS/graph.json","fetch_events":"https://pith.science/api/pith-number/SUSBACENIQYYOWM7T5DSSBTPHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS/action/storage_attestation","attest_author":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS/action/author_attestation","sign_citation":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS/action/citation_signature","submit_replication":"https://pith.science/pith/SUSBACENIQYYOWM7T5DSSBTPHS/action/replication_record"}},"created_at":"2026-05-18T01:36:27.161810+00:00","updated_at":"2026-05-18T01:36:27.161810+00:00"}