{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HDNPNDH6ZM333ZGSGV3G4DM2WA","short_pith_number":"pith:HDNPNDH6","schema_version":"1.0","canonical_sha256":"38daf68cfecb37bde4d235766e0d9ab024d27c002b57363a16c367a86714a2e6","source":{"kind":"arxiv","id":"1212.3874","version":1},"attestation_state":"computed","paper":{"title":"Reducing Weak to Strong Bisimilarity in CCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andr\\'es Aristiz\\'abal (CNRS/DGA, Filippo Bonchi (ENS Lyon, Frank Valencia (CNRS, LIP), LIX \\'Ecole Polytechnique de Paris), Luis Pino (INRIA/DGA, Universit\\'e de Lyon","submitted_at":"2012-12-17T03:42:03Z","abstract_excerpt":"Concurrent constraint programming (ccp) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence in concurrency theory. However, only recently a well-behaved notion of bisimilarity for ccp, and a ccp partition refinement algorithm for deciding the strong version of this equivalence have been proposed. Weak bisimiliarity is a central behavioural equivalence in process calculi and it is obtained"},"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.3874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-12-17T03:42:03Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4ea5b20535ce204b615571d047fa2f3771460bc487ffe7326945af57dc4da67d","abstract_canon_sha256":"1e2fba1d588d9341636c5c5fc34b6040809f5febab7ef86b08edeafda4b911c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.207391Z","signature_b64":"8CueAFHc048xGfmocAFTtrtckoALnxu0sck86FMhKuEYrLFoq4Y1RwfOICjjr3sQ91mor1rwXEi8pKG/vPGrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38daf68cfecb37bde4d235766e0d9ab024d27c002b57363a16c367a86714a2e6","last_reissued_at":"2026-05-18T03:38:22.206870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.206870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing Weak to Strong Bisimilarity in CCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andr\\'es Aristiz\\'abal (CNRS/DGA, Filippo Bonchi (ENS Lyon, Frank Valencia (CNRS, LIP), LIX \\'Ecole Polytechnique de Paris), Luis Pino (INRIA/DGA, Universit\\'e de Lyon","submitted_at":"2012-12-17T03:42:03Z","abstract_excerpt":"Concurrent constraint programming (ccp) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence in concurrency theory. However, only recently a well-behaved notion of bisimilarity for ccp, and a ccp partition refinement algorithm for deciding the strong version of this equivalence have been proposed. Weak bisimiliarity is a central behavioural equivalence in process calculi and it is obtained"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3874","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.3874","created_at":"2026-05-18T03:38:22.206949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3874v1","created_at":"2026-05-18T03:38:22.206949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3874","created_at":"2026-05-18T03:38:22.206949+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDNPNDH6ZM33","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDNPNDH6ZM333ZGS","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDNPNDH6","created_at":"2026-05-18T12:27:09.501522+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/HDNPNDH6ZM333ZGSGV3G4DM2WA","json":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA.json","graph_json":"https://pith.science/api/pith-number/HDNPNDH6ZM333ZGSGV3G4DM2WA/graph.json","events_json":"https://pith.science/api/pith-number/HDNPNDH6ZM333ZGSGV3G4DM2WA/events.json","paper":"https://pith.science/paper/HDNPNDH6"},"agent_actions":{"view_html":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA","download_json":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA.json","view_paper":"https://pith.science/paper/HDNPNDH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3874&json=true","fetch_graph":"https://pith.science/api/pith-number/HDNPNDH6ZM333ZGSGV3G4DM2WA/graph.json","fetch_events":"https://pith.science/api/pith-number/HDNPNDH6ZM333ZGSGV3G4DM2WA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA/action/storage_attestation","attest_author":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA/action/author_attestation","sign_citation":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA/action/citation_signature","submit_replication":"https://pith.science/pith/HDNPNDH6ZM333ZGSGV3G4DM2WA/action/replication_record"}},"created_at":"2026-05-18T03:38:22.206949+00:00","updated_at":"2026-05-18T03:38:22.206949+00:00"}