{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LR4LZ6DCTZGXAZQECLWTQLFZRW","short_pith_number":"pith:LR4LZ6DC","schema_version":"1.0","canonical_sha256":"5c78bcf8629e4d70660412ed382cb98db350c61013c9897728efa8918eec19ef","source":{"kind":"arxiv","id":"1403.5729","version":3},"attestation_state":"computed","paper":{"title":"Synchronizing weighted automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hungary), Szabolcs Iv\\'an (University of Szeged","submitted_at":"2014-03-23T08:31:40Z","abstract_excerpt":"We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if there exists a column in A consisting of nonzero entries such that all the other columns of A are filled by zeros. If additionally all the entries of this designated column are the same, we call A synchronizing. Note that these notions coincide for stochastic matrices and also in the Boolean semiring. A set M of matrices in K^nxn is called (location-)synchroniz"},"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":"1403.5729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-03-23T08:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"03d83912db2f6588fab8013f696820b2b0d7e5bf6efb47cc329e16ad33c96595","abstract_canon_sha256":"508822a127d04e92491fe0cd8811bbd1aad9a9e5e6ea66ca93c5e75ee4cf911b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:22.813721Z","signature_b64":"ckO153HrJhbBcUyojrA36vTlUMasrJ8q9CXWPioOct91Yb0L5yJxGdrbg68ur30KrGyhjQSDcY8FIppZVxmRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c78bcf8629e4d70660412ed382cb98db350c61013c9897728efa8918eec19ef","last_reissued_at":"2026-05-18T02:51:22.813079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:22.813079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronizing weighted automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hungary), Szabolcs Iv\\'an (University of Szeged","submitted_at":"2014-03-23T08:31:40Z","abstract_excerpt":"We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if there exists a column in A consisting of nonzero entries such that all the other columns of A are filled by zeros. If additionally all the entries of this designated column are the same, we call A synchronizing. Note that these notions coincide for stochastic matrices and also in the Boolean semiring. A set M of matrices in K^nxn is called (location-)synchroniz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5729","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":"1403.5729","created_at":"2026-05-18T02:51:22.813163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5729v3","created_at":"2026-05-18T02:51:22.813163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5729","created_at":"2026-05-18T02:51:22.813163+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR4LZ6DCTZGX","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR4LZ6DCTZGXAZQE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR4LZ6DC","created_at":"2026-05-18T12:28:38.356838+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/LR4LZ6DCTZGXAZQECLWTQLFZRW","json":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW.json","graph_json":"https://pith.science/api/pith-number/LR4LZ6DCTZGXAZQECLWTQLFZRW/graph.json","events_json":"https://pith.science/api/pith-number/LR4LZ6DCTZGXAZQECLWTQLFZRW/events.json","paper":"https://pith.science/paper/LR4LZ6DC"},"agent_actions":{"view_html":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW","download_json":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW.json","view_paper":"https://pith.science/paper/LR4LZ6DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5729&json=true","fetch_graph":"https://pith.science/api/pith-number/LR4LZ6DCTZGXAZQECLWTQLFZRW/graph.json","fetch_events":"https://pith.science/api/pith-number/LR4LZ6DCTZGXAZQECLWTQLFZRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW/action/storage_attestation","attest_author":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW/action/author_attestation","sign_citation":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW/action/citation_signature","submit_replication":"https://pith.science/pith/LR4LZ6DCTZGXAZQECLWTQLFZRW/action/replication_record"}},"created_at":"2026-05-18T02:51:22.813163+00:00","updated_at":"2026-05-18T02:51:22.813163+00:00"}