{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Y5V3HPWPWUNQWNX5CO22MK43SG","short_pith_number":"pith:Y5V3HPWP","schema_version":"1.0","canonical_sha256":"c76bb3becfb51b0b36fd13b5a62b9b91b503af0a331ddf51c99be9908c687787","source":{"kind":"arxiv","id":"1410.4034","version":5},"attestation_state":"computed","paper":{"title":"On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fran\\c{c}ois Gonze, Rapha\\\"el M. Jungers","submitted_at":"2014-10-15T12:18:05Z","abstract_excerpt":"Cerny's conjecture is a longstanding open problem in automata theory. We study two different concepts, which allow to approach it from a new angle. The first one is the triple rendezvous time, i.e., the length of the shortest word mapping three states onto a single one. The second one is the synchronizing probability function of an automaton, a recently introduced tool which reinterprets the synchronizing phenomenon as a two-player game, and allows to obtain optimal strategies through a Linear Program.\n  Our contribution is twofold. First, by coupling two different novel approaches based on th"},"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":"1410.4034","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-15T12:18:05Z","cross_cats_sorted":[],"title_canon_sha256":"d741d991870556e103aaa3b974a3a34a6fbc8d656421524ad9a9964a2b43ea8a","abstract_canon_sha256":"ee87471970f2266ec8893472985a8b75af4a3f3bfe6e433ca2ac657451b70178"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:08.823018Z","signature_b64":"ZxBNnwpSU8j/o34Wt9SEPw+F4IuG5W4IbvpskDlwvg50XPDYf7NKhmJLZ3PUMQshyjFwslF3AYd9/sbgoQUrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c76bb3becfb51b0b36fd13b5a62b9b91b503af0a331ddf51c99be9908c687787","last_reissued_at":"2026-05-18T01:24:08.822306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:08.822306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Fran\\c{c}ois Gonze, Rapha\\\"el M. Jungers","submitted_at":"2014-10-15T12:18:05Z","abstract_excerpt":"Cerny's conjecture is a longstanding open problem in automata theory. We study two different concepts, which allow to approach it from a new angle. The first one is the triple rendezvous time, i.e., the length of the shortest word mapping three states onto a single one. The second one is the synchronizing probability function of an automaton, a recently introduced tool which reinterprets the synchronizing phenomenon as a two-player game, and allows to obtain optimal strategies through a Linear Program.\n  Our contribution is twofold. First, by coupling two different novel approaches based on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4034","kind":"arxiv","version":5},"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":"1410.4034","created_at":"2026-05-18T01:24:08.822430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4034v5","created_at":"2026-05-18T01:24:08.822430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4034","created_at":"2026-05-18T01:24:08.822430+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5V3HPWPWUNQ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5V3HPWPWUNQWNX5","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5V3HPWP","created_at":"2026-05-18T12:28:57.508820+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/Y5V3HPWPWUNQWNX5CO22MK43SG","json":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG.json","graph_json":"https://pith.science/api/pith-number/Y5V3HPWPWUNQWNX5CO22MK43SG/graph.json","events_json":"https://pith.science/api/pith-number/Y5V3HPWPWUNQWNX5CO22MK43SG/events.json","paper":"https://pith.science/paper/Y5V3HPWP"},"agent_actions":{"view_html":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG","download_json":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG.json","view_paper":"https://pith.science/paper/Y5V3HPWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4034&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5V3HPWPWUNQWNX5CO22MK43SG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5V3HPWPWUNQWNX5CO22MK43SG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG/action/storage_attestation","attest_author":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG/action/author_attestation","sign_citation":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG/action/citation_signature","submit_replication":"https://pith.science/pith/Y5V3HPWPWUNQWNX5CO22MK43SG/action/replication_record"}},"created_at":"2026-05-18T01:24:08.822430+00:00","updated_at":"2026-05-18T01:24:08.822430+00:00"}