{"as_of":"2026-08-17T23:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c3afc0b08ab7ceb306547c56917d1399cdac7e59559fbfdadbc9b450ddd7b94","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:44:09.565865Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.16015/citation-record","integrity":"/paper/2411.16015/integrity","json":"/paper/2411.16015/citation-record.json","paper":"/paper/2411.16015"},"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-12T13:44:09.921783Z","title":"An implementation of kar- markar’s algorithm for linear programming.Mathematical programming, 44:297–335, 1989","venue":null,"work_id":"8f1a4207-6c39-4e1d-b8b5-9b49696cc066","year":1989},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.448526Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:2e27c5b46ce1c010b7fb27e8861948ab4dee57a97780d820a9065938cd1a4d28","observation_id":"fe3aba2c-ef7e-441e-835d-58e0a7c0cbc4","resolution":{"observed_at":"2026-08-12T13:44:09.925113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.914854Z","title":"HEC/Université de Geneve, 1996","venue":null,"work_id":"3a4e0737-c357-4044-8076-0d70149b1630","year":1996},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.451650Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:5a3619bfe0555746cc43c2803aa51ab34bc7b09e0225b5af1b4b3c35a4b99431","observation_id":"43f899cd-d633-4ba9-9fd6-eea7b4a10ba6","resolution":{"observed_at":"2026-08-12T13:44:09.917371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.907915Z","title":"Inexact interior-point method.Journal of Optimization Theory and Applications, 96:109– 121, 1998","venue":null,"work_id":"38034ee8-d591-4548-8582-9df79a38a11c","year":1998},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.454113Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:978d54e89a9b15bc061cc4cd247d3cd9599a4ebfadb619a0e1bac6d3c1d03be9","observation_id":"a1f93adb-7bbd-4119-9eb6-ae7ef4b7a088","resolution":{"observed_at":"2026-08-12T13:44:09.910602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.900902Z","title":"An inexact dual logarithmic barrier method for solving sparse semidefinite programs.Mathematical Programming, 178:109–143, 2019","venue":null,"work_id":"a4b37109-3000-45dc-bd1a-efd9e23445fd","year":2019},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.456789Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:7b0a09ce500b62af53d9fb227e1dcd608d94124c9d55a708b7bb3f1213e0aa43","observation_id":"e0f83c80-b52e-4f83-ae7c-90792a7f8d56","resolution":{"observed_at":"2026-08-12T13:44:09.903691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.893711Z","title":"Algorithm 875: Dsdp5-software for semidefinite programming","venue":null,"work_id":"5990cf4f-cf81-450f-9e2c-b59d18cc28ea","year":2008},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.459288Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:0d571f4d69fa5d90d11e4fde5974fd866f907cdc31494e7a674a854bc4282da7","observation_id":"dc6d9fc7-1971-4028-83ab-c5597bd2ab82","resolution":{"observed_at":"2026-08-12T13:44:09.896517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.886821Z","title":"A new preconditioning approach for an interior point-proximal method of multipliers for linear and convex quadratic programming","venue":null,"work_id":"53bc1904-32b0-47be-b335-a642bc0a940a","year":2021},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.462483Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:e8436ac8c48693fd92e1923f94a2f64f1f57eaa7abf16c79332aa8e0e231791f","observation_id":"1c6d07e3-2c38-4db1-8f6c-cca3ec966e4e","resolution":{"observed_at":"2026-08-12T13:44:09.889488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.879620Z","title":"Inexact constraint preconditioners for linear systems arising in interior point methods.Computational Optimization and Applications, 36:137– 147, 2007","venue":null,"work_id":"a738d371-6cfa-4da9-9b95-c6d88414f3e0","year":2007},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.465625Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:3d3d79dce7ca7eea699c9f9b0108ee2ab6d0699e7b620c271eabf5bb5516e7c3","observation_id":"37b78694-0d26-4bbb-90c8-cd3c463870d7","resolution":{"observed_at":"2026-08-12T13:44:09.882626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.871788Z","title":"Preconditioning indefinite systems in interior point methods for optimization.Computational Optimization and Applications, 28:149–171, 2004","venue":null,"work_id":"3d6a0c23-1e88-41df-9b88-2ff3c669d601","year":2004},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.467923Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:d819cc2134c39eaa19823f699649d569b6ff22f8c4c9d059e329c0f0313c98f8","observation_id":"2654b162-906b-4396-88c7-0463054441f7","resolution":{"observed_at":"2026-08-12T13:44:09.874520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.863659Z","title":"Faster randomized infeasible interior point methods for tall/wide linear programs.Advances in Neural Information Processing Systems, 33:8704– 8715, 2020","venue":null,"work_id":"88c850af-8628-4dad-b677-eebfcc9ea29b","year":2020},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.470280Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:a78f33a8822702b101c9875d5f215b984dd0556a58e27882afa7dd9ad4122e3e","observation_id":"e1d169c3-0dcc-4bee-b6df-ac253d0d05b9","resolution":{"observed_at":"2026-08-12T13:44:09.866590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14524","last_updated":"2025-01-14T00:40:59Z","snapshot_observed_at":"2026-08-16T22:14:44.038096Z","submitted_at":"2024-04-22T18:46:35Z","title":"Randomized Nystr\\\"om Preconditioned Interior Point-Proximal Method of Multipliers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14524","snapshot_observed_at":"2026-08-12T13:44:09.472650Z","title":"Randomized nystr\\\" om preconditioned interior point-proximal method of multipliers.arXiv preprint arXiv:2404.14524, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.472650Z"},"links":{"cited_paper":"/paper/2404.14524","citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:86ce043e544d065ab773acb8e4c282c689a43a7468ea35ef06ba1a5c4ee71622","observation_id":"3a629b7e-5f84-4e07-b48a-da51b5e534e0","resolution":{"observed_at":"2026-08-12T13:44:09.472650Z","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-12T13:44:09.856631Z","title":"Proximal stabilized interior point methods and low-frequency-update preconditioning techniques","venue":null,"work_id":"28903164-0b66-47a9-a626-6693a7c686ed","year":2023},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.475381Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:e78c237ba9ca1fd51c9d496e020f35ff40884027e1c878873725f04762e27fbb","observation_id":"41b70074-1cab-43ad-a892-a5cf696e8b3a","resolution":{"observed_at":"2026-08-12T13:44:09.859241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.849597Z","title":"Solving linear programs in the current matrix multipli- cation time","venue":null,"work_id":"6712979d-1956-4c63-a12d-ec88dbcad152","year":2021},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.477757Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:772c9eaedd330ded20da63ef07be891a6b22fee8abf5516e80d1b7ef1e578314","observation_id":"d59a5b40-5c31-4836-bc01-0c56119d40ac","resolution":{"observed_at":"2026-08-12T13:44:09.852255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.841266Z","title":"A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix","venue":null,"work_id":"98c3a4fb-cff5-42be-9a3e-ed0fa5ff8f09","year":2020},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.480209Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:664b86edd44c9dccfe27d014cfdf0b3b3f38a62998b4bd7d35ea25089f9d1a64","observation_id":"b21247e0-0eb6-4678-b750-1266ca11cad1","resolution":{"observed_at":"2026-08-12T13:44:09.845176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.834333Z","title":"Iterative solution of problems of linear and quadratic programming","venue":null,"work_id":"bb4ba942-e655-40b5-9108-e812377e0afe","year":1967},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.482539Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:2bb63b8e8cb11fc13c52891db2250920af7c9f68f3cfcca3c0de37805bd68115","observation_id":"c510cc2f-2b2f-4f8c-aa6e-9d08209a7e9d","resolution":{"observed_at":"2026-08-12T13:44:09.837018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.827357Z","title":"Convergence of a class of inexact interior-point algorithms for linear programs.Mathematics of Operations Research, 24(1):50–71, 1999","venue":null,"work_id":"11d1df80-6d38-4619-bb7c-4a63b119d4e9","year":1999},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.484824Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:5a9b36b0b189be485275da004763dc98abf933173d8ab6bb5bee8b05f26f306a","observation_id":"689184f2-38fb-45c2-ab91-4cf3c1c90c5e","resolution":{"observed_at":"2026-08-12T13:44:09.830184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.13862","last_updated":"2023-11-09T01:35:10Z","snapshot_observed_at":"2026-08-16T16:42:48.976441Z","submitted_at":"2022-07-28T02:35:08Z","title":"HDSDP: Software for Semidefinite Programming","version":2},"cited_work":{"arxiv_id":"2207.13862","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.13862","snapshot_observed_at":"2026-08-12T13:44:09.584522Z","title":"HDSDP: Software for Semidefinite Programming","venue":"cs.MS","work_id":"91dbd886-78c8-4931-95be-8effd64ef1a4","year":2022},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.487191Z"},"links":{"cited_paper":"/paper/2207.13862","citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:7f6dd847509e4d56de9a62bddd779b113eb173cc7a576ec928fd40ae9fbe8a13","observation_id":"9077fe7e-e21f-49d5-880f-a8c1c3704373","resolution":{"observed_at":"2026-08-12T13:44:09.589585Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.820208Z","title":"Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, Marco Lübbecke, Hans D","venue":null,"work_id":"eb8a1a10-a7d2-49fc-81a2-56cfa487ccc2","year":2017},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.489915Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:78074b1424c5b1689132c24b3b2c072ef101470feb09d1194843490c8bcbf076","observation_id":"aa96c002-bd9e-4c79-83ea-1eb2f744e382","resolution":{"observed_at":"2026-08-12T13:44:09.822952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.813274Z","title":"Interior point methods 25 years later","venue":null,"work_id":"805ccf14-1ff0-40cb-9a93-4b9281e7a796","year":2012},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.492290Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:39619e6f286672f62c4f5f837eba50b8d6afd4a129777948415a1913e9101006","observation_id":"0210861a-fe0c-4d76-9337-12f7c28b82b4","resolution":{"observed_at":"2026-08-12T13:44:09.815887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.806161Z","title":"Matrix-free interior point method.Computational Optimization and Applications, 51:457– 480, 2012","venue":null,"work_id":"92b2d733-5f56-460d-ad45-89649f80e68b","year":2012},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.494736Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:0c03ac0fa312dd7cfe44e1556b8fdb1e1713861f56762d0fad8311f3c3a74362","observation_id":"91a72e06-3f06-4ca3-aace-40542713c09a","resolution":{"observed_at":"2026-08-12T13:44:09.808884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.798854Z","title":"General-purpose preconditioning for regu- larized interior point methods.Computational Optimization and Applications, 83(3):727–757, 2022","venue":null,"work_id":"6a6a0a30-fbaa-451f-a8a8-dcce5ba1bd26","year":2022},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.497021Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:d8ab1a8d55c63491ebf30120929327c56bb0fe000f8a30a61a53c51e06363c6c","observation_id":"da3a0a57-d444-4d7d-949d-9dbd1e39ef33","resolution":{"observed_at":"2026-08-12T13:44:09.801668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.791518Z","title":"Properties of the central points in linear programming problems","venue":null,"work_id":"a454e9b9-9bd2-4856-8d2d-b922cbc35fbb","year":2004},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.499379Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:eee821e5648d3529796b1bdf03fb64d87ce90afa1c8eb45d945fd4e543ea5393","observation_id":"7fa7e09a-95d8-4717-9267-7e7fc8295374","resolution":{"observed_at":"2026-08-12T13:44:09.794330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.783990Z","title":"Degeneracy in interior point methods for linear programming: a survey","venue":null,"work_id":"94fdc32f-95ab-4b74-8c57-a0f177114f3b","year":1993},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.501630Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:c6100a9efe71ed138a81f56067fcc549a269f98a21655074b45a6e1532cf31ab","observation_id":"b2b624bd-4251-42f4-b20a-9376fee5b9ac","resolution":{"observed_at":"2026-08-12T13:44:09.786860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.776574Z","title":"Convergence behavior of interior-point algorithms.Mathematical Program- ming, 60(1-3):215–228, 1993","venue":null,"work_id":"63a7a759-f18a-473d-8a3b-ca7990557495","year":1993},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.504042Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:e4de7b14d3e0398adcdc270d6be1c21f982674407d84bcf3b775f6e6a86c7711","observation_id":"f3ecd760-2bd3-4ae6-83cb-c600e010d919","resolution":{"observed_at":"2026-08-12T13:44:09.779357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.768608Z","title":"A new polynomial-time algorithm for linear programming","venue":null,"work_id":"c4406cf9-2428-440a-b657-4dec8aa705a7","year":1984},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.506390Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:552b86154bcfb24a7b93a5282584a94f3be357ada8211f0aad8c91c23c51f0bc","observation_id":"43063b03-d5bb-404f-8e9e-a56bf2720b7b","resolution":{"observed_at":"2026-08-12T13:44:09.772084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.761203Z","title":"Computational results of an interior point algorithm for large scale linear programming.Mathematical Programming, 52:555–586, 1991","venue":null,"work_id":"627438b7-f51a-4364-856c-3ffc1ad59b03","year":1991},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.508749Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:a03c7688a6777a99f526f494aefcaafd0d2bb26a031aa64eb13b46db711a59f5","observation_id":"54711825-c253-4a0d-8db9-f4b16327cbda","resolution":{"observed_at":"2026-08-12T13:44:09.764158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.753770Z","title":"Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow","venue":null,"work_id":"9741ff42-3567-49bf-a0b2-13ef5b0cad27","year":2014},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.510958Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:fe8caaa8792f996b4939f8bd21ec2dd0dd45a400d696081e36dcd647c3ef9cce","observation_id":"15f96292-f4c4-43d3-9a7c-5aa4fcfdcd09","resolution":{"observed_at":"2026-08-12T13:44:09.756617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.513311Z","title":"Springer, 1984","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.513311Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:a1e78ba4e0f659a574da5af2ecbd7dd027ebc8639ed86fa4d445e154e7b186f1","observation_id":"24d2d11e-6b05-4dff-a6c4-712ead434c25","resolution":{"observed_at":"2026-08-12T13:44:09.513311Z","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-12T13:44:09.742296Z","title":"Interior point methods for linear programming: Computational state of the art.ORSA Journal on Computing, 6(1):1–14, 1994","venue":null,"work_id":"6e64181e-ee08-4213-8729-e5cd6474b88b","year":1994},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.515737Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:d64039efdff456a617b64d93bb9e1ade8a58fb2bdf8c0c1419e733188aea03e1","observation_id":"8692491b-91ba-4b95-818b-2f2f7e865c36","resolution":{"observed_at":"2026-08-12T13:44:09.745145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.734427Z","title":"On the implementation of a primal-dual interior point method","venue":null,"work_id":"3154efd0-576f-48b3-bc2a-98a216b8c3bf","year":1992},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.518118Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:ca1c591dd3f59babb92f4e8127b326696cdacbd22cf83d79f69e3a27835953f1","observation_id":"73e57aee-0b19-4388-bc7d-b45bdfead747","resolution":{"observed_at":"2026-08-12T13:44:09.737728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.726908Z","title":"An independent benchmarking of sdp and socp solvers.Mathematical Programming, 95(2):407–430, 2003","venue":null,"work_id":"574ca53d-dfe6-4502-91c8-9a4faa18f698","year":2003},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.520448Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:83bf19806a51b2d4641294e08b0b16b7d384d17d921ba40b1cefb7953b97a1b9","observation_id":"a0479cfe-370a-4a3b-bad9-94676abba561","resolution":{"observed_at":"2026-08-12T13:44:09.729736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.719245Z","title":"Benchmarking optimization software-a (hi) story","venue":null,"work_id":"4507e36c-61f1-4753-9a88-6b268da5ee60","year":2020},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.522961Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:3a6bd190785fd74445683610f154696c66d120cf60a155b030fa8711e3b344ad","observation_id":"5cad91d8-85aa-4d6c-ad8e-6c6185753bc9","resolution":{"observed_at":"2026-08-12T13:44:09.722082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.711987Z","title":"Interior point methods for linear optimization","venue":null,"work_id":"16827e69-32bf-48e5-8e9c-807be2ae715d","year":2005},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.525322Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:466b3d4714f5587f02856a3e1475ef1193a469427e7c5531386120bae994888e","observation_id":"d3bf4c52-f4f6-4184-9d4a-c86bd9612999","resolution":{"observed_at":"2026-08-12T13:44:09.714724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.704791Z","title":"Wiley Chichester, 1997","venue":null,"work_id":"1c14a0af-e553-434e-9611-ea184b5e7262","year":1997},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.527642Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:2562f567ff21d119e26c548ee5fd551f563ea02c496d6c77bbfb5bdd5ea71d8c","observation_id":"ef459cf2-3e29-412d-b263-ecb039f69de7","resolution":{"observed_at":"2026-08-12T13:44:09.707488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.697366Z","title":"A polynomial method of approximate centers for linear programming","venue":null,"work_id":"8c81bee0-6f6f-4dbc-9428-9f25d632e92e","year":1992},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.530074Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:0e2d6626e0d5952c64761908828c47e16961ab4b454829553ead22a6e2cbee8c","observation_id":"8045205d-4bdd-4dc7-baf5-85cb4fcfa63f","resolution":{"observed_at":"2026-08-12T13:44:09.700231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.532314Z","title":"SIAM, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.532314Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:acfc2e1993531abb25a4e2fc18681362341f49b8cee8d7ed67dbe750fcc47fc3","observation_id":"42d8141b-526a-4020-a152-038bf86057aa","resolution":{"observed_at":"2026-08-12T13:44:09.532314Z","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-12T13:44:09.686450Z","title":"Implementation of an interior point method with basis preconditioning","venue":null,"work_id":"502040bf-5bdb-4441-8137-522cef6825a4","year":2020},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.534769Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:f3c4191cb5254e56f1be1d49a5a9d06b5a432227b3aaaf771e6b5e8f01591353","observation_id":"5686bcae-bd4d-41c5-8537-a3b503fa316c","resolution":{"observed_at":"2026-08-12T13:44:09.689159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.679538Z","title":"Scaling, shifting and weighting in interior-point methods.Computational Optimization and Applications, 3(4):305–315, 1994","venue":null,"work_id":"10b44ff1-feb5-4873-a020-41d5a2c723a5","year":1994},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.537093Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:f8d7740446416b0b5da877345fa55688ab582de4cffd259ba984e9b134a7cff6","observation_id":"e73084ce-1fc4-405f-8dcb-634535efab2c","resolution":{"observed_at":"2026-08-12T13:44:09.682387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.673012Z","title":"A deterministic linear program solver in current matrix multiplication time","venue":null,"work_id":"00b64c58-5ffb-430a-969b-6b705ba0be51","year":2020},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.539448Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:a1b962df2644fa0633a2607ef797cb6e399e48a198ed2a8d9710424ff50a5058","observation_id":"dd8c2f64-f9e9-4f9a-a2ef-653aed2a8aba","resolution":{"observed_at":"2026-08-12T13:44:09.675691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.665830Z","title":"A primal-dual interior point method whose running time depends only on the constraint matrix.Mathematical Programming, 74(1):79–120, 1996","venue":null,"work_id":"afaa0403-c313-4e54-9e74-814b113761eb","year":1996},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.541786Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:47ff031e50ccd0db64347f88ace89953dce094e884825f4dff86ccc2643623a4","observation_id":"41aa6f59-924a-4384-acf2-5a5534e1ce60","resolution":{"observed_at":"2026-08-12T13:44:09.668597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.658417Z","title":"Anoteonhybridpreconditioners for large-scale normal equations arising from interior-point methods.Optimization Methods & Software, 25(2):321–332, 2010","venue":null,"work_id":"ae02bec3-8978-4723-923e-5feb149efef3","year":2010},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.544138Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:4ea711081a7075b7737ea2145a5cb68619061a57ee8d760406d88969e4c6d3f5","observation_id":"97855fc4-04f3-4d90-ae50-43418a059aa9","resolution":{"observed_at":"2026-08-12T13:44:09.661369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.651413Z","title":"Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming.Numerical Algorithms, 25:387–406, 2000","venue":null,"work_id":"b120b0f6-d37e-45bd-95ec-b3b0f676b701","year":2000},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.546490Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:9c9dc547e4258a6a617eb83ec558f5d054a0a56a7221ea18bca80068ab3749f3","observation_id":"15166d5a-f01d-49cc-817a-2952f3270f69","resolution":{"observed_at":"2026-08-12T13:44:09.654211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.643946Z","title":"SIAM, 1997","venue":null,"work_id":"f844f227-2ac4-4fa2-a3b9-f4a68261f065","year":1997},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.548861Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:ef31ce9f0849726df081d9fe7ab7713b41a9c11c26b4f144f9d1c73b375f862e","observation_id":"bd7784c4-a1b3-4d3f-90dc-dcde101aaf72","resolution":{"observed_at":"2026-08-12T13:44:09.646741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.636895Z","title":"Ano(n3l) potential reduction algorithm for linear programming.Mathematical programming, 50(1-3):239–258, 1991","venue":null,"work_id":"4ea3967c-2acb-4192-813b-66b27ec43a6c","year":1991},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.551615Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:24a1288cf24f4840b6bad144975e5c91c1f508063dc87afafb2d0afdf79d64bf","observation_id":"43b37a4c-07ad-40b9-a156-0d31f9bc4f75","resolution":{"observed_at":"2026-08-12T13:44:09.639611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.629595Z","title":"John Wiley & Sons, 2011","venue":null,"work_id":"c4aa0611-e1ef-4734-9adc-b3ffedda7b20","year":2011},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.555149Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:82390cbccfa5e96cf3b1a64a2635774f1f00ae7fccc0e82560f036598cc75e71","observation_id":"91e04e51-bfce-4c9a-8e24-219c4b32d071","resolution":{"observed_at":"2026-08-12T13:44:09.632101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.622561Z","title":"A new stopping criterion for krylov solvers applied in interior point methods","venue":null,"work_id":"4a4904d4-fa6e-4a4a-a451-f8b4b812f6e4","year":2023},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.557411Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:8ab9bb3edea9b873a315a6e4ac37cae36ea2d27a0d52ef415a6a924787c98f3e","observation_id":"69fbd8d7-8cf2-42d9-9ade-55f44467204d","resolution":{"observed_at":"2026-08-12T13:44:09.625201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.615472Z","title":"Next consider solving(A W2A⊤)−1A W(WX−1)v","venue":null,"work_id":"6d5e52d9-2c7a-4060-9357-82bc40f40115","year":null},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.560211Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:eb6651b326efa9b3b18ccebf0334d78bd8a796b5a824efd64d97e9560e0e6114","observation_id":"c3745750-cb69-43ff-8bf9-9fe9158126f5","resolution":{"observed_at":"2026-08-12T13:44:09.618095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.607938Z","title":"Lemma C.4","venue":null,"work_id":"987ba1d0-8b57-48f1-a1c9-dfecfaab27ec","year":null},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.563444Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:8dfd1445aeac4d780212dfe9abfd98debe890144dce769e210677a4aee2fc1b3","observation_id":"d90a54ae-a059-4ede-a8d7-e27c84855fb1","resolution":{"observed_at":"2026-08-12T13:44:09.610610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T13:44:09.600775Z","title":"Therefore x+ ∈ F0 p","venue":null,"work_id":"fe5c22a8-7bbb-40f5-bb64-cec380dc1f8a","year":null},"citing_paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T13:44:09.565865Z"},"links":{"citing_paper":"/paper/2411.16015"},"observation_digest":"sha256:510715e3f3f7a5e3b61a6b219869b595e30f8f6796ae4ce40092ab47b2cac769","observation_id":"dd4ae6b4-8254-4979-8855-cc7a4f65af01","resolution":{"observed_at":"2026-08-12T13:44:09.603491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16015","last_updated":"2024-11-24T23:37:04Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T09:55:03.391015Z","submitted_at":"2024-11-24T23:37:04Z","title":"When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":44},"total_outbound_references":48},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2411.16015."}