{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7TEL7G4ZDCKSSLVFYV4DPBMSM3","short_pith_number":"pith:7TEL7G4Z","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"},"canonical_sha256":"fcc8bf9b991895292ea5c57837859266fad29c789c4e0fc60580768e44cf2aba","source":{"kind":"arxiv","id":"1212.1089","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1089","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1089v3","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1089","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"7TEL7G4ZDCKS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7TEL7G4ZDCKSSLVF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7TEL7G4Z","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7TEL7G4ZDCKSSLVFYV4DPBMSM3","target":"record","payload":{"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"},"canonical_sha256":"fcc8bf9b991895292ea5c57837859266fad29c789c4e0fc60580768e44cf2aba","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"},"source_kind":"arxiv","source_id":"1212.1089","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6OGp17HYPnMLRX6ZPmpvoNejcBlLEoW/RCZIVylOlcO3h09OfMFIXRlekCba3ICWz1KUnGOsQ33TVIs0obWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:37:40.326047Z"},"content_sha256":"e0d59e1f280e64b11a0d220ae20e12823c88b990be088974489b1764d684bc69","schema_version":"1.0","event_id":"sha256:e0d59e1f280e64b11a0d220ae20e12823c88b990be088974489b1764d684bc69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7TEL7G4ZDCKSSLVFYV4DPBMSM3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9vOjt4wI/Yklf9CG09I6PAlilleNiYTLMGk3ZeQKJ45QHhZ2UE2EDWJ068ENmrL3ZxIElzsByGyT0Jyd9egDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:37:40.326794Z"},"content_sha256":"4ac1ee6dd533003ac805f26dedb2745ae0280dca2be15440536517142f2e27f1","schema_version":"1.0","event_id":"sha256:4ac1ee6dd533003ac805f26dedb2745ae0280dca2be15440536517142f2e27f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/bundle.json","state_url":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T20:37:40Z","links":{"resolver":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3","bundle":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/bundle.json","state":"https://pith.science/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TEL7G4ZDCKSSLVFYV4DPBMSM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7TEL7G4ZDCKSSLVFYV4DPBMSM3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7998f559c5916032f8d69b6bfea3ff67cefaeb6ec12262038253172a33ec9bdd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-05T16:27:16Z","title_canon_sha256":"7bd7f243a737d8c8e9339aeb8f0bbf3e9ba5fb62f67bdeae814cb12a34ac88d1"},"schema_version":"1.0","source":{"id":"1212.1089","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1089","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1089v3","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1089","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"7TEL7G4ZDCKS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7TEL7G4ZDCKSSLVF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7TEL7G4Z","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:4ac1ee6dd533003ac805f26dedb2745ae0280dca2be15440536517142f2e27f1","target":"graph","created_at":"2026-05-18T03:17:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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|) ","authors_text":"Francesco Ranzato","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-05T16:27:16Z","title":"An Efficient Simulation Algorithm on Kripke Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1089","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e0d59e1f280e64b11a0d220ae20e12823c88b990be088974489b1764d684bc69","target":"record","created_at":"2026-05-18T03:17:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7998f559c5916032f8d69b6bfea3ff67cefaeb6ec12262038253172a33ec9bdd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-05T16:27:16Z","title_canon_sha256":"7bd7f243a737d8c8e9339aeb8f0bbf3e9ba5fb62f67bdeae814cb12a34ac88d1"},"schema_version":"1.0","source":{"id":"1212.1089","kind":"arxiv","version":3}},"canonical_sha256":"fcc8bf9b991895292ea5c57837859266fad29c789c4e0fc60580768e44cf2aba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcc8bf9b991895292ea5c57837859266fad29c789c4e0fc60580768e44cf2aba","first_computed_at":"2026-05-18T03:17:24.671275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:24.671275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"63l0JTDvQREk5PhhAX0H1fplzTr94VXzNG6wz0QdslrIExoGE/LEYniHCHKOR17n6vFKllm/4neI55eOWIomDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:24.672100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1089","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0d59e1f280e64b11a0d220ae20e12823c88b990be088974489b1764d684bc69","sha256:4ac1ee6dd533003ac805f26dedb2745ae0280dca2be15440536517142f2e27f1"],"state_sha256":"fdc9e65ea03d03162d76065d8c382abcbef237f9297583e1b120000690f3350d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQrC+YBNftFkrLFP5yszsFaNRZsGMAAIj8HucQxW/2655lWqT6RCwiVbUl0BuS4QOT8PKF5YZ/x3ifo9icbiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:37:40.330574Z","bundle_sha256":"b6c3f0d2138a3d8d0bbfe9ca0f63b068497eb7916f0a480dab13c49ce52b3dc7"}}