{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FZ7WURGREBDLWKAZTY7C53OSCF","short_pith_number":"pith:FZ7WURGR","schema_version":"1.0","canonical_sha256":"2e7f6a44d12046bb28199e3e2eedd211451f815c7748d4aef091d7e174adf881","source":{"kind":"arxiv","id":"1311.7635","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.7635","created_at":"2026-05-18T03:02:33.959954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7635v2","created_at":"2026-05-18T03:02:33.959954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7635","created_at":"2026-05-18T03:02:33.959954+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZ7WURGREBDL","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZ7WURGREBDLWKAZ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZ7WURGR","created_at":"2026-05-18T12:27:45.050594+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/FZ7WURGREBDLWKAZTY7C53OSCF","json":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF.json","graph_json":"https://pith.science/api/pith-number/FZ7WURGREBDLWKAZTY7C53OSCF/graph.json","events_json":"https://pith.science/api/pith-number/FZ7WURGREBDLWKAZTY7C53OSCF/events.json","paper":"https://pith.science/paper/FZ7WURGR"},"agent_actions":{"view_html":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF","download_json":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF.json","view_paper":"https://pith.science/paper/FZ7WURGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7635&json=true","fetch_graph":"https://pith.science/api/pith-number/FZ7WURGREBDLWKAZTY7C53OSCF/graph.json","fetch_events":"https://pith.science/api/pith-number/FZ7WURGREBDLWKAZTY7C53OSCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/action/storage_attestation","attest_author":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/action/author_attestation","sign_citation":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/action/citation_signature","submit_replication":"https://pith.science/pith/FZ7WURGREBDLWKAZTY7C53OSCF/action/replication_record"}},"created_at":"2026-05-18T03:02:33.959954+00:00","updated_at":"2026-05-18T03:02:33.959954+00:00"}