{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DPQBRLP4UZIIDUU7PP7R27GQRY","short_pith_number":"pith:DPQBRLP4","canonical_record":{"source":{"id":"1808.03161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-09T13:49:33Z","cross_cats_sorted":[],"title_canon_sha256":"be7938b1e96c4046e9adf4f820cf074f9c84aa97333b3b742bbfd7cac38e5245","abstract_canon_sha256":"6b77ea87a3e6d3fdd07cd9c350160e821f7336b8263f25adcfcf5f2946f67863"},"schema_version":"1.0"},"canonical_sha256":"1be018adfca65081d29f7bff1d7cd08e1b05f14572217f68d8d6d259ea3c4fea","source":{"kind":"arxiv","id":"1808.03161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03161","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03161v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03161","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"DPQBRLP4UZII","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPQBRLP4UZIIDUU7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPQBRLP4","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DPQBRLP4UZIIDUU7PP7R27GQRY","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-09T13:49:33Z","cross_cats_sorted":[],"title_canon_sha256":"be7938b1e96c4046e9adf4f820cf074f9c84aa97333b3b742bbfd7cac38e5245","abstract_canon_sha256":"6b77ea87a3e6d3fdd07cd9c350160e821f7336b8263f25adcfcf5f2946f67863"},"schema_version":"1.0"},"canonical_sha256":"1be018adfca65081d29f7bff1d7cd08e1b05f14572217f68d8d6d259ea3c4fea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.038366Z","signature_b64":"x3w4l6WQBXy9PCmMBabX9iS3kaIYIaLqtJ8TwjTvwyHSCoqFAKeLnuNzlgsf+/WXeEtU3tRWHDU9zI1l1z/ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1be018adfca65081d29f7bff1d7cd08e1b05f14572217f68d8d6d259ea3c4fea","last_reissued_at":"2026-05-18T00:08:30.037732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.037732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03161","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:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oV6gWw+mshjAl21EWDvHmGsez/W+SdlnhrsAhSf98Lbvv3+XQrLyoKocf63/T23WJfC7RsZMwQF8u8TNfX0VCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:37:11.692176Z"},"content_sha256":"a8bc71546948fcaeb2671361edd2b739d2b8fec11da26dd509330cd564417d90","schema_version":"1.0","event_id":"sha256:a8bc71546948fcaeb2671361edd2b739d2b8fec11da26dd509330cd564417d90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DPQBRLP4UZIIDUU7PP7R27GQRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Set-Theoretic Framework for Parallel Graph Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Rachid Echahed, Thierry Boy de la Tour","submitted_at":"2018-08-09T13:49:33Z","abstract_excerpt":"We tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introducing some abstract operations over graph structures. Then, we define the notion of rewrite rules as three inclusions of the form $L \\supseteq K \\supseteq M \\subseteq R$. We provide six conditions that parallel graph rewrite relations should ideally satisfy, which lead us to define two distinct full parallel graph rewrite relations. A central notion of regularity of matchings is proved to be equivalent to these six con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03161","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:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ayb/jF5nKNMBT9zoOemkSWK/AFqsHr7P30wy42DEwdP8137NUtubI+oTUql9NRa3EO0afBM2LHv/cgPeIrVwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:37:11.692985Z"},"content_sha256":"02296e883fc6cc5e090a9c3a66f416de185308c8e0f7c3d3dc7420109ce4fc51","schema_version":"1.0","event_id":"sha256:02296e883fc6cc5e090a9c3a66f416de185308c8e0f7c3d3dc7420109ce4fc51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPQBRLP4UZIIDUU7PP7R27GQRY/bundle.json","state_url":"https://pith.science/pith/DPQBRLP4UZIIDUU7PP7R27GQRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPQBRLP4UZIIDUU7PP7R27GQRY/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-05-30T02:37:11Z","links":{"resolver":"https://pith.science/pith/DPQBRLP4UZIIDUU7PP7R27GQRY","bundle":"https://pith.science/pith/DPQBRLP4UZIIDUU7PP7R27GQRY/bundle.json","state":"https://pith.science/pith/DPQBRLP4UZIIDUU7PP7R27GQRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPQBRLP4UZIIDUU7PP7R27GQRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DPQBRLP4UZIIDUU7PP7R27GQRY","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":"6b77ea87a3e6d3fdd07cd9c350160e821f7336b8263f25adcfcf5f2946f67863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-09T13:49:33Z","title_canon_sha256":"be7938b1e96c4046e9adf4f820cf074f9c84aa97333b3b742bbfd7cac38e5245"},"schema_version":"1.0","source":{"id":"1808.03161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03161","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03161v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03161","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"DPQBRLP4UZII","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPQBRLP4UZIIDUU7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPQBRLP4","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:02296e883fc6cc5e090a9c3a66f416de185308c8e0f7c3d3dc7420109ce4fc51","target":"graph","created_at":"2026-05-18T00:08:30Z","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 tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introducing some abstract operations over graph structures. Then, we define the notion of rewrite rules as three inclusions of the form $L \\supseteq K \\supseteq M \\subseteq R$. We provide six conditions that parallel graph rewrite relations should ideally satisfy, which lead us to define two distinct full parallel graph rewrite relations. A central notion of regularity of matchings is proved to be equivalent to these six con","authors_text":"Rachid Echahed, Thierry Boy de la Tour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-09T13:49:33Z","title":"A Set-Theoretic Framework for Parallel Graph Rewriting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03161","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:a8bc71546948fcaeb2671361edd2b739d2b8fec11da26dd509330cd564417d90","target":"record","created_at":"2026-05-18T00:08:30Z","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":"6b77ea87a3e6d3fdd07cd9c350160e821f7336b8263f25adcfcf5f2946f67863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-09T13:49:33Z","title_canon_sha256":"be7938b1e96c4046e9adf4f820cf074f9c84aa97333b3b742bbfd7cac38e5245"},"schema_version":"1.0","source":{"id":"1808.03161","kind":"arxiv","version":1}},"canonical_sha256":"1be018adfca65081d29f7bff1d7cd08e1b05f14572217f68d8d6d259ea3c4fea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1be018adfca65081d29f7bff1d7cd08e1b05f14572217f68d8d6d259ea3c4fea","first_computed_at":"2026-05-18T00:08:30.037732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:30.037732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x3w4l6WQBXy9PCmMBabX9iS3kaIYIaLqtJ8TwjTvwyHSCoqFAKeLnuNzlgsf+/WXeEtU3tRWHDU9zI1l1z/ECA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:30.038366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8bc71546948fcaeb2671361edd2b739d2b8fec11da26dd509330cd564417d90","sha256:02296e883fc6cc5e090a9c3a66f416de185308c8e0f7c3d3dc7420109ce4fc51"],"state_sha256":"4faa87b668f2a381a3704fb8685174944441dc9b2e05cfa8a646d9e22c8b639d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwsT8tJDcnGxMwb+SZ4EnLUgKmETMbhy8Kn0AYL4bmlg7iq8THZSuOeTnXugJTvdrwOU39DUxqhbhadUmtR9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:37:11.697051Z","bundle_sha256":"bdc93c2c2feea2add8ab1c850d79fa9484037bbf872508383e87551858a933f7"}}