{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EDTXNDBC3Q3PWNF6AQMFJQWDLU","short_pith_number":"pith:EDTXNDBC","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"},"canonical_sha256":"20e7768c22dc36fb34be041854c2c35d398cad47bdd96e90fff38815d3d5d4ad","source":{"kind":"arxiv","id":"1709.07741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07741","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07741v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07741","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"EDTXNDBC3Q3P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDTXNDBC3Q3PWNF6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDTXNDBC","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EDTXNDBC3Q3PWNF6AQMFJQWDLU","target":"record","payload":{"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"},"canonical_sha256":"20e7768c22dc36fb34be041854c2c35d398cad47bdd96e90fff38815d3d5d4ad","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"},"source_kind":"arxiv","source_id":"1709.07741","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:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQsfYJLG2N3eYRG3QdMNRZHWuz6WtBFItcamdj0nnKXV9sJL99+NoWGNtCdPtx2VMTP167AibVyMEJe8qEIJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:22:21.635890Z"},"content_sha256":"897a661c2b9c6303c8745aa68b91da359bd39104270e9fc6435b3719f42172fd","schema_version":"1.0","event_id":"sha256:897a661c2b9c6303c8745aa68b91da359bd39104270e9fc6435b3719f42172fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EDTXNDBC3Q3PWNF6AQMFJQWDLU","target":"graph","payload":{"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"},"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:34:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4fkHwj7s6AyoV8+eMeUSykE3Sil9xITSLBwnpzxTZSrGO17zYJei9Cf6dnvrAmg7Y35ma/BS/7HmWwpJckrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:22:21.636692Z"},"content_sha256":"42db5efca056673dca9fc02c771f4118a541b389bacb9c3eae3637ac8a11278b","schema_version":"1.0","event_id":"sha256:42db5efca056673dca9fc02c771f4118a541b389bacb9c3eae3637ac8a11278b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/bundle.json","state_url":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/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-05-31T05:22:21Z","links":{"resolver":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU","bundle":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/bundle.json","state":"https://pith.science/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDTXNDBC3Q3PWNF6AQMFJQWDLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EDTXNDBC3Q3PWNF6AQMFJQWDLU","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":"902db37a665acb2a5e38444dbe0161e211ca26c0eb8f1e0ce6cac85b92b39435","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-22T13:35:58Z","title_canon_sha256":"a51460148bb4d614d9b51e59a7619ef26392bab9f49365b34e63c255e5794317"},"schema_version":"1.0","source":{"id":"1709.07741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07741","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07741v1","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07741","created_at":"2026-05-18T00:34:32Z"},{"alias_kind":"pith_short_12","alias_value":"EDTXNDBC3Q3P","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDTXNDBC3Q3PWNF6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDTXNDBC","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:42db5efca056673dca9fc02c771f4118a541b389bacb9c3eae3637ac8a11278b","target":"graph","created_at":"2026-05-18T00:34:32Z","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":"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","authors_text":"Aleksandar Nanevski, Anindya Banerjee, Germ\\'an Andr\\'es Delbianco","cross_cats":["cs.DC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-22T13:35:58Z","title":"Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07741","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:897a661c2b9c6303c8745aa68b91da359bd39104270e9fc6435b3719f42172fd","target":"record","created_at":"2026-05-18T00:34:32Z","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":"902db37a665acb2a5e38444dbe0161e211ca26c0eb8f1e0ce6cac85b92b39435","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-22T13:35:58Z","title_canon_sha256":"a51460148bb4d614d9b51e59a7619ef26392bab9f49365b34e63c255e5794317"},"schema_version":"1.0","source":{"id":"1709.07741","kind":"arxiv","version":1}},"canonical_sha256":"20e7768c22dc36fb34be041854c2c35d398cad47bdd96e90fff38815d3d5d4ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20e7768c22dc36fb34be041854c2c35d398cad47bdd96e90fff38815d3d5d4ad","first_computed_at":"2026-05-18T00:34:32.447635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:32.447635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQ3Cy2ZFFtLR67YxR2sVxDKW1e2BvDPLhr9ilkvmJQTxWvDQG0ypENic6cO4eoTG/Bou7tCBI0vEjglwRVbBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:32.447981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:897a661c2b9c6303c8745aa68b91da359bd39104270e9fc6435b3719f42172fd","sha256:42db5efca056673dca9fc02c771f4118a541b389bacb9c3eae3637ac8a11278b"],"state_sha256":"9d327da518f16bf91523418c757b9125d747793b2ed63a181322fc2580001c93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRF3JBPSJZ1tgWVnaLxrIE+IjiCyGsiTkJfV4etZ02Dzk5a0bDEOXJLEavWW9UjsNI1pys4/iANf431fVUqKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:22:21.640341Z","bundle_sha256":"c2af04e3329291003a59c61671399d4a3c97cb138681a970f003d46ab9cd939c"}}