{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QWBCG7RBFGEMMNFQN2GUIXD7UD","short_pith_number":"pith:QWBCG7RB","canonical_record":{"source":{"id":"1803.02776","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-07T17:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"ae3d3a5d6b3f9984efd162f11f5b25ad6a2bc015f1e176c25ff1b590b2a81548","abstract_canon_sha256":"eed01a10158912a1311518de48dab753f55905efafdf9793c7dc582395254bd8"},"schema_version":"1.0"},"canonical_sha256":"8582237e212988c634b06e8d445c7fa0fad001d8e730b87a3af35047a2715930","source":{"kind":"arxiv","id":"1803.02776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02776","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02776v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02776","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"QWBCG7RBFGEM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QWBCG7RBFGEMMNFQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QWBCG7RB","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QWBCG7RBFGEMMNFQN2GUIXD7UD","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02776","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-07T17:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"ae3d3a5d6b3f9984efd162f11f5b25ad6a2bc015f1e176c25ff1b590b2a81548","abstract_canon_sha256":"eed01a10158912a1311518de48dab753f55905efafdf9793c7dc582395254bd8"},"schema_version":"1.0"},"canonical_sha256":"8582237e212988c634b06e8d445c7fa0fad001d8e730b87a3af35047a2715930","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:49.270004Z","signature_b64":"2n3my3BX/cOIGp2OFBnMj7pgjqi6+3o/so1uGi//t9mRFpXMeM6rQVv7hnzHNzhd0HE3P2LdItW1iIfnQ6PCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8582237e212988c634b06e8d445c7fa0fad001d8e730b87a3af35047a2715930","last_reissued_at":"2026-05-18T00:21:49.269378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:49.269378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02776","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Av7DyOKQ8xkKTQwMSIUvtsq8NbljtVjyIX3slu9xFTCtYy07BZ7/Y2jqy+yX7/hGj/8A1vit6EXlZNbjako4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:03:16.639649Z"},"content_sha256":"df45b02872dda272e90a0d3b904c12daea6dc576ea97d90fe95f994ffcd3d3b6","schema_version":"1.0","event_id":"sha256:df45b02872dda272e90a0d3b904c12daea6dc576ea97d90fe95f994ffcd3d3b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QWBCG7RBFGEMMNFQN2GUIXD7UD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Verification of Logically Decorated Graph Transformations","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jon Ha\\\"el Brenas, Martin Strecker, Rachid Echahed","submitted_at":"2018-03-07T17:16:01Z","abstract_excerpt":"We address the problem of reasoning on graph transformations featuring actions such as \\emph{addition} and \\emph{deletion} of nodes and edges, node \\emph{merging} and \\emph{cloning}, node or edge \\emph{labelling} and edge \\emph{redirection}. First, we introduce the considered graph rewrite systems which are parameterized by a given logic $\\mathcal{L}$. Formulas of $\\mathcal{L}$ are used to label graph nodes and edges. In a second step, we tackle the problem of formal verification of the considered rewrite systems by using a Hoare-like weakest precondition calculus. It acts on triples of the fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02776","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71MD5Rl0ymAQdvbLgdrEafYQ+LSkzMbVo8TrGtbrvIfJzxG4AHjlkJ19VRCZoycO8iDOYHp1FOCkqO4h02n8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:03:16.640360Z"},"content_sha256":"ac49d5b992ad6ef35566d18b281464117612f2448a344f0dada6458f9651459d","schema_version":"1.0","event_id":"sha256:ac49d5b992ad6ef35566d18b281464117612f2448a344f0dada6458f9651459d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/bundle.json","state_url":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/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-12T00:03:16Z","links":{"resolver":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD","bundle":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/bundle.json","state":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QWBCG7RBFGEMMNFQN2GUIXD7UD","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":"eed01a10158912a1311518de48dab753f55905efafdf9793c7dc582395254bd8","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-07T17:16:01Z","title_canon_sha256":"ae3d3a5d6b3f9984efd162f11f5b25ad6a2bc015f1e176c25ff1b590b2a81548"},"schema_version":"1.0","source":{"id":"1803.02776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02776","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02776v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02776","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"QWBCG7RBFGEM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QWBCG7RBFGEMMNFQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QWBCG7RB","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:ac49d5b992ad6ef35566d18b281464117612f2448a344f0dada6458f9651459d","target":"graph","created_at":"2026-05-18T00:21:49Z","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":"We address the problem of reasoning on graph transformations featuring actions such as \\emph{addition} and \\emph{deletion} of nodes and edges, node \\emph{merging} and \\emph{cloning}, node or edge \\emph{labelling} and edge \\emph{redirection}. First, we introduce the considered graph rewrite systems which are parameterized by a given logic $\\mathcal{L}$. Formulas of $\\mathcal{L}$ are used to label graph nodes and edges. In a second step, we tackle the problem of formal verification of the considered rewrite systems by using a Hoare-like weakest precondition calculus. It acts on triples of the fo","authors_text":"Jon Ha\\\"el Brenas, Martin Strecker, Rachid Echahed","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-07T17:16:01Z","title":"On the Verification of Logically Decorated Graph Transformations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02776","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:df45b02872dda272e90a0d3b904c12daea6dc576ea97d90fe95f994ffcd3d3b6","target":"record","created_at":"2026-05-18T00:21:49Z","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":"eed01a10158912a1311518de48dab753f55905efafdf9793c7dc582395254bd8","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-07T17:16:01Z","title_canon_sha256":"ae3d3a5d6b3f9984efd162f11f5b25ad6a2bc015f1e176c25ff1b590b2a81548"},"schema_version":"1.0","source":{"id":"1803.02776","kind":"arxiv","version":1}},"canonical_sha256":"8582237e212988c634b06e8d445c7fa0fad001d8e730b87a3af35047a2715930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8582237e212988c634b06e8d445c7fa0fad001d8e730b87a3af35047a2715930","first_computed_at":"2026-05-18T00:21:49.269378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:49.269378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2n3my3BX/cOIGp2OFBnMj7pgjqi6+3o/so1uGi//t9mRFpXMeM6rQVv7hnzHNzhd0HE3P2LdItW1iIfnQ6PCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:49.270004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df45b02872dda272e90a0d3b904c12daea6dc576ea97d90fe95f994ffcd3d3b6","sha256:ac49d5b992ad6ef35566d18b281464117612f2448a344f0dada6458f9651459d"],"state_sha256":"72aad9ca8339e110ad8c2b3ddc9f089e2e0706ae42499090cf712dead8bb0657"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6PvvJdoEV0z5yYAafB3I9NBIY285hskGSCaHT+RT3pllCN6XZEB9p+k/VQKca+cNKaZmv04vSn/vVIXXyMUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:03:16.645367Z","bundle_sha256":"d275eae8f0775e9bc9ab3eef0944b8669bcbbef8d9f5e1286a55153e2851e373"}}