{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EDO7PE2G2J55Z6RFAWFQ6JOVNU","short_pith_number":"pith:EDO7PE2G","canonical_record":{"source":{"id":"1407.4394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-16T17:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"a505a6b99d9106946f7949e3c4cd5696d058a5a0e709085f0a52d5c0385671f7","abstract_canon_sha256":"9e632c532242fe21f0923fd53e1d46aea713fc2c8025521987cfc044d3908413"},"schema_version":"1.0"},"canonical_sha256":"20ddf79346d27bdcfa25058b0f25d56d2146715f8a68a187518216ecfce775a1","source":{"kind":"arxiv","id":"1407.4394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4394","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4394v2","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4394","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"EDO7PE2G2J55","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDO7PE2G2J55Z6RF","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDO7PE2G","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EDO7PE2G2J55Z6RFAWFQ6JOVNU","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-16T17:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"a505a6b99d9106946f7949e3c4cd5696d058a5a0e709085f0a52d5c0385671f7","abstract_canon_sha256":"9e632c532242fe21f0923fd53e1d46aea713fc2c8025521987cfc044d3908413"},"schema_version":"1.0"},"canonical_sha256":"20ddf79346d27bdcfa25058b0f25d56d2146715f8a68a187518216ecfce775a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:22.698578Z","signature_b64":"1z5xGhwk2YN0OJWabaAEhtmixhRepAdJg2fqOqLBIHwW9kk3KZ2kUg/x4OmXwZw2JAvsj8F11hChwk52pCdlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20ddf79346d27bdcfa25058b0f25d56d2146715f8a68a187518216ecfce775a1","last_reissued_at":"2026-05-18T02:47:22.698050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:22.698050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4394","source_version":2,"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:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mq6RN6aKlxgaZ+/qWjOQYuF8LR+LPwGUoPvX/l5MO5Qqv6RZWNVP5LJO2IAi73I4CoreBR50yU2SZX53elexBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:17:03.816882Z"},"content_sha256":"be0c2fdbb526ba111288da55e2712f3c2811c0cd14b9b80b9e334ebb5a62d460","schema_version":"1.0","event_id":"sha256:be0c2fdbb526ba111288da55e2712f3c2811c0cd14b9b80b9e334ebb5a62d460"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EDO7PE2G2J55Z6RFAWFQ6JOVNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Giorgio Delzanno, Jan St\\\"uckrath","submitted_at":"2014-07-16T17:51:44Z","abstract_excerpt":"We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4394","kind":"arxiv","version":2},"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:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOEkdZusTV/r7AAVf5DbH0zcAo4BcfCUZzDsei8PInSgrxPzKYp1zasl1AE0ywnyfJkSj/xhj//doIQiqTQaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:17:03.817595Z"},"content_sha256":"9dcc74d59352bf244c8633a4cace9d21b8ee1a441ef1effdd38823c73216ff65","schema_version":"1.0","event_id":"sha256:9dcc74d59352bf244c8633a4cace9d21b8ee1a441ef1effdd38823c73216ff65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDO7PE2G2J55Z6RFAWFQ6JOVNU/bundle.json","state_url":"https://pith.science/pith/EDO7PE2G2J55Z6RFAWFQ6JOVNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDO7PE2G2J55Z6RFAWFQ6JOVNU/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-08T20:17:03Z","links":{"resolver":"https://pith.science/pith/EDO7PE2G2J55Z6RFAWFQ6JOVNU","bundle":"https://pith.science/pith/EDO7PE2G2J55Z6RFAWFQ6JOVNU/bundle.json","state":"https://pith.science/pith/EDO7PE2G2J55Z6RFAWFQ6JOVNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDO7PE2G2J55Z6RFAWFQ6JOVNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EDO7PE2G2J55Z6RFAWFQ6JOVNU","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":"9e632c532242fe21f0923fd53e1d46aea713fc2c8025521987cfc044d3908413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-16T17:51:44Z","title_canon_sha256":"a505a6b99d9106946f7949e3c4cd5696d058a5a0e709085f0a52d5c0385671f7"},"schema_version":"1.0","source":{"id":"1407.4394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4394","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4394v2","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4394","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"EDO7PE2G2J55","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDO7PE2G2J55Z6RF","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDO7PE2G","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:9dcc74d59352bf244c8633a4cace9d21b8ee1a441ef1effdd38823c73216ff65","target":"graph","created_at":"2026-05-18T02:47:22Z","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 introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition s","authors_text":"Giorgio Delzanno, Jan St\\\"uckrath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-16T17:51:44Z","title":"Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4394","kind":"arxiv","version":2},"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:be0c2fdbb526ba111288da55e2712f3c2811c0cd14b9b80b9e334ebb5a62d460","target":"record","created_at":"2026-05-18T02:47:22Z","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":"9e632c532242fe21f0923fd53e1d46aea713fc2c8025521987cfc044d3908413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-16T17:51:44Z","title_canon_sha256":"a505a6b99d9106946f7949e3c4cd5696d058a5a0e709085f0a52d5c0385671f7"},"schema_version":"1.0","source":{"id":"1407.4394","kind":"arxiv","version":2}},"canonical_sha256":"20ddf79346d27bdcfa25058b0f25d56d2146715f8a68a187518216ecfce775a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20ddf79346d27bdcfa25058b0f25d56d2146715f8a68a187518216ecfce775a1","first_computed_at":"2026-05-18T02:47:22.698050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:22.698050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1z5xGhwk2YN0OJWabaAEhtmixhRepAdJg2fqOqLBIHwW9kk3KZ2kUg/x4OmXwZw2JAvsj8F11hChwk52pCdlBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:22.698578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be0c2fdbb526ba111288da55e2712f3c2811c0cd14b9b80b9e334ebb5a62d460","sha256:9dcc74d59352bf244c8633a4cace9d21b8ee1a441ef1effdd38823c73216ff65"],"state_sha256":"1c6c17f6c4ccf49fee767e69220dea3545237a25c48d2f0ae697056c7f900888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIITgikyLOFhnLjznoT0Tu0rNzPZBF/Pv+YidOpDLhAk9Xpp3mUvvHqg0h2dRvm5gZOA+I7P3bO1yykzLxquAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:17:03.821171Z","bundle_sha256":"1784c694859e23d9a419a06b2602c3a7f321f60a50e71c46a542eba8262915f6"}}