{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:X5KUQ5AMMJNVR2CQIAR5DJPDZS","short_pith_number":"pith:X5KUQ5AM","schema_version":"1.0","canonical_sha256":"bf5548740c625b58e8504023d1a5e3ccbb7cd060c53244fb5be201d650523be4","source":{"kind":"arxiv","id":"1301.1638","version":1},"attestation_state":"computed","paper":{"title":"Three Simulation Algorithms for Labelled Transition Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"G\\'erard C\\'ec\\'e (FEMTO-ST/DISC)","submitted_at":"2013-01-08T19:05:05Z","abstract_excerpt":"Algorithms which compute the coarsest simulation preorder are generally designed on Kripke structures. Only in a second time they are extended to labelled transition systems. By doing this, the size of the alphabet appears in general as a multiplicative factor to both time and space complexities. Let $Q$ denotes the state space, $\\rightarrow$ the transition relation, $\\Sigma$ the alphabet and $P_{sim}$ the partition of $Q$ induced by the coarsest simulation equivalence. In this paper, we propose a base algorithm which minimizes, since the first stages of its design, the incidence of the size o"},"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":"1301.1638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-08T19:05:05Z","cross_cats_sorted":[],"title_canon_sha256":"2e44cbd6ca2d67ea2a0124898175fe876341b78982710be322571ad66bf8cf29","abstract_canon_sha256":"07ae0ead69a98f81c9ccbe379ab87026fa78510d455f1a4667ac45b920d64497"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:57.000170Z","signature_b64":"V4fLlGJBqeWGeeeUl9C/r6i1trwdd9IeFw97H3zQP4HgdecuOfV0OBC46xVWGJNqau+HYEWo9Wonz6pPLcqzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf5548740c625b58e8504023d1a5e3ccbb7cd060c53244fb5be201d650523be4","last_reissued_at":"2026-05-18T03:36:56.999685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:56.999685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three Simulation Algorithms for Labelled Transition Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"G\\'erard C\\'ec\\'e (FEMTO-ST/DISC)","submitted_at":"2013-01-08T19:05:05Z","abstract_excerpt":"Algorithms which compute the coarsest simulation preorder are generally designed on Kripke structures. Only in a second time they are extended to labelled transition systems. By doing this, the size of the alphabet appears in general as a multiplicative factor to both time and space complexities. Let $Q$ denotes the state space, $\\rightarrow$ the transition relation, $\\Sigma$ the alphabet and $P_{sim}$ the partition of $Q$ induced by the coarsest simulation equivalence. In this paper, we propose a base algorithm which minimizes, since the first stages of its design, the incidence of the size o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1638","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":"1301.1638","created_at":"2026-05-18T03:36:56.999765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1638v1","created_at":"2026-05-18T03:36:56.999765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1638","created_at":"2026-05-18T03:36:56.999765+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5KUQ5AMMJNV","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5KUQ5AMMJNVR2CQ","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5KUQ5AM","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09759","citing_title":"Towards Bridging Formal Methods and Human Interpretability","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS","json":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS.json","graph_json":"https://pith.science/api/pith-number/X5KUQ5AMMJNVR2CQIAR5DJPDZS/graph.json","events_json":"https://pith.science/api/pith-number/X5KUQ5AMMJNVR2CQIAR5DJPDZS/events.json","paper":"https://pith.science/paper/X5KUQ5AM"},"agent_actions":{"view_html":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS","download_json":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS.json","view_paper":"https://pith.science/paper/X5KUQ5AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1638&json=true","fetch_graph":"https://pith.science/api/pith-number/X5KUQ5AMMJNVR2CQIAR5DJPDZS/graph.json","fetch_events":"https://pith.science/api/pith-number/X5KUQ5AMMJNVR2CQIAR5DJPDZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/action/storage_attestation","attest_author":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/action/author_attestation","sign_citation":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/action/citation_signature","submit_replication":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/action/replication_record"}},"created_at":"2026-05-18T03:36:56.999765+00:00","updated_at":"2026-05-18T03:36:56.999765+00:00"}