{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UCCNVRTJCA3FOOW4BWBNPERKMO","short_pith_number":"pith:UCCNVRTJ","canonical_record":{"source":{"id":"1505.05265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-20T07:33:14Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"03ab3f2df1a8009a006e17b833ea53291f5b2d6b5c88d627bd4603fa0269dab0","abstract_canon_sha256":"bcaf905adefce4d91d6deba6e19bb39e70101257d87bb43436e70d86c9332b64"},"schema_version":"1.0"},"canonical_sha256":"a084dac6691036573adc0d82d7922a63a173f7e007066920e234dd9562d47695","source":{"kind":"arxiv","id":"1505.05265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05265","created_at":"2026-05-18T02:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05265v1","created_at":"2026-05-18T02:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05265","created_at":"2026-05-18T02:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"UCCNVRTJCA3F","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCCNVRTJCA3FOOW4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCCNVRTJ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UCCNVRTJCA3FOOW4BWBNPERKMO","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-20T07:33:14Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"03ab3f2df1a8009a006e17b833ea53291f5b2d6b5c88d627bd4603fa0269dab0","abstract_canon_sha256":"bcaf905adefce4d91d6deba6e19bb39e70101257d87bb43436e70d86c9332b64"},"schema_version":"1.0"},"canonical_sha256":"a084dac6691036573adc0d82d7922a63a173f7e007066920e234dd9562d47695","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:58.848301Z","signature_b64":"Wvj2b65cxGmuF8e8Q9J+thgs8ukWINFl1CR0B+BQhgva6+L1PJHIIF698TAci3NM3SK0Hb6tTzvOg8QrKRBvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a084dac6691036573adc0d82d7922a63a173f7e007066920e234dd9562d47695","last_reissued_at":"2026-05-18T02:03:58.847661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:58.847661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05265","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:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47CkGgtdu75IEHNgR1aAlMDbtSpGy0suENAM0I8kcgQKT09be7FdGZcQyKfjAWSTxAT48D3RKI6XYpOa/Y+KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:38:53.830536Z"},"content_sha256":"d87733457f0a16f9ba5dde53a53f4e5a6c018e16d5f59d06df3fd7de5e5e0c6a","schema_version":"1.0","event_id":"sha256:d87733457f0a16f9ba5dde53a53f4e5a6c018e16d5f59d06df3fd7de5e5e0c6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UCCNVRTJCA3FOOW4BWBNPERKMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modelling and Verifying an Object-Oriented Concurrency Model in GROOVE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Claudio Corrodi","submitted_at":"2015-05-20T07:33:14Z","abstract_excerpt":"SCOOP is a programming model and language that allows concurrent programming at a high level of abstraction. Several approaches to verifying SCOOP programs have been proposed in the past, but none of them operate directly on the source code without modifications or annotations.\n  We propose a fully automatic approach to verifying (a subset of) SCOOP programs by translation to graph-based models. First, we present a graph transformation based semantics for SCOOP. We present an implementation of the model in the state-of-the-art model checker GROOVE, which can be used to simulate programs and ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05265","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:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UakKp3e97WDlh1p3L6zxgzbA14k5rHEpfJHAhF65YrPcOTClNM4zcgJjdRlu3yfqnMXMTcJXqK3BvqUgj1vfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:38:53.830881Z"},"content_sha256":"807d8cc7e732acd803676556e299ec8903f00b716ad4461d11162b8601fc2dc8","schema_version":"1.0","event_id":"sha256:807d8cc7e732acd803676556e299ec8903f00b716ad4461d11162b8601fc2dc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCCNVRTJCA3FOOW4BWBNPERKMO/bundle.json","state_url":"https://pith.science/pith/UCCNVRTJCA3FOOW4BWBNPERKMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCCNVRTJCA3FOOW4BWBNPERKMO/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:38:53Z","links":{"resolver":"https://pith.science/pith/UCCNVRTJCA3FOOW4BWBNPERKMO","bundle":"https://pith.science/pith/UCCNVRTJCA3FOOW4BWBNPERKMO/bundle.json","state":"https://pith.science/pith/UCCNVRTJCA3FOOW4BWBNPERKMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCCNVRTJCA3FOOW4BWBNPERKMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UCCNVRTJCA3FOOW4BWBNPERKMO","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":"bcaf905adefce4d91d6deba6e19bb39e70101257d87bb43436e70d86c9332b64","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-20T07:33:14Z","title_canon_sha256":"03ab3f2df1a8009a006e17b833ea53291f5b2d6b5c88d627bd4603fa0269dab0"},"schema_version":"1.0","source":{"id":"1505.05265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05265","created_at":"2026-05-18T02:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05265v1","created_at":"2026-05-18T02:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05265","created_at":"2026-05-18T02:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"UCCNVRTJCA3F","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCCNVRTJCA3FOOW4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCCNVRTJ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:807d8cc7e732acd803676556e299ec8903f00b716ad4461d11162b8601fc2dc8","target":"graph","created_at":"2026-05-18T02:03:58Z","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":"SCOOP is a programming model and language that allows concurrent programming at a high level of abstraction. Several approaches to verifying SCOOP programs have been proposed in the past, but none of them operate directly on the source code without modifications or annotations.\n  We propose a fully automatic approach to verifying (a subset of) SCOOP programs by translation to graph-based models. First, we present a graph transformation based semantics for SCOOP. We present an implementation of the model in the state-of-the-art model checker GROOVE, which can be used to simulate programs and ve","authors_text":"Claudio Corrodi","cross_cats":["cs.LO","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-20T07:33:14Z","title":"Modelling and Verifying an Object-Oriented Concurrency Model in GROOVE"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05265","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:d87733457f0a16f9ba5dde53a53f4e5a6c018e16d5f59d06df3fd7de5e5e0c6a","target":"record","created_at":"2026-05-18T02:03:58Z","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":"bcaf905adefce4d91d6deba6e19bb39e70101257d87bb43436e70d86c9332b64","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-20T07:33:14Z","title_canon_sha256":"03ab3f2df1a8009a006e17b833ea53291f5b2d6b5c88d627bd4603fa0269dab0"},"schema_version":"1.0","source":{"id":"1505.05265","kind":"arxiv","version":1}},"canonical_sha256":"a084dac6691036573adc0d82d7922a63a173f7e007066920e234dd9562d47695","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a084dac6691036573adc0d82d7922a63a173f7e007066920e234dd9562d47695","first_computed_at":"2026-05-18T02:03:58.847661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:58.847661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wvj2b65cxGmuF8e8Q9J+thgs8ukWINFl1CR0B+BQhgva6+L1PJHIIF698TAci3NM3SK0Hb6tTzvOg8QrKRBvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:58.848301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d87733457f0a16f9ba5dde53a53f4e5a6c018e16d5f59d06df3fd7de5e5e0c6a","sha256:807d8cc7e732acd803676556e299ec8903f00b716ad4461d11162b8601fc2dc8"],"state_sha256":"38b191033e46380cf9952b2da390fcafb141ceb2154d30ba784adba7b43fc0ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhuPkiL+mG6KQRpiamBDu9WdlwhFHUSwdeThZQGRLQjegsX23LY6Y+dewJMrPfES3/Msug7fSns8Ek7fkC9dCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T05:38:53.832747Z","bundle_sha256":"c66ad2332c7d267d4f1aa5ff882cedfc4da4ae4cedc67cfc28376453f10eeca2"}}