{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:Z5EQFAS7ZEKWQNNHVAFXGPQGNH","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":"b10c53a6541ad7e6c34cc3c0fc4105009800e16f82238460ce2db8058f6390b9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-05-25T09:32:50Z","title_canon_sha256":"fca2ffb4b3a3e688f26678a8979675247e4ef4e1eaa177cc0575997dffaadbc3"},"schema_version":"1.0","source":{"id":"2105.11788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.11788","created_at":"2026-07-05T02:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"2105.11788v1","created_at":"2026-07-05T02:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11788","created_at":"2026-07-05T02:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"Z5EQFAS7ZEKW","created_at":"2026-07-05T02:42:56Z"},{"alias_kind":"pith_short_16","alias_value":"Z5EQFAS7ZEKWQNNH","created_at":"2026-07-05T02:42:56Z"},{"alias_kind":"pith_short_8","alias_value":"Z5EQFAS7","created_at":"2026-07-05T02:42:56Z"}],"graph_snapshots":[{"event_id":"sha256:4783f25add0bf8bd48d31752f393fad6b65405cdb69d5b66c5952daa84cc30ee","target":"graph","created_at":"2026-07-05T02:42: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.11788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The most efficient way to calculate strong bisimilarity is by calculation the relational coarsest partition on a transition system. We provide the first linear time algorithm to calculate strong bisimulation using parallel random access machines (PRAMs). More precisely, with $n$ states, $m$ transitions and $|\\mathit{Act}|\\leq m$ action labels, we provide an algorithm on $max(n,m)$ processors that calculates strong bisimulation in time $O(n+|\\mathit{Act}|)$ and space $O(n+m)$. The best-known PRAM algorithm has time complexity $O(n\\log n)$ on a smaller number of processors making it less suitabl","authors_text":"Anton Wijs, Jan Friso Groote, Jan Martens, Lars van den Haak, Pieter Hijma","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-05-25T09:32:50Z","title":"A linear parallel algorithm to compute bisimulation and relational coarsest partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11788","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:19ab484bb1860ff6046000801d62ec2ef0c38edd565b852b4b5e1d34cc02595b","target":"record","created_at":"2026-07-05T02:42: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":"b10c53a6541ad7e6c34cc3c0fc4105009800e16f82238460ce2db8058f6390b9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-05-25T09:32:50Z","title_canon_sha256":"fca2ffb4b3a3e688f26678a8979675247e4ef4e1eaa177cc0575997dffaadbc3"},"schema_version":"1.0","source":{"id":"2105.11788","kind":"arxiv","version":1}},"canonical_sha256":"cf4902825fc9156835a7a80b733e0669fa811549588e951e7f133e3c590a03ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf4902825fc9156835a7a80b733e0669fa811549588e951e7f133e3c590a03ee","first_computed_at":"2026-07-05T02:42:56.528751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:42:56.528751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XdsWJpF6WW9xTwExWK1kZUVkV+sM4t7eZo/cWCmfju86uZGweOnTN/lvQ8jiUvY3FqsfaPyTE3kOjrheoYzpBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:42:56.529286Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.11788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19ab484bb1860ff6046000801d62ec2ef0c38edd565b852b4b5e1d34cc02595b","sha256:4783f25add0bf8bd48d31752f393fad6b65405cdb69d5b66c5952daa84cc30ee"],"state_sha256":"2a264d6246ac697f511c10e4597af15238ad86d1ab28bcf542e0b319fab216a8"}