{"as_of":"2026-08-14T21:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ffbd07cc2d576609be1af32012adf14b94e407ac7a21d2bade128f5d6a3c70d","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:44:32.739306Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2412.20141/citation-record","integrity":"/paper/2412.20141/integrity","json":"/paper/2412.20141/citation-record.json","paper":"/paper/2412.20141"},"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-10T23:44:33.305697Z","title":"Limiting behavior of t he affine scaling continuous trajectories for linear programming problems","venue":null,"work_id":"6dca7d22-3ed3-428a-b649-8d6dffbd08d3","year":1991},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.569803Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:c515994647bc52900f728a1bc716dd2429501527135be47ceae840321351d988","observation_id":"31e265d5-6528-46ac-b167-150e03c999ae","resolution":{"observed_at":"2026-08-10T23:44:33.310711Z","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-10T23:44:33.290503Z","title":"On augmented lagrangian methods with general lower-level c onstraints","venue":null,"work_id":"5c2c0148-7c2d-4c7c-aae7-e5550d6e4063","year":2008},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.575247Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:afb864331181e28c0d6ad5290fd5c086b4485638a07566455bcdaf6ef5ed496a","observation_id":"c7a7ae94-b7ae-470c-9154-8c1262435b33","resolution":{"observed_at":"2026-08-10T23:44:33.295454Z","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-10T23:44:33.275288Z","title":"Dynamical systems I: ordinary differential equations and smooth dynamical syste ms","venue":null,"work_id":"58497781-0b54-4ed3-9e2e-97f3935698df","year":1988},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.580378Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:289a82784ea5d06ef2f425a154af37c939b523522c6a8ecd3365759267d0c37b","observation_id":"3fc20f33-c5af-4768-bd47-5d632e98226a","resolution":{"observed_at":"2026-08-10T23:44:33.280128Z","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-10T23:44:33.259813Z","title":"Regularity versus degeneracy in dynam ics, games, and optimization: a unified approach to different aspects","venue":null,"work_id":"79ead60d-86ff-43aa-9167-2fe5cd33410c","year":2002},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.585794Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:34dd64855dbc0fe8e1f0fee99a6b180807d0af57377d2b246d1c2039800fa24c","observation_id":"b439ae90-7e6a-4117-a7b5-d8cb0c75e5cb","resolution":{"observed_at":"2026-08-10T23:44:33.264950Z","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-10T23:44:33.245537Z","title":"Functions of a real variable","venue":null,"work_id":"11759a5a-2a59-4769-812a-4e312feebd23","year":2004},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.590978Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:dfe337b6a0deae0a8a00598c698b25a4a69aa1111900c2dd993cc99a490a1d29","observation_id":"976f3af4-fae7-473a-88d8-4a32217ca2ae","resolution":{"observed_at":"2026-08-10T23:44:33.249955Z","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-10T23:44:32.595871Z","title":"Convex optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.595871Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:bae28a9fbad9379ae7538c0887f74b249f898365c6f68ed3a12c7809668272ee","observation_id":"4f0ccba5-f1b1-47e1-bc23-bca9c161c672","resolution":{"observed_at":"2026-08-10T23:44:32.595871Z","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-10T23:44:33.220505Z","title":"Examples of ill-behaved central paths in convex optimization","venue":null,"work_id":"dc27c688-58a5-42b9-974f-94a1b86dadfb","year":2005},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.601458Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:cd3944fd631e9cfed2d56a96d14224e784071afdb79cc29f272ec38683a27cea","observation_id":"8144cee6-05b1-4be7-9ca3-86e201594a57","resolution":{"observed_at":"2026-08-10T23:44:33.225252Z","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-10T23:44:33.205126Z","title":"Iterative solution of problems of linear and qu adratic programming","venue":null,"work_id":"0c186a88-6337-4050-b082-0241452502c1","year":null},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.606245Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:4897f12b2b0a0e76a706995cac5758c32c19c9ae6e94b28dbff1d335b8e5e511","observation_id":"82dc5894-2d12-43e0-92de-5c8716be3153","resolution":{"observed_at":"2026-08-10T23:44:33.210448Z","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-10T23:44:33.190716Z","title":"On the convergence of an iterative process","venue":null,"work_id":"f7208426-b2da-4828-b5e4-2cfb82d7e8fd","year":1974},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.610943Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:e625c559810b4d7dafb65948151ef41f270c252819f4eb6d8764080b6545bb44","observation_id":"0f6e93d5-5e17-4dfc-9e6a-82633796cf5c","resolution":{"observed_at":"2026-08-10T23:44:33.195293Z","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-10T23:44:33.175981Z","title":"A primal affine scaling algorithm for linearly con- strained convex programs","venue":null,"work_id":"bb9cc2b1-d7d8-4821-ab32-24122ceed043","year":1990},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.616527Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:a73be50a7e1b1cbd681a14aaafca9be382dd2e061fe29b0ee2c4788c8cdb18e3","observation_id":"38e3fb60-a943-47cf-a42b-8cb0090de7d8","resolution":{"observed_at":"2026-08-10T23:44:33.180917Z","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-10T23:44:33.160866Z","title":"On full j acobian decomposition of the augmented lagrangian method for separable convex progr amming","venue":null,"work_id":"ea34c938-e456-45fd-a9bd-c6c6bf49c207","year":2015},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.621136Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:3d3fe943fb6785135a8a0e63dcdde555ddf3e896f83ccf0810e779c9df9a00b5","observation_id":"178101f7-4274-4fa8-ac5c-eff6eb39266e","resolution":{"observed_at":"2026-08-10T23:44:33.165527Z","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-10T23:44:32.625948Z","title":"Multiplier and gradient methods","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.625948Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:3c58c14099f67e57679d1ae1f116e283c32c20d10bad345698dcdf9fb93bcf7e","observation_id":"7570fd15-a234-4455-a06c-5120ace3c330","resolution":{"observed_at":"2026-08-10T23:44:32.625948Z","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-10T23:44:33.137340Z","title":"Augmented lagrangian methods and prox imal point methods for convex optimization","venue":null,"work_id":"38100ed0-ccc0-443d-911e-fa51a37fe127","year":1999},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.630611Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:f0cac303435e340271c56e947de24114744a691bef06522def4b1e6b1905af68","observation_id":"d0bb470d-6af2-4987-ab1d-8c4b1adccaa5","resolution":{"observed_at":"2026-08-10T23:44:33.142076Z","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-10T23:44:33.122574Z","title":"A study of the dual affine scaling continuous trajectories for linear programming","venue":null,"work_id":"b707442d-e3fc-4dd4-88f8-057f28ed5076","year":2014},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.635148Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:031f1d067554b005eecac55619cfab7679c4e14b689db1e5b2304b303c430eee","observation_id":"7349ebda-bc34-41fe-b753-a645841aae73","resolution":{"observed_at":"2026-08-10T23:44:33.127287Z","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-10T23:44:33.108234Z","title":"Dynamics of games and gene s: Discrete versus continuous time","venue":null,"work_id":"f02eaf6e-0b82-4b9b-a433-9fad7e33d235","year":1983},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.639642Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:40f391413d34f625aeb42270cac07da905fae37525b4ab5f548489affcf93520","observation_id":"3511bcc9-413b-4fd6-a98c-e64e4b1274a6","resolution":{"observed_at":"2026-08-10T23:44:33.112755Z","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-10T23:44:33.093363Z","title":"A simple characterization of solut ion sets of convex programs","venue":null,"work_id":"42e6f66e-7880-4873-81e6-ea674495ec23","year":1988},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.644049Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:77ccc894789ed1f730219428b1569d3ce3819398c245b93e4786d5edb2a00abd","observation_id":"0ecd967a-4d80-4bbe-bc4d-0d28da233742","resolution":{"observed_at":"2026-08-10T23:44:33.098438Z","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-10T23:44:33.079233Z","title":"Boundary behavior of interior poi nt algorithms for linear pro- gramming,","venue":null,"work_id":"fe2be95b-2a84-47e3-94a0-42cab7a9b6ac","year":1986},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.648354Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:fe9781fff565ef865c6c154e61f14dcec80cb91f4662d24f383457edbbf54064","observation_id":"5d7edd3c-934f-433b-a60c-a616cfaf9493","resolution":{"observed_at":"2026-08-10T23:44:33.083951Z","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-10T23:44:33.063600Z","title":"Convergence and boundary behavior of the projective scaling trajec- tories for linear programming","venue":null,"work_id":"7ea7d7f3-60f8-4a0b-b8e2-f54e6c53a249","year":1991},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.652923Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:e99a7f263c3641cdfa1e01731cc57d6454a323c5cfac41efc9882d525a5bf5af","observation_id":"99b22386-8c39-4e73-a04b-7fb9e78412cc","resolution":{"observed_at":"2026-08-10T23:44:33.068709Z","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-10T23:44:33.047709Z","title":"Global conver gence of the affine scaling al- gorithm for convex quadratic programming","venue":null,"work_id":"b63380f7-ceea-4e72-87b9-a25a85506d02","year":1998},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.657687Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:e8dee72b0530d190056e19893b999e3e1c4bfbc4efec1cb8825e1b4ed5adc415","observation_id":"0455170f-fc08-4ac2-a989-fd2c6b72085c","resolution":{"observed_at":"2026-08-10T23:44:33.052396Z","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-10T23:44:33.032455Z","title":"A method for nonlinear constraints i n minimization problems","venue":null,"work_id":"8f9f2a51-b58a-47ee-aed9-4e5b86409123","year":1969},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.662446Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:42f4217c5eac6f4ff357f34c79d42bdcbfdd38b21536680d3e40f27e991bf591","observation_id":"faa406e7-32d5-4d1b-a5d4-8fdf1f5cdb09","resolution":{"observed_at":"2026-08-10T23:44:33.037382Z","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-10T23:44:33.016859Z","title":"A strategy of global c onvergence for the affine scaling algorithm for convex semidefinite programming","venue":null,"work_id":"0a3e3fc4-ac86-446b-97ab-d57dc053da36","year":2020},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.666863Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:c2c1f0e5b98162b3fecd0229222b32a9c3220c417ded15718be888ce69eaf65a","observation_id":"24333125-44e1-4735-96d8-8b65d4fac32a","resolution":{"observed_at":"2026-08-10T23:44:33.022009Z","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-10T23:44:33.001394Z","title":"The converg ent generalized central paths for linearly constrained convex programming","venue":null,"work_id":"c81e107e-7176-4655-a14f-0e57b854d790","year":2018},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.671188Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:b7aadcce45bddef2a747c014816270ffd0778519de36080ed6304efd67c93bba","observation_id":"a241777b-408b-41cb-a1db-2bb318a3ec84","resolution":{"observed_at":"2026-08-10T23:44:33.006478Z","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-10T23:44:32.986034Z","title":"Augmented lagrangians and appl ications of the proximal point algo- rithm in convex programming","venue":null,"work_id":"b08ea961-c5d0-4d66-b009-6c5948d02d96","year":1976},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.675936Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:32e4ab2aa79d52e3a45cbc3cea3341365f3ebf5a059ec1512d4cf7cbd16de82d","observation_id":"89bed251-b5ec-428c-9c45-b31b011c3e5d","resolution":{"observed_at":"2026-08-10T23:44:32.991218Z","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-10T23:44:32.680438Z","title":"Monotone operators and the prox imal point algorithm","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.680438Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:76e71d6170d67e557142874db97bc076bcce59b46bc40fe1da1d3a004482103c","observation_id":"793d7abc-d6d9-40bf-9650-da79236cc032","resolution":{"observed_at":"2026-08-10T23:44:32.680438Z","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-10T23:44:32.960389Z","title":"A simple proof of a primal affine scaling me thod","venue":null,"work_id":"fd5db542-e095-48a4-aed8-96bd8139e925","year":1996},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.684893Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:7e9a1ad4418d14730340ea42fa2ac29090f22b7545839273264f08cfe5d8c04f","observation_id":"62ab8dbe-1151-48b3-b00a-ca03bc71db67","resolution":{"observed_at":"2026-08-10T23:44:32.965073Z","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-10T23:44:32.946514Z","title":"Applied nonlinear control","venue":null,"work_id":"f33ff50d-430d-4ac4-8b89-f96ba6461caa","year":1991},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.689350Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:2bb235e7a43f092bf2b9a3bca68d2ea1bb08f0d4b875b390d5aaddd2c2243e13","observation_id":"3ea58b53-65c3-41d4-866c-d753265b4e80","resolution":{"observed_at":"2026-08-10T23:44:32.951096Z","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-10T23:44:32.931772Z","title":"The rate of converg ence of the augmented lagrangian method for nonlinear semidefinite programming","venue":null,"work_id":"5c1aaa49-a0ea-44d1-9195-0e22572c86ee","year":2008},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.693650Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:b58051ab2d7280c8894541831975f5a78ffc14085a12b57908a1ac29e6306165","observation_id":"02323a81-032e-40e0-8bb0-30e12fdc775a","resolution":{"observed_at":"2026-08-10T23:44:32.936470Z","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":"1404.5378","last_updated":"2014-12-01T05:49:32Z","snapshot_observed_at":"2026-07-06T03:41:43.996091Z","submitted_at":"2014-04-22T04:44:30Z","title":"A Convergent 3-Block Semi-Proximal Alternating Direction Method of Multipliers for Conic Programming with $4$-Type of Constraints","version":2},"cited_work":{"arxiv_id":"1404.5378","doi":null,"metadata_source":"pith","pith_arxiv_id":"1404.5378","snapshot_observed_at":"2026-08-10T23:44:32.774994Z","title":"A Convergent 3-Block Semi-Proximal Alternating Direction Method of Multipliers for Conic Programming with $4$-Type of Constraints","venue":"math.OC","work_id":"17d78346-b109-4fdb-a462-49c3b241d17c","year":2014},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.698206Z"},"links":{"cited_paper":"/paper/1404.5378","citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:5eb6aebfc6d04b6e465069152d3cc5207fadde36fd749e6cdccfdeb56588cd1e","observation_id":"2b9020b6-24b0-4a3c-8152-44c02f4cf8f6","resolution":{"observed_at":"2026-08-10T23:44:32.782281Z","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-10T23:44:32.915578Z","title":"A convergence proof for an affine-scaling algori thm for convex quadratic program- ming without nondegeneracy assumptions","venue":null,"work_id":"7dbc2efb-cd6b-44d2-9bc2-847729068bc8","year":1993},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.702872Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:bc449dc3be5a6dcb164c6c706d3ce98280c7482f8fe4b90e2858f49761b9b5d0","observation_id":"8bb783da-f3ea-4a1b-b373-8278d241c91a","resolution":{"observed_at":"2026-08-10T23:44:32.921597Z","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-10T23:44:32.900522Z","title":"A convergence analysis for a convex version of d ikin’s algorithm","venue":null,"work_id":"4bafc67d-ae30-46ed-a123-8d35f8cc03f0","year":1996},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.707234Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:0439629731b68abb78f189ee536610a4e5f1f45dbb3409f52f6fe32f2aff1a73","observation_id":"b89b1889-5e60-4abb-872b-5bd9546c88be","resolution":{"observed_at":"2026-08-10T23:44:32.905636Z","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-10T23:44:32.885514Z","title":"On the convergence o f the exponential multiplier method for convex programming","venue":null,"work_id":"7e51df68-2400-4611-aa24-b5761f791bc8","year":1993},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.711743Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:a7d9f0e4e028dfb85bee4038a5c67b073d1f04cd787c71e305a4a85a2a3d0055","observation_id":"502b46b2-b950-43aa-a6f4-31d42c8500a7","resolution":{"observed_at":"2026-08-10T23:44:32.890301Z","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-10T23:44:32.871014Z","title":"A first-order interior-point method for linearly constrained smooth optimization","venue":null,"work_id":"daecda2e-bb7b-42fa-bd76-9eb19bed450b","year":2011},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.716321Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:55b6d1972fe8403011f0357acaf87639388f70441a6690e6cdd760cce56560c9","observation_id":"ba6caf0b-0311-4ab8-88ed-740fae41e49e","resolution":{"observed_at":"2026-08-10T23:44:32.875838Z","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-10T23:44:32.854250Z","title":"On the convergence of the affi ne-scaling algorithm","venue":null,"work_id":"83c0869b-a26d-495c-a4c9-2a53b9fb024a","year":1992},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.720900Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:a516016dbcb87085140c21914334e093989bee04459597f851e598975e84fd75","observation_id":"38069347-48d9-4013-b3e8-7020239639ed","resolution":{"observed_at":"2026-08-10T23:44:32.859429Z","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-10T23:44:32.838631Z","title":"Global convergence of the affine scali ng methods for degenerate linear programming problems","venue":null,"work_id":"3ccb5bda-bbb7-44a9-950f-9bd3509d1f40","year":1991},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.725261Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:b5c6e67a31b50839b0ebd559e9f65ca706b7c37539e6aa196f2189da015ea6a9","observation_id":"e5b08337-023c-47b9-a62c-c262c7f8a831","resolution":{"observed_at":"2026-08-10T23:44:32.843650Z","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-10T23:44:32.823978Z","title":"Sdpnal+: a m ajorized semismooth newton-cg augmented lagrangian method for semidefinite pro gramming with nonnegative constraints","venue":null,"work_id":"bbd86218-9c70-44b9-b30e-bd92525ce92d","year":2015},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.729835Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:29202a9df667c81f62064634eae736e2193d5534ed58bb494f158a72b5d7e862","observation_id":"0fc4456c-9e7b-44b2-bdd7-401b6a3be002","resolution":{"observed_at":"2026-08-10T23:44:32.828765Z","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-10T23:44:32.808338Z","title":"An extension of karmarkar’s pro jective algorithm for convex quadratic programming","venue":null,"work_id":"aeb09ed5-e596-4a10-9062-b3e730ab3ab8","year":1989},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.734684Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:123893eab0f4d80f10b008082a14c47b7a024b367f4c3c2d0b198a281fdf1a35","observation_id":"10bb27d8-6964-4075-991a-9d423932c0e3","resolution":{"observed_at":"2026-08-10T23:44:32.813075Z","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-10T23:44:32.793342Z","title":"A newton- cg augmented lagrangian method for semidefinite programming","venue":null,"work_id":"7e39c121-2745-4c45-ad29-4b433b350741","year":2010},"citing_paper":{"arxiv_id":"2412.20141","last_updated":"2024-12-28T13:05:26Z","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T23:44:32.739306Z"},"links":{"citing_paper":"/paper/2412.20141"},"observation_digest":"sha256:3dda088879b9b7e280aa5fd124be4d56298d46667236f376f76a6cdd8316eed5","observation_id":"decb5cb2-7582-420b-a88b-1c91605a04e2","resolution":{"observed_at":"2026-08-10T23:44:32.798328Z","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":"2412.20141","last_updated":"2024-12-28T13:05:26Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T12:19:35.425815Z","submitted_at":"2024-12-28T13:05:26Z","title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":33},"total_outbound_references":37},"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 14 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2412.20141."}