{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FZ7WURGREBDLWKAZTY7C53OSCF","short_pith_number":"pith:FZ7WURGR","canonical_record":{"source":{"id":"1311.7635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-25T19:14:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7c76368ada109df047ba318b7dc0d46aae38f6a42dde862da233395f739f22aa","abstract_canon_sha256":"c12669260210f153ffb67474d11583e0f46180d7f5eee2f7d5f463d1ebed25a7"},"schema_version":"1.0"},"canonical_sha256":"2e7f6a44d12046bb28199e3e2eedd211451f815c7748d4aef091d7e174adf881","source":{"kind":"arxiv","id":"1311.7635","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7635","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7635v2","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7635","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"FZ7WURGREBDL","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FZ7WURGREBDLWKAZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FZ7WURGR","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FZ7WURGREBDLWKAZTY7C53OSCF","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-25T19:14:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7c76368ada109df047ba318b7dc0d46aae38f6a42dde862da233395f739f22aa","abstract_canon_sha256":"c12669260210f153ffb67474d11583e0f46180d7f5eee2f7d5f463d1ebed25a7"},"schema_version":"1.0"},"canonical_sha256":"2e7f6a44d12046bb28199e3e2eedd211451f815c7748d4aef091d7e174adf881","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:33.960706Z","signature_b64":"K/h3j0wnxszLUiWwjJu5OqcBX7KPfXQ8ewRZWB7e7DUrKmiFmaD6MKTR35MXvRzA9+o2XTzcEhUNdeV8vLz0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e7f6a44d12046bb28199e3e2eedd211451f815c7748d4aef091d7e174adf881","last_reissued_at":"2026-05-18T03:02:33.959785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:33.959785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7635","source_version":2,"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:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuclabdjfxCczKEGp3j+PHIznUlBtTFy6T+kMRXiUgE/8tHpuhJx4o16rDYP+b8AlFfx8nnb8hBQVtg0P3bhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:32:29.243208Z"},"content_sha256":"dd4f56e326b9477bc69ae40a0870258d8e53375633bf056571fcf4cb69cb5d5e","schema_version":"1.0","event_id":"sha256:dd4f56e326b9477bc69ae40a0870258d8e53375633bf056571fcf4cb69cb5d5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FZ7WURGREBDLWKAZTY7C53OSCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concurrent bisimulation algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Konrad Ku{\\l}akowski","submitted_at":"2013-11-25T19:14:21Z","abstract_excerpt":"The coarsest bisimulation-finding problem plays an important role in the formal analysis of concurrent systems. For example, solving this problem allows the behavior of different processes to be compared or specifications to be verified. Hence, in this paper an efficient concurrent bisimulation algorithm is presented. It is based on the sequential Paige and Tarjan algorithm and the concept of the state signatures. The original solution follows Hopcroft's principle \"process the smaller half\". The presented algorithm uses its generalized version \"process all but the largest one\" better suited fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7635","kind":"arxiv","version":2},"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:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcP0N/nF36l0AURs4edpbzwiNlWCxEOBAXPS0xEIyr716LP5S1t3kvOHzyNqQbsxsWjsaZssf3bS2ESfBxjuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:32:29.243582Z"},"content_sha256":"591fd22d54bde044e973c66559e8da44a709c5515451f4089df396e734d0205d","schema_version":"1.0","event_id":"sha256:591fd22d54bde044e973c66559e8da44a709c5515451f4089df396e734d0205d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/bundle.json","state_url":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZ7WURGREBDLWKAZTY7C53OSCF/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-06-30T23:32:29Z","links":{"resolver":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF","bundle":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/bundle.json","state":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZ7WURGREBDLWKAZTY7C53OSCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FZ7WURGREBDLWKAZTY7C53OSCF","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":"c12669260210f153ffb67474d11583e0f46180d7f5eee2f7d5f463d1ebed25a7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-25T19:14:21Z","title_canon_sha256":"7c76368ada109df047ba318b7dc0d46aae38f6a42dde862da233395f739f22aa"},"schema_version":"1.0","source":{"id":"1311.7635","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7635","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7635v2","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7635","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"FZ7WURGREBDL","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FZ7WURGREBDLWKAZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FZ7WURGR","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:591fd22d54bde044e973c66559e8da44a709c5515451f4089df396e734d0205d","target":"graph","created_at":"2026-05-18T03:02:33Z","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":"The coarsest bisimulation-finding problem plays an important role in the formal analysis of concurrent systems. For example, solving this problem allows the behavior of different processes to be compared or specifications to be verified. Hence, in this paper an efficient concurrent bisimulation algorithm is presented. It is based on the sequential Paige and Tarjan algorithm and the concept of the state signatures. The original solution follows Hopcroft's principle \"process the smaller half\". The presented algorithm uses its generalized version \"process all but the largest one\" better suited fo","authors_text":"Konrad Ku{\\l}akowski","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-25T19:14:21Z","title":"Concurrent bisimulation algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7635","kind":"arxiv","version":2},"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:dd4f56e326b9477bc69ae40a0870258d8e53375633bf056571fcf4cb69cb5d5e","target":"record","created_at":"2026-05-18T03:02:33Z","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":"c12669260210f153ffb67474d11583e0f46180d7f5eee2f7d5f463d1ebed25a7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-11-25T19:14:21Z","title_canon_sha256":"7c76368ada109df047ba318b7dc0d46aae38f6a42dde862da233395f739f22aa"},"schema_version":"1.0","source":{"id":"1311.7635","kind":"arxiv","version":2}},"canonical_sha256":"2e7f6a44d12046bb28199e3e2eedd211451f815c7748d4aef091d7e174adf881","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e7f6a44d12046bb28199e3e2eedd211451f815c7748d4aef091d7e174adf881","first_computed_at":"2026-05-18T03:02:33.959785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:33.959785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/h3j0wnxszLUiWwjJu5OqcBX7KPfXQ8ewRZWB7e7DUrKmiFmaD6MKTR35MXvRzA9+o2XTzcEhUNdeV8vLz0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:33.960706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7635","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd4f56e326b9477bc69ae40a0870258d8e53375633bf056571fcf4cb69cb5d5e","sha256:591fd22d54bde044e973c66559e8da44a709c5515451f4089df396e734d0205d"],"state_sha256":"260052d843afc0cd3c4dca8959ffdd0be788d581bd28142c1a9cefba7bd9d739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXD+UQNUhDlngUT++zxaXCOb+oPwQYgPl2+GGxEnKu3plN/VBemAJxP6nxLWY+oFBwVQFGMv+aFbZWTNOQwxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:32:29.245894Z","bundle_sha256":"5271b91c6be2c78eef635a9da6b6b32f609ac245d8ba80ef62800efe6fe8a1a5"}}