{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EDTXNDBC3Q3PWNF6AQMFJQWDLU","short_pith_number":"pith:EDTXNDBC","schema_version":"1.0","canonical_sha256":"20e7768c22dc36fb34be041854c2c35d398cad47bdd96e90fff38815d3d5d4ad","source":{"kind":"arxiv","id":"1709.07741","version":1},"attestation_state":"computed","paper":{"title":"Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Aleksandar Nanevski, Anindya Banerjee, Germ\\'an Andr\\'es Delbianco","submitted_at":"2017-09-22T13:35:58Z","abstract_excerpt":"Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger ones, while enabling programs specified under one STS to be linked to a larger one, without reverification. This paper develops a notion of morphism between two STSs which permits such lifting. The morphisms are a constructive form of simulation between the STSs, and lead to a general and concise proof system. We illustrate the concept and its generality on se"},"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":"1709.07741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-22T13:35:58Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"a51460148bb4d614d9b51e59a7619ef26392bab9f49365b34e63c255e5794317","abstract_canon_sha256":"902db37a665acb2a5e38444dbe0161e211ca26c0eb8f1e0ce6cac85b92b39435"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:32.447981Z","signature_b64":"kQ3Cy2ZFFtLR67YxR2sVxDKW1e2BvDPLhr9ilkvmJQTxWvDQG0ypENic6cO4eoTG/Bou7tCBI0vEjglwRVbBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20e7768c22dc36fb34be041854c2c35d398cad47bdd96e90fff38815d3d5d4ad","last_reissued_at":"2026-05-18T00:34:32.447635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:32.447635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Aleksandar Nanevski, Anindya Banerjee, Germ\\'an Andr\\'es Delbianco","submitted_at":"2017-09-22T13:35:58Z","abstract_excerpt":"Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger ones, while enabling programs specified under one STS to be linked to a larger one, without reverification. This paper develops a notion of morphism between two STSs which permits such lifting. The morphisms are a constructive form of simulation between the STSs, and lead to a general and concise proof system. We illustrate the concept and its generality on se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07741","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":"1709.07741","created_at":"2026-05-18T00:34:32.447692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07741v1","created_at":"2026-05-18T00:34:32.447692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07741","created_at":"2026-05-18T00:34:32.447692+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDTXNDBC3Q3P","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDTXNDBC3Q3PWNF6","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDTXNDBC","created_at":"2026-05-18T12:31:12.930513+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/EDTXNDBC3Q3PWNF6AQMFJQWDLU","json":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU.json","graph_json":"https://pith.science/api/pith-number/EDTXNDBC3Q3PWNF6AQMFJQWDLU/graph.json","events_json":"https://pith.science/api/pith-number/EDTXNDBC3Q3PWNF6AQMFJQWDLU/events.json","paper":"https://pith.science/paper/EDTXNDBC"},"agent_actions":{"view_html":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU","download_json":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU.json","view_paper":"https://pith.science/paper/EDTXNDBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07741&json=true","fetch_graph":"https://pith.science/api/pith-number/EDTXNDBC3Q3PWNF6AQMFJQWDLU/graph.json","fetch_events":"https://pith.science/api/pith-number/EDTXNDBC3Q3PWNF6AQMFJQWDLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/action/storage_attestation","attest_author":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/action/author_attestation","sign_citation":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/action/citation_signature","submit_replication":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/action/replication_record"}},"created_at":"2026-05-18T00:34:32.447692+00:00","updated_at":"2026-05-18T00:34:32.447692+00:00"}