{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TESED2622NOH3XZWONTCPG7JKX","short_pith_number":"pith:TESED262","canonical_record":{"source":{"id":"1807.08117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2018-07-21T10:01:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3ae0a6b8da1062c9c6ce1c0baf0a442f62f1a9fe251758573722863a255607f1","abstract_canon_sha256":"79bf6145305e150e1e179fd91c0d6abc855baf6fc5cda4cfb89e698e9274128e"},"schema_version":"1.0"},"canonical_sha256":"992441ebdad35c7ddf367366279be955fc921019097b25d2b20d4d8d9672bc7c","source":{"kind":"arxiv","id":"1807.08117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08117","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08117v1","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08117","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"pith_short_12","alias_value":"TESED2622NOH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TESED2622NOH3XZW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TESED262","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TESED2622NOH3XZWONTCPG7JKX","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08117","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2018-07-21T10:01:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3ae0a6b8da1062c9c6ce1c0baf0a442f62f1a9fe251758573722863a255607f1","abstract_canon_sha256":"79bf6145305e150e1e179fd91c0d6abc855baf6fc5cda4cfb89e698e9274128e"},"schema_version":"1.0"},"canonical_sha256":"992441ebdad35c7ddf367366279be955fc921019097b25d2b20d4d8d9672bc7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:09.251512Z","signature_b64":"hjnMCOnmT7ByDqcseggSpdelchfUyH+v6MJr0kRgRkgoVood7V0aoI98n1M/zcpS3AjEPRMBBrklERiMAcKZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"992441ebdad35c7ddf367366279be955fc921019097b25d2b20d4d8d9672bc7c","last_reissued_at":"2026-05-18T00:10:09.250877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:09.250877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08117","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRJwxqvw6uxxA4kMv0vgj/YbshBlcl88ZfZKMk+aGA9HNCOhZumm7h2Rv8AB5q+KsA/B52MstyQyPq9iCXvHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:54:40.901999Z"},"content_sha256":"708af4394ed932e029a54872a7517b5767a9aadfcd162227e3bb4a262d563485","schema_version":"1.0","event_id":"sha256:708af4394ed932e029a54872a7517b5767a9aadfcd162227e3bb4a262d563485"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TESED2622NOH3XZWONTCPG7JKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asynchronous soundness theorem for concurrent separation logic","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"L\\'eo Stefanesco, Paul-Andr\\'e Melli\\`es","submitted_at":"2018-07-21T10:01:36Z","abstract_excerpt":"Concurrent separation logic (CSL) is a specification logic for concurrent imperative programs with shared memory and locks. In this paper, we develop a concurrent and interactive account of the logic inspired by asynchronous game semantics. To every program $C$, we associate a pair of asynchronous transition systems $[C]_S$ and $[C]_L$ which describe the operational behavior of the Code when confronted to its Environment or Frame --- both at the level of machine states ($S$) and of machine instructions and locks ($L$). We then establish that every derivation tree $\\pi$ of a judgment $\\Gamma\\vd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08117","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsrSSsXA0WXPIxXUQNsK5vdoXmFoB+V7zhENoDafWxrpn2dyhNR51jHtxyz2+8JgD75nXq+kwpQA3yArdHXUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:54:40.902368Z"},"content_sha256":"86736f03e438bd800fea6ea0a051591a0b8e460991f62ab694f91ccea76a16a1","schema_version":"1.0","event_id":"sha256:86736f03e438bd800fea6ea0a051591a0b8e460991f62ab694f91ccea76a16a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/bundle.json","state_url":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TESED2622NOH3XZWONTCPG7JKX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T15:54:40Z","links":{"resolver":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX","bundle":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/bundle.json","state":"https://pith.science/pith/TESED2622NOH3XZWONTCPG7JKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TESED2622NOH3XZWONTCPG7JKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TESED2622NOH3XZWONTCPG7JKX","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":"79bf6145305e150e1e179fd91c0d6abc855baf6fc5cda4cfb89e698e9274128e","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2018-07-21T10:01:36Z","title_canon_sha256":"3ae0a6b8da1062c9c6ce1c0baf0a442f62f1a9fe251758573722863a255607f1"},"schema_version":"1.0","source":{"id":"1807.08117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08117","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08117v1","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08117","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"pith_short_12","alias_value":"TESED2622NOH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TESED2622NOH3XZW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TESED262","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:86736f03e438bd800fea6ea0a051591a0b8e460991f62ab694f91ccea76a16a1","target":"graph","created_at":"2026-05-18T00:10:09Z","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":"Concurrent separation logic (CSL) is a specification logic for concurrent imperative programs with shared memory and locks. In this paper, we develop a concurrent and interactive account of the logic inspired by asynchronous game semantics. To every program $C$, we associate a pair of asynchronous transition systems $[C]_S$ and $[C]_L$ which describe the operational behavior of the Code when confronted to its Environment or Frame --- both at the level of machine states ($S$) and of machine instructions and locks ($L$). We then establish that every derivation tree $\\pi$ of a judgment $\\Gamma\\vd","authors_text":"L\\'eo Stefanesco, Paul-Andr\\'e Melli\\`es","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2018-07-21T10:01:36Z","title":"An Asynchronous soundness theorem for concurrent separation logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08117","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:708af4394ed932e029a54872a7517b5767a9aadfcd162227e3bb4a262d563485","target":"record","created_at":"2026-05-18T00:10:09Z","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":"79bf6145305e150e1e179fd91c0d6abc855baf6fc5cda4cfb89e698e9274128e","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2018-07-21T10:01:36Z","title_canon_sha256":"3ae0a6b8da1062c9c6ce1c0baf0a442f62f1a9fe251758573722863a255607f1"},"schema_version":"1.0","source":{"id":"1807.08117","kind":"arxiv","version":1}},"canonical_sha256":"992441ebdad35c7ddf367366279be955fc921019097b25d2b20d4d8d9672bc7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"992441ebdad35c7ddf367366279be955fc921019097b25d2b20d4d8d9672bc7c","first_computed_at":"2026-05-18T00:10:09.250877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:09.250877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hjnMCOnmT7ByDqcseggSpdelchfUyH+v6MJr0kRgRkgoVood7V0aoI98n1M/zcpS3AjEPRMBBrklERiMAcKZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:09.251512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:708af4394ed932e029a54872a7517b5767a9aadfcd162227e3bb4a262d563485","sha256:86736f03e438bd800fea6ea0a051591a0b8e460991f62ab694f91ccea76a16a1"],"state_sha256":"00876bad43eb572f6f14127a3892a0d0bc6c276262bfdf59751f171fc85158fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsRhnjRUc5zybIOU8pILt4Dz5C/QHP9plODcCKRUm59XGABVgarrfHH4M2AAJTxLbNV+s5h0h5TszH/yvItnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:54:40.904298Z","bundle_sha256":"926e5e99c44d3277fb038728c1af6b4bf5f50f854ca6dc76d7de43546ed382bb"}}