{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6D4OIKW5I6GZLOJUSU23IJBKJZ","short_pith_number":"pith:6D4OIKW5","canonical_record":{"source":{"id":"1712.02614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-07T13:36:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5924e8dde1ec0f34c07477380fda463ca16c8e1c4617b10e624a441c3e55c658","abstract_canon_sha256":"db6e98812353930d0feade14a2909af7c20a6ce4625673933b32e6b4209cdb01"},"schema_version":"1.0"},"canonical_sha256":"f0f8e42add478d95b9349535b4242a4e68220ff41823ea90ca6d073d286986eb","source":{"kind":"arxiv","id":"1712.02614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02614","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02614v1","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02614","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"pith_short_12","alias_value":"6D4OIKW5I6GZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6D4OIKW5I6GZLOJU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6D4OIKW5","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6D4OIKW5I6GZLOJUSU23IJBKJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-07T13:36:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5924e8dde1ec0f34c07477380fda463ca16c8e1c4617b10e624a441c3e55c658","abstract_canon_sha256":"db6e98812353930d0feade14a2909af7c20a6ce4625673933b32e6b4209cdb01"},"schema_version":"1.0"},"canonical_sha256":"f0f8e42add478d95b9349535b4242a4e68220ff41823ea90ca6d073d286986eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:33.452246Z","signature_b64":"lRnvki2LMd34wiIgs5q0vjzRF69Qfbws6C+BPhxuhFrZ0yXn3SRH0+HrgowRoX/u+XQvZxkG8ingsBuk6lwlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f8e42add478d95b9349535b4242a4e68220ff41823ea90ca6d073d286986eb","last_reissued_at":"2026-05-18T00:28:33.451514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:33.451514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02614","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQmjLvbv6QaeD1LHhKgIOk2Yb+SsXBUTGysb3H0UKEVHZCBvn7/ug7KfD9CLTyw4nueoKnLxBOw+kFqmUOHcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:12:01.265575Z"},"content_sha256":"841a0fd2452d7acac3919045d1a68b0c294c536d9059aeab824b784f07f913b3","schema_version":"1.0","event_id":"sha256:841a0fd2452d7acac3919045d1a68b0c294c536d9059aeab824b784f07f913b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6D4OIKW5I6GZLOJUSU23IJBKJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sets of Stochastic Matrices with Converging Products: Bounds and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Julien M. Hendrickx, Pierre-Yves Chevalier, Rapha\\\"el M. Jungers, Vladimir V. Gusev","submitted_at":"2017-12-07T13:36:54Z","abstract_excerpt":"An SIA matrix is a stochastic matrix whose sequence of powers converges to a rank-one matrix. This convergence is desirable in various applications making use of stochastic matrices, such as consensus, distributed optimization and Markov chains. We study the shortest SIA products of sets of matrices. We observe that the shortest SIA product of a set of matrices is usually very short and we provide a first upper bound on the length of the shortest SIA product (if one exists) of any set of stochastic matrices. We also provide an algorithm that decides the existence of an SIA product.\n  When part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02614","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkghT/JOxJYQTbQxvaCa2sicMVi3nJZFpD8x1Zel0L0uHF+7YREBJh+GzxchIUsXluZz4Qs7ny/NrhDJOJm6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:12:01.265968Z"},"content_sha256":"e6381762685e5953729ba0d6f911fcd14820e32fee18a15b324ea78a3f25206b","schema_version":"1.0","event_id":"sha256:e6381762685e5953729ba0d6f911fcd14820e32fee18a15b324ea78a3f25206b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6D4OIKW5I6GZLOJUSU23IJBKJZ/bundle.json","state_url":"https://pith.science/pith/6D4OIKW5I6GZLOJUSU23IJBKJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6D4OIKW5I6GZLOJUSU23IJBKJZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T19:12:01Z","links":{"resolver":"https://pith.science/pith/6D4OIKW5I6GZLOJUSU23IJBKJZ","bundle":"https://pith.science/pith/6D4OIKW5I6GZLOJUSU23IJBKJZ/bundle.json","state":"https://pith.science/pith/6D4OIKW5I6GZLOJUSU23IJBKJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6D4OIKW5I6GZLOJUSU23IJBKJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6D4OIKW5I6GZLOJUSU23IJBKJZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"db6e98812353930d0feade14a2909af7c20a6ce4625673933b32e6b4209cdb01","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-07T13:36:54Z","title_canon_sha256":"5924e8dde1ec0f34c07477380fda463ca16c8e1c4617b10e624a441c3e55c658"},"schema_version":"1.0","source":{"id":"1712.02614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02614","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02614v1","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02614","created_at":"2026-05-18T00:28:33Z"},{"alias_kind":"pith_short_12","alias_value":"6D4OIKW5I6GZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6D4OIKW5I6GZLOJU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6D4OIKW5","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:e6381762685e5953729ba0d6f911fcd14820e32fee18a15b324ea78a3f25206b","target":"graph","created_at":"2026-05-18T00:28:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An SIA matrix is a stochastic matrix whose sequence of powers converges to a rank-one matrix. This convergence is desirable in various applications making use of stochastic matrices, such as consensus, distributed optimization and Markov chains. We study the shortest SIA products of sets of matrices. We observe that the shortest SIA product of a set of matrices is usually very short and we provide a first upper bound on the length of the shortest SIA product (if one exists) of any set of stochastic matrices. We also provide an algorithm that decides the existence of an SIA product.\n  When part","authors_text":"Julien M. Hendrickx, Pierre-Yves Chevalier, Rapha\\\"el M. Jungers, Vladimir V. Gusev","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-07T13:36:54Z","title":"Sets of Stochastic Matrices with Converging Products: Bounds and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02614","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:841a0fd2452d7acac3919045d1a68b0c294c536d9059aeab824b784f07f913b3","target":"record","created_at":"2026-05-18T00:28:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"db6e98812353930d0feade14a2909af7c20a6ce4625673933b32e6b4209cdb01","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-07T13:36:54Z","title_canon_sha256":"5924e8dde1ec0f34c07477380fda463ca16c8e1c4617b10e624a441c3e55c658"},"schema_version":"1.0","source":{"id":"1712.02614","kind":"arxiv","version":1}},"canonical_sha256":"f0f8e42add478d95b9349535b4242a4e68220ff41823ea90ca6d073d286986eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0f8e42add478d95b9349535b4242a4e68220ff41823ea90ca6d073d286986eb","first_computed_at":"2026-05-18T00:28:33.451514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:33.451514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lRnvki2LMd34wiIgs5q0vjzRF69Qfbws6C+BPhxuhFrZ0yXn3SRH0+HrgowRoX/u+XQvZxkG8ingsBuk6lwlCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:33.452246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:841a0fd2452d7acac3919045d1a68b0c294c536d9059aeab824b784f07f913b3","sha256:e6381762685e5953729ba0d6f911fcd14820e32fee18a15b324ea78a3f25206b"],"state_sha256":"bb8b235e0e17049e7384bcde2c260ac8e6d4bd4aacfedf5e061cca2fb79202a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAA+tGH/x1IvwWJjzpf+seTb9uvRnmZ1+HmgA62zHPHAfVkfH8gjoWsLQov5JHQjJYSFwl78mBlNwrM11WNvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:12:01.272453Z","bundle_sha256":"01285bb0647478f76c2b3976e13bb05689c7661b359ec32ffd22ae12cf703d01"}}