{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:A5ZLBX5JWRKYLXBOONVBKXFFBP","short_pith_number":"pith:A5ZLBX5J","schema_version":"1.0","canonical_sha256":"0772b0dfa9b45585dc2e736a155ca50bd8944f929c6b82fbbf023725010b673f","source":{"kind":"arxiv","id":"1212.1548","version":1},"attestation_state":"computed","paper":{"title":"Partition Refinement for Bisimilarity in CCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","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)","submitted_at":"2012-12-07T07:28:30Z","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"},"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":"1212.1548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-12-07T07:28:30Z","cross_cats_sorted":[],"title_canon_sha256":"9e6146072c200f960e433d3df9ea1ecd62e0cdccd1bb11ecba3183be52d18080","abstract_canon_sha256":"bb5e564685717245b17f2708677686287178c7c9a456930c3ef7dc1c6df6d249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:56.958280Z","signature_b64":"85tkDBxTV09x8DUOB2opPHkwfc7K1D36CDT7u9RKqW4TRuOAzP8RKVcOKSTfcTZM/PVEJHqsENs0SNC2OhZbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0772b0dfa9b45585dc2e736a155ca50bd8944f929c6b82fbbf023725010b673f","last_reissued_at":"2026-05-18T03:38:56.957747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:56.957747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partition Refinement for Bisimilarity in CCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","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)","submitted_at":"2012-12-07T07:28:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1548","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.1548","created_at":"2026-05-18T03:38:56.957830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1548v1","created_at":"2026-05-18T03:38:56.957830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1548","created_at":"2026-05-18T03:38:56.957830+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5ZLBX5JWRKY","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5ZLBX5JWRKYLXBO","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5ZLBX5J","created_at":"2026-05-18T12:26:58.693483+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/A5ZLBX5JWRKYLXBOONVBKXFFBP","json":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP.json","graph_json":"https://pith.science/api/pith-number/A5ZLBX5JWRKYLXBOONVBKXFFBP/graph.json","events_json":"https://pith.science/api/pith-number/A5ZLBX5JWRKYLXBOONVBKXFFBP/events.json","paper":"https://pith.science/paper/A5ZLBX5J"},"agent_actions":{"view_html":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP","download_json":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP.json","view_paper":"https://pith.science/paper/A5ZLBX5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1548&json=true","fetch_graph":"https://pith.science/api/pith-number/A5ZLBX5JWRKYLXBOONVBKXFFBP/graph.json","fetch_events":"https://pith.science/api/pith-number/A5ZLBX5JWRKYLXBOONVBKXFFBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP/action/storage_attestation","attest_author":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP/action/author_attestation","sign_citation":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP/action/citation_signature","submit_replication":"https://pith.science/pith/A5ZLBX5JWRKYLXBOONVBKXFFBP/action/replication_record"}},"created_at":"2026-05-18T03:38:56.957830+00:00","updated_at":"2026-05-18T03:38:56.957830+00:00"}