{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X5KUQ5AMMJNVR2CQIAR5DJPDZS","short_pith_number":"pith:X5KUQ5AM","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"},"canonical_sha256":"bf5548740c625b58e8504023d1a5e3ccbb7cd060c53244fb5be201d650523be4","source":{"kind":"arxiv","id":"1301.1638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1638","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1638v1","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1638","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"X5KUQ5AMMJNV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X5KUQ5AMMJNVR2CQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X5KUQ5AM","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X5KUQ5AMMJNVR2CQIAR5DJPDZS","target":"record","payload":{"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"},"canonical_sha256":"bf5548740c625b58e8504023d1a5e3ccbb7cd060c53244fb5be201d650523be4","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"},"source_kind":"arxiv","source_id":"1301.1638","source_version":1,"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:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOBQXwvYeGdNPoxVEHjHreb6UXi/kd8c3VjFwycyo3pXYVYpwVuO5cn0Lt+U0Vcd5YWLelTBjdycL6/HSYdmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:19:38.052972Z"},"content_sha256":"d8d5a3e37ba419767add2654d00ffecaa2a5ff323fd95f7042ea6d4ec6df8aeb","schema_version":"1.0","event_id":"sha256:d8d5a3e37ba419767add2654d00ffecaa2a5ff323fd95f7042ea6d4ec6df8aeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X5KUQ5AMMJNVR2CQIAR5DJPDZS","target":"graph","payload":{"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"},"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:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4C8AUpU/RdMb3y7o3Aj2iv9KB3mib372hZJGAY0t9q28RhstXWkFUEr4n/GGMhRSHQnwtPJC27wFwRc+n2x9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T01:19:38.053411Z"},"content_sha256":"7e48c60b51b1e89f3dc89e16e32aac0e7c253b8249f17ad74785e1da249f8aa4","schema_version":"1.0","event_id":"sha256:7e48c60b51b1e89f3dc89e16e32aac0e7c253b8249f17ad74785e1da249f8aa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/bundle.json","state_url":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/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-08-17T01:19:38Z","links":{"resolver":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS","bundle":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/bundle.json","state":"https://pith.science/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5KUQ5AMMJNVR2CQIAR5DJPDZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X5KUQ5AMMJNVR2CQIAR5DJPDZS","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":"07ae0ead69a98f81c9ccbe379ab87026fa78510d455f1a4667ac45b920d64497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-08T19:05:05Z","title_canon_sha256":"2e44cbd6ca2d67ea2a0124898175fe876341b78982710be322571ad66bf8cf29"},"schema_version":"1.0","source":{"id":"1301.1638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1638","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1638v1","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1638","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"X5KUQ5AMMJNV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X5KUQ5AMMJNVR2CQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X5KUQ5AM","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:7e48c60b51b1e89f3dc89e16e32aac0e7c253b8249f17ad74785e1da249f8aa4","target":"graph","created_at":"2026-05-18T03:36:56Z","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":"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","authors_text":"G\\'erard C\\'ec\\'e (FEMTO-ST/DISC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-08T19:05:05Z","title":"Three Simulation Algorithms for Labelled Transition Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1638","kind":"arxiv","version":1},"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:d8d5a3e37ba419767add2654d00ffecaa2a5ff323fd95f7042ea6d4ec6df8aeb","target":"record","created_at":"2026-05-18T03:36:56Z","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":"07ae0ead69a98f81c9ccbe379ab87026fa78510d455f1a4667ac45b920d64497","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-08T19:05:05Z","title_canon_sha256":"2e44cbd6ca2d67ea2a0124898175fe876341b78982710be322571ad66bf8cf29"},"schema_version":"1.0","source":{"id":"1301.1638","kind":"arxiv","version":1}},"canonical_sha256":"bf5548740c625b58e8504023d1a5e3ccbb7cd060c53244fb5be201d650523be4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf5548740c625b58e8504023d1a5e3ccbb7cd060c53244fb5be201d650523be4","first_computed_at":"2026-05-18T03:36:56.999685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:56.999685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V4fLlGJBqeWGeeeUl9C/r6i1trwdd9IeFw97H3zQP4HgdecuOfV0OBC46xVWGJNqau+HYEWo9Wonz6pPLcqzCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:57.000170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8d5a3e37ba419767add2654d00ffecaa2a5ff323fd95f7042ea6d4ec6df8aeb","sha256:7e48c60b51b1e89f3dc89e16e32aac0e7c253b8249f17ad74785e1da249f8aa4"],"state_sha256":"026acd7766a7026ad8c3db28739c0fbfc18fcc60af93f5a69112557191faa662"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Y2O+/Yd2OSg1zrfvbqf1ept5PCEsWewdw8HuMvY7qv9eDIOrL8xOa82pr9I45Gv83rGVmM4j81VDShk9SrKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T01:19:38.058523Z","bundle_sha256":"af1a08349bee01624cdef63e960f15cdd15183e8e40128501674911c733f8ca4"}}