{"as_of":"2026-08-15T06:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5f90ac3a5b496da123de787f2e07c6e6afa4874792f02b6290b698446ffdb46","coverage":[{"denominator":91,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":91,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:03:14.112114Z","state":"measured"},{"denominator":92,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":92,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T13:00:03.187092Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.22918","snapshot_observed_at":"2026-08-01T13:00:03.187092Z","title":"Fornace and M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19282","last_updated":"2026-07-21T16:53:51Z","snapshot_observed_at":"2026-08-10T11:39:07.615952Z","submitted_at":"2026-07-21T16:53:51Z","title":"Nystr\\\"om Error Beyond $M$-Matrices: A Minimal Diagonally Dominant Obstruction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T13:00:03.187092Z"},"links":{"cited_paper":"/paper/2506.22918","citing_paper":"/paper/2607.19282"},"observation_digest":"sha256:3253928d999f7227c7530b75ffd371ed30865cf58b63110c7eb6c5ed0a3b0cb9","observation_id":"96f887eb-400b-4ce3-a256-c52269d5cdec","resolution":{"observed_at":"2026-08-01T13:00:03.187092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.22918/citation-record","integrity":"/paper/2506.22918/integrity","json":"/paper/2506.22918/citation-record.json","paper":"/paper/2506.22918"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:04.862118Z","title":"Inequalities for rare events in time-reversible Markov chains I","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:04.862118Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:f5c2bf1e7d2e83fa1b81b448061ddfabd80ddd58dd1c931df030a8bdee5b4adb","observation_id":"a10e7f85-2a01-4ee5-bb82-c04e176a01ed","resolution":{"observed_at":"2026-08-06T22:03:04.862118Z","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-06T22:03:05.047097Z","title":"Aldous and J","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:05.047097Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:d3fe0c90f0dabb87a89be06836c65a44334bd7104cdd031dadf0a85a7bc012cd","observation_id":"91a966ed-d54f-4db9-aa5e-a3e9ce7cbb1a","resolution":{"observed_at":"2026-08-06T22:03:05.047097Z","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-06T22:03:05.184072Z","title":"Spectral methods in machine learning and new strategies for very large datasets","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:05.184072Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:f0cbdd78f5412413442cbe252aebc65b578f1d78ac9549d12e41df18a2f63de6","observation_id":"5d72fd31-d322-4e80-9885-9ea833547d3d","resolution":{"observed_at":"2026-08-06T22:03:05.184072Z","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-06T22:03:05.320249Z","title":"Committors, first-passage times, fluxes, Markov states, milestones, and all that","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:05.320249Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:3bd8cd8e2300b9268b11b2a4fcce19e5fb50516be126d7f139641962fdce2fe9","observation_id":"2499db87-958a-432b-be77-12c7b81a46be","resolution":{"observed_at":"2026-08-06T22:03:05.320249Z","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-06T22:03:05.504983Z","title":"An Improved Approximation Algorithm for the Column Subset Selection Problem","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:05.504983Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:6ec1dccc8025179133b6e10ffa39a465f04094a69be4b2a94c37959fdf9db044","observation_id":"fd65dbb4-13f1-4972-938e-ae02b99b946d","resolution":{"observed_at":"2026-08-06T22:03:05.504983Z","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-06T22:03:05.651750Z","title":"Approximating IMRL distributions by exponential distributions, with appli- cations to first passage times","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:05.651750Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:c44c07943051ac0e566133f3b651c277ccb57f9f3ae25eb4b33f84251e543e5d","observation_id":"bc582da5-4bbe-447f-a581-612cced4566e","resolution":{"observed_at":"2026-08-06T22:03:05.651750Z","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-06T22:03:05.762063Z","title":"Uncertainty in a Markov state model with missing states and rates: Application to a room temperature kinetic model obtained using high temperature molecular dynamics","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:05.762063Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:1e4e48decb8fb8cc94cf80dbbe421eb46f495477775ede795a1dfa94e3c7866f","observation_id":"d6b1decc-4490-4bdb-921b-142effabea54","resolution":{"observed_at":"2026-08-06T22:03:05.762063Z","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-06T22:03:05.886950Z","title":"Nonlinear model reduction via discrete empirical interpolation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:05.886950Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:74be0e96ff6706e4b41aa6a121df15b01cf571ba6de9e011df73a47f3e8c5e88","observation_id":"992ae344-78a7-49a0-b63e-f031df825e0a","resolution":{"observed_at":"2026-08-06T22:03:05.886950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m1380624","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems","venue":"SIAM Journal on Scientific Computing","work_id":"81e7b721-dc6c-42f7-9165-19d50c334716","year":2021},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:06.059652Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:51c76299fbbb0ce669f9fc760a47bcdfd2a800a1d4f1cf480fb679fc7ea17847","observation_id":"b5f5e9ce-b8bd-4feb-a3ec-b2c254e4daae","resolution":{"observed_at":"2026-08-06T22:03:14.602447Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:06.185718Z","title":"Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:06.185718Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:e086d57c9a40407dd26212f766f9669195b7925e4c8f698611a44b5f882bc977","observation_id":"7f9f734c-1e1d-4bae-8374-ff753dbc45e5","resolution":{"observed_at":"2026-08-06T22:03:06.185718Z","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-06T22:03:06.306111Z","title":"Markov state models of biomolecular conformational dynamics","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:06.306111Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:1470b1006a2bc06222c24848e837c8496fd15de678e614100dca35131ede29d6","observation_id":"13cc4eed-1d0c-4bf9-a68b-10fe5ca03d22","resolution":{"observed_at":"2026-08-06T22:03:06.306111Z","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-06T22:03:06.444804Z","title":"Discrete Green’s functions","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:06.444804Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:89de1c60841ef9a4063d719e2d01d46cbf75c0ede7554ff3b4b89d136c642b13","observation_id":"2ccaca33-0688-4d4b-8172-94945f028fca","resolution":{"observed_at":"2026-08-06T22:03:06.444804Z","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-06T22:03:06.578405Z","title":"On selecting a maximum volume sub-matrix of a matrix and related problems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:06.578405Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:479c2bf7b0ac8f4ba1cc429757ae519898dc68fe59eb4320b29c073498467ce7","observation_id":"0ae574ff-1680-4b2e-b875-8db19df8f734","resolution":{"observed_at":"2026-08-06T22:03:06.578405Z","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-06T22:03:27.807987Z","title":"Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation","venue":null,"work_id":"864b1fa8-8b02-4881-8379-4d90bf2cb871","year":2024},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:06.726105Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:4baf1164a09ea87e4f3a4388e76cfe5a3f78bbb8aaf92178e5f0f4d336103cd2","observation_id":"59f8a054-b6b4-46a6-84c4-c24fa61f279f","resolution":{"observed_at":"2026-08-06T22:03:27.891357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:27.613772Z","title":"Determinantal point processes in randomized nu- merical linear algebra","venue":null,"work_id":"3a92b915-56e6-4c93-a602-e3f9a0298454","year":2021},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:06.901732Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:233d8e39851f08b9c25b89b7c6d50fd9877da86e3586e6eb41c2dea568c98884","observation_id":"c302c891-a47e-4914-8704-7d09e6f1775e","resolution":{"observed_at":"2026-08-06T22:03:27.715102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:27.457026Z","title":"Optimal state-space lumping in Markov chains","venue":null,"work_id":"165c4d72-dcc2-4919-b1cf-558d0e88d9e3","year":2003},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.007924Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:2816eaea4659a1de25319120b68db874b2861705e57896877628f37c17c99bb8","observation_id":"ea27d0e7-473c-4e1f-9734-fc28a4fb52ec","resolution":{"observed_at":"2026-08-06T22:03:27.523399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:27.278862Z","title":"Efficient volume sampling for row/column subset selection","venue":null,"work_id":"d31124a3-7d4d-4431-97d0-78f9735acf98","year":2010},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.103027Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:663e6e29afd9ea7e0e9263144f6d374c218d4eacf6a97f977559e57b83b4498a","observation_id":"83050046-8a4a-4faf-b3c4-b11299ae2d8f","resolution":{"observed_at":"2026-08-06T22:03:27.390087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:27.097722Z","title":"Adaptive sampling and fast low-rank matrix approxima- tion","venue":null,"work_id":"3dd0141b-4c62-4e97-a80f-41384732127e","year":2006},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.267783Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:5dd3095ad63d05011eca98c32261c57b19f33eea3f1d92decbca199933ce5125","observation_id":"d5be9d44-53d8-456a-bf79-1c2e58da913f","resolution":{"observed_at":"2026-08-06T22:03:27.164040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:26.847518Z","title":"Estimating the eigenvalue error of Markov state models","venue":null,"work_id":"3a40ed12-3809-471e-9358-738cbb36b9b0","year":2012},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.430405Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:64167b7166f590a14aad03f1499b00adcbba50ffcfae511aaf18033fbdf002e1","observation_id":"4540d240-fc61-4536-b10c-6912feb2b63a","resolution":{"observed_at":"2026-08-06T22:03:26.977098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:26.673277Z","title":null,"venue":null,"work_id":"9dafda4d-aaa9-41c1-9b82-31f6d6763e60","year":1984},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.616229Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:b85c51dd379d795a2776ede35fb61a3c0f62007417b1da827c1d91669479ece5","observation_id":"0a5905b7-d622-4d4c-9469-98fdebb27483","resolution":{"observed_at":"2026-08-06T22:03:26.755648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:26.504076Z","title":"On the Nystr¨ om method for approximating a Gram matrix for improved kernel-based learning","venue":null,"work_id":"1f2a0d7c-f414-4a17-bf83-ae22a86f34cc","year":2005},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.748308Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:cead079f2b42d9afc96f0973df0f45142f410c8410fa8f6585d3960866aee8e7","observation_id":"6d6c9e63-ad11-467a-84de-770721f06ffb","resolution":{"observed_at":"2026-08-06T22:03:26.586832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:26.311711Z","title":"Lattice QCD at the physical point: simulation and analysis details","venue":null,"work_id":"e97da37e-d4ed-4cab-8805-28ecd16b3485","year":2011},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.854232Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:357a4b81d1be9536bc938c5b97beb46a94d8ca00062465dfbbdda8f2045cec8e","observation_id":"2e5b972e-f684-45ae-b291-080a25fff50e","resolution":{"observed_at":"2026-08-06T22:03:26.390381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:26.146034Z","title":null,"venue":null,"work_id":"47e1ba3e-74be-4a13-ac14-984e325f6459","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:07.935096Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:e86109bbd7c2e64d5d8d017765eeebb0d2f0b4d106e72127a1073bef18bfaf8e","observation_id":"a2a3787f-076d-4e82-97e8-58f024d52fe1","resolution":{"observed_at":"2026-08-06T22:03:26.221979Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:25.958059Z","title":"Modeling molecular kinetics with Milestoning","venue":null,"work_id":"2a29d95d-23ba-45b0-ad54-45d4d60e7b30","year":2021},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.039590Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:87c03a34b646a5cce9b3c221fc3624bd6a79b0ed0b32d2e73e527ecd01581bb4","observation_id":"57e5b5be-4234-4238-b1ba-2ab23d9ed5dc","resolution":{"observed_at":"2026-08-06T22:03:26.037895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:25.772083Z","title":"Computing time scales from reaction coordinates by mileston- ing","venue":null,"work_id":"5e8e7df9-2861-4b54-8842-88f9882f2f7f","year":2004},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.116122Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:1a26a374e5fef4c089c353668e5202354d2fd83ac0f0bdec3f57f1ffb936e868","observation_id":"a3eed962-4f87-44a5-8ba7-3bed3c0e418e","resolution":{"observed_at":"2026-08-06T22:03:25.875416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:25.561494Z","title":"RNA folding at elementary step resolution","venue":null,"work_id":"5ef89d73-cea9-44de-8ac1-dc33e6754d41","year":2000},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.216227Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:0fcda7d7f53e9a8a541fd6537621019e37980563b9869aeff01634476cd82664","observation_id":"19617fbc-fbe0-4a7d-a881-a1ec9d7cd319","resolution":{"observed_at":"2026-08-06T22:03:25.677157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:25.377092Z","title":null,"venue":null,"work_id":"20668450-9789-4b92-b4c1-6858ffd94b47","year":2024},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.295405Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:c044def756acceb955ac0a171591297de7118cac4f9408f6e5d9b87462c38c3f","observation_id":"28c4933a-c971-4354-a931-ffe82dfcb03f","resolution":{"observed_at":"2026-08-06T22:03:25.467597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01698","last_updated":"2024-08-07T22:31:10Z","snapshot_observed_at":"2026-08-12T23:31:00.456251Z","submitted_at":"2024-07-01T18:10:19Z","title":"Column and row subset selection using nuclear scores: algorithms and theory for Nystr\\\"{o}m approximation, CUR decomposition, and graph Laplacian reduction","version":2},"cited_work":{"arxiv_id":"2407.01698","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.01698","snapshot_observed_at":"2026-08-06T22:03:14.717822Z","title":"Column and row subset selection using nuclear scores: algorithms and theory for Nystr\\\"{o}m approximation, CUR decomposition, and graph Laplacian reduction","venue":"math.NA","work_id":"5c9e380b-6852-4d0e-aa6a-113e4871f15b","year":2024},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.391535Z"},"links":{"cited_paper":"/paper/2407.01698","citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:ca6e32fd2f861016ed6b7e312697325a0485247acb8ec528f748e340e471671b","observation_id":"6e04c5b3-f2a4-488d-8217-e63d5b0f9f1b","resolution":{"observed_at":"2026-08-06T22:03:14.783224Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:25.203067Z","title":"A Unified Dynamic Programming Frame- work for the Analysis of Interacting Nucleic Acid Strands: Enhanced Models, Scalability, and Speed","venue":null,"work_id":"07b8f676-3aa3-4e6e-aab6-d19312303dbc","year":2020},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.468959Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:6061ba551d12bc5e72f6db300953a445822cc0d428e9e4b280684308735ae950","observation_id":"ac6b6ff2-86d0-4f7e-a353-a0b537b09ca4","resolution":{"observed_at":"2026-08-06T22:03:25.274457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:25.071136Z","title":"NUPACK: Analysis and Design of Nucleic Acid Structures, Devices, and Systems","venue":null,"work_id":"98af037d-8027-4d20-835b-7714e38ea3a9","year":2022},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.566384Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:30c51aec594caadf5b9c5862903cc3d66381813a563e5ab2d7adb1e9c7141fc1","observation_id":"b5c1affa-40a7-423e-850b-b1cdb30af8ae","resolution":{"observed_at":"2026-08-06T22:03:25.119852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:24.882594Z","title":"Computational methods for simulating and parameterizing nucleic acid secondary structure thermodynamics and kinetics","venue":null,"work_id":"eddb9b32-149f-471b-882b-406880be3fef","year":2022},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.672556Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:21992808a52c8f9b62c147188c20c0d86ac261003a35b5d09a04ed08a3f3ef97","observation_id":"a713f0d7-dd90-4952-98a2-8fea24b005d3","resolution":{"observed_at":"2026-08-06T22:03:24.975002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:24.699821Z","title":"Frenkel and B","venue":null,"work_id":"3bec9feb-e309-40e2-abc1-c5d1a193e16f","year":2023},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.779476Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:3082d8c81f1f72241ea2e7853afe23bc44193891c785b67761bd43e26fa91a34","observation_id":"e287866c-5381-4bd9-8a14-2a8f5a2e088b","resolution":{"observed_at":"2026-08-06T22:03:24.787457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00709","last_updated":"2023-06-14T08:26:46Z","snapshot_observed_at":"2026-08-13T12:34:08.050361Z","submitted_at":"2023-03-01T18:07:51Z","title":"Robust and Practical Solution of Laplacian Equations by Approximate Elimination","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00709","snapshot_observed_at":"2026-08-06T22:03:08.883092Z","title":"Robust and Practical Solution of Laplacian Equations by Approximate Elimination","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.883092Z"},"links":{"cited_paper":"/paper/2303.00709","citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:041be5cf4d4d8cd69f4553c4dcd975b516f3c88cd1d8cf00ed2f21db710fd014","observation_id":"fb9b7213-e985-478a-8c59-b68258553e49","resolution":{"observed_at":"2026-08-06T22:03:08.883092Z","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-06T22:03:24.525392Z","title":"Strong rank revealing Cholesky factorization","venue":null,"work_id":"8c4c995d-b13e-4807-aa0a-87a857a61d8d","year":2004},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:08.998581Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:f7f3dc1f40e284e61567075f8027dcbc4be980094719b5f3ade6d41ddbe39213","observation_id":"53587b3e-c8b6-4cc5-badc-5a354132e977","resolution":{"observed_at":"2026-08-06T22:03:24.611233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:24.353158Z","title":"Optimal Column-Based Low-Rank Matrix Reconstruc- tion","venue":null,"work_id":"33bea512-f4b8-4a82-97c5-70aeed49e40f","year":2012},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.105274Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:5bcecda6106ca9eb8b7c4c40e2a64df221ee67c73a179b151e361fd12fdffc09","observation_id":"c0d796ac-c56e-42e1-9fe3-588e20df1017","resolution":{"observed_at":"2026-08-06T22:03:24.433912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:09.205014Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.205014Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:adb939f025b7aac7fb0510d9d4cd8bdd8e178f9c455790a7ad9191e4a4bd3311","observation_id":"cc57531c-2be8-4836-b9dd-3b2d15c601dc","resolution":{"observed_at":"2026-08-06T22:03:09.205014Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:24.187681Z","title":"Optimal dimensionality reduction of multistate kinetic and Markov-state models","venue":null,"work_id":"8fc538ab-29c7-43e1-a3cd-207fd0e51faa","year":2015},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.298775Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:16533ec265d967e3dbfa2f49c8037bccb759fc3abb7958c4dfcb423ba18c10f7","observation_id":"c227c4c2-5118-4c3b-9b25-d2832e53fdcf","resolution":{"observed_at":"2026-08-06T22:03:24.266466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:24.044352Z","title":"Markov State Models: From an Art to a Science","venue":null,"work_id":"3631e44d-7b18-45fd-be80-327f09c4528f","year":2018},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.408417Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:2535d5ec25de7e71539fe13e830da7a0d431f2b1b9eb121c246611d6104010bc","observation_id":"cf25c5f1-5d07-4f94-b048-3d9db984c348","resolution":{"observed_at":"2026-08-06T22:03:24.100239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:23.883503Z","title":"Jacobsen","venue":null,"work_id":"f06ed338-8d9e-4a50-9b0c-d9c488965407","year":2005},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.498434Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:9f781c03a92821b504a39d622db4bd2b18eb64e14b6e7695db121caa4ecd80bd","observation_id":"d4d513b4-f224-4649-a1fe-3872a8550725","resolution":{"observed_at":"2026-08-06T22:03:23.967519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:23.690436Z","title":"Markov State Models of Molecular Simulations to Study Protein Folding and Dynamics","venue":null,"work_id":"7f7bad14-32b9-4a1a-b57d-8063b2622ea3","year":2023},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.664105Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:2a82dd89078749b349a3986a620c5031299f14624962ea4b3c7c2065e5efcf64","observation_id":"48f72cc5-96f4-4aa7-8d65-8719b6cae82d","resolution":{"observed_at":"2026-08-06T22:03:23.778279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:23.450001Z","title":"Rarity and Exponentiality","venue":null,"work_id":"673f00a7-59db-4cc9-9ccf-7dc5a5f8f19b","year":1979},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.796529Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:6afab97dfc50a7b6fe69360609f223e87c896e6d1b847dd5ef24576f25b9bff1","observation_id":"314b3c6d-0ac8-40ca-b834-0970ee622555","resolution":{"observed_at":"2026-08-06T22:03:23.587776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:23.250311Z","title":"Correlation functions, mean first passage times, and the Kemeny constant","venue":null,"work_id":"aabd445c-e466-4322-9092-3b37679222c7","year":2020},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.905340Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:68174f048b9f818191435cc4b8f4c9b3ce5250507074905a1bf51aba82e84fe4","observation_id":"697bf21b-face-41db-8877-52bd2ea30854","resolution":{"observed_at":"2026-08-06T22:03:23.356789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:23.034689Z","title":null,"venue":null,"work_id":"d48f2acb-e166-4c3f-8258-b236d98cf24c","year":1976},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:09.977531Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:2094a46f4a61c118fa05f212ee805c6508a19b99e989b2f7e1971a132bf500e6","observation_id":"137add2f-1d92-478a-887d-08c8babc7bbe","resolution":{"observed_at":"2026-08-06T22:03:23.140779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:22.791195Z","title":"Approximate Gaussian elimination for Laplacians - fast, sparse, and simple","venue":null,"work_id":"c0c1b894-f2ec-4eaa-8060-0ceb6a8d1253","year":2016},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.098001Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:f7b09ab4ff93d6b8af656874e1b745bb5a2bd2fe691b198a7e10cc3cdbdce72b","observation_id":"46952170-4540-4c65-bf14-9026405d0b73","resolution":{"observed_at":"2026-08-06T22:03:22.876792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:22.576056Z","title":"Leskovec and A","venue":null,"work_id":"a83393d8-1ce6-4742-805c-75a79f374dbe","year":2014},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.216726Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:8825794e4112f209acef198107dab9e751ed7e50c2a38c4718f18d1fc35dfa7a","observation_id":"d892db38-b72c-492f-b505-5d9137f7581f","resolution":{"observed_at":"2026-08-06T22:03:22.657981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:22.389188Z","title":null,"venue":null,"work_id":"96d761d7-af08-4e38-a1b6-b87c5ec9fc47","year":2009},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.304620Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:5f3d53e6a36e088fce266cd53e39971bd995d118c077127516cd93f2d9b11296","observation_id":"5c53d178-db7a-46a1-b746-fd971d447d34","resolution":{"observed_at":"2026-08-06T22:03:22.470165Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:22.181572Z","title":"A mathematical theory of optimal milestoning (with a detour via exact milestoning)","venue":null,"work_id":"dd7926c9-7055-41ff-b96b-c6da404c1d3e","year":2018},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.365970Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:268d5645278b95ac4c286dac52f7523bf4a4598161929de14f3e0b5906320dcd","observation_id":"886c4f8c-f411-4007-9825-2de2739035a0","resolution":{"observed_at":"2026-08-06T22:03:22.289909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:22.020484Z","title":"Integrated variational approach to conformational dynamics: a robust strategy for identifying eigenfunctions of dynamical operators","venue":null,"work_id":"77929157-bf1c-46bf-95b6-bfdffe216c5e","year":2020},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.454109Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:38e11f8726296a0a3df1bfa4d586ac8807c8a18f02e3889cea58f969edfebd04","observation_id":"c48c2128-8b88-4b41-bc6c-1193b4f0859c","resolution":{"observed_at":"2026-08-06T22:03:22.084537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:21.843057Z","title":"CUR matrix decompositions for improved data analysis","venue":null,"work_id":"35c59905-6132-4deb-96c0-5b5b93b5eeb5","year":2009},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.515472Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:28c84489ba959db6c2d9299760098f77228d9bf9c9bce8edd5e15219e64147f4","observation_id":"57cd2216-9354-449e-aa31-ccaa2058784f","resolution":{"observed_at":"2026-08-06T22:03:21.946993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:21.676867Z","title":"Variational cross-validation of slow dynamical modes in molecular kinetics","venue":null,"work_id":"ff03cf31-dd7e-4f3b-b33f-0e6786afa7e5","year":2015},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.597003Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:683fee7fb14bee4b8398ef6462b696da6ca55ccb3bb647385ca808a9cf2776b9","observation_id":"734cac52-6b4b-41c7-b93c-1387cff71315","resolution":{"observed_at":"2026-08-06T22:03:21.742644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:21.482987Z","title":"Hutch++: Optimal Stochastic Trace Estimation","venue":null,"work_id":"57bfdcea-1211-4543-add9-9dbcaae1f7d1","year":2021},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.678420Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:d28a48a404cd9d4505efc1a26dd0be8da829296506445825070add0ca23613e5","observation_id":"77961ee2-7f48-451e-8dff-8474c4e54340","resolution":{"observed_at":"2026-08-06T22:03:21.601201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:21.235058Z","title":"Everything you wanted to know about Markov State Models but were afraid to ask","venue":null,"work_id":"4a0cb421-f38f-42da-b4fb-9fd4db109f96","year":2010},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.741326Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:66d653fcc9e2b74a3f1e603f8286121eb619774a553da4d898dd48d9d5c74054","observation_id":"8fd1e3c0-df81-498c-bd28-9adcfe63df9a","resolution":{"observed_at":"2026-08-06T22:03:21.339951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:20.942794Z","title":null,"venue":null,"work_id":"70213667-0e55-486d-b455-c50001229236","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.843416Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:fca990c5d2c8cd172c9803669672fd6cd92ba36bca39ba68ea4395660c18f850","observation_id":"b9f2ac5b-a946-48a5-8b0f-da3264db5826","resolution":{"observed_at":"2026-08-06T22:03:21.087695Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:20.654269Z","title":"Validation of Markov state models using Shannon’s entropy","venue":null,"work_id":"d968cf42-e4c8-428d-bcfa-96fa4873cc65","year":2006},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.902950Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:1eb37372ca9499e9bbdcf88948f9c4cdb7c7bb0d40239b2e9712f29a2658971e","observation_id":"cd3f87f1-5bd6-4882-a476-5479701ab47b","resolution":{"observed_at":"2026-08-06T22:03:20.783124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:20.282430Z","title":null,"venue":null,"work_id":"5c31a7fd-a7d8-4f75-a48a-a1a089e23cd2","year":2000},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:10.973647Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:aab37dfd750943f5a7b57549ae8cf08605589fddc1e21074d3430d0a16b74336","observation_id":"17601ef2-f994-44f6-b0ad-5850d2fa539c","resolution":{"observed_at":"2026-08-06T22:03:20.461408Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:20.156192Z","title":null,"venue":null,"work_id":"c8a67991-120b-40e3-bab7-a566c06e4e44","year":1983},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.054298Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:4051033f0b8fbcc9cc9ed7e65f767131e131ef28263bf2b4680cb95b1156aa1a","observation_id":"73db206b-488c-4a02-985b-87966d846b04","resolution":{"observed_at":"2026-08-06T22:03:20.230650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:20.030782Z","title":"Multi-Scale attributed node embedding","venue":null,"work_id":"c1299f49-67e7-4e93-aa9a-a6a806395561","year":2021},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.133227Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:8001c674880fb49d4de8ef2787bb4fd4e74029761082a9ba57dabe8ed87c6e4f","observation_id":"cf8b8f37-31e7-49a4-8358-1bd9f9ff0d85","resolution":{"observed_at":"2026-08-06T22:03:20.069494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.946973Z","title":"Armadillo: a template-based C++ library for linear algebra","venue":null,"work_id":"6ddec16d-f8cb-45d0-b20f-e5a8a90290a2","year":2016},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.195753Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:ff4117554cf7f63ce6f950129444d06f2e2c054b308503136fc23fd3d60e84b8","observation_id":"78f1ebd8-2f91-4c15-95c4-aea60a3f89ba","resolution":{"observed_at":"2026-08-06T22:03:19.981072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.865240Z","title":"Practical Sparse Matrices in C++ with Hybrid Storage and Template-Based Expression Optimisation","venue":null,"work_id":"98742c8f-6f3d-43a3-a79f-dcccb57c9f23","year":2019},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.300157Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:b7c04e7c6861bca00cd2b56a0ed356c113291fead418df02e2bd440dfb3d8da1","observation_id":"6c9f4b02-72f2-4745-ac28-4822e05ead0b","resolution":{"observed_at":"2026-08-06T22:03:19.900013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.764913Z","title":"On the approximation quality of Markov state models","venue":null,"work_id":"6de6ce3c-a75f-4851-9f81-edf90bbb4737","year":2010},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.395794Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:71d0cf712113f6d406594c42f244fba0c59db69386968d30b7671225981c0438","observation_id":"390b0aeb-dcab-4f83-b464-71d1a768d984","resolution":{"observed_at":"2026-08-06T22:03:19.806525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.648839Z","title":"Stochastic simulation of the kinetics of multiple interacting nucleic acid strands","venue":null,"work_id":"61b51d3a-2b17-4b12-b232-75ff2ed6bb95","year":2015},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.468860Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:092233c88f61e0fe12ac3f12f8aa4ea04c5bc4e2883f9c681315eac801908535","observation_id":"6b292366-414e-4edc-be66-ae870f6f3f3d","resolution":{"observed_at":"2026-08-06T22:03:19.697193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.535973Z","title":"Uber eine Klasse von Mittelbildungen mit Anwendungen auf die Determinanten- theorie","venue":null,"work_id":"ca5970bd-26f7-4ea9-9ec5-f2e5473a7c69","year":1923},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.544004Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:9c7bb09538238748b8f8e04473daa1eb4f284206a8ff51cdd84c76f9a9e630b6","observation_id":"5050dd6c-c52d-40f5-b046-892710270fd8","resolution":{"observed_at":"2026-08-06T22:03:19.593316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.367074Z","title":"Markov state models based on milestoning","venue":null,"work_id":"dff30eee-ecb9-4a19-b4b4-036905977c07","year":2011},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.671269Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:1b6d6d02e998b20f865a0ec5d63555125b05aa7dfee2b2675e92e60d9f5d43f3","observation_id":"0e8c935b-8d1b-44e1-b01d-c780a4693cf7","resolution":{"observed_at":"2026-08-06T22:03:19.442536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.286035Z","title":"Improvements in Markov State Model Construction Reveal Many Non-Native Interactions in the Folding of NTL9","venue":null,"work_id":"a7544bbb-fd1f-4a48-bb62-924ec1ecdafd","year":2013},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.761634Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:b8c6412ca326e06f77873cce7a338534174c20000aef7558e80d73549bd210ad","observation_id":"ba48a197-d802-4a67-a672-aaf727af7f4a","resolution":{"observed_at":"2026-08-06T22:03:19.315860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.145334Z","title":"Column subset selection is NP-complete","venue":null,"work_id":"f47e5442-87a5-4f8a-b3cc-babe1ac0858c","year":2021},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.843503Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:110dc5e4e451f5e0151ab60e5f1703cd4c911d280a3b81a1dc33b4b71d08278f","observation_id":"a0cd784f-7977-4390-bb76-aafe593a688e","resolution":{"observed_at":"2026-08-06T22:03:19.223182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:19.029012Z","title":"Markov state models provide insights into dynamic modulation of protein function","venue":null,"work_id":"4d1bb4fb-018e-4cad-99b9-a97b9d1af858","year":2015},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.906887Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:f936261daf67668f8e7afef45944ed071ecd6bd9e4f56e2789e7d14bcdf3e28f","observation_id":"52437a24-b6f3-43b6-94bc-64984d2b785d","resolution":{"observed_at":"2026-08-06T22:03:19.083849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:18.901744Z","title":"A family of face products of matrices and its properties","venue":null,"work_id":"3c39505c-70c9-4887-b8cd-c58ed99661cd","year":1999},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:11.985081Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:ca412af947a8736d6f79458f9a3f2604886db558c8c1cefb05fd2f3030c5ff74","observation_id":"2cf43ac0-ff45-4bbf-99f1-3d0bc8e35eb5","resolution":{"observed_at":"2026-08-06T22:03:18.935911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:18.759527Z","title":"Randomly Pivoted Partial Cholesky: Random How?","venue":null,"work_id":"8691b64a-6e11-49a4-8249-61e3d6f6b2e8","year":2024},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.068788Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:b18769508ca5d76e0d5a635eeaf16928508312e1002d5cb43ef2979a70de4251","observation_id":"663dbef3-e65f-4822-833c-56927a170f21","resolution":{"observed_at":"2026-08-06T22:03:18.833153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:18.574032Z","title":"Stochastic simulation in systems biology","venue":null,"work_id":"260683e0-cf11-4429-ac7a-1d31c1c7cf54","year":2014},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.151318Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:44f9ed93599fe7b0cd3d80aa6134dc2cdc87501a49c03803971cc84dc174ec46","observation_id":"c8553f30-8a69-4bfd-af16-a65632f1cc6f","resolution":{"observed_at":"2026-08-06T22:03:18.658292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:18.397986Z","title":"Galerkin approximation of dynamical quantities using trajectory data","venue":null,"work_id":"6b0269dd-0aff-4a2a-b05d-e249547f8f5c","year":2019},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.236427Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:fe7d0b8ed3aa2b255b77318ecc5910d631c7d96bc5d0eeae6d6a524d3001ddf3","observation_id":"8bdc4243-c92b-46bd-9f7c-58676e4e08bf","resolution":{"observed_at":"2026-08-06T22:03:18.470356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:18.231100Z","title":"Simple O(m log n) time Markov chain lumping","venue":null,"work_id":"c1972025-17ad-4dc1-b26f-30456b908cf7","year":2010},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.302262Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:17d9bd758afb70351f33cc507c6a0f25d1775a78e6ab90af185c5490ab316e59","observation_id":"c3ae34ad-f207-4647-8b52-0660015e1755","resolution":{"observed_at":"2026-08-06T22:03:18.326902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:18.024093Z","title":"On the assumptions underlying milestoning","venue":null,"work_id":"bfcc186b-cee7-470c-bba9-74a21e647999","year":2008},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.383912Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:25c179301d68d3561867f77b9886687d99a56ea211589b418f61990c99e9c4d4","observation_id":"0bea6325-c0e0-452c-994f-e678dfa58896","resolution":{"observed_at":"2026-08-06T22:03:18.111475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:17.862265Z","title":"Error bounds for dynamical spectral estimation","venue":null,"work_id":"afaa56dd-0310-4f56-9a4c-499e4df02301","year":2021},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.450401Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:270a0ff2d73162997ebf1c73c6f07ce66ec1c7eb4f09295db4c337804f3fa3a6","observation_id":"121def1c-7d7c-47db-821e-1edc074d814f","resolution":{"observed_at":"2026-08-06T22:03:17.943361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:17.702838Z","title":"Using the Nystr¨ om method to speed up kernel machines","venue":null,"work_id":"0165f9c3-5f2a-44ca-9d86-e2e33ce9cb1e","year":2000},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.547395Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:6bf28d8441fc6eda29c59298f5f88e2cfaeb97e476fc11b4459078ccfb9be9e4","observation_id":"17e9bbb5-06fb-451d-af7c-0684855838a6","resolution":{"observed_at":"2026-08-06T22:03:17.791180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1063/1.4802007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Hierarchical Nystr¨ om methods for constructing Markov state models for conformational dynamics","venue":"The Journal of Chemical Physics","work_id":"7a6cdd01-282b-4cba-9c44-3257470854dc","year":2013},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.668889Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:ab85d41aecd77fa50e8d4e1bf9503a03ff94ee3a26b5ae10a5eee1272261b8c0","observation_id":"2b905d0a-5d61-41b3-bdff-7df9acd6a5a7","resolution":{"observed_at":"2026-08-06T22:03:14.322911Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:17.529243Z","title":"Fast and accurate interpolative decompositions for general, sparse, and structured tensors","venue":null,"work_id":"13ad09bd-27ee-464d-9cde-746aff21d989","year":2025},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.757087Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:abfac1213c1a20391ed8d79c57e7e1b11ea3cab6e7231ada2c11b6d9adad26f3","observation_id":"81dc9855-996e-4747-8c79-c8bc5c08e158","resolution":{"observed_at":"2026-08-06T22:03:17.606482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:17.426773Z","title":null,"venue":null,"work_id":"480da4c3-8761-4c77-9f85-c1c3cfb323bb","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.842733Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:dca54a7ecf55b329c14adecb8cd9e44d6111e420db56b8be817b771454bda1ec","observation_id":"f17dd0a8-54ce-4325-8397-9a4906b03425","resolution":{"observed_at":"2026-08-06T22:03:17.470378Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:17.235629Z","title":"the first return to j after hitting any one of I","venue":null,"work_id":"0023d22b-9764-4d06-a6a3-4a9a06d950e3","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:12.938446Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:f96fbaba0094de2b8b43858b24e27124f3cc7b4a3c015486dc317451c919190f","observation_id":"ef818bab-bef0-418a-8723-e25bd989f0fd","resolution":{"observed_at":"2026-08-06T22:03:17.343191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:17.072980Z","title":"More precisely, − ˆR−1 i,i = E(τ I \\{i} | X0 = i)","venue":null,"work_id":"8712be06-0a5e-40e6-b330-b35f4b888288","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.002921Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:a020585812d7a13beebd3335138a9a4705938242a099832e2a738d6a24d9f463","observation_id":"225616b8-1757-4eb6-af34-15ebe816a84f","resolution":{"observed_at":"2026-08-06T22:03:17.126162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:16.935585Z","title":"More precisely, − ˆRi,j/ ˆRi,i = P(Xτ I \\{i} = j | X0 = i)","venue":null,"work_id":"5bc14e54-24a0-4d8e-98ad-05c6a4888cf8","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.069670Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:d79add1d647441950d49141f0f7252b6e4ba5226b55ddba7b79b792e4c33d921","observation_id":"1ea7f8f3-adf9-411a-bc9e-5d9b069fbfa7","resolution":{"observed_at":"2026-08-06T22:03:16.992685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:16.773984Z","title":"More precisely, ˆπi = P(Xτ I = i)","venue":null,"work_id":"a31746d6-cf82-46f6-9627-63264285fbb8","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.183850Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:dc3a2e8c84eb9aaf3bae09c55e99f7a18be6308739538c89033b6c00f0dcf696","observation_id":"8731a07f-0c26-48c1-a662-94b5ec98a969","resolution":{"observed_at":"2026-08-06T22:03:16.834773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:16.597863Z","title":null,"venue":null,"work_id":"39a8b732-4223-4d0e-b8ea-6062903dc390","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.301083Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:7f4791d78c5dfe8ab95fd0a01e967c5841c3ff0b496b2dff2d396440b6c1e05c","observation_id":"10503313-c44b-4f65-8cc5-eff9ab6f5435","resolution":{"observed_at":"2026-08-06T22:03:16.693215Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:16.451939Z","title":"Given this approach, the probability 50 of the chain not having reached I \\{i} at time t is: P(τI \\{i} > t| X0 = i) = lim β→0 lim α→∞ Ii,: exp (R − β1π⊤ − αI:,I \\{i}I⊤ :,I \\{i})t","venue":null,"work_id":"078097f3-0aae-4259-ba58-6eae4390f4b2","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.380388Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:aa67b0a76bcda67d7c1af3277f924a794681b12f74f9be418248b4909a30e8ae","observation_id":"156ea42c-f61d-4677-92bd-60d6f70bdf55","resolution":{"observed_at":"2026-08-06T22:03:16.515908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:16.305321Z","title":null,"venue":null,"work_id":"102bf25a-d6e0-4d80-b45b-d4409ea9797e","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.469281Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:33dba38666474eb1979258e2a954e3bb5d57b2fece729cb9c18e4aaefdc97a74","observation_id":"6d40481e-59c1-49e0-9242-6bca43a3a6af","resolution":{"observed_at":"2026-08-06T22:03:16.370690Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:16.117433Z","title":"The rates between marked states ( i, i) → (i′, i′) are inherited from the rates i → i′ in the original chain M","venue":null,"work_id":"86fa3427-1dc0-4765-98ef-fce8b48bf4ec","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.560919Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:bfbe701dc0ffe81286508775b7929f66dd723cf7a6930d03bebe6241739343dd","observation_id":"05219ef3-9d90-4d7f-ad18-03365d79fcb6","resolution":{"observed_at":"2026-08-06T22:03:16.213858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:15.940934Z","title":"The rates between unmarked states (i, j) → (i′, j′) are inherited from the rates j → j′ in the original chain M when i = i′, otherwise they are zero","venue":null,"work_id":"7c30dc89-62b4-4b02-821c-bebc24de99cf","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.667480Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:607c99e3a16e4cdd2401a48a0e7740e8af2c8157a2fd695324d1608ed5afeb1e","observation_id":"c7a05a3e-716f-45cb-9b78-4777f9ce624a","resolution":{"observed_at":"2026-08-06T22:03:16.005937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:15.778643Z","title":null,"venue":null,"work_id":"15a0dc2e-079f-4731-9d12-89e932d9f641","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.746220Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:03da19dde2cb257358d7129d0328afdf6f0c8094758364483b8ea189211962e5","observation_id":"21b5241f-e950-48c2-8303-1816c7c86dff","resolution":{"observed_at":"2026-08-06T22:03:15.850246Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:15.543148Z","title":"Any unmarked state ( i, j) is allowed to transition to any marked state ( k, k), with a rate inherited from the rate j → k in the original chain M","venue":null,"work_id":"961adc49-0850-4400-a21e-00a73da34066","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.859232Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:046fbc7522964d29d13c4ec246537f7433f823b10aa38f4e2067585cba621b36","observation_id":"b58dee61-386a-4c77-bae2-96a7736c67f6","resolution":{"observed_at":"2026-08-06T22:03:15.658737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:15.357067Z","title":null,"venue":null,"work_id":"a374247d-2436-4aab-88a2-df2a629b0ec0","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:13.988235Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:7513101dc389f8c81a749cb599a155e4a1c26bdc2983ef584bd1adbeb488c1bf","observation_id":"b15f4b05-cdf3-46dc-9b7c-cb370019ce46","resolution":{"observed_at":"2026-08-06T22:03:15.455180Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:15.141074Z","title":null,"venue":null,"work_id":"694e27f5-4e93-4820-b94e-1f4e2be83537","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:14.066974Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:65741a9ac261d6d06fc75dbae94947f623974198adfca00df0d87cb1f56d97c5","observation_id":"43194737-6001-4a9d-94ca-b30ca69fd7b9","resolution":{"observed_at":"2026-08-06T22:03:15.241550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T22:03:14.899586Z","title":"killed Laplace equation","venue":null,"work_id":"f8c21f61-ae92-4d91-a2f7-1b050e39130e","year":null},"citing_paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:14.112114Z"},"links":{"citing_paper":"/paper/2506.22918"},"observation_digest":"sha256:622f444faeee72024a0d00c310e1157e41144c86ed06c2f2e4517a1015fb7c18","observation_id":"f51b95f9-de98-492e-8b12-20bf823b2ac1","resolution":{"observed_at":"2026-08-06T22:03:14.995087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.22918","last_updated":"2025-08-29T22:45:10Z","latest_version":3,"primary_category":"math.NA","snapshot_observed_at":"2026-08-10T11:38:51.070062Z","submitted_at":"2025-06-28T15:02:48Z","title":"An approximation theory for Markov chain compression"},"reference_resolution":{"displayed":91,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":3,"verified_fuzzy":60},"total_outbound_references":91},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 91 of 91 outbound references and 1 inbound Pith citation observation for arXiv:2506.22918."}