Pith. sign in

Paper Citation Record · LEDGER

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination

As of 13 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2411.14802.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2411.14802 v4

Coverage vector

measured 48 of 48 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T14:59:22.610314Z

measured 48 of 48 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

48 of 48 outbound references displayed

  • verified exact19
  • verified fuzzy12
  • unresolved12
  • parse uncertain0
  • malformed identifier2
  • metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation fa2ccadb-c562-4471-a73b-02a71cea94cb · outbound

This paper cites In: van Raamsdonk, F.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: van Raamsdonk, F

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.314374Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.260357Z digest=sha256:c1e9913c8e7eaf3b5e35f417f2ca7b9055f6bd2499d894581929fcc941b15365

Observation d9dac8ce-16a1-4471-9b42-3d778b68bdc3 · outbound

This paper cites Electronic Proceedings in Theoretical Computer Science 48 (Feb 2011).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Electronic Proceedings in Theoretical Computer Science 48 (Feb 2011)

Reference 2

Resolution
verified exact
doi, observed 2026-08-12T14:59:23.248916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.276356Z digest=sha256:05429e67b1e5dd481702b29fd44a075f349ea5d7ca2e6868014825fb93fea6e7

Observation 108ea9f8-2006-47c6-889e-8087a9b0b5ed · outbound

This paper cites Computer Software27(4), 4_197– 4_214 (2010).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Computer Software27(4), 4_197– 4_214 (2010)

Reference 3

Resolution
verified exact
doi, observed 2026-08-12T14:59:23.221701Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.281676Z digest=sha256:8242e9ba68a02ba9f8c869323c5c6ed1cef9020282e0cbff0b67c6d0974e380d

Observation a31a7e41-82ec-4d68-9a71-a2505d940ca2 · outbound

This paper cites Theoretical Computer Sci- ence 96(1), 217–248 (1992).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Theoretical Computer Sci- ence 96(1), 217–248 (1992)

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.291942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.291942Z digest=sha256:401ba8321cde5ab58eb011d59684cb91a167c5e8013881ca91079cb4c4eb0969

Observation c8673bba-b82a-4bb6-af09-5cc82d865723 · outbound

This paper cites In: Lambers, L., Weber, J.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Lambers, L., Weber, J

Reference 5

Resolution
verified exact
doi, observed 2026-08-12T14:59:23.190137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.298255Z digest=sha256:77bffde8ba1d0b2177af52bff7daaabf5094c29bfe275af94c08a25e8fbe2525

Observation 149bbc0a-7557-44ac-95b8-256560b41e93 · outbound

This paper cites Theoretical Computer Science 240(1), 177–213 (2000).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Theoretical Computer Science 240(1), 177–213 (2000)

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.304780Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.304780Z digest=sha256:620ec775c38f67f8e797d4f23f09b8a4e3f8d9d3b301fea44a35116b46cf584e

Observation a5732e08-fc62-46f3-bab3-ed66c8eec28c · outbound

This paper cites Cambridge University Press (2017).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Cambridge University Press (2017)

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.291038Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.310081Z digest=sha256:aa4a9c44cc21b0c27eb9a5399d8e7d6f7e82ec571bf486f3c62337a7e23dae37

Observation 8f65816c-0228-46f0-a195-dcb2837fe49a · outbound

This paper cites In: Graph Transformations (ICGT 2006).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Graph Transformations (ICGT 2006)

Reference 8

Resolution
verified exact
doi, observed 2026-08-12T14:59:23.156172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.315521Z digest=sha256:b146b23b19620cfe078566d633d8af13ca022b93ece3f05498b8284c2dcaf550

Observation 94de953a-c093-44af-aba7-a2bcb54c61ed · outbound

This paper cites Archive for Mathematical Logic 28(3), 181–203 (1989).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Archive for Mathematical Logic 28(3), 181–203 (1989)

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.321909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.321909Z digest=sha256:a065234db9124cbda30400730270480931e3c502b904a6ebe9a8410a037ba287

Observation cf8a97e1-50d9-433c-8fd9-d58268cd2d19 · outbound

This paper cites In: Proceedings of Twelfth An- nual IEEE Symposium on Logic in Computer Science.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Proceedings of Twelfth An- nual IEEE Symposium on Logic in Computer Science

Reference 10

Resolution
metadata mismatch
raw_fallback, observed 2026-08-12T14:59:23.992381Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.334677Z digest=sha256:0e2abe532fe1c70465f296afbc3885abd7e2b8881e468705eda95956aa08021f

Observation c4f80528-2578-46a3-a039-c62cab1ea396 · outbound

This paper cites In: Rewriting Techniques and Applications (RTA 1999).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Rewriting Techniques and Applications (RTA 1999)

Reference 11

Resolution
malformed identifier
no resolver link, observed 2026-08-12T14:59:22.345342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.345342Z digest=sha256:261e48f6f917a41b61364ff4c85ec6ee5a9096076cfc2ef0f57b92463c5804f9

Observation 7ed407de-85a4-40c1-847e-5c7041ec2b27 · outbound

This paper cites Journal of Computer and System Sciences 64(2), 249–283 (2002).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Journal of Computer and System Sciences 64(2), 249–283 (2002)

Reference 12

Resolution
verified exact
raw_fallback, observed 2026-08-12T14:59:23.882206Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.354451Z digest=sha256:0acc862e63483a30dcdacc1e95fe9e513d5987d6b5f264733fec2ea625158967

Observation fa1cab6c-4573-40ad-889a-95208048ac25 · outbound

This paper cites Electronic Proceedings in Theoretical Computer Science, EPTCS265, 2–19 (Feb 2018).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Electronic Proceedings in Theoretical Computer Science, EPTCS265, 2–19 (Feb 2018)

Reference 13

Resolution
verified exact
doi, observed 2026-08-12T14:59:23.102492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.365318Z digest=sha256:4e630876567d708b9ecb055dbdd1c911938b4d70a29d133af7f161801367136a

Observation 5dc5b06e-309e-4072-8092-b03bbe9b5c21 · outbound

This paper cites Mathematical Structures in Computer Science 4(2), 273–285 (1994).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Mathematical Structures in Computer Science 4(2), 273–285 (1994)

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.376972Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.376972Z digest=sha256:79b437ef1c1e361b6a1a0dea0c2223a869d44ab08bab469c812f4526e8f9c636

Observation 43f6061e-c4a5-4879-9f66-fa563873cf86 · outbound

This paper cites International Journal on Software Tools for Technology Transfer 14(1), 15–40 (Feb 2012).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination International Journal on Software Tools for Technology Transfer 14(1), 15–40 (Feb 2012)

Reference 15

Resolution
verified exact
doi, observed 2026-08-12T14:59:23.052142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.382995Z digest=sha256:f8cfbc1d9c5230c86b6be4bb4badfd465106fdc537dd6bcf12c5790798ae455b

Observation 906e944b-f3f0-45c3-9ec5-29af65d49b02 · outbound

This paper cites Theoretical Computer Science 50(1), 1–101 (1987).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Theoretical Computer Science 50(1), 1–101 (1987)

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.389250Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.389250Z digest=sha256:9200490fa1c534caaff11df0a2f332f3a2adcf1e7c2c16e945cb592defd1c4ab

Observation 5409c4ec-5b2d-49ba-a4d7-ca586dc8b89b · outbound

This paper cites In: Bauer, F., Brauer, W., Schwichtenberg, H.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Bauer, F., Brauer, W., Schwichtenberg, H

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.394591Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.394591Z digest=sha256:c12da206945087146635988cdefc4e317b601204a4cf56178df9164dbcf37100

Observation 520f5a90-f6cd-4fc8-8e66-42d47a9cb9e8 · outbound

This paper cites Computer Software 28(4), 137–157 (2011).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Computer Software 28(4), 137–157 (2011)

Reference 18

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.986901Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.401563Z digest=sha256:e3f114ac204b5aa8e884d02f0bc369efae492739ae25c341abb92a8771554db3

Observation fd2e76e4-72bc-434a-ae17-cd5730a32276 · outbound

This paper cites In: [1992] Pro- ceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: [1992] Pro- ceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science

Reference 19

Resolution
metadata mismatch
raw_fallback, observed 2026-08-12T14:59:23.785369Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.408259Z digest=sha256:910a13b3c5280a13b0675fe3aac645c9a5e53ccd84861adaf0a12c71760efd87

Observation 266a80f0-9722-4c93-958a-ec5d376359b9 · outbound

This paper cites In: Ehrhard, T., Girard, J.Y., Ruet, P., Scott, P.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Ehrhard, T., Girard, J.Y., Ruet, P., Scott, P

Reference 20

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.959988Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.414570Z digest=sha256:f86a741e81dee346ef68f34fb92da98245a17d6214b095e724337abda07b4fda

Observation c39f7308-6397-4579-9e73-060b6ee05e54 · outbound

This paper cites Computer Software 25(1), 1_124–1_150 (2008).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Computer Software 25(1), 1_124–1_150 (2008)

Reference 21

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.927799Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.420052Z digest=sha256:b82c40e93619169a8863c1e10e9a3fcb38150f42cce41874f56b92617a13ffa1

Observation edbac3c3-dabe-478c-8dc3-ed277dcfbaa0 · outbound

This paper cites Elec- tronic Proceedings in Theoretical Computer Science 143, 54–66 (Apr 2012).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Elec- tronic Proceedings in Theoretical Computer Science 143, 54–66 (Apr 2012)

Reference 22

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.900808Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.427294Z digest=sha256:8fb3b56b186b641fa2078b2986ee2fb0f2a57d28f18eeb3a2a63634598f59c40

Observation 22c14b90-8b5e-44eb-9bde-af423bcc14d6 · outbound

This paper cites Information Technology Letters4, 9– 12 (Aug 2005), http://id.nii.ac.jp/1001/00147815/.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Information Technology Letters4, 9– 12 (Aug 2005), http://id.nii.ac.jp/1001/00147815/

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.264011Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.432125Z digest=sha256:0c8c68d573807a8b7559e7ef02464a4bbf4c6c792b144bbfeccb079626d4c4e5

Observation 00c32433-e8ab-49f2-825b-daa9e182e2e8 · outbound

This paper cites In: Proceedings of the 17th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Proceedings of the 17th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.437537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.437537Z digest=sha256:ebac7c22fa5d6a4cb94e3f92b2f17d7799df9a73170e6ab906352ecbd694db18

Observation dee817e4-d47b-4941-9237-897da34798b5 · outbound

This paper cites In: 12th International Conference on Concurrency Theory (CONCUR ’01).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: 12th International Conference on Concurrency Theory (CONCUR ’01)

Reference 25

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.876665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.444692Z digest=sha256:4bd1478651a9f22a1fb70e27682e5ee387657f13f9b52096d035194525765cb0

Observation dab8e655-0dde-4211-822d-a884415a0554 · outbound

This paper cites In: 34th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2024).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: 34th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2024)

Reference 26

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.853646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.450931Z digest=sha256:bab31c0327afa22c558fa95faedf9aaf87bf0f42acb766e69c2d3f85c6fb98a1

Observation a5e79696-11a0-4324-b3b6-917a9b4721b0 · outbound

This paper cites an unresolved cited work.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Unresolved cited work

Reference 27

Resolution
unresolved
raw_fallback, observed 2026-08-12T14:59:24.237715Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.458551Z digest=sha256:3a78a0824021344bb318e4d5c4a41710d05d21783fca453fe5c002a7daf5548d

Observation a0fda4a4-ec4f-41c6-ac9c-c6998f701f10 · outbound

This paper cites an unresolved cited work.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Unresolved cited work

Reference 28

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.831224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.463713Z digest=sha256:be9e56d1b61b92f916b090c2b58bf582d6be53478d1c0ef2048719fa6d36de9e

Observation 7a929652-2206-4750-bf09-a65a4db149f8 · outbound

This paper cites In: Gadducci, F., Kehrer, T.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Gadducci, F., Kehrer, T

Reference 29

Resolution
malformed identifier
no resolver link, observed 2026-08-12T14:59:22.469778Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.469778Z digest=sha256:639e4a0b0a74277e5bf91b5335624288b915262ad9b4da718d509bb4b9984814

Observation 43b7b623-dc3b-43fd-9d4b-0eafd3d04112 · outbound

This paper cites Theoretical Computer Science 411(2), 410–444 (2010).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Theoretical Computer Science 411(2), 410–444 (2010)

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.475482Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.475482Z digest=sha256:f2c237c9e2d544c10420fdc7843b8f2c3912339618e8229e1ea1ee32c5d1f8bc

Observation f77f1142-040f-46d9-a27c-bd5bc5f6d667 · outbound

This paper cites Computer Graphics Forum31(3), 1265–1274 (2012).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Computer Graphics Forum31(3), 1265–1274 (2012)

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.480891Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.480891Z digest=sha256:34136d0445b7c6bb5d1be9d4344c161467063f8d0ed4d198da2c188bf2df5aed

Observation 89cfb7c2-426a-4367-88e2-40c6843d1b24 · outbound

This paper cites In: The 21st Asian Symposium on Programming Languages and Systems SRC & Posters (2023).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: The 21st Asian Symposium on Programming Languages and Systems SRC & Posters (2023)

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.219013Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.487068Z digest=sha256:e747ea83a215b549a5cef2456609a482dc51c761d458877fdbb75f3a802c3cab

Observation 6bc6bf83-788b-4356-b15e-fd0a8e837ac0 · outbound

This paper cites an unresolved cited work.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Unresolved cited work

Reference 33

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.764502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.497964Z digest=sha256:78a6ea4334bb0ef381b853fecee2c1a8f4cfc1003ac58716ebca7fc05285e359

Observation e4286831-2846-477f-a389-15cbe9ac299b · outbound

This paper cites In: Grädel, E., Kahle, R.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Grädel, E., Kahle, R

Reference 34

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.739320Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.503495Z digest=sha256:aabb4c5d2479bc83ccc9ffff6a97e8f6fb77a1d5e874892a3cdc0e94ce679a11

Observation a01337f5-1bff-4aeb-ad28-5d8eabd7ef57 · outbound

This paper cites Elec- tronic Notes in Theoretical Computer Science 209, 187–200 (2008).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Elec- tronic Notes in Theoretical Computer Science 209, 187–200 (2008)

Reference 35

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.716305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.511125Z digest=sha256:b066b38845a30159075929f5e4c959bfb95dab6150be2e96dbac27a165c190a2

Observation 8e3ea80f-5f81-45cd-89b5-a40295997c31 · outbound

This paper cites Theoretical Computer Science 410(46), 4784–4800 (2009).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Theoretical Computer Science 410(46), 4784–4800 (2009)

Reference 36

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.686718Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.518013Z digest=sha256:8aa8c60714ff0df393c58a900701eb3426d4f3a61f49ac11c93677bbd2b3efae

Observation 420a5f1c-c726-42b6-bb72-83daaaef285f · outbound

This paper cites an unresolved cited work.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Unresolved cited work

Reference 37

Resolution
unresolved
raw_fallback, observed 2026-08-12T14:59:24.198876Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.525480Z digest=sha256:7d767b625da6f0bf35398b8e5419cb214d7c2cdf531c9f20535726690fb5f022

Observation e21d43af-4f9a-495c-a683-41e39e7daab6 · outbound

This paper cites In: Proc.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination In: Proc

Reference 38

Resolution
verified exact
doi, observed 2026-08-12T14:59:22.665384Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.533639Z digest=sha256:25b6cb4cb433dde3787beda0867209bc5e9f250285bcf817ef371d45d17b192b

Observation 4e11b458-3481-40d4-8690-c845bed6a1a5 · outbound

This paper cites Theses, Université de la Méditerranée - Aix-Marseille II (Jan 2007), https://theses.hal.science/tel-00194149.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Theses, Université de la Méditerranée - Aix-Marseille II (Jan 2007), https://theses.hal.science/tel-00194149

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.174519Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.542783Z digest=sha256:f2e245d2e1366f1ec8c7d60346d65550c929188b27d1015c640872691a268ed5

Observation 9935072d-b156-4e2c-bfc7-102b884e7dc5 · outbound

This paper cites Tutorial given at the 5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021) (June 2021), https://lipn.univ- paris13.fr/TLLA/2021/.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Tutorial given at the 5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021) (June 2021), https://lipn.univ- paris13.fr/TLLA/2021/

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.152591Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.551460Z digest=sha256:bd4daf1ae919542312749a6dce337953a358af7b5c3d8bc07f18b9502c6c8352

Observation 752f838d-a4e8-4676-a435-d33c4ebf5e19 · outbound

This paper cites IEEE Access 9, 133449–133460 (2021).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination IEEE Access 9, 133449–133460 (2021)

Reference 41

Resolution
metadata mismatch
raw_fallback, observed 2026-08-12T14:59:23.500251Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.558215Z digest=sha256:aaedd6d460a87cba98add1a280315928e8dfbe7fe958a8b1d8a2477d8d149b86

Observation c8931d9f-9b98-4a63-a7b9-bb70331c7f49 · outbound

This paper cites A.1 Notes on the Syntax of LMNtal.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination A.1 Notes on the Syntax of LMNtal

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.124495Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.571082Z digest=sha256:32be67697496dcd5e4fae503b9ea5dfaf9d108c5fd188ede4628087576e8b62c

Observation ba0a6a4b-db9e-45da-b9fb-a6b2d7d05212 · outbound

This paper cites Note that, if each ofP1 and P2 has a free link with the same name, it becomes a local link in(P1, P2).

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination Note that, if each ofP1 and P2 has a free link with the same name, it becomes a local link in(P1, P2)

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.108210Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.578470Z digest=sha256:84594ab694a608cb766d3547d5511daaa6d15ced56c0bb08743d0465a789e7d5

Observation 398b31ed-44d9-4629-8448-eb900317b87a · outbound

This paper cites For instance,a, (a:-b,c) may be written asa.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination For instance,a, (a:-b,c) may be written asa

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.085628Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.586647Z digest=sha256:dabfd8d3dc52b821374d79b34258a8e5ca6e3b048ca658289906ea57af754ed5

Observation e36d78ca-042f-4c7f-b3e7-468850468555 · outbound

This paper cites This is used, for example, in the encoding of Rule (ax-cut) in Fig.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination This is used, for example, in the encoding of Rule (ax-cut) in Fig

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.061910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.595152Z digest=sha256:74466503f2fa1bc54cafd3bcb9c16fb59608d90e789f3633f1be3ee5b1acdb1c

Observation 853334bd-57bf-471e-b287-c50e42bec8c6 · outbound

This paper cites 2.1) and named rules of the formname@@ T :- T (as in Sect.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination 2.1) and named rules of the formname@@ T :- T (as in Sect

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.040014Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.602750Z digest=sha256:87d9867cd74c891f316f85fbcda2537d960deae30048b8ab8a026049e2cfbde6

Observation ee83c19f-4d4d-4b3c-bc7d-d24d89ef63ac · outbound

This paper cites For instance, a process a(L1,F),b(L1,L2,L3,L4),c(L2,L5,L6,L6),d(L5,L3,L4) stands for the undirected graph shown in Fig.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination For instance, a process a(L1,F),b(L1,L2,L3,L4),c(L2,L5,L6,L6),d(L5,L3,L4) stands for the undirected graph shown in Fig

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T14:59:24.018381Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-12T14:59:22.610314Z digest=sha256:357165e4eeb7d180b1ced872d30d10e0bd6f3e8c5c3cb0afcb251b144aa13423

Observation 76007084-07a7-4f51-83ca-67f17b2f4eb4 · outbound

This paper cites https://doi.org/10.4230/LIPIcs.RTA.2013.39.

Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination https://doi.org/10.4230/LIPIcs.RTA.2013.39

Reference 54

Resolution
unresolved
no resolver link, observed 2026-08-12T14:59:22.270443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T14:59:22.270443Z digest=sha256:1a5988599fcdb85049f6e6975096e9599e2ca7df3ddf086c835bf6eb92cb4261

Pith citing papers

No inbound Pith citation observations are available.