{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DRVFKBRPHTFYPKR4CIOOYHAZ3H","short_pith_number":"pith:DRVFKBRP","schema_version":"1.0","canonical_sha256":"1c6a55062f3ccb87aa3c121cec1c19d9f9b69ed14c4385771d0dab45ca1f3ebf","source":{"kind":"arxiv","id":"1612.01375","version":1},"attestation_state":"computed","paper":{"title":"Consensus analysis of large-scale nonlinear homogeneous multi-agent formations with polynomial dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"G\\'erard Scorletti, Paolo Massioni","submitted_at":"2016-12-05T14:40:20Z","abstract_excerpt":"Drawing inspiration from the theory of linear \"decomposable systems\", we provide a method, based on linear matrix inequalities (LMIs), which makes it possible to prove the convergence (or consensus) of a set of interacting agents with polynomial dynamic. We also show that the use of a generalised version of the famous Kalman-Yakubovic-Popov lemma allows the development of an LMI test whose size does not depend on the number of agents. The method is validated experimentally on two academic examples."},"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":"1612.01375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-12-05T14:40:20Z","cross_cats_sorted":[],"title_canon_sha256":"c13e58b9a844e56b4252ed6d6f99ba2b54e0d79b6087246751f7478c62edd4a7","abstract_canon_sha256":"9b8759b1159052cfffb6a002bb369224d58e4a9372445efab1554dc9352a038c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:52.819343Z","signature_b64":"phDF32qUkuX4DzdPMZLv7pimMQqtanS6YAl0nhtZsrmi/YhQtc85UIZwsR4GhH8Bls37c/mIqBR1UCPiBblXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6a55062f3ccb87aa3c121cec1c19d9f9b69ed14c4385771d0dab45ca1f3ebf","last_reissued_at":"2026-05-18T00:55:52.818861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:52.818861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consensus analysis of large-scale nonlinear homogeneous multi-agent formations with polynomial dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"G\\'erard Scorletti, Paolo Massioni","submitted_at":"2016-12-05T14:40:20Z","abstract_excerpt":"Drawing inspiration from the theory of linear \"decomposable systems\", we provide a method, based on linear matrix inequalities (LMIs), which makes it possible to prove the convergence (or consensus) of a set of interacting agents with polynomial dynamic. We also show that the use of a generalised version of the famous Kalman-Yakubovic-Popov lemma allows the development of an LMI test whose size does not depend on the number of agents. The method is validated experimentally on two academic examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01375","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":"1612.01375","created_at":"2026-05-18T00:55:52.818945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01375v1","created_at":"2026-05-18T00:55:52.818945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01375","created_at":"2026-05-18T00:55:52.818945+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRVFKBRPHTFY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRVFKBRPHTFYPKR4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRVFKBRP","created_at":"2026-05-18T12:30:12.583610+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/DRVFKBRPHTFYPKR4CIOOYHAZ3H","json":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H.json","graph_json":"https://pith.science/api/pith-number/DRVFKBRPHTFYPKR4CIOOYHAZ3H/graph.json","events_json":"https://pith.science/api/pith-number/DRVFKBRPHTFYPKR4CIOOYHAZ3H/events.json","paper":"https://pith.science/paper/DRVFKBRP"},"agent_actions":{"view_html":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H","download_json":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H.json","view_paper":"https://pith.science/paper/DRVFKBRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01375&json=true","fetch_graph":"https://pith.science/api/pith-number/DRVFKBRPHTFYPKR4CIOOYHAZ3H/graph.json","fetch_events":"https://pith.science/api/pith-number/DRVFKBRPHTFYPKR4CIOOYHAZ3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H/action/storage_attestation","attest_author":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H/action/author_attestation","sign_citation":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H/action/citation_signature","submit_replication":"https://pith.science/pith/DRVFKBRPHTFYPKR4CIOOYHAZ3H/action/replication_record"}},"created_at":"2026-05-18T00:55:52.818945+00:00","updated_at":"2026-05-18T00:55:52.818945+00:00"}