{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PG33HKIIWOELLHJBHZU2EM7QP3","short_pith_number":"pith:PG33HKII","schema_version":"1.0","canonical_sha256":"79b7b3a908b388b59d213e69a233f07ef07da00a8064a50d7d0c7910718aefe6","source":{"kind":"arxiv","id":"1302.6668","version":3},"attestation_state":"computed","paper":{"title":"Finite-time consensus using stochastic matrices with positive diagonals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.MA","authors_text":"Guodong Shi, Julien M. Hendrickx, Karl H. Johansson","submitted_at":"2013-02-27T05:54:41Z","abstract_excerpt":"We discuss the possibility of reaching consensus in finite time using only linear iterations, with the additional restrictions that the update matrices must be stochastic with positive diagonals and consistent with a given graph structure. We show that finite-time average consensus can always be achieved for connected undirected graphs. For directed graphs, we show some necessary conditions for finite-time consensus, including strong connectivity and the presence of a simple cycle of even length."},"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":"1302.6668","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-02-27T05:54:41Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b1ebabd6a115006b7607b00997763da560312422383962ba8156880b648eb225","abstract_canon_sha256":"50e2e1d56572e6c3fa0cfc9c58a0c17e4017cd130f41695b889101eaa1c67765"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:32.421585Z","signature_b64":"HD3XopjXVNxVINAiV8dXi9TBc9s+YaOVGxiEnA/DP8Z8BX32OdduQZlSK3qH/gh25fqfGSYI+YKv4ynujrYWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79b7b3a908b388b59d213e69a233f07ef07da00a8064a50d7d0c7910718aefe6","last_reissued_at":"2026-05-18T02:44:32.421026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:32.421026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-time consensus using stochastic matrices with positive diagonals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.MA","authors_text":"Guodong Shi, Julien M. Hendrickx, Karl H. Johansson","submitted_at":"2013-02-27T05:54:41Z","abstract_excerpt":"We discuss the possibility of reaching consensus in finite time using only linear iterations, with the additional restrictions that the update matrices must be stochastic with positive diagonals and consistent with a given graph structure. We show that finite-time average consensus can always be achieved for connected undirected graphs. For directed graphs, we show some necessary conditions for finite-time consensus, including strong connectivity and the presence of a simple cycle of even length."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6668","kind":"arxiv","version":3},"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":"1302.6668","created_at":"2026-05-18T02:44:32.421118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6668v3","created_at":"2026-05-18T02:44:32.421118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6668","created_at":"2026-05-18T02:44:32.421118+00:00"},{"alias_kind":"pith_short_12","alias_value":"PG33HKIIWOEL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PG33HKIIWOELLHJB","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PG33HKII","created_at":"2026-05-18T12:27:54.935989+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/PG33HKIIWOELLHJBHZU2EM7QP3","json":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3.json","graph_json":"https://pith.science/api/pith-number/PG33HKIIWOELLHJBHZU2EM7QP3/graph.json","events_json":"https://pith.science/api/pith-number/PG33HKIIWOELLHJBHZU2EM7QP3/events.json","paper":"https://pith.science/paper/PG33HKII"},"agent_actions":{"view_html":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3","download_json":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3.json","view_paper":"https://pith.science/paper/PG33HKII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6668&json=true","fetch_graph":"https://pith.science/api/pith-number/PG33HKIIWOELLHJBHZU2EM7QP3/graph.json","fetch_events":"https://pith.science/api/pith-number/PG33HKIIWOELLHJBHZU2EM7QP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3/action/storage_attestation","attest_author":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3/action/author_attestation","sign_citation":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3/action/citation_signature","submit_replication":"https://pith.science/pith/PG33HKIIWOELLHJBHZU2EM7QP3/action/replication_record"}},"created_at":"2026-05-18T02:44:32.421118+00:00","updated_at":"2026-05-18T02:44:32.421118+00:00"}