Paper Citation Record · LEDGER

On the Reachability Problem on Monoid-Labelled Undirected Graphs

As of 4 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2606.21103.

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

pith.paper-citation-record.v1
2606.21103 v1

Coverage vector

measured 57 of 57 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-26T12:58:52.731335Z

measured 57 of 57 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+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

57 of 57 outbound references displayed

verified exact8
verified fuzzy0
unresolved45
parse uncertain2
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ea491de9-f1ba-45f9-bcf5-db2d421128da · outbound

This paper cites I , author=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs I , author=

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9d3bf57-a063-4f7e-8b61-74aacd655757 · outbound

This paper cites Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings , series =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings , series =

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f30d123-d530-431e-b35f-52ed0d3c61e8 · outbound

This paper cites Proceedings of the National Academy of Sciences , volume=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Proceedings of the National Academy of Sciences , volume=

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 602d57bc-5579-49d6-850c-4db754014063 · outbound

This paper cites American Mathematical Society Translations, Series 2 , volume =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs American Mathematical Society Translations, Series 2 , volume =

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9ae873f-ff3a-49ec-b095-f75f5a9546dd · outbound

This paper cites 2001 , publisher=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 2001 , publisher=

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edf4de09-92ba-4286-8cb0-7ff2480bbeea · outbound

This paper cites Semigroup Forum , volume=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Semigroup Forum , volume=

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 650fd64e-6106-4ba2-a99b-2123274de9bf · outbound

This paper cites Amplifying lower bounds by means of self-reducibility , journal =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Amplifying lower bounds by means of self-reducibility , journal =

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b1b6d80-5efe-4063-8470-f1ddac7555f4 · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64dfe351-25a6-47ee-800f-6ebf16140a7a · outbound

This paper cites Electron.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Electron

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 524eaf20-c932-4f93-907e-17fc4e2a1bf3 · outbound

This paper cites and Lipton, Richard J.

On the Reachability Problem on Monoid-Labelled Undirected Graphs and Lipton, Richard J

Reference 10

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.059064Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 8fb6c5b6-40d6-414d-aa1d-3cdb401ae9f7 · outbound

This paper cites Bridgland , title =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Bridgland , title =

Reference 11

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.076422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 988bd28b-fb96-4c90-999c-b2719ca44e26 · outbound

This paper cites Log-space constructible universal traversal sequences for cycles of length O(n^.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Log-space constructible universal traversal sequences for cycles of length O(n^

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 75872dbb-934c-44a4-aa33-731b259bf807 · outbound

This paper cites Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) , booktitle =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) , booktitle =

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5db7b225-70c2-4f90-88e5-fbb5d43f3193 · outbound

This paper cites Karloff and Ramamohan Paturi and Janos Simon , title =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Karloff and Ramamohan Paturi and Janos Simon , title =

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13d864ce-297b-4be6-a812-12bc5d07079c · outbound

This paper cites Ruzzo and Martin Tompa , title =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Ruzzo and Martin Tompa , title =

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1e4d246-72f2-4d96-9148-e1dd2011d304 · outbound

This paper cites Ruzzo and Martin Tompa , title =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Ruzzo and Martin Tompa , title =

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcd77a43-8f97-401b-94e5-76fee36f2a50 · outbound

This paper cites Universal traversal sequences with backtracking , journal =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Universal traversal sequences with backtracking , journal =

Reference 17

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.060919Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 80f12d61-4a66-4ff8-ba7f-abff4ebad307 · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee4b704a-400c-44cc-961d-ca028b652f19 · outbound

This paper cites 2003 , note=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 2003 , note=

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8309428d-fb08-4299-b61a-751ebf5f4516 · outbound

This paper cites On Traversal Sequences, Exploration Sequences, and Completeness and Kolmogorov Random Strings.

On the Reachability Problem on Monoid-Labelled Undirected Graphs On Traversal Sequences, Exploration Sequences, and Completeness and Kolmogorov Random Strings

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b283666-9abe-40eb-9ba8-b4cac6f1397c · outbound

This paper cites 2000 , url =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 2000 , url =

Reference 21

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.064286Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 7b4d5bbe-8d40-4550-bdf0-926c7699000d · outbound

This paper cites Kallampally and Raghunath Tewari , editor =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Kallampally and Raghunath Tewari , editor =

Reference 22

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.069647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation 075e9c6f-ea76-475b-9231-5766305b9377 · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fdbef424-9f83-4d24-8a39-fa5a50bc6b3f · outbound

This paper cites Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC 2006) , pages =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC 2006) , pages =

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5062d1e8-3c53-4d3f-9baf-ba0a1f6ad5ab · outbound

This paper cites Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , journal =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , journal =

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55f9e10c-0789-4260-8e89-7b722c5c4881 · outbound

This paper cites Combinatorica , volume =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Combinatorica , volume =

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8fa147a-91c3-4517-b24a-e66662960409 · outbound

This paper cites Information Processing Letters , volume =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Information Processing Letters , volume =

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dde00b23-c301-4fd5-9139-07440db6e9f4 · outbound

This paper cites 1988 , publisher=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 1988 , publisher=

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f6699e29-0bd3-4762-ae06-e74709a807db · outbound

This paper cites Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC 1983) , pages=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC 1983) , pages=

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 497d4685-1df5-456a-9e91-3bc871bf2910 · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9997ccbc-00cd-4b48-ab37-d66cd70efc9b · outbound

This paper cites Lewis and Christos H.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Lewis and Christos H

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38782687-af2f-4841-94bb-2d5edd95ae8c · outbound

This paper cites Bounds on Universal Sequences , journal =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Bounds on Universal Sequences , journal =

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b16a540c-2539-4b3d-adc6-1c735c9612c5 · outbound

This paper cites Algebrization: A new barrier in complexity theory.ACM Transactions on Computation Theory, 1(1):2:1–2:54, 2009.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Algebrization: A new barrier in complexity theory.ACM Transactions on Computation Theory, 1(1):2:1–2:54, 2009

Reference 33

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T12:59:29.074403Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation d13936e8-3e18-4b01-92d0-93f2a2031290 · outbound

This paper cites 1997 , isbn =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 1997 , isbn =

Reference 34

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 068a630d-3d09-427a-ac51-390476d42392 · outbound

This paper cites Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness , booktitle =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness , booktitle =

Reference 35

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.071534Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation b94d422a-db13-461c-8d0a-7676e0700623 · outbound

This paper cites Korhonen, A single-exponential time 2-approximation algorithm for treewidth, in: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021), 2022, pp.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Korhonen, A single-exponential time 2-approximation algorithm for treewidth, in: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021), 2022, pp

Reference 36

Resolution: metadata mismatch; arxiv_id, observed 2026-06-26T12:59:29.067655Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation ef749ec6-09ec-438d-83e8-d73bf460e326 · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 37

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.078084Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation e2514a4f-a819-4df5-a9cc-87f4d6ef4452 · outbound

This paper cites UL problem.

On the Reachability Problem on Monoid-Labelled Undirected Graphs UL problem

Reference 38

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 22f5fda3-cc3d-47cc-b7f9-47e4a17946d3 · outbound

This paper cites and Merz, Sarah , year =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs and Merz, Sarah , year =

Reference 39

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a6d05fd-4316-435c-8733-8357d90c3dec · outbound

This paper cites 2012 , issn =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 2012 , issn =

Reference 40

Resolution: verified exact; doi, observed 2026-06-26T12:59:29.062545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.

Observation b93f80c2-8d0c-4e15-b2e0-7f8dc9f0ea6a · outbound

This paper cites 2024 , archivePrefix=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 2024 , archivePrefix=

Reference 41

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d8779d8-5a37-4288-8cc2-feda4363f8bc · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 42

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a948de7-da68-4587-9356-5bb00cca5afc · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 43

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed0660cb-1d5d-4be3-89e9-86360cff63ad · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 44

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 950aa741-0048-4296-bde4-c68c75a36b52 · outbound

This paper cites Advances in Mathematics , volume=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Advances in Mathematics , volume=

Reference 45

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e657a946-fc18-45bf-a97c-e22d9a5a760f · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 46

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d30ed16-9463-4eb5-bfe6-e8196d87b6cd · outbound

This paper cites 1961 , publisher=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 1961 , publisher=

Reference 47

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 243ed46f-ce0d-4a18-b59d-ddd66ab7271d · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 48

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e49706e-7805-4624-b5a8-4824ad7e5dff · outbound

This paper cites Pacific Journal of Mathematics , volume =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Pacific Journal of Mathematics , volume =

Reference 49

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1813aae6-995b-497e-a5d0-ecdc6419cd2d · outbound

This paper cites Theory of Computing Systems , volume=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Theory of Computing Systems , volume=

Reference 50

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 414aea0c-c62d-4eb0-9942-e17a09907693 · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 51

Resolution: parse uncertain; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d81580c-7bae-4493-aaeb-9413033e9fe9 · outbound

This paper cites 1995 , publisher=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 1995 , publisher=

Reference 52

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00122f45-6b50-4631-8146-a3035fd6caf4 · outbound

This paper cites Some results on.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Some results on

Reference 53

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb13d089-1053-4d82-82d2-2f034e0ccfe1 · outbound

This paper cites an unresolved cited work.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Unresolved cited work

Reference 54

Resolution: parse uncertain; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ab32688-d777-4714-9bb9-117552812668 · outbound

This paper cites Language and Automata Theory and Applications (LATA 2011) , series =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Language and Automata Theory and Applications (LATA 2011) , series =

Reference 55

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ad41ee0-c8a1-43fb-a44f-f0e765d5afba · outbound

This paper cites Margolis and Jean-Eric Pin , title =.

On the Reachability Problem on Monoid-Labelled Undirected Graphs Margolis and Jean-Eric Pin , title =

Reference 56

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a8a7a08-30f5-479c-8317-5caef383e74a · outbound

This paper cites 2016 , publisher=.

On the Reachability Problem on Monoid-Labelled Undirected Graphs 2016 , publisher=

Reference 57

Resolution: unresolved; no resolver link, observed 2026-06-26T12:58:52.731335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.