{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QWBCG7RBFGEMMNFQN2GUIXD7UD","short_pith_number":"pith:QWBCG7RB","schema_version":"1.0","canonical_sha256":"8582237e212988c634b06e8d445c7fa0fad001d8e730b87a3af35047a2715930","source":{"kind":"arxiv","id":"1803.02776","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.02776","created_at":"2026-05-18T00:21:49.269477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02776v1","created_at":"2026-05-18T00:21:49.269477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02776","created_at":"2026-05-18T00:21:49.269477+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWBCG7RBFGEM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWBCG7RBFGEMMNFQ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWBCG7RB","created_at":"2026-05-18T12:32:50.500415+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/QWBCG7RBFGEMMNFQN2GUIXD7UD","json":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD.json","graph_json":"https://pith.science/api/pith-number/QWBCG7RBFGEMMNFQN2GUIXD7UD/graph.json","events_json":"https://pith.science/api/pith-number/QWBCG7RBFGEMMNFQN2GUIXD7UD/events.json","paper":"https://pith.science/paper/QWBCG7RB"},"agent_actions":{"view_html":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD","download_json":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD.json","view_paper":"https://pith.science/paper/QWBCG7RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02776&json=true","fetch_graph":"https://pith.science/api/pith-number/QWBCG7RBFGEMMNFQN2GUIXD7UD/graph.json","fetch_events":"https://pith.science/api/pith-number/QWBCG7RBFGEMMNFQN2GUIXD7UD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/action/storage_attestation","attest_author":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/action/author_attestation","sign_citation":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/action/citation_signature","submit_replication":"https://pith.science/pith/QWBCG7RBFGEMMNFQN2GUIXD7UD/action/replication_record"}},"created_at":"2026-05-18T00:21:49.269477+00:00","updated_at":"2026-05-18T00:21:49.269477+00:00"}