{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZQSBHPZI65633Y4SIM2UUXK3CD","short_pith_number":"pith:ZQSBHPZI","canonical_record":{"source":{"id":"1504.02611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-04-10T09:40:14Z","cross_cats_sorted":["cs.DC","cs.LO","cs.PL"],"title_canon_sha256":"5a1bf5888d4245897ef786d655962c4bd6bd2f16691a37d7436cf26ce1295a24","abstract_canon_sha256":"ece6a52d0072db00d2c44dfbf761eb683b347e7fc0f7b3877f999b4e03943353"},"schema_version":"1.0"},"canonical_sha256":"cc2413bf28f77dbde39243354a5d5b10d75b111c5a975d494e1c29f77982b74a","source":{"kind":"arxiv","id":"1504.02611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02611","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02611v1","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02611","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZQSBHPZI6563","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZQSBHPZI65633Y4S","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZQSBHPZI","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZQSBHPZI65633Y4SIM2UUXK3CD","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-04-10T09:40:14Z","cross_cats_sorted":["cs.DC","cs.LO","cs.PL"],"title_canon_sha256":"5a1bf5888d4245897ef786d655962c4bd6bd2f16691a37d7436cf26ce1295a24","abstract_canon_sha256":"ece6a52d0072db00d2c44dfbf761eb683b347e7fc0f7b3877f999b4e03943353"},"schema_version":"1.0"},"canonical_sha256":"cc2413bf28f77dbde39243354a5d5b10d75b111c5a975d494e1c29f77982b74a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:07.184926Z","signature_b64":"r9G96rRAp53ajTseQc4/ZA4q1acv/rM5wUFrAlQuENafN+SIGyfrE6N/Y0TOpXWaghn9pmD2gSxb5jrgkLqBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc2413bf28f77dbde39243354a5d5b10d75b111c5a975d494e1c29f77982b74a","last_reissued_at":"2026-05-18T02:19:07.184202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:07.184202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02611","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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3504XCHYp4UsBK47pRDtIxUT0RQt6JaiXcRJjKe28kWbidLz6e1jPPh9o/xhDfwwsLPNYmXam7bmAAgZzSSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:37:42.890539Z"},"content_sha256":"a143c11751dd1f4f1e291ea17c3733f5a7490cc721dd467125d9a8b880690400","schema_version":"1.0","event_id":"sha256:a143c11751dd1f4f1e291ea17c3733f5a7490cc721dd467125d9a8b880690400"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZQSBHPZI65633Y4SIM2UUXK3CD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LO","cs.PL"],"primary_cat":"cs.SE","authors_text":"Alexander Heu{\\ss}ner, Benjamin Morandi, Christopher M. Poskitt, Claudio Corrodi","submitted_at":"2015-04-10T09:40:14Z","abstract_excerpt":"To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02611","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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/UilYSvbRSSjE+u5wdAQ00lNFwfoZP+X7CTazwkEUi+s+z/OPPv++SeT+tA9RjdaEhtWAtvqT70N+TAMWMJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:37:42.890889Z"},"content_sha256":"24fac92a3781b408dec0f3dbc36f29a7a23762ed448e618f424f6a745f8cf07a","schema_version":"1.0","event_id":"sha256:24fac92a3781b408dec0f3dbc36f29a7a23762ed448e618f424f6a745f8cf07a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQSBHPZI65633Y4SIM2UUXK3CD/bundle.json","state_url":"https://pith.science/pith/ZQSBHPZI65633Y4SIM2UUXK3CD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQSBHPZI65633Y4SIM2UUXK3CD/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-28T05:37:42Z","links":{"resolver":"https://pith.science/pith/ZQSBHPZI65633Y4SIM2UUXK3CD","bundle":"https://pith.science/pith/ZQSBHPZI65633Y4SIM2UUXK3CD/bundle.json","state":"https://pith.science/pith/ZQSBHPZI65633Y4SIM2UUXK3CD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQSBHPZI65633Y4SIM2UUXK3CD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZQSBHPZI65633Y4SIM2UUXK3CD","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":"ece6a52d0072db00d2c44dfbf761eb683b347e7fc0f7b3877f999b4e03943353","cross_cats_sorted":["cs.DC","cs.LO","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-04-10T09:40:14Z","title_canon_sha256":"5a1bf5888d4245897ef786d655962c4bd6bd2f16691a37d7436cf26ce1295a24"},"schema_version":"1.0","source":{"id":"1504.02611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02611","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02611v1","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02611","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZQSBHPZI6563","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZQSBHPZI65633Y4S","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZQSBHPZI","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:24fac92a3781b408dec0f3dbc36f29a7a23762ed448e618f424f6a745f8cf07a","target":"graph","created_at":"2026-05-18T02:19:07Z","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":"To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformatio","authors_text":"Alexander Heu{\\ss}ner, Benjamin Morandi, Christopher M. Poskitt, Claudio Corrodi","cross_cats":["cs.DC","cs.LO","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-04-10T09:40:14Z","title":"Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02611","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:a143c11751dd1f4f1e291ea17c3733f5a7490cc721dd467125d9a8b880690400","target":"record","created_at":"2026-05-18T02:19:07Z","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":"ece6a52d0072db00d2c44dfbf761eb683b347e7fc0f7b3877f999b4e03943353","cross_cats_sorted":["cs.DC","cs.LO","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-04-10T09:40:14Z","title_canon_sha256":"5a1bf5888d4245897ef786d655962c4bd6bd2f16691a37d7436cf26ce1295a24"},"schema_version":"1.0","source":{"id":"1504.02611","kind":"arxiv","version":1}},"canonical_sha256":"cc2413bf28f77dbde39243354a5d5b10d75b111c5a975d494e1c29f77982b74a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc2413bf28f77dbde39243354a5d5b10d75b111c5a975d494e1c29f77982b74a","first_computed_at":"2026-05-18T02:19:07.184202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:07.184202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r9G96rRAp53ajTseQc4/ZA4q1acv/rM5wUFrAlQuENafN+SIGyfrE6N/Y0TOpXWaghn9pmD2gSxb5jrgkLqBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:07.184926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a143c11751dd1f4f1e291ea17c3733f5a7490cc721dd467125d9a8b880690400","sha256:24fac92a3781b408dec0f3dbc36f29a7a23762ed448e618f424f6a745f8cf07a"],"state_sha256":"69356394681815d7f3fd4c952604ad0aba0540eec337e7d024e7854e59ffd2af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtHFob2pGvIlZnA+DZ2Lc51wk/wlkPeBZI+IJRpM8HIUx9PjSxU1fDD6WkhyUueyF+QtBBRCtgcF2b5vZ5e1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T05:37:42.892767Z","bundle_sha256":"50ce3920d3683b343b41e64bee5e216a1f4ee4e64b19d4401a10bb0ea110d414"}}