{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IXKDQMKFAUZ2GFOXWFMDMJBGCK","short_pith_number":"pith:IXKDQMKF","schema_version":"1.0","canonical_sha256":"45d43831450533a315d7b1583624261299497886714d60fad46ff7b28292b5a3","source":{"kind":"arxiv","id":"1109.4356","version":2},"attestation_state":"computed","paper":{"title":"Innocent strategies as presheaves and interactive equivalences for CCS (expanded version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Damien Pous (LIG), Tom Hirschowitz (LAMA)","submitted_at":"2011-09-20T16:59:41Z","abstract_excerpt":"Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner's CCS. We construct a category E of 'plays', and a subcategory V of 'views'. We argue that presheaves on V adequately represent 'innocent' strategies, in the sense of game semantics. We equip innocent strategies with a simple notion of interaction. We then prove decomposition results for innocent strategies, and, restricting to presheaves of finite ordinals, prove that innocent strategies are a final coalgebra for a polynomial functor derived from the game. This leads to a transl"},"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":"1109.4356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-20T16:59:41Z","cross_cats_sorted":[],"title_canon_sha256":"206b429a1624ccaca6bb6aa9f624d4111e0ecf9172dd8d4795663ea9e5b1ddf5","abstract_canon_sha256":"83bba98dc88bb00daf5d2552f282c09f72c4e510daad069f875d474c65762e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:43.963839Z","signature_b64":"F03RGUJv0UvTy78MbULelsXwWdLqyYW2NAu99U2ygDxt4ON2vrXXZO/z2BlFui4lwB2Qq07IgbBPVMERsZQ3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d43831450533a315d7b1583624261299497886714d60fad46ff7b28292b5a3","last_reissued_at":"2026-05-18T03:38:43.963045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:43.963045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Innocent strategies as presheaves and interactive equivalences for CCS (expanded version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Damien Pous (LIG), Tom Hirschowitz (LAMA)","submitted_at":"2011-09-20T16:59:41Z","abstract_excerpt":"Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner's CCS. We construct a category E of 'plays', and a subcategory V of 'views'. We argue that presheaves on V adequately represent 'innocent' strategies, in the sense of game semantics. We equip innocent strategies with a simple notion of interaction. We then prove decomposition results for innocent strategies, and, restricting to presheaves of finite ordinals, prove that innocent strategies are a final coalgebra for a polynomial functor derived from the game. This leads to a transl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4356","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":"1109.4356","created_at":"2026-05-18T03:38:43.963252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4356v2","created_at":"2026-05-18T03:38:43.963252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4356","created_at":"2026-05-18T03:38:43.963252+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXKDQMKFAUZ2","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXKDQMKFAUZ2GFOX","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXKDQMKF","created_at":"2026-05-18T12:26:32.869790+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/IXKDQMKFAUZ2GFOXWFMDMJBGCK","json":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK.json","graph_json":"https://pith.science/api/pith-number/IXKDQMKFAUZ2GFOXWFMDMJBGCK/graph.json","events_json":"https://pith.science/api/pith-number/IXKDQMKFAUZ2GFOXWFMDMJBGCK/events.json","paper":"https://pith.science/paper/IXKDQMKF"},"agent_actions":{"view_html":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK","download_json":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK.json","view_paper":"https://pith.science/paper/IXKDQMKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4356&json=true","fetch_graph":"https://pith.science/api/pith-number/IXKDQMKFAUZ2GFOXWFMDMJBGCK/graph.json","fetch_events":"https://pith.science/api/pith-number/IXKDQMKFAUZ2GFOXWFMDMJBGCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK/action/storage_attestation","attest_author":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK/action/author_attestation","sign_citation":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK/action/citation_signature","submit_replication":"https://pith.science/pith/IXKDQMKFAUZ2GFOXWFMDMJBGCK/action/replication_record"}},"created_at":"2026-05-18T03:38:43.963252+00:00","updated_at":"2026-05-18T03:38:43.963252+00:00"}