{"as_of":"2026-08-09T15:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2299549f705e5440fb0eaa421a98d1f5f7f19ea35a5e66a9f9e9df155e74f512","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:45:51.804265Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2509.19484/citation-record","integrity":"/paper/2509.19484/integrity","json":"/paper/2509.19484/citation-record.json","paper":"/paper/2509.19484"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:45:51.691308Z","title":"CasADi: a software framework for nonlinear optimization and opti- mal control,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.691308Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:e332d3dec85e5606255ba99e5058d58347a639330aca8e0c75b63f2563a6cc21","observation_id":"28b081ff-0d26-46f2-9fd9-5f4c055a3b8f","resolution":{"observed_at":"2026-08-04T15:45:51.691308Z","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-04T15:45:51.696263Z","title":"Control-Lyapunov functions,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.696263Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:6a4e137c53f90d40cff5483589d9c684ccce8a19a28851ed188cee1cb9aabe7e","observation_id":"c62b0b21-1e2d-40f4-a33b-9f30c6463c08","resolution":{"observed_at":"2026-08-04T15:45:51.696263Z","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-04T15:45:51.700178Z","title":"Control Barrier Functions: Theory and Applications,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.700178Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:7147c55f17ab5d2065c35fa6a94b730daf3f0311e570056f40925d21cbe60bc4","observation_id":"7c0407ae-351e-4527-b46c-249b938c89c2","resolution":{"observed_at":"2026-08-04T15:45:51.700178Z","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-04T15:45:51.705014Z","title":"Dantzig,Linear Programming and Extensions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.705014Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:b138ddc34a14fb0773380521e7c04e2605444f14d36f2ed2790abb736e4f96d3","observation_id":"b5f20e83-974c-4fd2-a875-4fd50313555c","resolution":{"observed_at":"2026-08-04T15:45:51.705014Z","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-04T15:45:51.709019Z","title":"Robust Path Planning and Control For Polygonal Environments via Linear Programming,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.709019Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:e563854d9eb3fcf86495aa8211d320a3d2451d37a658f17a8ee11b6ecd0fd859","observation_id":"18a05ed9-5912-484d-b615-7cf893b2ba34","resolution":{"observed_at":"2026-08-04T15:45:51.709019Z","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-04T15:45:51.712922Z","title":"Efficient polyhedral enclosures for the reachable set of nonlinear control systems,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.712922Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:f4a7aa1b6d948877fde79e59f0746257518532536e7d3c0de800149b68bfbe9d","observation_id":"58f9c5b7-86b3-4a39-8004-3ec621bfb317","resolution":{"observed_at":"2026-08-04T15:45:51.712922Z","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-04T15:45:51.721030Z","title":"SciPy 1.0: Fundamental algorithms for scientific computing in python,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.721030Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:026ecbf7171ac7806900086abf23f52e2bc258137123246abc5b24b32828c054","observation_id":"94aafa57-8e1a-47a3-a996-66313bbcc785","resolution":{"observed_at":"2026-08-04T15:45:51.721030Z","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-04T15:45:51.724386Z","title":"Gurobi optimizer reference manual,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.724386Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:14eca2e1cc92d4c3cb459ef0aa7a3a78ad8d8dc749ebc90f5de43cb92e6631b8","observation_id":"9d78f00a-7647-4d43-b8dc-b26919f8d314","resolution":{"observed_at":"2026-08-04T15:45:51.724386Z","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-04T15:45:51.728063Z","title":"CVXPY: A Python-embedded modeling language for convex optimization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.728063Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:05336f6c244bc274eed52cb8967466d44ca46d3d646a008c46fa22a01a57f85e","observation_id":"80f819b7-9180-4136-a3c3-1a7bc182205b","resolution":{"observed_at":"2026-08-04T15:45:51.728063Z","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-04T15:45:51.731348Z","title":"Linear optimization on modern GPUs,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.731348Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:e92381a16a9898c0ffc42c58f1d59141d7d9f859dedc7a9f2a3595022bba06e6","observation_id":"ad4de7c3-3369-4ea2-a19b-4f087e39f430","resolution":{"observed_at":"2026-08-04T15:45:51.731348Z","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-04T15:45:51.734795Z","title":"JAX: composable transformations of Python+NumPy programs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.734795Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:ac10c842f36ce5c6e42fdea61d5779c88fa065670b0bce11afe1f3db4fb7bcfe","observation_id":"aca45ddb-1019-43da-8042-c9cd2d9b932f","resolution":{"observed_at":"2026-08-04T15:45:51.734795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11608","last_updated":"2024-04-30T21:15:59Z","snapshot_observed_at":"2026-08-03T04:15:29.677806Z","submitted_at":"2024-01-21T22:01:34Z","title":"$\\texttt{immrax}$: A Parallelizable and Differentiable Toolbox for Interval Analysis and Mixed Monotone Reachability in JAX","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11608","snapshot_observed_at":"2026-08-04T15:45:51.738195Z","title":"immrax: A Paral- lelizable and Differentiable Toolbox for Interval Analysis and Mixed Monotone Reachability in JAX,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.738195Z"},"links":{"cited_paper":"/paper/2401.11608","citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:be0aad96f977e1208548d070147f49eb456f818bbe3740349e5b08fbaff93b2b","observation_id":"84c16959-4c35-49c3-830c-371847385a38","resolution":{"observed_at":"2026-08-04T15:45:51.738195Z","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-04T15:45:51.741941Z","title":"Kheperax: a Lightweight JAX-based Robot Control Environment for Benchmarking Quality-Diversity Al- gorithms,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.741941Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:745c530e52dbd99a4c2fc359d20068ba42a58f2eaf18523ff65a7c7e9e3355d4","observation_id":"d5665bec-18c4-4b27-a838-6a75d23f9835","resolution":{"observed_at":"2026-08-04T15:45:51.741941Z","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-04T15:45:51.745263Z","title":"JaxMARL: Multi-Agent RL Environments and Algorithms in JAX,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.745263Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:e3b32ccd7fd5f227c6d16a8f501a04d1959868eb7e2e621ce451369223a6b7b2","observation_id":"5b356ace-cef9-4956-811c-edfa7be6d63a","resolution":{"observed_at":"2026-08-04T15:45:51.745263Z","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-04T15:45:51.748781Z","title":"The DeepMind JAX Ecosystem,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.748781Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:920c7b3ce1d51627e6f89232585bfedee49de986c03b45f1019807df94ded2dc","observation_id":"64ef1a7a-a697-40e4-b684-0d96c3adb2f5","resolution":{"observed_at":"2026-08-04T15:45:51.748781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09983","last_updated":"2024-02-15T14:49:18Z","snapshot_observed_at":"2026-07-06T17:30:39.245059Z","submitted_at":"2024-02-15T14:49:18Z","title":"Optimistix: modular optimisation in JAX and Equinox","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09983","snapshot_observed_at":"2026-08-04T15:45:51.752328Z","title":"Optimistix: modular optimisation in JAX and equinox,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.752328Z"},"links":{"cited_paper":"/paper/2402.09983","citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:b4abd273ee87ec3d083a718951fdae697b94772a49f4dfb76dbc537e8ba2cdd4","observation_id":"542f0107-8ee6-4d74-a017-e4059f7cbd00","resolution":{"observed_at":"2026-08-04T15:45:51.752328Z","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-04T15:45:51.756046Z","title":"Equinox: neural networks in JAX via callable PyTrees and filtered transformations,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.756046Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:b655e2021960166f5eab6b076eff3cc1ebfdb7687ddea60b91a2e9541a610378","observation_id":"844399a5-a0dc-42eb-a17d-9d296cd23434","resolution":{"observed_at":"2026-08-04T15:45:51.756046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.15183","last_updated":"2022-10-12T09:51:43Z","snapshot_observed_at":"2026-07-06T11:14:31.306862Z","submitted_at":"2021-05-31T17:45:58Z","title":"Efficient and Modular Implicit Differentiation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.15183","snapshot_observed_at":"2026-08-04T15:45:51.759713Z","title":"Efficient and modular implicit differentiation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.759713Z"},"links":{"cited_paper":"/paper/2105.15183","citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:c32fbdcaa664b69f82dbcb11a588dac5ae6c3a17de20ff487f143c5fea251a75","observation_id":"3038cd6a-b4b9-4224-bb6a-2f2eaae4ffff","resolution":{"observed_at":"2026-08-04T15:45:51.759713Z","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-04T15:45:51.763856Z","title":"MPAX: Mathematical programming in JAX,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.763856Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:63ca1415d7ce6d7f405dea33c2b5fee595b823e2b613c081ffee411d1ea60dd1","observation_id":"b45fc3b3-6944-44e1-adb5-cf8390eb86ba","resolution":{"observed_at":"2026-08-04T15:45:51.763856Z","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-04T15:45:51.771227Z","title":"Jaulin, M","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.771227Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:0ff3f39a3ce0a10b0adf630e825680da1007f70dcbf18b33f3b2daac705591d6","observation_id":"247b75d4-80c2-4114-a51a-d67e989b3e54","resolution":{"observed_at":"2026-08-04T15:45:51.771227Z","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-04T15:45:51.775449Z","title":"Rapid and Accurate Reachability Analysis for Nonlinear Dynamic Systems by Exploiting Model Redundancy,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.775449Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:388153d27372306e480bd1c13eee44785f09032ef365a5374dd4896ad9a1d5c6","observation_id":"3d102bdc-3b5f-4439-899f-a57de664676c","resolution":{"observed_at":"2026-08-04T15:45:51.775449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.01273","last_updated":"2026-06-24T14:13:43Z","snapshot_observed_at":"2026-07-06T18:56:05.823411Z","submitted_at":"2024-08-02T13:55:26Z","title":"Certified Robust Invariant Polytope Training in Neural Controlled ODEs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.01273","snapshot_observed_at":"2026-08-04T15:45:51.779907Z","title":"Certified Robust Invariant Polytope Training in Neural Controlled ODEs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.779907Z"},"links":{"cited_paper":"/paper/2408.01273","citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:cd0c25edc3ad691dd33dcbd91a7468b03ca70fc885622f38148bdc5f5ed178a6","observation_id":"12fa4c87-336f-41e6-955c-0e83e2602d7b","resolution":{"observed_at":"2026-08-04T15:45:51.779907Z","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-04T15:45:51.783899Z","title":"Presolving in linear program- ming,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.783899Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:670c1e7d20e3fe2d76c553175b3a2ebaae52bbf33fc287e00feea2e944b3637d","observation_id":"33d25c29-1191-4ea4-b423-9813ee2743f4","resolution":{"observed_at":"2026-08-04T15:45:51.783899Z","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.1080/10556789508805634","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding all linearly dependent rows in large-scale linear programming,","venue":"Optimization methods & software","work_id":"278aa330-504e-4f9f-aa90-34a5e747191a","year":1995},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.787782Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:0bc13d797d30c841cc86459248eafbd482c11e51c378ae5e3de1b66ddfd1f82a","observation_id":"c8503547-77bd-4bf6-9b4e-3519454a2756","resolution":{"observed_at":"2026-08-04T15:51:50.235383Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T15:45:51.791646Z","title":"Parallelizing the dual revised simplex method,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.791646Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:a98e2ed83f9d5d3bd37b6401f702b7cd615e968aa06ba093f6ff6442b0d43620","observation_id":"393bacd8-5ca9-46a0-916f-e8b6bbafa155","resolution":{"observed_at":"2026-08-04T15:45:51.791646Z","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-04T15:45:51.795221Z","title":"A general analysis of the convergence of ADMM,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.795221Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:4da4e80ea44776bdbf33c304a14a9f4a2a032a3889f6f044ed82b6576048acb5","observation_id":"64900af2-35c1-49b6-95ef-440e23415940","resolution":{"observed_at":"2026-08-04T15:45:51.795221Z","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-04T15:45:51.798904Z","title":"Notes on Bland’s pivoting rule,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.798904Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:ce5a7e026152c3f1db2b8d714fa207121e5503161be6c8b1d82b5a96e5d133e6","observation_id":"1032320b-1457-4041-9a14-3a1d69f4e4cc","resolution":{"observed_at":"2026-08-04T15:45:51.798904Z","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-04T15:45:51.804265Z","title":"Differentiable convex optimization layers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.804265Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:157c89456709fc492ef4619c6564af756ab75680b2c23393f46b6cb1d34d5278","observation_id":"e555a3f1-6766-4e52-9ef8-eaff0f396565","resolution":{"observed_at":"2026-08-04T15:45:51.804265Z","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-04T15:45:51.717387Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:51.717387Z"},"links":{"citing_paper":"/paper/2509.19484"},"observation_digest":"sha256:7b932f797cfebf6060499029340507fb9f9557d5be2fc8b4a63d66e684e8124f","observation_id":"34b6268e-87ad-4bff-ad51-c35cd14a5cb5","resolution":{"observed_at":"2026-08-04T15:45:51.717387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.19484","last_updated":"2026-05-27T04:54:43Z","latest_version":2,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-07T08:54:05.638154Z","submitted_at":"2025-09-23T18:44:56Z","title":"linrax: A JAX Compatible, Simplex Method Linear Program Solver"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":29},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2509.19484."}