{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7TEL7G4ZDCKSSLVFYV4DPBMSM3","short_pith_number":"pith:7TEL7G4Z","schema_version":"1.0","canonical_sha256":"fcc8bf9b991895292ea5c57837859266fad29c789c4e0fc60580768e44cf2aba","source":{"kind":"arxiv","id":"1212.1089","version":3},"attestation_state":"computed","paper":{"title":"An Efficient Simulation Algorithm on Kripke Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Francesco Ranzato","submitted_at":"2012-12-05T16:27:16Z","abstract_excerpt":"A number of algorithms for computing the simulation preorder (and equivalence) on Kripke structures are available. Let Sigma denote the state space, -> the transition relation and Psim the partition of Sigma induced by simulation equivalence. While some algorithms are designed to reach the best space bounds, whose dominating additive term is |Psim|^2, other algorithms are devised to attain the best time complexity O(|Psim||->|). We present a novel simulation algorithm which is both space and time efficient: it runs in O(|Psim|^2 log|Psim| + |Sigma|log|Sigma|) space and O(|Psim||->|log|Sigma|) "},"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":"1212.1089","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-05T16:27:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7bd7f243a737d8c8e9339aeb8f0bbf3e9ba5fb62f67bdeae814cb12a34ac88d1","abstract_canon_sha256":"7998f559c5916032f8d69b6bfea3ff67cefaeb6ec12262038253172a33ec9bdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:24.672100Z","signature_b64":"63l0JTDvQREk5PhhAX0H1fplzTr94VXzNG6wz0QdslrIExoGE/LEYniHCHKOR17n6vFKllm/4neI55eOWIomDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcc8bf9b991895292ea5c57837859266fad29c789c4e0fc60580768e44cf2aba","last_reissued_at":"2026-05-18T03:17:24.671275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:24.671275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Simulation Algorithm on Kripke Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Francesco Ranzato","submitted_at":"2012-12-05T16:27:16Z","abstract_excerpt":"A number of algorithms for computing the simulation preorder (and equivalence) on Kripke structures are available. Let Sigma denote the state space, -> the transition relation and Psim the partition of Sigma induced by simulation equivalence. While some algorithms are designed to reach the best space bounds, whose dominating additive term is |Psim|^2, other algorithms are devised to attain the best time complexity O(|Psim||->|). We present a novel simulation algorithm which is both space and time efficient: it runs in O(|Psim|^2 log|Psim| + |Sigma|log|Sigma|) space and O(|Psim||->|log|Sigma|) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1089","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":"1212.1089","created_at":"2026-05-18T03:17:24.671442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1089v3","created_at":"2026-05-18T03:17:24.671442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1089","created_at":"2026-05-18T03:17:24.671442+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TEL7G4ZDCKS","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TEL7G4ZDCKSSLVF","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TEL7G4Z","created_at":"2026-05-18T12:26:58.693483+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/7TEL7G4ZDCKSSLVFYV4DPBMSM3","json":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3.json","graph_json":"https://pith.science/api/pith-number/7TEL7G4ZDCKSSLVFYV4DPBMSM3/graph.json","events_json":"https://pith.science/api/pith-number/7TEL7G4ZDCKSSLVFYV4DPBMSM3/events.json","paper":"https://pith.science/paper/7TEL7G4Z"},"agent_actions":{"view_html":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3","download_json":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3.json","view_paper":"https://pith.science/paper/7TEL7G4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1089&json=true","fetch_graph":"https://pith.science/api/pith-number/7TEL7G4ZDCKSSLVFYV4DPBMSM3/graph.json","fetch_events":"https://pith.science/api/pith-number/7TEL7G4ZDCKSSLVFYV4DPBMSM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/action/storage_attestation","attest_author":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/action/author_attestation","sign_citation":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/action/citation_signature","submit_replication":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/action/replication_record"}},"created_at":"2026-05-18T03:17:24.671442+00:00","updated_at":"2026-05-18T03:17:24.671442+00:00"}