{"as_of":"2026-08-21T08:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e669ed6ef3f237103d8ebee427556a1bb05d7adc7b0f44b94c049d5180be2eab","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T10:49:34.040867Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2504.17536/citation-record","integrity":"/paper/2504.17536/integrity","json":"/paper/2504.17536/citation-record.json","paper":"/paper/2504.17536"},"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-16T10:49:34.662285Z","title":"Marked ancestor problems http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.71.3834&rep=rep1&type=pdf","venue":null,"work_id":"c4327552-7a57-406c-9d01-96fc76fea107","year":1998},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.909958Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:bde841264520a75c637f6d9d05ea92e71af02760644ea5dca00e802b64762395","observation_id":"adb3a395-6973-4e9f-88f1-097e5004ebe6","resolution":{"observed_at":"2026-08-16T10:49:34.666875Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06185","last_updated":"2018-05-31T12:44:22Z","snapshot_observed_at":"2026-08-14T20:31:59.811756Z","submitted_at":"2017-09-18T22:08:44Z","title":"Enumeration on Trees under Relabelings","version":3},"cited_work":{"arxiv_id":"1709.06185","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.06185","snapshot_observed_at":"2026-08-16T10:49:34.400582Z","title":"Enumeration on Trees under Relabelings","venue":"cs.DB","work_id":"8e9edf86-ddeb-4511-a907-9933b6b8f4f6","year":2017},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.915040Z"},"links":{"cited_paper":"/paper/1709.06185","citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:95e70e9b06ee76a6871a06d9b1143bd6849f9cdf5992529e5835c8153ab44c88","observation_id":"fa154955-7320-4cca-83f5-3925cc73e72d","resolution":{"observed_at":"2026-08-16T10:49:34.405627Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07728","last_updated":"2021-06-04T09:34:07Z","snapshot_observed_at":"2026-08-16T18:45:25.984849Z","submitted_at":"2021-02-15T18:25:48Z","title":"Dynamic Membership for Regular Languages","version":2},"cited_work":{"arxiv_id":"2102.07728","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.07728","snapshot_observed_at":"2026-08-16T10:49:34.378477Z","title":"Dynamic Membership for Regular Languages","venue":"cs.FL","work_id":"248abdcc-f796-43f8-9719-5d43a7e79419","year":2021},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.920372Z"},"links":{"cited_paper":"/paper/2102.07728","citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:52ba3a15493247ba8f5cd16b356ef44df48279966eb90320df4cecb35728b161","observation_id":"b29fbc9f-f132-4c8e-8268-42d047ccabe9","resolution":{"observed_at":"2026-08-16T10:49:34.385010Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07724","last_updated":"2023-10-17T15:01:53Z","snapshot_observed_at":"2026-08-21T07:52:42.037167Z","submitted_at":"2021-02-15T18:17:10Z","title":"Locality and Centrality: The Variety ZG","version":5},"cited_work":{"arxiv_id":"2102.07724","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.07724","snapshot_observed_at":"2026-08-16T10:49:34.358994Z","title":"Locality and Centrality: The Variety ZG","venue":"cs.FL","work_id":"ab3b6f7d-f125-4619-affa-2c9205d0f851","year":2021},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.925397Z"},"links":{"cited_paper":"/paper/2102.07724","citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:80cd5b476ac0512a781f7ab82493e216b97c8ff67fdfc0df39b2afd5bb1cad49","observation_id":"74ce6067-94e0-4e25-add2-097de8d2540b","resolution":{"observed_at":"2026-08-16T10:49:34.363429Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.647148Z","title":"http://db.ucsd.edu/wp-content/uploads/pdfs/212.pdf Incremental validation of XML documents","venue":null,"work_id":"7e55fd09-41ea-400e-b8aa-fed399818af8","year":2004},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.930295Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:180f051c3a7076d633c3d656d681cab7d09f08edb73dc612261f3a858cb3076d","observation_id":"14bdd16a-d250-4177-b260-9926fbe87126","resolution":{"observed_at":"2026-08-16T10:49:34.651696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.632724Z","title":"On the complexity of regular languages","venue":null,"work_id":"db5a4512-f1ce-4dd2-a183-3ef59b22a43d","year":2024},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.934848Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:c842afa6b54e018eb9c865fa529e67e85e3bc18193416f307fea723053e6f5e8","observation_id":"ccf48943-6950-4235-90c6-910d12cdb2a6","resolution":{"observed_at":"2026-08-16T10:49:34.637888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2004.07.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:49:34.113111Z","title":"First-order expressibility of languages with neutral letters or: The C rane B each conjecture","venue":null,"work_id":"44951cb9-0b3b-4f50-a180-11ba7a9e5608","year":2005},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.940454Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:05cbfdab3f84df3708a7d2adcc35ff8379d2774e776339b5f491d2ee3e908351","observation_id":"02b2fd9a-311c-4ab6-bb21-3a6462713fae","resolution":{"observed_at":"2026-08-16T10:49:34.117683Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.616386Z","title":"Parallel algorithms with optimal speedup for bounded treewidth","venue":null,"work_id":"ad316795-8456-4e59-aa87-cf1f0dcc52df","year":1998},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.944876Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:7b7e7df603b799b7cb34b34acf6fc5bba274ced8bdedf414620f148d26254462","observation_id":"1a0c40dd-a24c-49c2-b3b4-2b9e941fc8f7","resolution":{"observed_at":"2026-08-16T10:49:34.621146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.602873Z","title":"Forest algebras","venue":null,"work_id":"d4a3661f-775d-41e9-b31a-d898e311945d","year":2008},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.949933Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:72964778eed2207c577bca9e6a5e17dc4f755b02c0cf251293e1b4294ade9240","observation_id":"dc6e3306-c096-4b7f-97a8-72572567ceeb","resolution":{"observed_at":"2026-08-16T10:49:34.607269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1502.04898","last_updated":"2015-02-17T14:07:12Z","snapshot_observed_at":"2026-08-14T22:59:43.100871Z","submitted_at":"2015-02-17T14:07:12Z","title":"Recognisable languages over monads","version":1},"cited_work":{"arxiv_id":"1502.04898","doi":null,"metadata_source":"pith","pith_arxiv_id":"1502.04898","snapshot_observed_at":"2026-08-16T10:49:34.339866Z","title":"Recognisable languages over monads","venue":"cs.LO","work_id":"2599a62d-e9bf-46fc-bf05-06e44814d1cc","year":2015},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.954270Z"},"links":{"cited_paper":"/paper/1502.04898","citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:1f84614d707ac3d543703ec0fd53ee51e2d7ff283ad19563f835a892554adcdc","observation_id":"6649e685-615d-4679-a8cf-45acc7b6ff5a","resolution":{"observed_at":"2026-08-16T10:49:34.344563Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.589413Z","title":"Tree automata: T echniques and applications, 2008","venue":null,"work_id":"1ddcdd6f-44ac-462c-9de5-8ddcc2b5210a","year":2008},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.959322Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:65316ff974400121d10c60280223d82659e99c06289b3c3c9ac3c294b3fe493d","observation_id":"1d449f8f-ff51-413d-b076-8c0c0f9085ed","resolution":{"observed_at":"2026-08-16T10:49:34.593657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.574565Z","title":"Automata, Languages and Machines, Vol","venue":null,"work_id":"6a671030-b153-40bd-8362-4e2497f11600","year":1976},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.963866Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:1d435a273f34d4673fc952f82799b575f5ffe46ba5c99dd93c134a8a8db37eb4","observation_id":"84d96916-7a53-4f3e-85e1-b48cacf7f20a","resolution":{"observed_at":"2026-08-16T10:49:34.579046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.559635Z","title":"Dynamic algorithms for the Dyck languages https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.57.4615&rep=rep1&type=pdf","venue":null,"work_id":"36646725-a599-438c-8c9b-344a936346b5","year":null},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.968469Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:9a20b29bf789cb0f442b1f67596b72853fab60b07043a4d106a5e5983dee5604","observation_id":"1fcb6c63-9df3-4aa0-b511-3e7ba2f42f2a","resolution":{"observed_at":"2026-08-16T10:49:34.565053Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.545154Z","title":"The cell probe complexity of dynamic data structures https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.453.9085&rep=rep1&type=pdf","venue":null,"work_id":"909d5f94-5021-49a8-b1ea-044205c3f966","year":1989},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.972880Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:7eb6044fe2843bf9aef5ea4d431ee2113bf3f76189c9f42da057b820014cfa43","observation_id":"b7820d6d-e984-4eb6-95ac-92cb68fec104","resolution":{"observed_at":"2026-08-16T10:49:34.549818Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.531081Z","title":"Optimal tree contraction in the EREW model","venue":null,"work_id":"2d9244d5-eaad-4483-8a36-6a59f71d3fa4","year":1988},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.978198Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:04105e8f6a916b09e3feeb4e0385ce4db27498ea41379f29d5481f8d4b6811ff","observation_id":"bfea73eb-2407-4e56-8350-a8003dd42754","resolution":{"observed_at":"2026-08-16T10:49:34.535549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0812.1915","last_updated":"2008-12-10T14:13:57Z","snapshot_observed_at":"2026-08-15T05:59:38.490133Z","submitted_at":"2008-12-10T14:13:57Z","title":"Dynamic Complexity of Formal Languages","version":1},"cited_work":{"arxiv_id":"0812.1915","doi":null,"metadata_source":"pith","pith_arxiv_id":"0812.1915","snapshot_observed_at":"2026-08-16T10:49:34.314486Z","title":"Dynamic Complexity of Formal Languages","venue":"cs.CC","work_id":"36923f20-3974-4cf4-be16-29293b04fb3b","year":2008},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.982419Z"},"links":{"cited_paper":"/paper/0812.1915","citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:ae5f14fd42ab51e07f4375584cfb337ebcb6357bebd51a2843157025bd4c1596","observation_id":"2fb7e7a2-7ca4-4072-b893-745360964eb0","resolution":{"observed_at":"2026-08-16T10:49:34.319646Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.517368Z","title":"Fast algorithms for finding nearest common ancestors","venue":null,"work_id":"48d61db6-50f4-4c69-85ed-524338bee5dc","year":1984},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.987230Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:62392daa112197a1fdd0ca94d5944c312cbf3e41ee0b67458141d94c9f857428","observation_id":"40bd6041-c7c6-4ceb-9635-3bf229a9e055","resolution":{"observed_at":"2026-08-16T10:49:34.521697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.503094Z","title":"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.29.6315&rep=rep1&type=pdf Hardness results for dynamic problems by extensions of F redman and S aks' chronogram method","venue":null,"work_id":"b0ae12db-a2f2-46be-a68c-6542ce996132","year":null},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.991641Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:9f448bcd465482620c710f5ab3424facd43d73f31b1668c18643ad6ac8591044","observation_id":"81aaf9a1-6dd6-44d0-b6af-92af1acc099f","resolution":{"observed_at":"2026-08-16T10:49:34.507878Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:33.995979Z","title":"A Ramsey theorem for finite monoids","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:33.995979Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:a1dbd3a28739bb73eb3fd66652aba0a7f391a7b843df0e349491d9404e800a61","observation_id":"ad9f7370-9151-48ab-a850-22de64c3f879","resolution":{"observed_at":"2026-08-16T10:49:33.995979Z","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-16T10:49:34.001392Z","title":"Bounded-depth circuits: S eparating wires from gates","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.001392Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:70a597f4e6af04eb81178293773aaeee4902bdee4465a0d546acca7f0998c605","observation_id":"6292dca6-f33b-4d1c-9526-aed96c80e5b5","resolution":{"observed_at":"2026-08-16T10:49:34.001392Z","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-16T10:49:34.005484Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.005484Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:bd1d328788aae57572a87dcc79b3b9a7400e331f83df2b983bab60dabf60a9df","observation_id":"2e383dba-0f7e-4f26-907d-a303b660554c","resolution":{"observed_at":"2026-08-16T10:49:34.005484Z","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-16T10:49:34.489320Z","title":"Parallel tree contraction and its application","venue":null,"work_id":"199c915d-36f6-4879-887a-7a4ff19aa7e2","year":1985},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.009560Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:cda5842be9b2365157171581f78eff2b6036a8b4441c7f3c4127573a73c847fa","observation_id":"d40c06d0-ef98-4bcd-ba61-43ac8841f4a4","resolution":{"observed_at":"2026-08-16T10:49:34.493907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.473955Z","title":"Mathematical foundations of automata theory, 2014","venue":null,"work_id":"d36b2f86-2aca-4e30-8cbb-5d30b401aa05","year":2014},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.013647Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:714d3d74e4ed7d9b2dbd9abb4cfaa38847fd7fed424813448e982e480b98bf9b","observation_id":"6267a27e-6913-4648-92d4-78a2b98cb645","resolution":{"observed_at":"2026-08-16T10:49:34.479126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.460058Z","title":"Mathematical foundations of automata theory","venue":null,"work_id":"56875e56-9b87-4006-9909-79eb6171a5a3","year":2019},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.017906Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:822ad3b1dbcabc00912765f5330a61232c35a05d7f25cbb2ed4b975a6430550b","observation_id":"03873308-d707-4a6a-b9b0-1b05e44098e4","resolution":{"observed_at":"2026-08-16T10:49:34.464400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2023.81","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T10:49:34.088406Z","title":null,"venue":null,"work_id":"7e7f4d14-7d59-445d-aa48-315aeb9eee8b","year":null},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.022021Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:c372a6921f2221a65e40be869cf2b87bb96f5823657766f6acd7dbae613a386d","observation_id":"627ad716-7ca2-41b0-9790-629dad952c1f","resolution":{"observed_at":"2026-08-16T10:49:34.093741Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.445571Z","title":"Dynamic word problems http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.868.4450&rep=rep1&type=pdf","venue":null,"work_id":"46e98eba-487a-49dc-8432-a297c8ce41dc","year":1997},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.027188Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:2faef6bc203ab1329b1a520289ccc6fd11d5ec1b4ee34620cdeec41fb6d43abf","observation_id":"a8031206-b56b-401b-b292-612ae033a135","resolution":{"observed_at":"2026-08-16T10:49:34.450112Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02572753","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"The variety generated by finite nilpotent monoids","venue":"Semigroup Forum","work_id":"8fb5a002-a8ab-4064-8c7e-7146d03c4872","year":1982},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.031398Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:7c2840aa281e3c5d3e90a69c3c384656140ab6535caac29131fd99807da8467b","observation_id":"b157570e-3bbb-4202-91e3-46851abe7215","resolution":{"observed_at":"2026-08-16T10:49:34.077754Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.430894Z","title":"Dynamic complexity of regular languages: Big changes, small work","venue":null,"work_id":"24860ec7-36cb-41a4-a6d4-07ab1b174c76","year":2023},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.036696Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:19ccc4cd274247b84be3284393ca1bcb19dad24695da13ec0d5830abffafa53f","observation_id":"d8efbe2f-823e-45df-ba0a-8d8653a21b1d","resolution":{"observed_at":"2026-08-16T10:49:34.435434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T10:49:34.415413Z","title":"The complexity of relational query languages","venue":null,"work_id":"6f1c3135-b919-41dc-b7b1-d84273806c68","year":1982},"citing_paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T10:49:34.040867Z"},"links":{"citing_paper":"/paper/2504.17536"},"observation_digest":"sha256:e780367f7f1b5265452ddb7b2cd5673bd8d34359d582af8b4dea7abb8348d707","observation_id":"5d94babf-2c27-4567-99dd-49af365f350c","resolution":{"observed_at":"2026-08-16T10:49:34.420996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.17536","last_updated":"2025-07-02T07:46:18Z","latest_version":2,"primary_category":"cs.FL","snapshot_observed_at":"2026-08-21T01:11:51.050572Z","submitted_at":"2025-04-24T13:26:08Z","title":"Dynamic Membership for Regular Tree Languages"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":5,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":8,"verified_fuzzy":13},"total_outbound_references":29},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2504.17536."}