{"as_of":"2026-08-08T10:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c42f4f4b08f18e376315e2d6b779ee3246f6434ed10148cb044028c70b10b9b7","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:47:01.461595Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2505.21232/citation-record","integrity":"/paper/2505.21232/integrity","json":"/paper/2505.21232/citation-record.json","paper":"/paper/2505.21232"},"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-07T13:47:13.267793Z","title":"Andersen and Knud D","venue":null,"work_id":"5797e9f8-73d1-4f0a-9a27-d29ceabcafd5","year":2000},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:55.599842Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:fa8c5bc917d4b014129c93086eff2f0e4c141fbdd202b06f934be0d359c9b2cf","observation_id":"b897bee1-2840-4c1a-a264-8cecea6a429d","resolution":{"observed_at":"2026-08-07T13:47:13.356623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:13.040159Z","title":"Optimization iii: Convex optimization, 2023","venue":null,"work_id":"14367aac-ed53-4572-9c68-b7d123d5cc4a","year":2023},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:55.712820Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:a1f5e4606d298b13d4b0229d0533bf5056bb1dd9af2d44c538bb275adeb1078f","observation_id":"3a6c07a6-4ba3-460c-a938-8068144e26b6","resolution":{"observed_at":"2026-08-07T13:47:13.153267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:12.783954Z","title":"Bertsekas","venue":null,"work_id":"55fbee3a-06d3-453e-9f40-82d69a853639","year":1975},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:55.841490Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:6a012e4bcacffa6fe135f371fe71f777a1d9a1c32e01e1780bbc6847fe4e2a9d","observation_id":"7bfb3770-2505-4e39-9963-9ed68482ff88","resolution":{"observed_at":"2026-08-07T13:47:12.913516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:46:56.013510Z","title":"Convex Optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:56.013510Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:bf97a06d178b8d422ff3e6809e28b7072b2662f7e6201c5b2f2a971069b70ea1","observation_id":"16c62ab4-40a6-49b2-bfa2-75db65c8f964","resolution":{"observed_at":"2026-08-07T13:46:56.013510Z","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-07T13:47:12.502398Z","title":"Cartis, N","venue":null,"work_id":"19418541-1f54-4c6e-9b37-0e86fd8fa086","year":2010},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:56.129391Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:ab796d37dd1811e926c5253f460a2fc67df508665228df631f7bbe6481492c00","observation_id":"ea4d0e3d-7df7-4a10-9ddb-26efd29240b9","resolution":{"observed_at":"2026-08-07T13:47:12.600561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:12.256077Z","title":null,"venue":null,"work_id":"bcdc1825-cfb8-4a70-979a-068a5aec7e89","year":2011},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:56.267498Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:e86c191b1e43068b28e03a6cde460e50ff024e2382c057fbe625e8a15d1390b9","observation_id":"3fd50c48-bde3-44f0-8218-9da25f6783aa","resolution":{"observed_at":"2026-08-07T13:47:12.367869Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:11.960170Z","title":null,"venue":null,"work_id":"1c33d177-f493-456c-a55f-05025ba198b1","year":2011},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:56.457614Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:ac70ad7c7197ab18c4c68299d8b664a81729e4a456151573632a2d26097b2717","observation_id":"3ee9d7cc-57c2-4640-a8dc-d05a089f35a9","resolution":{"observed_at":"2026-08-07T13:47:12.079278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:11.627292Z","title":null,"venue":null,"work_id":"51fc3ba2-25a9-43f0-8d33-3378719048a6","year":2001},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:56.594460Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:d301f35113cf2cb84ddef71032465a958f71962d4a2eb2cc1fdaa9f78da19ea4","observation_id":"5daeda60-3d43-44cf-9238-8bf0beb1aaeb","resolution":{"observed_at":"2026-08-07T13:47:11.796542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:11.271737Z","title":"Faster randomized interior point methods for tall/wide linear programs.Journal of Machine Learning Research, 23:336:1–336:48, 2022","venue":null,"work_id":"e89107dc-f2d7-46e6-a320-7f61454189f7","year":2022},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:56.736074Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:f1d7596eaa5bd47b8fb8d7f95ae318b49bd52dc59996e99128c7f32df2bd4c1f","observation_id":"29163adf-0a9d-4872-b2e8-c5f9c795dd60","resolution":{"observed_at":"2026-08-07T13:47:11.445520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:11.043661Z","title":"Conn, Nicholas I","venue":null,"work_id":"94fc4dc2-c158-4b5a-ac3b-7b8261ef95c3","year":2000},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:56.923288Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:2d08cc18a441fd257c7bf7aaecd8819bdd87ae08c587cca4f3ca8155fe4f155c","observation_id":"d9460c23-9735-42a5-9faf-382e941915ca","resolution":{"observed_at":"2026-08-07T13:47:11.152133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:10.779149Z","title":"Convergence properties of the inexact levenberg-marquardt method under local error bound conditions","venue":null,"work_id":"86a11060-b7bd-4608-9186-b2762a653e32","year":2002},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:57.090359Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:88ec779a603cfa6a5ff857c79473b0d063a08ee4ae2f4cd9232966a2fd9c6d99","observation_id":"ec1858f0-4e0b-448c-b6c2-2dca03ec0a39","resolution":{"observed_at":"2026-08-07T13:47:10.921846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:10.608566Z","title":null,"venue":null,"work_id":"3d69d66d-fc94-45f7-acb9-03ba4530dcd7","year":1951},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:57.233169Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:92d8462bf28ebed7edba44533dc1f116a880691eec1a452fedb7047e959536f5","observation_id":"a774125c-4d80-443f-be5d-097adee98c1f","resolution":{"observed_at":"2026-08-07T13:47:10.712589Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:10.328787Z","title":null,"venue":null,"work_id":"79a9b3e9-226b-4ec6-926a-d28880dcdf0c","year":1951},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:57.394304Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:b51e5c8e1e485be9f9a75111f7202957c63e11a61d13983756e3ae97350201ce","observation_id":"a3c88682-9cbc-4ca7-af13-177a725fdb08","resolution":{"observed_at":"2026-08-07T13:47:10.485306Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:10.018597Z","title":"Dolgopolik","venue":null,"work_id":"7f092d3f-a627-4b59-adf5-c8deb7ac5677","year":2016},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:57.557824Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:949acf4a96ca6586bcaf604b6858e0e269393814cb0c5dc7be8af2190661acdf","observation_id":"a7da83f3-8bb5-4eb3-b8f3-25e541ec8b1e","resolution":{"observed_at":"2026-08-07T13:47:10.182026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:09.747702Z","title":null,"venue":null,"work_id":"0590f2b2-782d-405e-8057-23efcb27d13a","year":2005},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:57.714659Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:d1e3167f659bd8147898e258bb260039b82ba9392a91b5965f21a0c8db5765d1","observation_id":"1034df0a-9923-4515-8b93-1bcd38e87208","resolution":{"observed_at":"2026-08-07T13:47:09.866227Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:09.443084Z","title":"A regularized newton method for monotone nonlinear equations and its application","venue":null,"work_id":"881c69a4-9b9b-43a1-b222-51e52f06e91e","year":2014},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:57.817927Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:5d51c6b0a4f043581a3e9a7d35f06edd5964b543328334c37e4af6a415e1bc8f","observation_id":"c13b8b67-b83f-4ace-8509-ae6e8df2edc7","resolution":{"observed_at":"2026-08-07T13:47:09.596882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:09.190392Z","title":"coin-or/clp: Release releases/1.17.10, August 2024","venue":null,"work_id":"098566ef-1890-4ed5-9fa4-f63bd2c11e3b","year":2024},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:57.897552Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:fa01622909db0dceb81e4fd0108fe57491c61148ba880d3c8f662e981b42702f","observation_id":"785bc7e2-b21a-497a-af5b-57ee64bc0785","resolution":{"observed_at":"2026-08-07T13:47:09.313126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:08.926643Z","title":null,"venue":null,"work_id":"30ad4d78-389c-4a1f-94ae-39f74ffccb40","year":2020},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.083769Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:d6f93191533c6b204b7e074e8208434de61bc2cae6bca3d5a3e3d1eb29f40e5b","observation_id":"a88f1367-75b7-4490-870c-f53ae2381fec","resolution":{"observed_at":"2026-08-07T13:47:09.066845Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:08.597740Z","title":null,"venue":null,"work_id":"a90f4a51-4691-4de6-ab9f-e07b5b116265","year":1974},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.186432Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:b703b110b4e8aa37fb829a67a3296a4c5dd4f9b5f3f2412e62dc71ddde488208","observation_id":"66ccbcd4-eff8-408f-b7bb-b2fa1c841de6","resolution":{"observed_at":"2026-08-07T13:47:08.762755Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:08.313519Z","title":null,"venue":null,"work_id":"3f0f1b05-7ff6-4a81-9f1d-a2f748da0124","year":1992},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.304405Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:ed777659b850dd4b39cb0c5af51d7c5880594948d01835dd513f3a6451af2022","observation_id":"a829d038-d501-4a3a-9ed0-6987e3508b25","resolution":{"observed_at":"2026-08-07T13:47:08.464701Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:08.018336Z","title":"Stochastic subspace cubic newton method","venue":null,"work_id":"702eb0ef-0c15-4c6c-b3ae-f6ca1ec20d91","year":2020},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.429708Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:628b81a151c1470cc3946885e6b5c85e54fe928b792c742847ea91bd5ff9a159","observation_id":"8d01210c-df8d-4640-8406-ba8985506f0e","resolution":{"observed_at":"2026-08-07T13:47:08.149110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:07.786587Z","title":"Hillier and Gerald J","venue":null,"work_id":"e461a242-055c-4976-b0db-b81e9f022021","year":2014},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.500930Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:2882efa80906611dacd511fc6cbdc849ba6a524daec10bfaf9f30347d03849dd","observation_id":"5d8f774a-d5ca-4818-a9c9-199105cf803d","resolution":{"observed_at":"2026-08-07T13:47:07.898790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:07.616951Z","title":null,"venue":null,"work_id":"ad6107d5-96b6-4fcf-a713-bb37ead0c0b2","year":2023},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.600128Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:d08bb69b938239530a7f98aa178b4e197d62524ec45fa91604362767c5ae05e9","observation_id":"4bf4c095-b3a5-4496-9b3e-facbcedaf1b4","resolution":{"observed_at":"2026-08-07T13:47:07.680563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:07.385971Z","title":"A new polynomial-time algorithm for linear programming","venue":null,"work_id":"795345ff-cde2-4a45-aad2-027d22e2df2e","year":1984},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.748915Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:e9896500c3b9a365de0fc7db05c160faace0ecd721b1925ddcd2657ae96fea33","observation_id":"e7abf9ab-b0bc-453e-a57f-8ef2f5ca966f","resolution":{"observed_at":"2026-08-07T13:47:07.486960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:07.177271Z","title":null,"venue":null,"work_id":"9713b756-2f1e-4fa2-9cc5-8e73119160d5","year":1979},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.874908Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:cbe16836cacea1aaa933f89b9d1ff6ae7ee522908cb4cccce4bc568afe03cb72","observation_id":"93c3e312-c94d-439a-ae46-66a644a5396e","resolution":{"observed_at":"2026-08-07T13:47:07.267720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:07.042428Z","title":null,"venue":null,"work_id":"cd68e211-dad7-4819-beb4-31d905665dcc","year":1972},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:58.956822Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:55234bd7d72327145ebcb795ef0ad9013f15cece59c7e37c5eec004018714807","observation_id":"350a9539-f283-4ea8-b385-9ca4cbdeed7b","resolution":{"observed_at":"2026-08-07T13:47:07.108183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:06.822328Z","title":"Levenberg","venue":null,"work_id":"9bcf0f33-db96-4a64-9222-4db77817dd3e","year":1944},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.033133Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:a491a7afc52f0531fb705e244ae2b46b5ef08953bd81f40403b2236f3632f916","observation_id":"06b18097-5940-426a-9e54-7032cb847efe","resolution":{"observed_at":"2026-08-07T13:47:06.900297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:06.586999Z","title":"Regularized newton methods for convex minimization problems with singular solutions","venue":null,"work_id":"fcd4e9a8-0e78-462f-8149-c4fb6265601d","year":2004},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.178324Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:fcb3322d2935c4b3811f223124f6cb4522e548fa1536d8548745b392dabc65b9","observation_id":"4ddf382a-57d8-4fd6-8d23-0c128b9d599e","resolution":{"observed_at":"2026-08-07T13:47:06.707840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:06.367133Z","title":"Truncated regularized newton method for convex minimiza- tions","venue":null,"work_id":"88bdb164-ba84-4742-bb32-50248ae2bdcc","year":2009},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.267061Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:3e4bce89fda26ee8c48d450dd8983e8c4aac9d4755e78f56e82d7ccf719b5f8b","observation_id":"4039c03c-397e-4b63-af76-cfd6c198e036","resolution":{"observed_at":"2026-08-07T13:47:06.480829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:06.186169Z","title":null,"venue":null,"work_id":"1220d667-ace9-454c-90e7-85d3fa976747","year":2004},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.384297Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:318bdd81b867b0499925d7dd71367b2a24f6597112f925254428d8cf451437ca","observation_id":"ce38a41c-db43-4c1f-bef6-9d4cdba49fc1","resolution":{"observed_at":"2026-08-07T13:47:06.288476Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:05.972323Z","title":"Marquardt","venue":null,"work_id":"e2cdcdbb-15c6-49c3-8f22-c1a5b52593b9","year":1963},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.520447Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:494d1dedb771a3a32e457de24905d18ba0fd6c057065b81d41a210db2015c4e4","observation_id":"9bc346db-c50b-4be7-b912-4cab1af9812a","resolution":{"observed_at":"2026-08-07T13:47:06.043748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:05.732079Z","title":"Regularized newton method with global ≀(1/k2) convergence","venue":null,"work_id":"2c52266d-4a96-4a6f-a16e-768b817843f2","year":2023},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.612877Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:eed978f7dea95393e23ed528e12ce72e8873fb0d023bbe36eb55b496b7a3a546","observation_id":"e84d1ff1-7e74-4888-9e75-4e43ab936efa","resolution":{"observed_at":"2026-08-07T13:47:05.830299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:05.490173Z","title":"Mor´ e, D","venue":null,"work_id":"01be3347-9d75-4ca8-bb77-4d6c2ef2d7c2","year":1984},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.677909Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:c20d33f576036b91fa88981c30d7c0c4517e5ef18686b23686b47ca23387716d","observation_id":"b5ad16f0-971a-4add-ac1a-49ec2e5be1c4","resolution":{"observed_at":"2026-08-07T13:47:05.595746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:05.269877Z","title":null,"venue":null,"work_id":"c9310811-3ce0-49a9-ba74-dad972270eec","year":1986},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.778915Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:6d600c44a5925d5483bcb9791e8cd0c5a49274dd3d93aa5e99cd8b495ca33ae5","observation_id":"0652ab10-6f92-407f-9c1d-b11ca35b0012","resolution":{"observed_at":"2026-08-07T13:47:05.329160Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:05.050044Z","title":null,"venue":null,"work_id":"8149822c-064e-447d-9469-e2557e234804","year":1991},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.908467Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:69ca6d39771cb6a8bb7865f570471395e99c7d3a1d45858e3ae6b16310733a6d","observation_id":"6c3602ce-070c-4304-a8f3-1ca6d7cd9527","resolution":{"observed_at":"2026-08-07T13:47:05.164597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:04.723701Z","title":"Interior-Point Polynomial Algorithms in Convex Programming","venue":null,"work_id":"a08cac50-fbb5-451c-908c-a9928ca9e4b8","year":1994},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:46:59.992481Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:b7bf4bf24b9cbd53f56113c7b97bf6a1459491dcaf51446ecfad3499386a0774","observation_id":"d81cfa83-25d4-47cc-8045-778a6a511dd2","resolution":{"observed_at":"2026-08-07T13:47:04.887952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:04.604968Z","title":null,"venue":null,"work_id":"65c920c8-3dc3-4ad6-b6cc-b807a02df810","year":2006},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.060345Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:2b18700fa2cbcb278af2ed19ae45a556c3434c38eb66d55479b0a0234b7228ec","observation_id":"3002c30c-96c0-4c0c-8af0-09f8bc26b12b","resolution":{"observed_at":"2026-08-07T13:47:04.681978Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:04.405029Z","title":null,"venue":null,"work_id":"e4db7c9e-41fe-4beb-bcc8-c648f28bd613","year":2006},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.179955Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:5253f878e9b9c36ec5a87d0429e84e592e28506711de1d8485635694f9520af9","observation_id":"42481ef6-2592-497f-93f9-b25d9dbaa58c","resolution":{"observed_at":"2026-08-07T13:47:04.477290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:04.162137Z","title":null,"venue":null,"work_id":"519bb7a8-f7cd-4329-9bfb-fc4659e3e1c3","year":2009},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.253569Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:f4911d3710159d50e1ca531def15143676d8186033fb1741dc7493c04ccfe86f","observation_id":"b449a811-a7cf-4751-9346-6f123d005625","resolution":{"observed_at":"2026-08-07T13:47:04.298591Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:03.993456Z","title":null,"venue":null,"work_id":"bbe15977-6754-4012-9357-f008306db745","year":1960},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.317481Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:13e18d12679c8bb1e17460985adf9d8097ffca221bde249a4ae3dffdcfea9102","observation_id":"54348bb1-f537-4a94-b98f-4a928b756f53","resolution":{"observed_at":"2026-08-07T13:47:04.082118Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:03.755556Z","title":"Convergence properties of the regularized newton method for the unconstrained nonconvex optimization","venue":null,"work_id":"05e56c12-9a44-43a0-8059-cb7b7515865e","year":2010},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.414452Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:6e519ee805e9342192a90c41ad3a880708e7653a6cef38e59753c927313d0920","observation_id":"0bb59ac1-6af1-4f35-99e1-28cdc79f2a17","resolution":{"observed_at":"2026-08-07T13:47:03.880472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:03.514192Z","title":"A regularized newton method without line search for unconstrained optimization","venue":null,"work_id":"06d521a4-93c1-40f5-bace-a6a62765d1bf","year":2014},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.544252Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:76b5369994f48e1611da46fdd179486f7e8eeff6c30779a41c094fb14b31418b","observation_id":"178e12ff-8148-490e-b28d-390d9d3894b8","resolution":{"observed_at":"2026-08-07T13:47:03.674062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:03.359982Z","title":"Vanderbei","venue":null,"work_id":"08c55a5e-63c4-4add-be22-3ece07f24b5d","year":2020},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.616742Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:d3c9bac1e2d670196cbf54fe6b73cd795d97be6fb88b6f4ea97153e7dd95aef3","observation_id":"af987e00-2c18-4559-9044-bf91ea5c716f","resolution":{"observed_at":"2026-08-07T13:47:03.426585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:03.110726Z","title":"Random projections for linear programming","venue":null,"work_id":"2ec38361-34ac-4047-bd5e-565bb4195725","year":2018},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.710485Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:f90bd8ba8e36b4448ce34eda08e01a19928149da8a8aa22089b79406cbbd6237","observation_id":"1dfdbe6c-0e32-4cbe-876c-023b568bec28","resolution":{"observed_at":"2026-08-07T13:47:03.262170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:02.967231Z","title":"A new newton method for convex optimization problems with singular hessian matrices","venue":null,"work_id":"86bdb20e-2834-4ca8-aa8d-d325df39cd77","year":2023},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.802125Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:6a490a7ee8829e0350c38638b72f9882378c96823c9e595e7b634f9f158f3129","observation_id":"d483e7a7-febc-4f65-9a17-1fad22bf5ff1","resolution":{"observed_at":"2026-08-07T13:47:03.033356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:02.757640Z","title":null,"venue":null,"work_id":"7fbadb19-9a66-4006-830c-fb1da6630dc6","year":2020},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:00.918594Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:fef277391996c1f57f57a6a279336ed0b76499ff9908bb4796422ab1eb2aaabc","observation_id":"0841b5fd-3d94-42e7-a550-555ff5cebc20","resolution":{"observed_at":"2026-08-07T13:47:02.852123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:02.560012Z","title":null,"venue":null,"work_id":"7e907701-4368-4ae5-932c-be573e7d8e49","year":1997},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:01.011177Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:ad83164ef79b0de4101ae9a6e77b858b6a686c14d5c80eab01e64fd79def97d3","observation_id":"42895bed-9d05-43f2-81b2-c7e8d4fc2515","resolution":{"observed_at":"2026-08-07T13:47:02.656035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:02.343910Z","title":"A deep learning approach for solving linear programming problems","venue":null,"work_id":"a9a882d0-2a91-4f18-875e-e633ea620299","year":2023},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:01.103936Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:908d1c1a7430ef8d4ff8c2ed45762676077ca29cbed6391a81acc0fc3a998e4a","observation_id":"d8fa63f1-be62-4051-9639-4d40a8cdc55d","resolution":{"observed_at":"2026-08-07T13:47:02.452067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:02.157064Z","title":"A simplified homogeneous and self-dual linear programming algorithm and its implementation","venue":null,"work_id":"5fcb5fdd-df5a-434e-9bc2-fc19ffce91b8","year":1996},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:01.192817Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:511ee17f9fba9d359c8fc121b3f0d318515fb9d989c680d58eca53eacdda56ac","observation_id":"6f826cac-2d9c-4f70-87b4-c1c8884d9190","resolution":{"observed_at":"2026-08-07T13:47:02.263148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:01.926162Z","title":"Yamashita and M","venue":null,"work_id":"a375f41e-11cc-4dcd-925d-9b3721ea78a4","year":2001},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:01.258823Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:59046c8cdcc8917ce64a3285ec003c5035406b6fe5ab7425600d821fb6e41a60","observation_id":"d1e86526-1f98-41a3-8bd1-179ed04d6233","resolution":{"observed_at":"2026-08-07T13:47:02.036424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:01.710561Z","title":"Todd, and Shinji Mizuno","venue":null,"work_id":"8324a401-115f-4b62-881f-2cb8830d12bc","year":1994},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:01.344057Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:ce4fc41c643c5eb8fb7378b1b59c6fd951ee8347a5fe8e09e8084d1fdd3cc318","observation_id":"de69f106-ef5c-4f1f-bcc6-36173b94ae6f","resolution":{"observed_at":"2026-08-07T13:47:01.799460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:47:01.593596Z","title":"On the quadratic convergence of the cubic regularization method under a local error bound condition","venue":null,"work_id":"e8480a66-5ebe-4719-9bbf-c7708011cbd6","year":2019},"citing_paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:47:01.461595Z"},"links":{"citing_paper":"/paper/2505.21232"},"observation_digest":"sha256:495cbb19795c1e7c0f567d4a5f7561ec25d44b03cee69b2d9faf1f05260a4cd6","observation_id":"8eed07ab-d6a7-4a64-ae63-a6c388bcc53a","resolution":{"observed_at":"2026-08-07T13:47:01.638322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21232","last_updated":"2025-08-11T13:40:15Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T13:30:33.572919Z","submitted_at":"2025-05-27T14:16:04Z","title":"Solving a linear program via a single unconstrained minimization"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":30},"total_outbound_references":52},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2505.21232."}