{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2EYGAMHDZHPVX7KRDD6FQ4Q2HG","short_pith_number":"pith:2EYGAMHD","schema_version":"1.0","canonical_sha256":"d1306030e3c9df5bfd5118fc58721a3996b285891d618a22fda94d0bc73df742","source":{"kind":"arxiv","id":"1103.5078","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for computing the greatest simulations and bisimulations between fuzzy automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.FL","authors_text":"Ivana Jan\\v{c}i\\'c, Jelena Ignjatovi\\'c, Miroslav \\'Ciri\\'c, Nada Damljanovi\\'c","submitted_at":"2011-03-25T20:37:04Z","abstract_excerpt":"Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, and backward-forward bisimulations) between fuzzy automata have been introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of this kind. In the present paper, for any of the above-mentioned types of simulations/bisimulations we provide an effective algorithm for deciding whether there is a simulation/bisimulation of this typ"},"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":"1103.5078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-03-25T20:37:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6d9530e1822012cdc1c7ff8ae3cf41eb6bb92b5c996d307d9383f1474dae9457","abstract_canon_sha256":"072ed0d1fc62fcf9bdc586e02fa70903500d1e4aa5f21bd99bd78968622d9364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:18.855768Z","signature_b64":"TCvkzcaaNK0Av1UjPfhdxbfQqbkcZJ8O3bSE6Iw5Qa6xphrCTEBLkk77O5OX+QJWWb/ZpB+2x5Trebz3NEEOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1306030e3c9df5bfd5118fc58721a3996b285891d618a22fda94d0bc73df742","last_reissued_at":"2026-05-18T02:55:18.855278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:18.855278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for computing the greatest simulations and bisimulations between fuzzy automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.FL","authors_text":"Ivana Jan\\v{c}i\\'c, Jelena Ignjatovi\\'c, Miroslav \\'Ciri\\'c, Nada Damljanovi\\'c","submitted_at":"2011-03-25T20:37:04Z","abstract_excerpt":"Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, and backward-forward bisimulations) between fuzzy automata have been introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of this kind. In the present paper, for any of the above-mentioned types of simulations/bisimulations we provide an effective algorithm for deciding whether there is a simulation/bisimulation of this typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5078","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.5078","created_at":"2026-05-18T02:55:18.855372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5078v1","created_at":"2026-05-18T02:55:18.855372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5078","created_at":"2026-05-18T02:55:18.855372+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EYGAMHDZHPV","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EYGAMHDZHPVX7KR","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EYGAMHD","created_at":"2026-05-18T12:26:18.847500+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/2EYGAMHDZHPVX7KRDD6FQ4Q2HG","json":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG.json","graph_json":"https://pith.science/api/pith-number/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/graph.json","events_json":"https://pith.science/api/pith-number/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/events.json","paper":"https://pith.science/paper/2EYGAMHD"},"agent_actions":{"view_html":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG","download_json":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG.json","view_paper":"https://pith.science/paper/2EYGAMHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5078&json=true","fetch_graph":"https://pith.science/api/pith-number/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/graph.json","fetch_events":"https://pith.science/api/pith-number/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/action/storage_attestation","attest_author":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/action/author_attestation","sign_citation":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/action/citation_signature","submit_replication":"https://pith.science/pith/2EYGAMHDZHPVX7KRDD6FQ4Q2HG/action/replication_record"}},"created_at":"2026-05-18T02:55:18.855372+00:00","updated_at":"2026-05-18T02:55:18.855372+00:00"}