{"as_of":"2026-08-13T15:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:36748ca8d15e8e069d37ed7b7b9234acef0114f987d20066d4b0e625a6546317","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:59:22.610314Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.14802/citation-record","integrity":"/paper/2411.14802/integrity","json":"/paper/2411.14802/citation-record.json","paper":"/paper/2411.14802"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.307915Z","title":"In: van Raamsdonk, F","venue":null,"work_id":"1b880fa8-afb9-4a6f-aee9-e9f77b5b0bde","year":2013},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.260357Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:c1e9913c8e7eaf3b5e35f417f2ca7b9055f6bd2499d894581929fcc941b15365","observation_id":"fa2ccadb-c562-4471-a73b-02a71cea94cb","resolution":{"observed_at":"2026-08-12T14:59:24.314374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4204/eptcs.48.8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.238012Z","title":"Electronic Proceedings in Theoretical Computer Science 48 (Feb 2011)","venue":null,"work_id":"1cfc7b47-2314-4f6c-9c3b-02d6ff97a5f7","year":2011},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.276356Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:05429e67b1e5dd481702b29fd44a075f349ea5d7ca2e6868014825fb93fea6e7","observation_id":"d9dac8ce-16a1-4471-9b42-3d778b68bdc3","resolution":{"observed_at":"2026-08-12T14:59:23.248916Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.11309/jssst.27.4_197","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.215653Z","title":"Computer Software27(4), 4_197– 4_214 (2010)","venue":null,"work_id":"039c0102-6bdb-476e-9457-b4b299742b77","year":2010},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.281676Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:8242e9ba68a02ba9f8c869323c5c6ed1cef9020282e0cbff0b67c6d0974e380d","observation_id":"108ea9f8-2006-47c6-889e-8087a9b0b5ed","resolution":{"observed_at":"2026-08-12T14:59:23.221701Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.291942Z","title":"Theoretical Computer Sci- ence 96(1), 217–248 (1992)","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.291942Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:401ba8321cde5ab58eb011d59684cb91a167c5e8013881ca91079cb4c4eb0969","observation_id":"a31a7e41-82ec-4d68-9a71-a2505d940ca2","resolution":{"observed_at":"2026-08-12T14:59:22.291942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-92991-0_10","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"In: Lambers, L., Weber, J","venue":"Lecture notes in computer science","work_id":"fadfb620-1913-4878-8ffd-a7c78fe76465","year":2018},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.298255Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:77bffde8ba1d0b2177af52bff7daaabf5094c29bfe275af94c08a25e8fbe2525","observation_id":"c8673bba-b82a-4bb6-af09-5cc82d865723","resolution":{"observed_at":"2026-08-12T14:59:23.190137Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.304780Z","title":"Theoretical Computer Science 240(1), 177–213 (2000)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.304780Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:620ec775c38f67f8e797d4f23f09b8a4e3f8d9d3b301fea44a35116b46cf584e","observation_id":"149bbc0a-7557-44ac-95b8-256560b41e93","resolution":{"observed_at":"2026-08-12T14:59:22.304780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.278663Z","title":"Cambridge University Press (2017)","venue":null,"work_id":"4090a5ad-5853-4424-8030-f69df9183896","year":2017},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.310081Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:aa4a9c44cc21b0c27eb9a5399d8e7d6f7e82ec571bf486f3c62337a7e23dae37","observation_id":"a5732e08-fc62-46f3-bab3-ed66c8eec28c","resolution":{"observed_at":"2026-08-12T14:59:24.291038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11841883_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"In: Graph Transformations (ICGT 2006)","venue":"Lecture notes in computer science","work_id":"3635d64d-84df-402e-a015-78a342bd41dc","year":2006},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.315521Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:b146b23b19620cfe078566d633d8af13ca022b93ece3f05498b8284c2dcaf550","observation_id":"8f65816c-0228-46f0-a195-dcb2837fe49a","resolution":{"observed_at":"2026-08-12T14:59:23.156172Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.321909Z","title":"Archive for Mathematical Logic 28(3), 181–203 (1989)","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.321909Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:a065234db9124cbda30400730270480931e3c502b904a6ebe9a8410a037ba287","observation_id":"94de953a-c093-44af-aba7-a2bcb54c61ed","resolution":{"observed_at":"2026-08-12T14:59:22.321909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1997.61492","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.981741Z","title":"In: Proceedings of Twelfth An- nual IEEE Symposium on Logic in Computer Science","venue":null,"work_id":"b5ecd1e5-c314-491e-bac5-e4d17c600401","year":1997},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.334677Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:0e2abe532fe1c70465f296afbc3885abd7e2b8881e468705eda95956aa08021f","observation_id":"cf8a97e1-50d9-433c-8fd9-d58268cd2d19","resolution":{"observed_at":"2026-08-12T14:59:23.992381Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.345342Z","title":"In: Rewriting Techniques and Applications (RTA 1999)","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.345342Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:261e48f6f917a41b61364ff4c85ec6ee5a9096076cfc2ef0f57b92463c5804f9","observation_id":"c4f80528-2578-46a3-a039-c62cab1ea396","resolution":{"observed_at":"2026-08-12T14:59:22.345342Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2001.1790","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.872720Z","title":"Journal of Computer and System Sciences 64(2), 249–283 (2002)","venue":null,"work_id":"7c4661e6-662d-4291-a400-41252b2f1761","year":2002},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.354451Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:0acc862e63483a30dcdacc1e95fe9e513d5987d6b5f264733fec2ea625158967","observation_id":"7ed407de-85a4-40c1-847e-5c7041ec2b27","resolution":{"observed_at":"2026-08-12T14:59:23.882206Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4204/eptcs.265.2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.094386Z","title":"Electronic Proceedings in Theoretical Computer Science, EPTCS265, 2–19 (Feb 2018)","venue":null,"work_id":"ce184464-6b36-4f73-8090-ab0f26a2754b","year":2018},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.365318Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:4e630876567d708b9ecb055dbdd1c911938b4d70a29d133af7f161801367136a","observation_id":"fa1cab6c-4573-40ad-889a-95208048ac25","resolution":{"observed_at":"2026-08-12T14:59:23.102492Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.376972Z","title":"Mathematical Structures in Computer Science 4(2), 273–285 (1994)","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.376972Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:79b437ef1c1e361b6a1a0dea0c2223a869d44ab08bab469c812f4526e8f9c636","observation_id":"5dc5b06e-309e-4072-8092-b03bbe9b5c21","resolution":{"observed_at":"2026-08-12T14:59:22.376972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10009-011-0186-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.042603Z","title":"International Journal on Software Tools for Technology Transfer 14(1), 15–40 (Feb 2012)","venue":null,"work_id":"27ed0c98-a3b1-4eb8-8f8d-400a9dc5904f","year":2012},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.382995Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:f8cfbc1d9c5230c86b6be4bb4badfd465106fdc537dd6bcf12c5790798ae455b","observation_id":"43f6061e-c4a5-4879-9f66-fa563873cf86","resolution":{"observed_at":"2026-08-12T14:59:23.052142Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.389250Z","title":"Theoretical Computer Science 50(1), 1–101 (1987)","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.389250Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:9200490fa1c534caaff11df0a2f332f3a2adcf1e7c2c16e945cb592defd1c4ab","observation_id":"906e944b-f3f0-45c3-9ec5-29af65d49b02","resolution":{"observed_at":"2026-08-12T14:59:22.389250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.394591Z","title":"In: Bauer, F., Brauer, W., Schwichtenberg, H","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.394591Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:c12da206945087146635988cdefc4e317b601204a4cf56178df9164dbcf37100","observation_id":"5409c4ec-5b2d-49ba-a4d7-ca586dc8b89b","resolution":{"observed_at":"2026-08-12T14:59:22.394591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.11309/jssst.28.4_137","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.980283Z","title":"Computer Software 28(4), 137–157 (2011)","venue":null,"work_id":"56fb9eb7-a394-41e9-9465-1e5d2b5b1f66","year":2011},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.401563Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:e3f114ac204b5aa8e884d02f0bc369efae492739ae25c341abb92a8771554db3","observation_id":"520f5a90-f6cd-4fc8-8e66-42d47a9cb9e8","resolution":{"observed_at":"2026-08-12T14:59:22.986901Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1992.18553","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.774446Z","title":"In: [1992] Pro- ceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","venue":null,"work_id":"3e470eb3-6cfb-4f81-8f91-86ba4b808282","year":1992},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.408259Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:910a13b3c5280a13b0675fe3aac645c9a5e53ccd84861adaf0a12c71760efd87","observation_id":"fd2e76e4-72bc-434a-ae17-cd5730a32276","resolution":{"observed_at":"2026-08-12T14:59:23.785369Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511550850.003","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.952977Z","title":"In: Ehrhard, T., Girard, J.Y., Ruet, P., Scott, P","venue":null,"work_id":"d99d222a-5973-4364-976b-40633071a3d8","year":2004},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.414570Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:f86a741e81dee346ef68f34fb92da98245a17d6214b095e724337abda07b4fda","observation_id":"266a80f0-9722-4c93-958a-ec5d376359b9","resolution":{"observed_at":"2026-08-12T14:59:22.959988Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.11309/jssst.25.1_124","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.922278Z","title":"Computer Software 25(1), 1_124–1_150 (2008)","venue":null,"work_id":"d4f3456b-a6d5-495d-be9e-621ff0adab42","year":2008},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.420052Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:b82c40e93619169a8863c1e10e9a3fcb38150f42cce41874f56b92617a13ffa1","observation_id":"c39f7308-6397-4579-9e73-060b6ee05e54","resolution":{"observed_at":"2026-08-12T14:59:22.927799Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4204/eptcs.143.5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.893383Z","title":"Elec- tronic Proceedings in Theoretical Computer Science 143, 54–66 (Apr 2012)","venue":null,"work_id":"764c945b-4484-4663-a5c6-504ce122cf84","year":2012},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.427294Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:8fb3b56b186b641fa2078b2986ee2fb0f2a57d28f18eeb3a2a63634598f59c40","observation_id":"edbac3c3-dabe-478c-8dc3-ed277dcfbaa0","resolution":{"observed_at":"2026-08-12T14:59:22.900808Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.257519Z","title":"Information Technology Letters4, 9– 12 (Aug 2005), http://id.nii.ac.jp/1001/00147815/","venue":null,"work_id":"dc41ef78-260e-4d75-a204-0d4960c9ba28","year":2005},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.432125Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:0c8c68d573807a8b7559e7ef02464a4bbf4c6c792b144bbfeccb079626d4c4e5","observation_id":"22c14b90-8b5e-44eb-9bde-af423bcc14d6","resolution":{"observed_at":"2026-08-12T14:59:24.264011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.437537Z","title":"In: Proceedings of the 17th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.437537Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:ebac7c22fa5d6a4cb94e3f92b2f17d7799df9a73170e6ab906352ecbd694db18","observation_id":"00c32433-e8ab-49f2-825b-daa9e182e2e8","resolution":{"observed_at":"2026-08-12T14:59:22.437537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-44685-0_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"In: 12th International Conference on Concurrency Theory (CONCUR ’01)","venue":"Lecture notes in computer science","work_id":"f2670952-ddd3-4bb8-9dc4-db12b4800e4d","year":2001},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.444692Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:4bd1478651a9f22a1fb70e27682e5ee387657f13f9b52096d035194525765cb0","observation_id":"dee817e4-d47b-4941-9237-897da34798b5","resolution":{"observed_at":"2026-08-12T14:59:22.876665Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-71294-4_13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"In: 34th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2024)","venue":"Lecture notes in computer science","work_id":"e55e2720-bafd-4852-8eb7-a6e9b620ad54","year":2024},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.450931Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:bab31c0327afa22c558fa95faedf9aaf87bf0f42acb766e69c2d3f85c6fb98a1","observation_id":"dab8e655-0dde-4211-822d-a884415a0554","resolution":{"observed_at":"2026-08-12T14:59:22.853646Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.232168Z","title":null,"venue":null,"work_id":"a456309d-2318-48bc-b72b-d7cd102760d0","year":2020},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.458551Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:3a78a0824021344bb318e4d5c4a41710d05d21783fca453fe5c002a7daf5548d","observation_id":"a5e79696-11a0-4324-b3b6-917a9b4721b0","resolution":{"observed_at":"2026-08-12T14:59:24.237715Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.23638/lmcs-16(1:27)2020","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.823874Z","title":null,"venue":null,"work_id":"bfb648e5-cd2a-451b-b913-66c779553593","year":2019},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.463713Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:be9e56d1b61b92f916b090c2b58bf582d6be53478d1c0ef2048719fa6d36de9e","observation_id":"a0fda4a4-ec4f-41c6-ac9c-c6998f701f10","resolution":{"observed_at":"2026-08-12T14:59:22.831224Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.469778Z","title":"In: Gadducci, F., Kehrer, T","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.469778Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:639e4a0b0a74277e5bf91b5335624288b915262ad9b4da718d509bb4b9984814","observation_id":"7a929652-2206-4750-bf09-a65a4db149f8","resolution":{"observed_at":"2026-08-12T14:59:22.469778Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.475482Z","title":"Theoretical Computer Science 411(2), 410–444 (2010)","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.475482Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:f2c237c9e2d544c10420fdc7843b8f2c3912339618e8229e1ea1ee32c5d1f8bc","observation_id":"43b7b623-dc3b-43fd-9d4b-0eafd3d04112","resolution":{"observed_at":"2026-08-12T14:59:22.475482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.480891Z","title":"Computer Graphics Forum31(3), 1265–1274 (2012)","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.480891Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:34136d0445b7c6bb5d1be9d4344c161467063f8d0ed4d198da2c188bf2df5aed","observation_id":"f77f1142-040f-46d9-a27c-bd5bc5f6d667","resolution":{"observed_at":"2026-08-12T14:59:22.480891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.213510Z","title":"In: The 21st Asian Symposium on Programming Languages and Systems SRC & Posters (2023)","venue":null,"work_id":"0f3a86aa-d661-4271-b0b2-b87a81166ef4","year":2023},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.487068Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:e747ea83a215b549a5cef2456609a482dc51c761d458877fdbb75f3a802c3cab","observation_id":"89cfb7c2-426a-4367-88e2-40c6843d1b24","resolution":{"observed_at":"2026-08-12T14:59:24.219013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4204/eptcs.12.7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.757015Z","title":null,"venue":null,"work_id":"16546cd4-1424-4bc9-8202-7c436e9ef1f9","year":2009},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.497964Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:78a6ea4334bb0ef381b853fecee2c1a8f4cfc1003ac58716ebca7fc05285e359","observation_id":"6bc6bf83-788b-4356-b15e-fd0a8e837ac0","resolution":{"observed_at":"2026-08-12T14:59:22.764502Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-04027-6_36","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"In: Grädel, E., Kahle, R","venue":"Lecture notes in computer science","work_id":"959ab172-5655-4e0d-8936-7d9fc4d8ccb0","year":2009},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.503495Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:aabb4c5d2479bc83ccc9ffff6a97e8f6fb77a1d5e874892a3cdc0e94ce679a11","observation_id":"e4286831-2846-477f-a389-15cbe9ac299b","resolution":{"observed_at":"2026-08-12T14:59:22.739320Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.entcs.2008.04.012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.704849Z","title":"Elec- tronic Notes in Theoretical Computer Science 209, 187–200 (2008)","venue":null,"work_id":"3f8ef413-b18b-4f3c-8dd5-cdac92b972f9","year":2008},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.511125Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:b066b38845a30159075929f5e4c959bfb95dab6150be2e96dbac27a165c190a2","observation_id":"a01337f5-1bff-4aeb-ad28-5d8eabd7ef57","resolution":{"observed_at":"2026-08-12T14:59:22.716305Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2009.07.043","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.680774Z","title":"Theoretical Computer Science 410(46), 4784–4800 (2009)","venue":null,"work_id":"9bcc229e-899b-4f48-850d-54643be5d440","year":2009},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.518013Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:8aa8c60714ff0df393c58a900701eb3426d4f3a61f49ac11c93677bbd2b3efae","observation_id":"8e3ea80f-5f81-45cd-89b5-a40295997c31","resolution":{"observed_at":"2026-08-12T14:59:22.686718Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.192425Z","title":null,"venue":null,"work_id":"f3b9239b-1dc6-4ef1-805a-1b6724d6aeb4","year":2024},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.525480Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:7d767b625da6f0bf35398b8e5419cb214d7c2cdf531c9f20535726690fb5f022","observation_id":"420a5f1c-c726-42b6-bb72-83daaaef285f","resolution":{"observed_at":"2026-08-12T14:59:24.198876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-31837-8_6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"In: Proc","venue":"Lecture notes in computer science","work_id":"6dfca6cc-4916-46f6-8a9c-af612ea66922","year":2005},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.533639Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:25b6cb4cb433dde3787beda0867209bc5e9f250285bcf817ef371d45d17b192b","observation_id":"e21d43af-4f9a-495c-a683-41e39e7daab6","resolution":{"observed_at":"2026-08-12T14:59:22.665384Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.167798Z","title":"Theses, Université de la Méditerranée - Aix-Marseille II (Jan 2007), https://theses.hal.science/tel-00194149","venue":null,"work_id":"6d982661-a2e2-4b98-9d81-afe49162db31","year":2007},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.542783Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:f2e245d2e1366f1ec8c7d60346d65550c929188b27d1015c640872691a268ed5","observation_id":"4e11b458-3481-40d4-8690-c845bed6a1a5","resolution":{"observed_at":"2026-08-12T14:59:24.174519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.143900Z","title":"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/","venue":null,"work_id":"7fe9b073-1282-45d3-89fc-601597dda62e","year":2021},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.551460Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:bd4daf1ae919542312749a6dce337953a358af7b5c3d8bc07f18b9502c6c8352","observation_id":"9935072d-b156-4e2c-bfc7-102b884e7dc5","resolution":{"observed_at":"2026-08-12T14:59:24.152591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.31129","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:23.487823Z","title":"IEEE Access 9, 133449–133460 (2021)","venue":null,"work_id":"5d8468e6-4763-462b-ad30-d33058a75943","year":2021},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.558215Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:aaedd6d460a87cba98add1a280315928e8dfbe7fe958a8b1d8a2477d8d149b86","observation_id":"752f838d-a4e8-4676-a435-d33c4ebf5e19","resolution":{"observed_at":"2026-08-12T14:59:23.500251Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.119368Z","title":"A.1 Notes on the Syntax of LMNtal","venue":null,"work_id":"4f726a10-8022-4f36-9230-90afa392c32a","year":null},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.571082Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:32be67697496dcd5e4fae503b9ea5dfaf9d108c5fd188ede4628087576e8b62c","observation_id":"c8931d9f-9b98-4a63-a7b9-bb70331c7f49","resolution":{"observed_at":"2026-08-12T14:59:24.124495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.101730Z","title":"Note that, if each ofP1 and P2 has a free link with the same name, it becomes a local link in(P1, P2)","venue":null,"work_id":"7af188cc-af95-4ae3-9b87-70d5e939cfc0","year":null},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.578470Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:84594ab694a608cb766d3547d5511daaa6d15ced56c0bb08743d0465a789e7d5","observation_id":"ba0a6a4b-db9e-45da-b9fb-a6b2d7d05212","resolution":{"observed_at":"2026-08-12T14:59:24.108210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.077968Z","title":"For instance,a, (a:-b,c) may be written asa","venue":null,"work_id":"ec313ab4-d577-451b-a7a6-cc3c6005516e","year":null},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.586647Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:dabfd8d3dc52b821374d79b34258a8e5ca6e3b048ca658289906ea57af754ed5","observation_id":"398b31ed-44d9-4629-8448-eb900317b87a","resolution":{"observed_at":"2026-08-12T14:59:24.085628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.053727Z","title":"This is used, for example, in the encoding of Rule (ax-cut) in Fig","venue":null,"work_id":"dd8c0828-8f7d-44c7-b93a-bb03ab08098c","year":null},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.595152Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:74466503f2fa1bc54cafd3bcb9c16fb59608d90e789f3633f1be3ee5b1acdb1c","observation_id":"e36d78ca-042f-4c7f-b3e7-468850468555","resolution":{"observed_at":"2026-08-12T14:59:24.061910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.032968Z","title":"2.1) and named rules of the formname@@ T :- T (as in Sect","venue":null,"work_id":"32370891-e825-4bcf-9730-43049bc979cc","year":null},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.602750Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:87d9867cd74c891f316f85fbcda2537d960deae30048b8ab8a026049e2cfbde6","observation_id":"853334bd-57bf-471e-b287-c50e42bec8c6","resolution":{"observed_at":"2026-08-12T14:59:24.040014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:24.010033Z","title":"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","venue":null,"work_id":"48ce3e66-0fcd-4383-a0b7-8060ee072f14","year":null},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.610314Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:357165e4eeb7d180b1ced872d30d10e0bd6f3e8c5c3cb0afcb251b144aa13423","observation_id":"ee83c19f-4d4d-4b3c-bc7d-d24d89ef63ac","resolution":{"observed_at":"2026-08-12T14:59:24.018381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:59:22.270443Z","title":"https://doi.org/10.4230/LIPIcs.RTA.2013.39","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T14:59:22.270443Z"},"links":{"citing_paper":"/paper/2411.14802"},"observation_digest":"sha256:1a5988599fcdb85049f6e6975096e9599e2ca7df3ddf086c835bf6eb92cb4261","observation_id":"76007084-07a7-4f51-83ca-67f17b2f4eb4","resolution":{"observed_at":"2026-08-12T14:59:22.270443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.14802","last_updated":"2026-07-16T10:38:32Z","latest_version":4,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-13T03:39:35.751210Z","submitted_at":"2024-11-22T09:03:09Z","title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":2,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":12,"verified_exact":19,"verified_fuzzy":12},"total_outbound_references":48},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"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."}