{"as_of":"2026-08-13T06:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4507ce4791110227fd098937343f870448bb61ac482058ded225733e7b8ab896","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:37:37.903504Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"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.14284/citation-record","integrity":"/paper/2411.14284/integrity","json":"/paper/2411.14284/citation-record.json","paper":"/paper/2411.14284"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3088.26030","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.399445Z","title":"KAT + B!","venue":null,"work_id":"1f830a3f-8d7c-419d-b322-d17aa43de272","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.829891Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:6a0c00a734133dc28fe4d316106470b301cc2d23ddd5bdecb6a00a4fdb163997","observation_id":"b1dbee64-aebd-44e2-ba2e-cc5ee57248ec","resolution":{"observed_at":"2026-08-12T15:37:38.410429Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:37.834525Z","title":"A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.834525Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:95a1c625be725ed23020159720ba6549869b3fd1583b782c53eaface14f7a79f","observation_id":"fd09d4ed-9556-4800-9769-c4292cf6f2e5","resolution":{"observed_at":"2026-08-12T15:37:37.834525Z","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-12T15:37:37.861919Z","title":"Kleene Algebra with Tests: Completeness and Decidability","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.861919Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:8e314cef5197c25025fa0140cdfda304cecdd7f7d06ecf81c799dc22703cfd1a","observation_id":"fca41944-076c-4e95-af98-d9526fb9ea2e","resolution":{"observed_at":"2026-08-12T15:37:37.861919Z","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-12T15:37:37.866185Z","title":"The Böhm-Jacopini Theorem Is False, Propositionally","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.866185Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:687786dbb181f0ce02101a23c3b3455052c621f9cbcf98ef8afc73c3197aba97","observation_id":"1336cc80-eb91-431c-b4c0-6328ec519d21","resolution":{"observed_at":"2026-08-12T15:37:37.866185Z","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.22028/d291-26058","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:37.966957Z","title":null,"venue":null,"work_id":"b24ef3e9-1662-46e7-9774-572352f7054a","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.874801Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:8e43e23a1ef13110a1034e9c4a44e799a704650fa1dfd2cea3e85a5aab22a403","observation_id":"666510ae-5e23-4d1a-b012-5be625f87a27","resolution":{"observed_at":"2026-08-12T15:37:37.972625Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:37.878953Z","title":"On the Capabilities of While, Repeat, and Exit Statements","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.878953Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:5180544a59e5a89cf4aaa469847458b7716514da3873bcb99c3ebd27613d829e","observation_id":"0c16c771-e974-470a-8322-c331a9a96397","resolution":{"observed_at":"2026-08-12T15:37:37.878953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.06937","last_updated":"2023-11-12T19:49:41Z","snapshot_observed_at":"2026-08-13T05:27:32.357325Z","submitted_at":"2023-11-12T19:49:41Z","title":"Kleene Algebra with Dynamic Tests: Completeness and Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06937","snapshot_observed_at":"2026-08-12T15:37:37.894058Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.894058Z"},"links":{"cited_paper":"/paper/2311.06937","citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:2416196087bd880275ab392814b00d42d1efd7e08bcd8f92603aa9fc61e8e7f2","observation_id":"3a0651dd-7e13-4599-91a7-4f3cbe82a18e","resolution":{"observed_at":"2026-08-12T15:37:37.894058Z","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-12T15:37:37.903504Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.903504Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:02407afe7aa61104e65cff6797e2f9723db843a0cadadad621caf491b4dc8b47","observation_id":"897ffc2e-2c7a-4d7a-a9ff-268c4ca2ffe3","resolution":{"observed_at":"2026-08-12T15:37:37.903504Z","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.1145/32123","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.107529Z","title":"Derivatives of Regular Expressions","venue":null,"work_id":"9def0bea-4700-4d41-afb5-7f0ce24a925f","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1964,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.792444Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:349c9aa98cb1d1d438494abcf85bca3ad566c318102be67b169684e68c5f4971","observation_id":"7eafae7e-acea-4ca4-b225-2d86d079a4d5","resolution":{"observed_at":"2026-08-12T15:37:38.112208Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":"5592.36564","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.753487Z","title":"Flow diagrams, turing machines and languages with only two formation rules","venue":null,"work_id":"88253102-2407-4ee4-a97f-e7d1fad2a753","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1966,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.787548Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:65d8a5b906361cbe7648c89f8749a63ae133302e23b8cfed1c0912fae10dfe6d","observation_id":"6cdb1443-d35b-4e69-bddc-644e254e6304","resolution":{"observed_at":"2026-08-12T15:37:38.762516Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0020-0190(71)90018-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.044516Z","title":"Notes on Avoiding","venue":null,"work_id":"08cc770c-1284-45d4-8b13-074f55f7a53f","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1971,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.839157Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:43f19bcaf067f7672d87c23cb0961e8f12382d0a32fb75aeef48ad4dbb20dd3d","observation_id":"4efe190d-2fcc-48ac-bece-e51f129e6d6a","resolution":{"observed_at":"2026-08-12T15:37:38.049014Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0022-0000(73)80040-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.068109Z","title":"Program Schemes, Recursion Schemes, and Formal Languages","venue":null,"work_id":"b9ba201f-13aa-48fa-ac47-ec9fcad7bfa1","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1973,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.816301Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:3f55707abeed487f8c33c01ed8fb68377602f74d80d3c4d3eb4d6a9e5d26bcdf","observation_id":"65a9427a-16a2-412b-8f63-191274cf84b2","resolution":{"observed_at":"2026-08-12T15:37:38.073067Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s00","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.030520Z","title":"Analysis of Structured Programs","venue":null,"work_id":"78bf8fb6-67e2-4319-b1b2-099519ff9356","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1974,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.843581Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:7490ab5ea9b36783b9d2ea63ad2fe2b6a34d5c86623d4f835e4f9df233a17cf4","observation_id":"2a6e0835-739d-444a-ba62-275b2c916e4f","resolution":{"observed_at":"2026-08-12T15:37:38.035037Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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:37:37.811346Z","title":"Propositional Dynamic Logic of Regular Programs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.811346Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:92cc66d5c94fe740361646f11b1c438e73eaa84de5904993692ca3c0be1a07df","observation_id":"fc01bcc9-4177-4a81-a92e-921d819a7950","resolution":{"observed_at":"2026-08-12T15:37:37.811346Z","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/0022-0000(84)90023-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:37.982523Z","title":"A Complete Inference System for a Class of Regular Behaviours","venue":null,"work_id":"faac1523-22bc-4f9c-9d87-5688b52960b4","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1984,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.870451Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:aade88c177accc87613e573661d1d3a35d3e8bad945f827fdd28cb9ba8429d59","observation_id":"860cd2c5-3930-4d18-bea8-0a0a8668922f","resolution":{"observed_at":"2026-08-12T15:37:37.987902Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1994.28837","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.608083Z","title":"Taming Control Flow: A Structured Approach to Eliminating Goto Statements","venue":null,"work_id":"1262bf55-b052-496d-88c7-cc3609cb069b","year":1994},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.806382Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:c87d21b1860f55d7abf73a91b1e2cbcd2ecb3a774964f3a35980ae3378ff6a55","observation_id":"b0231f99-252a-4811-b5b0-764600c46cb0","resolution":{"observed_at":"2026-08-12T15:37:38.616071Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:37.776469Z","title":"Partial Derivatives of Regular Expressions and Finite Automaton Constructions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.776469Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:7e58b60e611c31123de3d5f55268ce75047870e6e527c66d9598c5efb8942a3a","observation_id":"30dbb699-9958-43d0-87f3-a373ed430765","resolution":{"observed_at":"2026-08-12T15:37:37.776469Z","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-12T15:37:37.848374Z","title":"Kleene Algebra with Tests","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.848374Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:dca3eb429c5703598557320a7b70d0bde11f3601d3b4f0dbc6f3f13de172f636","observation_id":"7b8567c1-6182-4c18-ae1b-8d40020f3fee","resolution":{"observed_at":"2026-08-12T15:37:37.848374Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-44957-4_38","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.016082Z","title":"Certification of Compiler Optimizations Using Kleene Algebra with Tests","venue":null,"work_id":"f6c6229b-fa1a-43ef-944a-ce6e56a9128f","year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.857518Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:ac35a2e8f03f65898446181f291e6bf58b2c9bf118d183fdf41b2f0a8c2c25e3","observation_id":"d2f85ad8-57a0-43c8-ac9c-27c18786e878","resolution":{"observed_at":"2026-08-12T15:37:38.020849Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.865057Z","title":null,"venue":null,"work_id":"d70bf4f3-6592-4806-ac2a-dade87b98ad5","year":2001},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.771884Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:78b7bf35507672e7f993e740c535dd29c36bdd8c40d116283bc0b107cbe71035","observation_id":"b11fd932-c4fd-437e-8f5a-26656ea14a9a","resolution":{"observed_at":"2026-08-12T15:37:38.869813Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2004.07.020","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:38.092597Z","title":"A coalgebraic approach to Kleene algebra with tests","venue":null,"work_id":"3b2d6859-cfa4-47a0-892d-1ec4c3249781","year":2004},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.797252Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:976cf2c8754a0e80f6871bc4593b6e6312f6d84c24da16962c7062254b7c7c4d","observation_id":"d6a23b96-092f-4e45-a5b7-bde45e446d1b","resolution":{"observed_at":"2026-08-12T15:37:38.097841Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:37.801936Z","title":"Kleene algebra with domain","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.801936Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:df979d64f4efed0edc7c9c73fa335e70a02828839731524f859a336ca463202a","observation_id":"2a53a394-ef82-40b8-a1f1-3cfc7b66f239","resolution":{"observed_at":"2026-08-12T15:37:37.801936Z","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:37:38.849641Z","title":"Nonlocal Flow of Control and Kleene Algebra with Tests","venue":null,"work_id":"7dcf1ba8-13b9-45af-8a5d-33e28009de56","year":2008},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.852643Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:95e86930bcfbb020a34d0849b411f9826a1be6f5cf83634ae88e2cc85992557b","observation_id":"b2596787-0339-4169-976f-3c735a793011","resolution":{"observed_at":"2026-08-12T15:37:38.855221Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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:37:37.766851Z","title":"NetKAT: semantic foundations for networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.766851Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:a44cd64327e60a726418a7e38634da37ec5906d4b7ac90b350306541ef67a5b5","observation_id":"634dd94f-7533-4faf-8a70-90b0975fa0ad","resolution":{"observed_at":"2026-08-12T15:37:37.766851Z","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-12T15:37:37.884005Z","title":"Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.884005Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:6ed8dabcb8b6e8d3d0d985c225b492ef069317d6a66a337f7e09c835c452d682","observation_id":"61b55d64-42a4-4bec-a41c-d679a3192e35","resolution":{"observed_at":"2026-08-12T15:37:37.884005Z","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-12T15:37:37.825551Z","title":"A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilar- ity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.825551Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:d2edbe4b3b7d52886dc4f30619444e0efe93c1b8a8e18e1e2be869110d052e75","observation_id":"87d94f00-add0-40e0-b107-8a2338cde463","resolution":{"observed_at":"2026-08-12T15:37:37.825551Z","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-12T15:37:37.888247Z","title":"Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.888247Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:9ff0030690eb03c3d002d3411cad0d4bc523680b5266cb7f9f0293db7c0e9268","observation_id":"1b66d9f5-c9f3-43c7-84b3-13862605366a","resolution":{"observed_at":"2026-08-12T15:37:37.888247Z","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-12T15:37:37.821211Z","title":"Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.821211Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:af5cad5635726c4d2153be63cbbf70e42e65045595e61f23a92b2cac9744bf20","observation_id":"30b05f63-55cc-4362-86de-3d70556e47b8","resolution":{"observed_at":"2026-08-12T15:37:37.821211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04656","last_updated":"2024-09-01T16:05:51Z","snapshot_observed_at":"2026-08-04T11:55:28.066921Z","submitted_at":"2023-05-08T12:18:03Z","title":"Preservation theorems for Tarski's relation algebra","version":5},"cited_work":{"arxiv_id":"2305.04656","doi":"10.48550/arxiv.2305.04656","metadata_source":"pith","pith_arxiv_id":"2305.04656","snapshot_observed_at":"2026-08-12T18:16:22.223912Z","title":"Preservation theorems for Tarski's relation algebra","venue":"cs.LO","work_id":"3b6ee02e-09a4-4658-895c-d040f6527f16","year":2023},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.781579Z"},"links":{"cited_paper":"/paper/2305.04656","citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:d74061c1f70ee68211401e658fa9a71156b61973f7ec20e4440e82593c36d4fc","observation_id":"dd87589b-12e6-48a7-abb8-d57b4a882007","resolution":{"observed_at":"2026-08-12T15:37:38.133245Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:37:37.899189Z","title":"CF-GKAT: Efficient Validation of Control-Flow Transformations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:37.899189Z"},"links":{"citing_paper":"/paper/2411.14284"},"observation_digest":"sha256:036f6cc32831a603fceec26d8dba145094985ad9f3fdba47adb0980339fab0d9","observation_id":"74b4d3d1-2c39-4725-a62d-0bacdf87da9d","resolution":{"observed_at":"2026-08-12T15:37:37.899189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.14284","last_updated":"2025-01-16T16:31:25Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-12T15:18:17.917909Z","submitted_at":"2024-11-21T16:34:53Z","title":"Algebras for Deterministic Computation Are Inherently Incomplete"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":4,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":16,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":30},"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 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2411.14284."}