{"as_of":"2026-08-04T19:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c2d1459b9b54d6110d7191fef3f930ad4980898ee2cdfed7c298b3253300b9d","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T12:58:52.731335Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2606.21103/citation-record","integrity":"/paper/2606.21103/integrity","json":"/paper/2606.21103/citation-record.json","paper":"/paper/2606.21103"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:58:52.731335Z","title":"I , author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:6fc4cd561fddfc0e2d1b147485d5f7fe0935bb9bd6f8de3d4edb6d2fb3b5d02c","observation_id":"ea491de9-f1ba-45f9-bcf5-db2d421128da","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings , series =","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:3d33a282aacf892050411ffdf0f7749fa2cefd046e025e8012dc3d636c0d2be4","observation_id":"e9d3bf57-a063-4f7e-8b61-74aacd655757","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Proceedings of the National Academy of Sciences , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:95d2c00f3bf347f6f89d95a5c53c30795c6aac07a85787945a6a9ebdc3704c74","observation_id":"4f30d123-d530-431e-b35f-52ed0d3c61e8","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"American Mathematical Society Translations, Series 2 , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:818c55f66e8f33c206e5601a40d7ad446ad7481da364704edf940a9f0ece9422","observation_id":"602d57bc-5579-49d6-850c-4db754014063","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"2001 , publisher=","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:b558b216571450ecfbde02ef63affca5fcf5d5b069f1f6d0f82e339ce57c33b3","observation_id":"f9ae873f-ff3a-49ec-b095-f75f5a9546dd","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Semigroup Forum , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:7ca578f6aa5c0c558d9824e6849827a4c0aec950f19c52bb21d78aac62a97238","observation_id":"edf4de09-92ba-4286-8cb0-7ff2480bbeea","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Amplifying lower bounds by means of self-reducibility , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:ba95f1ef0b6e59b2b8c0525c89c528fdcc6bc38fac01191e90c1c12a5fac418a","observation_id":"650fd64e-6106-4ba2-a99b-2123274de9bf","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:2bfcb12d1204c992460ca52c226a2c522dae95ba6474a29600e9378118e95d3f","observation_id":"8b1b6d80-5efe-4063-8470-f1ddac7555f4","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Electron","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:af2d1ead39fa44f8a292eb2a4d7645a3bbb0edfc5eabc8dbd37e9bd5b4d046d7","observation_id":"64dfe351-25a6-47ee-800f-6ebf16140a7a","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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.1109/sfcs.1979.34","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.057638Z","title":"and Lipton, Richard J","venue":null,"work_id":"733a545c-9beb-40b3-9575-ac1ca36021dc","year":1979},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:81740baed47ead5b7d36f8ee39e95bcbc34050c347b7b47d60653d089cc7f283","observation_id":"524eaf20-c932-4f93-907e-17fc4e2a1bf3","resolution":{"observed_at":"2026-06-26T12:59:29.059064Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0196-6774(87)90019-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.075178Z","title":"Bridgland , title =","venue":null,"work_id":"30025504-fc69-4290-bacd-4efffa9c5bae","year":1987},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:696fecd542b2b26a6e2349d0739bb6e83fe69da1f81b01f5b1a8cf85050e7951","observation_id":"8fb6c5b6-40d6-414d-aa1d-3cdb401ae9f7","resolution":{"observed_at":"2026-06-26T12:59:29.076422Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-26T12:58:52.731335Z","title":"Log-space constructible universal traversal sequences for cycles of length O(n^","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:0fa8b1f15a770c8b960d2f512391c0faab7e43fe9f4ff7aa479da431bbcb9308","observation_id":"988bd28b-fb96-4c90-999c-b2719ca44e26","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:fab75953a51a6585e5b92fe672ad9b07ece13dc905dbd394f76b88972fa589df","observation_id":"75872dbb-934c-44a4-aa33-731b259bf807","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Karloff and Ramamohan Paturi and Janos Simon , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:97d0c645a5b756eb0bf165cd2645e2e27415e5860353a98d7ead36113c53fcfa","observation_id":"5db7b225-70c2-4f90-88e5-fbb5d43f3193","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Ruzzo and Martin Tompa , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:2abba12c0ee90a4f37246928d3425812d0e6a27a2834b460659446625282589a","observation_id":"13d864ce-297b-4be6-a812-12bc5d07079c","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Ruzzo and Martin Tompa , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:87cbe1ce1ae1ead1da44617f90e243c179df867a7dc01982dc2ba2895b4ba255","observation_id":"b1e4d246-72f2-4d96-9148-e1dd2011d304","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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.1016/s0022-0000(02)00023-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.059599Z","title":"Universal traversal sequences with backtracking , journal =","venue":null,"work_id":"eb32fd7b-7f18-4a05-96e1-d63b1982a3b3","year":2002},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:8dae58cdce91090d1d60d3a4703a7696bd269d1385973d5317c25048ff5f7129","observation_id":"dcd77a43-8f97-401b-94e5-76fee36f2a50","resolution":{"observed_at":"2026-06-26T12:59:29.060919Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:eb924e0654127616e7da3230a049799356f66ea6a32dfd9a241a277c555ab0ab","observation_id":"80f12d61-4a66-4ff8-ba7f-abff4ebad307","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"2003 , note=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:c0964e704ce5c3a0b7e183dd50ec9eca6153a7466f466561b82cfd3f02a5ad00","observation_id":"ee4b704a-400c-44cc-961d-ca028b652f19","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"On Traversal Sequences, Exploration Sequences, and Completeness and Kolmogorov Random Strings","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:99a39d23e74ac6cf061584ebe27211ec083fbfe99a81f7b4efc7a869fb2cc811","observation_id":"8309428d-fb08-4299-b61a-751ebf5f4516","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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.1137/s0097539798339041","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.063122Z","title":"2000 , url =","venue":null,"work_id":"58d8d753-c519-49ac-91f5-5588135124a8","year":2000},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:750cf9590bae186b16571cfa4de98f36a01a23438a7181774904a57c3002c85d","observation_id":"9b283666-9abe-40eb-9ba8-b4cac6f1397c","resolution":{"observed_at":"2026-06-26T12:59:29.064286Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2016.10","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.068391Z","title":"Kallampally and Raghunath Tewari , editor =","venue":null,"work_id":"1a25c657-b4f8-4eef-b862-78d8727e6424","year":2016},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:24de11fe35f3bab6a29d27879e10c3923b5cf3deaa48c216565af65382da9212","observation_id":"7b4d5bbe-8d40-4550-bdf0-926c7699000d","resolution":{"observed_at":"2026-06-26T12:59:29.069647Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:a9a5807c368ceb350d44e84bc817d1ffc3e75392b5df8525e68c902d5b23204a","observation_id":"075e9c6f-ea76-475b-9231-5766305b9377","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC 2006) , pages =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:0281a6ab6410c375734279d7b8dcf038be2acb6e1226ce90c29971741072b586","observation_id":"fdbef424-9f83-4d24-8a39-fa5a50bc6b3f","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:a55930d871f27e91893a759b0fcd874567f4d24d7bd6711c40352f41699064ec","observation_id":"5062d1e8-3c53-4d3f-9baf-ba0a1f6ad5ab","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Combinatorica , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:8367ee06a2fb72fede5bef620025a03eb077e1c109d8bea6eca54837238b8b70","observation_id":"55f9e10c-0789-4260-8e89-7b722c5c4881","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Information Processing Letters , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:d173efd52cd445ec789e895b0e5cbca889567fd7134950f3cf387e6f6ecb93ac","observation_id":"b8fa147a-91c3-4517-b24a-e66662960409","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"1988 , publisher=","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:bc3220cf75f8551e56a6afb02c83ad5dc2c860763e234dd4cd56f25dd1a1ba87","observation_id":"dde00b23-c301-4fd5-9139-07440db6e9f4","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC 1983) , pages=","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:d8dc707b9995c11da23e71377e26ff309079538f529c54cf484f5ba3126e041d","observation_id":"f6699e29-0bd3-4762-ae06-e74709a807db","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:379166e68509b977423219d1aa8946d6ab642bc3ef5eed2359e94412ebbecc1e","observation_id":"497d4685-1df5-456a-9e91-3bc871bf2910","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Lewis and Christos H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:bd24b3320a345a76b76130788c5e68f861e100baf34a10429a52a5690c798b4a","observation_id":"9997ccbc-00cd-4b48-ab37-d66cd70efc9b","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Bounds on Universal Sequences , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:28f6d1e40ebc28e5b13f3517c6e2eacf8367588b6123ed29710b5f7a94e2a8f0","observation_id":"38782687-af2f-4841-94bb-2d5edd95ae8c","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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":"0270.149027","doi":"10.1145/1490270.1490272","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Algebrization: A new barrier in complexity theory.ACM Transactions on Computation Theory, 1(1):2:1–2:54, 2009","venue":null,"work_id":"7a289482-0cf1-49d4-b3d2-c23f0fb9e15b","year":2009},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:77176984746b7f229baef9e3f1caaf166e32e189d9716b61f5985322989e940b","observation_id":"b16a540c-2539-4b3d-adc6-1c735c9612c5","resolution":{"observed_at":"2026-06-26T12:59:29.074403Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-26T12:58:52.731335Z","title":"1997 , isbn =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:faa295aac6c0cc3b3be3cfdd343cae89df44d10cd6b2a75bccaec4f02124337c","observation_id":"d13936e8-3e18-4b01-92d0-93f2a2031290","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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.4230/lipics.approx/random.2022.20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.070374Z","title":"Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness , booktitle =","venue":null,"work_id":"504b5ff6-c2f3-4e4d-b176-4bc638db4b41","year":2022},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:2afc2159b8fe3328ef315a7adab982cfdca6e151a004d9bb2c4ceab2c92f83f3","observation_id":"068a630d-3d09-427a-ac51-390476d42392","resolution":{"observed_at":"2026-06-26T12:59:29.071534Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2979.2021","doi":"10.1109/focs52979.2021.00010","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Korhonen, A single-exponential time 2-approximation algorithm for treewidth, in: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021), 2022, pp","venue":null,"work_id":"a4a25e66-8de3-4c82-acfc-23967e5f3b24","year":2021},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:a5d8efa8e6d4706fb4280bc1b1aa316438cdd3566e16ec0a9dc85e3d7ca0f31c","observation_id":"b94d422a-db13-461c-8d0a-7676e0700623","resolution":{"observed_at":"2026-06-26T12:59:29.067655Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-012-0047-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.076932Z","title":null,"venue":null,"work_id":"3cbdbe4f-d685-477b-914e-b049aee862e5","year":2012},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:685e263701e7ec64a472adfcaa86dbe779ee479c7463b666ccb0427bbd1cae2a","observation_id":"ef749ec6-09ec-438d-83e8-d73bf460e326","resolution":{"observed_at":"2026-06-26T12:59:29.078084Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-26T12:58:52.731335Z","title":"UL problem","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:310223042f8def810488a889b052f5a53805cbcf02a9e3bfe40ccb6e3a410fa2","observation_id":"e2514a4f-a819-4df5-a9cc-87f4d6ef4452","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"and Merz, Sarah , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:c71c28a0709d54f42ff89404562122d55ae3c38936c3f5a041bd2ed1123808f1","observation_id":"22f5fda3-cc3d-47cc-b7f9-47e4a17946d3","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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.1016/j.aml.2011.10.003","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T12:59:29.061394Z","title":"2012 , issn =","venue":null,"work_id":"7bacf2e8-4406-4da6-94b3-bbe1c25dca9c","year":2012},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:77b75f8525c17b234b3d9da85e8e433e4865b3a82fe761144dfa86631f20fdd9","observation_id":"7a6d05fd-4316-435c-8733-8357d90c3dec","resolution":{"observed_at":"2026-06-26T12:59:29.062545Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-26T12:58:52.731335Z","title":"2024 , archivePrefix=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:938c4fcf9912e5c2f2080ef5e9573521e1bd036273856c21c3d655afdcb78425","observation_id":"b93f80c2-8d0c-4e15-b2e0-7f8dc9f0ea6a","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:c66981c89173c7bafae26ba5bd2b70149db3844314e550f932aed00804601a9f","observation_id":"2d8779d8-5a37-4288-8cc2-feda4363f8bc","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:67227200a804d625ddc840d437fb5af887f559fa26fbd99321d252dc2f0988cc","observation_id":"0a948de7-da68-4587-9356-5bb00cca5afc","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:3cf1cd636724ee06740d2925b05b0fc83b1de98f208d1f5c9beb38ee050597f1","observation_id":"ed0660cb-1d5d-4be3-89e9-86360cff63ad","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Advances in Mathematics , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:de7c77ed2e0842741e94b2f014a96140b8a83391319b6047b5f531b7548211bd","observation_id":"950aa741-0048-4296-bde4-c68c75a36b52","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:9d4bdc5646df276b58c60c662f28e5962689e7e0d42086f862b6fa93ab76be6a","observation_id":"e657a946-fc18-45bf-a97c-e22d9a5a760f","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"1961 , publisher=","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:029c30220c1149a9a54d4452e366b36c0c33682bce424c8d0edae94881f98899","observation_id":"9d30ed16-9463-4eb5-bfe6-e8196d87b6cd","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:cac69ff5dade4c752f7275b610138daf34fdeb590c65d5213eef8e2f6c8dc9f2","observation_id":"243ed46f-ce0d-4a18-b59d-ddd66ab7271d","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Pacific Journal of Mathematics , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:229edecec5d3109b4b7815da8d1c6e64a9adb9367203c0592caad5f4afc5477e","observation_id":"0e49706e-7805-4624-b5a8-4824ad7e5dff","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Theory of Computing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:716fc4e35af3c5f0eebfb7b6728c8fd0274b7f772784167f56c6764373db1cc3","observation_id":"1813aae6-995b-497e-a5d0-ecdc6419cd2d","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:1b3827acd06605d896c42e969d5fc0639fbf090fb9d3d222123028717f34e012","observation_id":"414aea0c-c62d-4eb0-9942-e17a09907693","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","resolver_source":null,"status":"parse_uncertain"},"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-06-26T12:58:52.731335Z","title":"1995 , publisher=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:5ea7bf2c11a1a8848eb4ca4e64fc8afee184f30fb7836b7a4fe9c2a446cb4abe","observation_id":"9d81580c-7bae-4493-aaeb-9413033e9fe9","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Some results on","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:522d4c6721eb897a155e09086e1da95fae42657bd8486a5d65b950416fdb0bf6","observation_id":"00122f45-6b50-4631-8146-a3035fd6caf4","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:2f4dc3013a98a49a38d82ca17fe1fdea210e914a6a85d9c412a41761aa449f4e","observation_id":"eb13d089-1053-4d82-82d2-2f034e0ccfe1","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","resolver_source":null,"status":"parse_uncertain"},"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-06-26T12:58:52.731335Z","title":"Language and Automata Theory and Applications (LATA 2011) , series =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:c0a587ebfb17bdd9a594bcf47a2ee714365ac3182769a1844777129ef217c394","observation_id":"9ab32688-d777-4714-9bb9-117552812668","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"Margolis and Jean-Eric Pin , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:6ebbf8b2ef172fec6f8389d04187fb6d5fabc6e63838b291f616ea118fca0137","observation_id":"0ad41ee0-c8a1-43fb-a44f-f0e765d5afba","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","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-06-26T12:58:52.731335Z","title":"2016 , publisher=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-26T12:58:52.731335Z"},"links":{"citing_paper":"/paper/2606.21103"},"observation_digest":"sha256:e709a02632c9e5055a8f42046eac58bcfd7c00eadf516a04711d156bfb0941d6","observation_id":"4a8a7a08-30f5-479c-8317-5caef383e74a","resolution":{"observed_at":"2026-06-26T12:58:52.731335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.21103","last_updated":"2026-06-19T05:08:43Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-03T11:03:27.337424Z","submitted_at":"2026-06-19T05:08:43Z","title":"On the Reachability Problem on Monoid-Labelled Undirected Graphs"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":2,"unresolved":45,"verified_exact":8,"verified_fuzzy":0},"total_outbound_references":57},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"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."}