{"as_of":"2026-08-13T15:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09e1e4e10e0b2ddcfd7786f25a7e943005365b6997e745c9bbc085e449fed9bd","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:21:51.355597Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.14538/citation-record","integrity":"/paper/2411.14538/integrity","json":"/paper/2411.14538/citation-record.json","paper":"/paper/2411.14538"},"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-12T15:21:51.594501Z","title":"Inference of Reversible Languages","venue":null,"work_id":"1bcc11e3-9272-4d04-8274-e5294aa6575b","year":1982},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.288075Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:46a33fe81d4cd0be00ff53bd4763a2dac9032b45f9edc1dc8fccb22fd5c3291e","observation_id":"2eb067d4-f84b-4340-b23d-bf9345023429","resolution":{"observed_at":"2026-08-12T15:21:51.598446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.582278Z","title":"PSPACE-complete problems for subgroups of free groups and inverse finite automata","venue":null,"work_id":"6e9dad16-fd73-43f0-b3a2-e12880c4e84d","year":2000},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.292987Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:4110c206402bb3de89eea869cc4f8d1adb2cbcd3337c16585548ad12684f4f16","observation_id":"40a67e44-28c7-47fd-8cc7-85010ba4db22","resolution":{"observed_at":"2026-08-12T15:21:51.586558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.568667Z","title":"A Lower Bound For Reversible Automata","venue":null,"work_id":"faf1cdc8-f889-4e1e-96df-b5b695c50406","year":2000},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.297574Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:26bab223b024d6a213b5271e1b7597affb662eb4d752de34a23ad3f8bdcab252","observation_id":"182b62c7-a96c-43ec-a94f-b7bc498befe9","resolution":{"observed_at":"2026-08-12T15:21:51.573940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.554672Z","title":"Minimal and hyper-minimal biautomata","venue":null,"work_id":"bbb5cbd9-240e-4d76-b34b-78f7b54407b9","year":2016},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.301741Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:59d1c2a6466d9aaebaa002a728075d45ec43c6f7381da4a0092d52845506f41a","observation_id":"4eb52e13-1818-4ad7-a99c-47c658ebac34","resolution":{"observed_at":"2026-08-12T15:21:51.559578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.538972Z","title":"Minimal Reversible Deterministic Finite Automata","venue":null,"work_id":"e9af11db-021a-4474-9a79-1a608d5eae96","year":2018},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.307150Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:e29cea761b92be8872203ed7b49dc470636479cf8af5c7e03ec5dd4230dfbc3a","observation_id":"9c7e1859-376e-4a7a-b71b-1afd935b2d38","resolution":{"observed_at":"2026-08-12T15:21:51.546282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.528175Z","title":"On the state complexity of k-entry deterministic finite automata","venue":null,"work_id":"91bc41fe-c223-43c1-b3fb-948de0e6102b","year":2001},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.311511Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:5adac92096a22321c7c88fa1e580b8aaeb19332f8bf0fb5cf6e78d18ab663513","observation_id":"c7755bc2-ce7a-405b-905f-b44557722175","resolution":{"observed_at":"2026-08-12T15:21:51.532144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.511985Z","title":"Operations on Permutation Automata","venue":null,"work_id":"3fc305cf-c71e-4bce-a65d-5bcfa0fc20a2","year":2020},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.315974Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:937222c9dfa60264e93186596f7adfd6a9afe8c6b1dfca69159205997efa4919","observation_id":"b3a688db-a5a3-4725-b6de-5c1ee62308ea","resolution":{"observed_at":"2026-08-12T15:21:51.516053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.498411Z","title":"Decomposing Permutation Au- tomata","venue":null,"work_id":"766c9726-f9ec-4fe9-bcc4-bc9dbbbb46ea","year":2021},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.319611Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:95490fbf74f7ac4c4d972526d15e70178f6ca6900603491aff8dd1db7484940d","observation_id":"074ffe28-0309-4240-8c67-dbe4193f2f79","resolution":{"observed_at":"2026-08-12T15:21:51.503421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.484372Z","title":"On the power of quantum finite state au- tomata","venue":null,"work_id":"733abbea-6037-4c55-9c1b-d982fdbb3fd5","year":1997},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.323521Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:712db7b1b3318bea21b42735a2d5106f0c6c1faa48df816f2d94cd3f0c62b451","observation_id":"a79a65cc-87b5-4be8-b3f4-716c2fab368a","resolution":{"observed_at":"2026-08-12T15:21:51.489016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.470261Z","title":"Irreversibility and heat generation in the computing pro- cess","venue":null,"work_id":"91f3689f-b8e4-4193-965a-bf9bac35455b","year":1961},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.327315Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:695f19e9b3aa785faa404010147f0415a30889081e6cd7368dd3f4ba96105ee0","observation_id":"4840ab25-64d9-471d-810c-7ca82fd2f332","resolution":{"observed_at":"2026-08-12T15:21:51.474964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.456165Z","title":"GF(2)-operations on basic families of formal languages","venue":null,"work_id":"def700a1-77d9-4cff-a91b-a4726465b40b","year":2024},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.331444Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:8d50545b2f70fcbbbd12cab93937112f33faa5b55d367619fa35e8cc6cd52bef","observation_id":"8027c7ac-ef54-4d06-af99-484fc5969952","resolution":{"observed_at":"2026-08-12T15:21:51.461312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.443649Z","title":"On the Language Accepted by Finite Reversible Automata","venue":null,"work_id":"72add9b8-0f4b-4e47-9e8a-68808c8379f5","year":1987},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.335048Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:51aff0d38b55a4cbb29b55b1a28c0be391cdbe46cc96187f99ecba8d4f437154","observation_id":"a92edecf-5584-4c9f-ac43-8e84bc81753e","resolution":{"observed_at":"2026-08-12T15:21:51.447520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.432017Z","title":"Sweeping permutation automata","venue":null,"work_id":"44c42f19-c745-4d12-9971-733b5a06ed9f","year":2023},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.338836Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:b459ec9a10d4c01f8e652750dad796694c000dec5aa2e6742524a2f891eb7316","observation_id":"bcbb674b-6c01-4fc0-ade4-2176cd242101","resolution":{"observed_at":"2026-08-12T15:21:51.435746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.419388Z","title":"On the accepting state complexity of operations on permutation automata","venue":null,"work_id":"ab993d2a-45fb-49fa-92ca-930b40c05f37","year":2023},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.342719Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:c606b2a6996f1bdc0188f6c461f1a038b1fd100dbaecc67a0526cde993a7a49b","observation_id":"fd23e220-3e94-4ac5-b4f3-d9aeff0431f0","resolution":{"observed_at":"2026-08-12T15:21:51.424284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.407075Z","title":"The reduction of two-way automata to one-way automata","venue":null,"work_id":"a3df9422-b7aa-40b3-b837-e1ba3a30645f","year":1959},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.347163Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:343dc1588ac0c7ce09499e228d18fb4f5a49895e0bb8bc45b39e13c22792ab3a","observation_id":"f3428ef5-a980-432f-80c2-7296a07a7e16","resolution":{"observed_at":"2026-08-12T15:21:51.411321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:21:51.351685Z","title":"Lower bounds on the size of sweeping automata","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.351685Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:ed6c62c34197b5c2be06df338568453f8d7a8699482860ed9bbba58bd347b1f1","observation_id":"eb379841-0683-4338-ab3f-443d53f9d7e6","resolution":{"observed_at":"2026-08-12T15:21:51.351685Z","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-12T15:21:51.393416Z","title":"Permutation Automata","venue":null,"work_id":"89f95d00-47e2-48db-81f5-ae8e71f8e8d6","year":1968},"citing_paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:21:51.355597Z"},"links":{"citing_paper":"/paper/2411.14538"},"observation_digest":"sha256:aafe72a087f6f14ecef30a2f55820352e004491b455a0521f0ebc3d657d7123d","observation_id":"4e776570-847f-4724-9572-8b27c303d104","resolution":{"observed_at":"2026-08-12T15:21:51.398440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14538","last_updated":"2024-11-21T19:10:08Z","latest_version":1,"primary_category":"cs.FL","snapshot_observed_at":"2026-08-12T15:07:30.723709Z","submitted_at":"2024-11-21T19:10:08Z","title":"A hierarchy of reversible finite automata"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":17},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2411.14538."}