{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4M2SGWEGQCALR2AERIUMIMQUOP","short_pith_number":"pith:4M2SGWEG","schema_version":"1.0","canonical_sha256":"e3352358868080b8e8048a28c4321473e0825b1c4a349840836073c9b26be018","source":{"kind":"arxiv","id":"1505.00144","version":2},"attestation_state":"computed","paper":{"title":"Reachability of Consensus and Synchronizing Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SY"],"primary_cat":"cs.DC","authors_text":"Julien M. Hendrickx, Pierre-Yves Chevalier, Rapha\\\"el M. Jungers","submitted_at":"2015-05-01T10:29:14Z","abstract_excerpt":"We consider the problem of determining the existence of a sequence of matrices driving a discrete-time consensus system to consensus. We transform this problem into one of the existence of a product of the transition (stochastic) matrices that has a positive column. We then generalize some results from automata theory to sets of stochastic matrices. We obtain as a main result a polynomial-time algorithm to decide the existence of a sequence of matrices achieving consensus."},"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":"1505.00144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-01T10:29:14Z","cross_cats_sorted":["cs.DM","cs.SY"],"title_canon_sha256":"1786ccc745c3f001b1f4699aa8af2d3ce34b9d267622ea44ea42dca24815c4bf","abstract_canon_sha256":"d3dee31252728b0935052c5e55ba4c23af2de103a7075b652af6e10253b4c878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:18.695363Z","signature_b64":"Brfb98vJ/TfluzAVP0Qv/vvVSrFl2/56S4MJgpm0E0nIfdWttN2JSiRfE/sWqkru5angeTcbMlfYXP2Gy2d4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3352358868080b8e8048a28c4321473e0825b1c4a349840836073c9b26be018","last_reissued_at":"2026-05-18T01:31:18.694773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:18.694773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability of Consensus and Synchronizing Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SY"],"primary_cat":"cs.DC","authors_text":"Julien M. Hendrickx, Pierre-Yves Chevalier, Rapha\\\"el M. Jungers","submitted_at":"2015-05-01T10:29:14Z","abstract_excerpt":"We consider the problem of determining the existence of a sequence of matrices driving a discrete-time consensus system to consensus. We transform this problem into one of the existence of a product of the transition (stochastic) matrices that has a positive column. We then generalize some results from automata theory to sets of stochastic matrices. We obtain as a main result a polynomial-time algorithm to decide the existence of a sequence of matrices achieving consensus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00144","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":"1505.00144","created_at":"2026-05-18T01:31:18.694852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00144v2","created_at":"2026-05-18T01:31:18.694852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00144","created_at":"2026-05-18T01:31:18.694852+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M2SGWEGQCAL","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M2SGWEGQCALR2AE","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M2SGWEG","created_at":"2026-05-18T12:29:05.191682+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/4M2SGWEGQCALR2AERIUMIMQUOP","json":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP.json","graph_json":"https://pith.science/api/pith-number/4M2SGWEGQCALR2AERIUMIMQUOP/graph.json","events_json":"https://pith.science/api/pith-number/4M2SGWEGQCALR2AERIUMIMQUOP/events.json","paper":"https://pith.science/paper/4M2SGWEG"},"agent_actions":{"view_html":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP","download_json":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP.json","view_paper":"https://pith.science/paper/4M2SGWEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00144&json=true","fetch_graph":"https://pith.science/api/pith-number/4M2SGWEGQCALR2AERIUMIMQUOP/graph.json","fetch_events":"https://pith.science/api/pith-number/4M2SGWEGQCALR2AERIUMIMQUOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP/action/storage_attestation","attest_author":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP/action/author_attestation","sign_citation":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP/action/citation_signature","submit_replication":"https://pith.science/pith/4M2SGWEGQCALR2AERIUMIMQUOP/action/replication_record"}},"created_at":"2026-05-18T01:31:18.694852+00:00","updated_at":"2026-05-18T01:31:18.694852+00:00"}