{"as_of":"2026-08-23T11:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2cdfa84492c26634115b947663c29082bbd950081b20c9ff810124621dc291d6","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:24:23.569984Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.01332/citation-record","integrity":"/paper/2608.01332/integrity","json":"/paper/2608.01332/citation-record.json","paper":"/paper/2608.01332"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:24:24.015399Z","title":"Stochastic MPC for real- time market-based optimal power dispatch,","venue":null,"work_id":"c25bd884-52fe-491d-8b71-cc592fe4a98f","year":2011},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.458587Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:e08d0fa67db01baf341764b321c9fa95a8b77e5a666fb099a372480325107368","observation_id":"f9c182e9-697e-40a3-92f7-d50aa96256a4","resolution":{"observed_at":"2026-08-15T15:24:24.019618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:24.001428Z","title":"Dual stochastic MPC for systems with parametric and structural uncertainty,","venue":null,"work_id":"7c5e19ab-5258-4c27-a263-3a91c098ecb0","year":2020},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.463660Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:8eb37ee6f572ec405a83dfa71e4f972776a1ae328f6a953b59021eddb81918b2","observation_id":"5bdb6635-8030-43c0-a2fe-872f2a7156b8","resolution":{"observed_at":"2026-08-15T15:24:24.006008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.467489Z","title":"Interactive multi-modal motion planning with branch model predictive control,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.467489Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:93214105c0ef3e1aa4e391e8874902ae184828f11725234e2e354d2f6c5a0f3a","observation_id":"2affeaa1-95bc-4eef-b2fc-9756283e63f3","resolution":{"observed_at":"2026-08-15T15:24:23.467489Z","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-15T15:24:23.980329Z","title":"Linear quadratic control compu- tation for systems with a directed tree structure,","venue":null,"work_id":"f3693aed-d2d2-4305-947b-d20910f0608e","year":2020},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.470985Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:d10cc4ae287dbded49276a736b34b8bd2f2b49319c9737b2ed6e1e84ab0ec83a","observation_id":"d14de393-9680-498e-88c2-410ba24cb875","resolution":{"observed_at":"2026-08-15T15:24:23.984802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.968746Z","title":"Application of interior-point methods to model predictive control,","venue":null,"work_id":"7a3758d5-db7f-49dc-8fd2-0da7acbfa23d","year":1998},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.474945Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:6f1f3ececa7e85a6ed7d9460d982837a5de93d1aa459d1634fe40f150db8a72d","observation_id":"b43a0d93-ce48-42f6-bdd7-17cde6b2be3f","resolution":{"observed_at":"2026-08-15T15:24:23.972488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.957243Z","title":"A high- performance Riccati based solver for tree-structured quadratic programs,","venue":null,"work_id":"a4d18be0-7959-495f-ae11-1d25f1caac6c","year":2017},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.479049Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:62764ea62682da0116729eaecb935704406c8c7c7605e92ee78d56ab4ac3c296","observation_id":"25306399-c308-44a5-9eb0-ec26f81bea36","resolution":{"observed_at":"2026-08-15T15:24:23.961431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.945521Z","title":"Temporal parallelization of dynamic programming and linear quadratic control,","venue":null,"work_id":"8df9d706-7e9c-4a5c-99ae-d324eea7eeea","year":2023},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.483155Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:87265aab3cb127c24a51e9deac8a5184c275ed9d645d21192e002b7ca47395a2","observation_id":"bb4e2bd7-fdee-4c7b-9476-69527d73b178","resolution":{"observed_at":"2026-08-15T15:24:23.949327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.934093Z","title":"jax-bidirectional-tree-rake-compress: Bidirectional direct rooted-tree rake–compress for JAX,","venue":null,"work_id":"5d867ba1-8d50-41b1-9df2-132d5af05158","year":2026},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.487485Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:e852bfccce5a6707b2224216b9c5f059eda351032511c9b80d86eb5ad6fd6fae","observation_id":"58573697-71eb-48e3-bca2-290bcbfc215c","resolution":{"observed_at":"2026-08-15T15:24:23.937908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.923179Z","title":"regularized_lqr_jax: Dual-regularized linear-quadratic control in JAX,","venue":null,"work_id":"3310051d-ba2f-48da-8312-fa4d29b46f87","year":2026},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.491054Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:c41f71dfcd10828e735ed5e755214a10162219115aa6a0bda9f808615dc23647","observation_id":"c52b5868-6e95-4682-aeb4-35b3a5ec71a2","resolution":{"observed_at":"2026-08-15T15:24:23.927124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.910899Z","title":"primal-dual-lipa: Primal–dual interior-point optimization in JAX,","venue":null,"work_id":"6b95ec69-d60d-405d-ab26-d5f356ce912c","year":2026},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.494505Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:26c32555387ee2b37af597f086de4432373c76e239b8abdd28ee4dde700b733a","observation_id":"c1803d13-584b-4ceb-b2e9-57f56c0f6475","resolution":{"observed_at":"2026-08-15T15:24:23.914958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.897568Z","title":"Tree-sparse convex programs,","venue":null,"work_id":"12ae7ea6-3bf1-45d8-bb1c-c400590af9b4","year":2002},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.498016Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:05904c723ef80d8a7eae41347d958a8b912f4c3a113484fb10145b071de668eb","observation_id":"a363c37b-7dee-4a68-b8cd-8a494e537b01","resolution":{"observed_at":"2026-08-15T15:24:23.901905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.884671Z","title":"A Riccati-based primal interior point solver for multistage stochastic programming,","venue":null,"work_id":"d9149516-3d4d-42ca-ba9e-bb727b1f75c4","year":2002},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.501501Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:e649b1d8a3e19aeba1aac50e29da13dcfae92c1c27253392c21ea07252b2b066","observation_id":"c7efa814-6829-49f6-a0ae-168a6095c115","resolution":{"observed_at":"2026-08-15T15:24:23.889053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.872539Z","title":"A dual Newton strategy for tree-sparse quadratic programs and its implementa- tion in the open-source software treeQP,","venue":null,"work_id":"1e8465c4-e98d-491a-8f9a-772afc360f7d","year":2019},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.505134Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:44f088dce88997ba73bf7da8d41ed6d202517cc7a1bc5365c58da88cb9e26772","observation_id":"32de8aad-6775-4c9f-805b-2256293e3294","resolution":{"observed_at":"2026-08-15T15:24:23.876680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.860433Z","title":"A parallel structure exploiting factorization algorithm with applications to model predictive control,","venue":null,"work_id":"cc6c704f-c22f-406a-b2c6-e7ed37b3a67f","year":2015},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.508651Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:e9dd15a336dc772a12ee18f816d27ca54b6b909751775657b6d6c7c35056c240","observation_id":"b72da6b7-7ecf-4884-9359-d4c5aa72f37e","resolution":{"observed_at":"2026-08-15T15:24:23.864631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.844753Z","title":"Parallelizing LQR computation through endpoint-explicit Riccati recursion,","venue":null,"work_id":"7690e903-cbc1-49bb-bb95-2871a360880b","year":2019},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.512081Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:7e32b1712577cda63eafcf5ffca9c79ad96f2f27f91c6a428c6ecb56e0215812","observation_id":"ac0e3ac1-21ec-4f2c-8c2e-2a2136d0e388","resolution":{"observed_at":"2026-08-15T15:24:23.848640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.16370","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:24:23.673063Z","title":"Dual-regularized Riccati recursions for interior-point optimal control,","venue":null,"work_id":"8fb3fbca-f27c-476b-80e1-0fbcda13b0e4","year":2025},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.515735Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:d8a6ecbc6c0af58f51c9ef2f27aa48083d632378c52e345a0d6cdd6cfe9c5ca8","observation_id":"a9e4b474-66cb-48c4-aa5a-ece78211f6f1","resolution":{"observed_at":"2026-08-15T15:24:23.678843Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.832991Z","title":"A dual Newton strategy for scenario decomposition in robust multistage MPC,","venue":null,"work_id":"8353f0e2-a2b6-4dfc-b44d-26347baef612","year":2018},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.520287Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:57055beb413b97f5deb2f2d83682a2165b86f3142b1f391939184b0f3da9f8bc","observation_id":"a83c9e05-0afb-4896-aeda-3c7652efed21","resolution":{"observed_at":"2026-08-15T15:24:23.837016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.821219Z","title":"Massively parallelizable proximal algorithms for large-scale stochastic optimal control problems,","venue":null,"work_id":"bbb3cf64-3629-4494-8d0d-933f1c7cb675","year":2024},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.523819Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:f37dcb8e65159b5ce5525d6400dc45a58920e5d01102108332dc5c950105fbaa","observation_id":"54d97e9a-ee7d-4822-8034-3190f7e780e8","resolution":{"observed_at":"2026-08-15T15:24:23.825287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.808729Z","title":"A framework for the solution of tree-coupled saddle-point systems,","venue":null,"work_id":"31d1575e-ffd0-41e2-af88-c4362ddce7ff","year":2025},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.527402Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:6aa3268b76439ccdc43feb39f86ce1e1f074d168e9e057cd1ea96392dd9461b3","observation_id":"3c27389e-770f-4d34-81db-7277615ce604","resolution":{"observed_at":"2026-08-15T15:24:23.812792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.796249Z","title":"Parallel tree contraction and its application,","venue":null,"work_id":"7189991f-bb10-4986-b2d3-18767339ca1c","year":1985},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.532131Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:8c9fc3ea92febe31569b10627620a9febef11295874375aa12829686d41da284","observation_id":"47d7b4df-328c-4e4e-ad3e-05c6c7650aae","resolution":{"observed_at":"2026-08-15T15:24:23.800740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.782773Z","title":"Parallel tree contraction, part 1: Fundamentals,","venue":null,"work_id":"20f44ab2-1658-403f-bb61-0278793987dd","year":1989},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.536158Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:d3e156f6014ede2be443b35f2e65ad1d874d9c7a73efed9f626348c64d623585","observation_id":"4ba4c7de-90b9-4e1b-80fd-46334177cdcf","resolution":{"observed_at":"2026-08-15T15:24:23.787526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.768959Z","title":"Optimal tree contraction in the EREW model,","venue":null,"work_id":"4262616a-ae2b-4b54-9add-0912675a3c3f","year":1988},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.539871Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:8034c071a8d79f187ef15c1242132970268f58099870ca46de933c781ef2e653","observation_id":"c7edc267-e667-4983-bd4b-439c0a0df80c","resolution":{"observed_at":"2026-08-15T15:24:23.773340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.756168Z","title":"Logarithmic-time updates and queries in probabilistic networks,","venue":null,"work_id":"8a71f441-c25d-474a-9ae3-05dcfc06f55b","year":1996},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.543674Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:ac07c553760b0aa52da1db726a8eb8529646b2b414c36ef40845ae9d103e1250","observation_id":"8bf7444f-3d7d-4d81-9ccc-9f21c6a82ca5","resolution":{"observed_at":"2026-08-15T15:24:23.759944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.743440Z","title":"Adaptive exact inference in graphical models,","venue":null,"work_id":"647d1952-d5ec-4ecb-b4ad-84919ce355d5","year":2011},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.547594Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:a602ced1d79f9105d30ef1342c4b6a8fa6bd2dab75dcb9b655876d55f1a2b21f","observation_id":"74a348ca-268c-4eaa-88e2-e56a77a50ac1","resolution":{"observed_at":"2026-08-15T15:24:23.747762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13624","last_updated":"2026-08-18T00:28:03Z","snapshot_observed_at":"2026-08-21T23:09:55.935924Z","submitted_at":"2025-06-16T15:53:18Z","title":"Parallel Branch Model Predictive Control on GPUs","version":2},"cited_work":{"arxiv_id":"2506.13624","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.13624","snapshot_observed_at":"2026-08-15T15:24:23.601041Z","title":"Parallel Branch Model Predictive Control on GPUs","venue":"eess.SY","work_id":"e0dd0d5c-8fb5-4e78-8ef5-28d56eec0624","year":2025},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.551071Z"},"links":{"cited_paper":"/paper/2506.13624","citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:37cad416f5083c7f92d549b9929e9765635e422a0ad7c85dafa12b25dad07f65","observation_id":"f449d173-ed1c-4026-beec-850f0a7836c0","resolution":{"observed_at":"2026-08-15T15:24:23.607154Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.731006Z","title":"Alphabetic minimax trees,","venue":null,"work_id":"a539e123-e501-49aa-a72d-7a2918994a4e","year":1985},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.555291Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:c1068120edfdfff32e64de7b8b8a0cbf9887aa69d57cd50e1ad33140795a6d8a","observation_id":"19353efc-e2ed-4af6-b944-288233a64b1e","resolution":{"observed_at":"2026-08-15T15:24:23.734645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.719682Z","title":"Fast prefix adders for non-uniform input arrival times,","venue":null,"work_id":"1b726a03-9d15-4415-9d9a-88057c377fce","year":2017},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.558842Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:22fb7a49f9fc4c6624ddb9b086939395544ecddc81a98783d7e4f0c36c6ce403","observation_id":"2dd4f941-e29b-4d9c-a46a-bc8e5b563103","resolution":{"observed_at":"2026-08-15T15:24:23.723553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.562292Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.562292Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:d5d7ae2a20d339d817357bf43e3d0dbb96b6f0dfb6d9825006033c55bc0316c8","observation_id":"14dd8d9b-191b-4318-af30-dbb708b56043","resolution":{"observed_at":"2026-08-15T15:24:23.562292Z","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-15T15:24:23.700424Z","title":"JAX: Composable transformations of Python+NumPy programs,","venue":null,"work_id":"973d6b2a-b6e1-4810-81dd-f5e16d67a1b9","year":2018},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.565995Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:3cc6fa6920a8437e41b49ed3cee571da0aa1cf5956081ca55322542dfcd62ac3","observation_id":"a0b8716b-741f-4dbc-a2c9-7c7e0db0f441","resolution":{"observed_at":"2026-08-15T15:24:23.704204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T15:24:23.686272Z","title":"Reachability- based contingency planning against multi-modal predictions with branch MPC,","venue":null,"work_id":"19051f55-187b-4a1c-8ffd-9b3ab3704427","year":2013},"citing_paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T15:24:23.569984Z"},"links":{"citing_paper":"/paper/2608.01332"},"observation_digest":"sha256:556aed114a985d01955ed93d97122ea70637cde29b134d6275ae614c4dd54002","observation_id":"f89c5147-7f45-4de0-a1c3-f7a25ffea1bd","resolution":{"observed_at":"2026-08-15T15:24:23.689910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.01332","last_updated":"2026-08-02T15:52:43Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-21T08:33:16.955457Z","submitted_at":"2026-08-02T15:52:43Z","title":"Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":26},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2608.01332."}