{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UNP34LXKGWTLJB7KWJW3YUI7WJ","short_pith_number":"pith:UNP34LXK","schema_version":"1.0","canonical_sha256":"a35fbe2eea35a6b487eab26dbc511fb26d9b78030cabae01ec349f9ceb99953d","source":{"kind":"arxiv","id":"1102.5452","version":2},"attestation_state":"computed","paper":{"title":"Bisimulations for fuzzy automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.FL","authors_text":"Jelena Ignjatovi\\'c, Milan Ba\\v{s}i\\'c, Miroslav \\'Ciri\\'c, Nada Damljanovi\\'c","submitted_at":"2011-02-26T21:37:51Z","abstract_excerpt":"Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the study of equivalence between fuzzy automata. We prove that a uniform fuzzy relation between fuzzy automata $\\cal A$ and $\\cal B$ is a forward bisimulation if and only if its kernel and co-kernel are for"},"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":"1102.5452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-02-26T21:37:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1cd509b354465bbf695775040728a766586d57dc95deb47108a14f3c7f1df215","abstract_canon_sha256":"3724694267977a2832a0acbde0e83c6964d55ce417544339718ccad8c61aea22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:41.144307Z","signature_b64":"sE/bsL+BXKngdXW4JyUs7DsIKiIketUlAnJomSDWUyYdQ507L52ssL8upxWjj3Sj3Jj9ewK+9tW14vCj6t6mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35fbe2eea35a6b487eab26dbc511fb26d9b78030cabae01ec349f9ceb99953d","last_reissued_at":"2026-05-18T04:22:41.143617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:41.143617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bisimulations for fuzzy automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.FL","authors_text":"Jelena Ignjatovi\\'c, Milan Ba\\v{s}i\\'c, Miroslav \\'Ciri\\'c, Nada Damljanovi\\'c","submitted_at":"2011-02-26T21:37:51Z","abstract_excerpt":"Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the study of equivalence between fuzzy automata. We prove that a uniform fuzzy relation between fuzzy automata $\\cal A$ and $\\cal B$ is a forward bisimulation if and only if its kernel and co-kernel are for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5452","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":"1102.5452","created_at":"2026-05-18T04:22:41.143748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5452v2","created_at":"2026-05-18T04:22:41.143748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5452","created_at":"2026-05-18T04:22:41.143748+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNP34LXKGWTL","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNP34LXKGWTLJB7K","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNP34LXK","created_at":"2026-05-18T12:26:42.757692+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/UNP34LXKGWTLJB7KWJW3YUI7WJ","json":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ.json","graph_json":"https://pith.science/api/pith-number/UNP34LXKGWTLJB7KWJW3YUI7WJ/graph.json","events_json":"https://pith.science/api/pith-number/UNP34LXKGWTLJB7KWJW3YUI7WJ/events.json","paper":"https://pith.science/paper/UNP34LXK"},"agent_actions":{"view_html":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ","download_json":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ.json","view_paper":"https://pith.science/paper/UNP34LXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5452&json=true","fetch_graph":"https://pith.science/api/pith-number/UNP34LXKGWTLJB7KWJW3YUI7WJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UNP34LXKGWTLJB7KWJW3YUI7WJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ/action/storage_attestation","attest_author":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ/action/author_attestation","sign_citation":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ/action/citation_signature","submit_replication":"https://pith.science/pith/UNP34LXKGWTLJB7KWJW3YUI7WJ/action/replication_record"}},"created_at":"2026-05-18T04:22:41.143748+00:00","updated_at":"2026-05-18T04:22:41.143748+00:00"}