{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:A5ZLBX5JWRKYLXBOONVBKXFFBP","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":"bb5e564685717245b17f2708677686287178c7c9a456930c3ef7dc1c6df6d249","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-07T07:28:30Z","title_canon_sha256":"9e6146072c200f960e433d3df9ea1ecd62e0cdccd1bb11ecba3183be52d18080"},"schema_version":"1.0","source":{"id":"1212.1548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1548","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1548v1","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1548","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"A5ZLBX5JWRKY","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A5ZLBX5JWRKYLXBO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A5ZLBX5J","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:68b98e298dd50445cee5c32473bc9478dddaebbd9a3d24642e07b5fd3c928eb2","target":"graph","created_at":"2026-05-18T03:38: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":"Saraswat's concurrent constraint programming (ccp) is a mature formalism for modeling processes (or programs) that interact by telling and asking constraints in a global medium, called the store. Bisimilarity is a standard behavioural equivalence in concurrency theory, but a well-behaved notion of bisimilarity for ccp has been proposed only recently. When the state space of a system is finite, the ordinary notion of bisimilarity can be computed via the well-known partition refinement algorithm, but unfortunately, this algorithm does not work for ccp bisimilarity. In this paper, we propose a va","authors_text":"Andr\\'es Aristiz\\'abal (INRIA Saclay - Ile de France, Filippo Bonchi (LIP), Frank D. Valencia (INRIA Saclay - Ile de France, LIX), Luis Pino (INRIA Saclay - Ile de France)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-07T07:28:30Z","title":"Partition Refinement for Bisimilarity in CCP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1548","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:c4eeb7a273544973c05498596087acca1dc881b156e6b53226b8ad774fb701eb","target":"record","created_at":"2026-05-18T03:38: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":"bb5e564685717245b17f2708677686287178c7c9a456930c3ef7dc1c6df6d249","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-07T07:28:30Z","title_canon_sha256":"9e6146072c200f960e433d3df9ea1ecd62e0cdccd1bb11ecba3183be52d18080"},"schema_version":"1.0","source":{"id":"1212.1548","kind":"arxiv","version":1}},"canonical_sha256":"0772b0dfa9b45585dc2e736a155ca50bd8944f929c6b82fbbf023725010b673f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0772b0dfa9b45585dc2e736a155ca50bd8944f929c6b82fbbf023725010b673f","first_computed_at":"2026-05-18T03:38:56.957747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:56.957747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"85tkDBxTV09x8DUOB2opPHkwfc7K1D36CDT7u9RKqW4TRuOAzP8RKVcOKSTfcTZM/PVEJHqsENs0SNC2OhZbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:56.958280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4eeb7a273544973c05498596087acca1dc881b156e6b53226b8ad774fb701eb","sha256:68b98e298dd50445cee5c32473bc9478dddaebbd9a3d24642e07b5fd3c928eb2"],"state_sha256":"f5ec50cd0f0c4153478b0b1eaf0018f1ed5d9c917108d1a493509d8a64cc2d9a"}