{"as_of":"2026-08-13T13:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0674c591efa6765616e81fa10b89e81d2d9d2069ecab78100dab4df3cbf5453c","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:58:32.614756Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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.14828/citation-record","integrity":"/paper/2411.14828/integrity","json":"/paper/2411.14828/citation-record.json","paper":"/paper/2411.14828"},"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-12T14:58:35.005237Z","title":null,"venue":null,"work_id":"8138184c-9d09-4923-a3a6-90fca4f7aa4a","year":2023},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.520860Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:fd64fbaf73d79b1f700af06daf8bf917fbaabef5ead40799c24aa0a5eeb94df1","observation_id":"2c307ee7-0783-489e-892b-d71160405dc0","resolution":{"observed_at":"2026-08-12T14:58:35.009449Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.971346Z","title":null,"venue":null,"work_id":"3ef982e8-fb06-4a10-8936-9c11c9335d8c","year":2011},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.528395Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:510030ec7c0554a0a477661ac9a6fc2e12967218f91d5658a9bce54421d5108c","observation_id":"a959b079-3de5-41b3-91a4-34333a82e5fa","resolution":{"observed_at":"2026-08-12T14:58:34.995316Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.807421Z","title":null,"venue":null,"work_id":"10861ac0-610d-4153-801e-2b44ed4818e9","year":2004},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.535239Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:0d2e37f079531b5764b5cebef817f86641e89de432e09d7607b20c08cdb6432a","observation_id":"e37d0e54-89e0-4d82-8a3e-4cd08d86ebed","resolution":{"observed_at":"2026-08-12T14:58:34.895087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.760142Z","title":null,"venue":null,"work_id":"4330e06f-639e-4129-ba0a-932b502bc89b","year":2006},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.543605Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:12eb4c93ba2895b65f949b6fc0f55cf693bd6559d4a011b7acd31af0bdc1f291","observation_id":"6b49790c-7156-48ff-b3e7-70fbfc9d215b","resolution":{"observed_at":"2026-08-12T14:58:34.764245Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.746391Z","title":null,"venue":null,"work_id":"7c209d2f-e5db-4242-ada0-861afe48bcfe","year":2003},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.556178Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:31beb944abe4d1dc856f749a76332f4018b99294aa3f3e9a4b73acc13ca96deb","observation_id":"10cee026-bd50-4e4b-878c-591a8faf4b9c","resolution":{"observed_at":"2026-08-12T14:58:34.750785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.700150Z","title":"K.C., Ruszczynski","venue":null,"work_id":"55737ba1-2828-4154-90ec-d2e648608ecf","year":2012},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.589964Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:c32cbcff19dddce3d76c3c7b8505fe87bb9ec43d41b5da4bfa1e398be980cc9b","observation_id":"12b15104-bf90-4256-8534-baa99c8e09c1","resolution":{"observed_at":"2026-08-12T14:58:34.707986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.584507Z","title":null,"venue":null,"work_id":"aae8cda7-4d5b-43a8-b54c-071422c5d7fc","year":2014},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.595560Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:5fd9f34d077c94c2670350c52cc5ee189c580747e2e6196ec6caf1c46032427e","observation_id":"9b9ce23a-3744-44b6-b042-700bfe6ed7b7","resolution":{"observed_at":"2026-08-12T14:58:34.590201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.569264Z","title":null,"venue":null,"work_id":"a83f1a83-d56b-4ceb-8f57-625017b77e91","year":2014},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.600078Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:3aea53553eae01fdebd4429f7c3be13f74a1d3024195967a6c6c50f4ae2b0dc5","observation_id":"30d40c16-13ac-4d4b-a592-de70de4ee8b4","resolution":{"observed_at":"2026-08-12T14:58:34.574131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.435764Z","title":null,"venue":null,"work_id":"b4570c0d-b013-4463-bfe2-8e972319a5f9","year":1983},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.604525Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:b544979c9b9aede243ebf750d15698cb49b8c404de3fb7da96da12e359a54ff2","observation_id":"00afa56f-60bb-4d72-83c5-cf02a312e52c","resolution":{"observed_at":"2026-08-12T14:58:34.509323Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.356234Z","title":null,"venue":null,"work_id":"56179670-8d86-4eee-88f2-0e155782a01a","year":2020},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.608866Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:db2b2282f1712645d58f36f588d0387dfd09d2b16476c1f765588c030375b91c","observation_id":"479de895-729c-4988-ae59-5d1ce1cc864c","resolution":{"observed_at":"2026-08-12T14:58:34.362049Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.201300Z","title":null,"venue":null,"work_id":"de72eefa-9b3f-45e7-bb6b-6207bc215806","year":2023},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.613235Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:fb2572bea2439612289f422a2b48e1d13c68e93c0162168e0bba9d7a709195b7","observation_id":"203ae6ad-8d5b-4ec0-8c04-c2728eb342e7","resolution":{"observed_at":"2026-08-12T14:58:34.228778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.188187Z","title":null,"venue":null,"work_id":"2c2b3ffd-b7cd-4cce-8194-579e7e298a57","year":2005},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.617732Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:1021eaae96fcbab27608b9b1aea40bbea9a9bf0d605b23302af29bb3e80a97dc","observation_id":"5cf4227a-ef0d-4290-86cf-c8c2499c6dc8","resolution":{"observed_at":"2026-08-12T14:58:34.192296Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:34.149439Z","title":null,"venue":null,"work_id":"e9801d04-26b8-44ec-98c8-abb90d0d4657","year":2015},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.738366Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:dcac1ca6268ba880ca86c8d5f80ff331ff6439051f7647174bcf7ad79dbb400e","observation_id":"ec607e97-5cae-4dab-92b4-624783c25b53","resolution":{"observed_at":"2026-08-12T14:58:34.178769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.971438Z","title":null,"venue":null,"work_id":"b6497fe4-8a3e-4dc2-add1-993c0013ec33","year":2011},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.854150Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:e28874e0b7e390b8299a77369c474b61377d2cb309d9e95d9255063189fdcb6c","observation_id":"74a75235-7f88-4b9d-85a5-5daead6868c5","resolution":{"observed_at":"2026-08-12T14:58:34.053477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.956824Z","title":null,"venue":null,"work_id":"829fbe24-c1a3-48d4-9a5e-0a9490d6d369","year":2009},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.883948Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:37e967eb7731593f9a9d89977776327ace08ac1058bf163bbbd025ba15350039","observation_id":"9b718400-1fe4-4986-be2e-af387ee85218","resolution":{"observed_at":"2026-08-12T14:58:33.962064Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.943240Z","title":null,"venue":null,"work_id":"3962bd98-30fd-4042-839b-4d75598737df","year":2012},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.919800Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:b3b9c4072321ca8c395ac219f222915a6af0e20d6077111b3bca953637b4da3c","observation_id":"2ba029c7-88d2-4700-bc61-1cfdc838ffdc","resolution":{"observed_at":"2026-08-12T14:58:33.947614Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.833378Z","title":null,"venue":null,"work_id":"6d7e9b81-9948-4848-b2b1-8354019aa0e5","year":2019},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.924679Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:768c475436e736eeab0a9750eaf45083a208b608a40d417baa045140c9a4f2a8","observation_id":"17bb7207-8542-43c3-a489-541c607df956","resolution":{"observed_at":"2026-08-12T14:58:33.917536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.738280Z","title":null,"venue":null,"work_id":"3358150c-4290-4978-984c-6d8283d16de1","year":2012},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.929215Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:2e192d377f77bd58be5ae86830ac3e0582ad9c7b5ab94a10609d9eb714f524df","observation_id":"cba51f98-851e-4515-96cf-3d7c4fd363ab","resolution":{"observed_at":"2026-08-12T14:58:33.743529Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.725143Z","title":null,"venue":null,"work_id":"140b67d4-4931-4a3f-802f-059fca671202","year":2015},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.933616Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:84678f16385b2ab881ea16820a0a9d6144743283c118cb1d146d333ace4e04cf","observation_id":"2fe889d7-ec7e-4789-8647-bac142e6599b","resolution":{"observed_at":"2026-08-12T14:58:33.729286Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.712484Z","title":null,"venue":null,"work_id":"a9daa9d2-d506-46ba-bb0e-ae74cb8cddd6","year":2016},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.937948Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:5f7dcfc5ed420dc9c51244b7a74ace99ec350493eaa8a1f4f7159d770fa3ed42","observation_id":"1bbdbc81-b7c0-4049-9266-622843145cf0","resolution":{"observed_at":"2026-08-12T14:58:33.716516Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.698918Z","title":null,"venue":null,"work_id":"cc2e63fa-222e-4ef6-bd01-bea410b7e44f","year":2021},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.942147Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:e64c1c5a0bcfc90b7510b628b8784bd8ebb9d9109e645a9314e699717a070f35","observation_id":"997ea477-f542-4f9e-bd83-870a94bd2e8a","resolution":{"observed_at":"2026-08-12T14:58:33.703339Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.555934Z","title":null,"venue":null,"work_id":"37a37979-d35a-434e-ae07-1e3b96c59047","year":1983},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.946885Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:cf17c8f4769682b115b0b3ce28e7cfb7002534be5adf0f7b7ba354b18b26ffd3","observation_id":"da707e7b-f61b-428c-9e81-2b9e8b3d3eb1","resolution":{"observed_at":"2026-08-12T14:58:33.610832Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.541389Z","title":null,"venue":null,"work_id":"45110618-4a4a-4b36-aa0f-69added46031","year":2016},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.950570Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:226e5331c1ec8be9c62aa98c1a2a268ece214adf8f41dc583afc6f7eeafaa417","observation_id":"8dc7493f-6b85-4f78-a1c0-b6f45dfb3231","resolution":{"observed_at":"2026-08-12T14:58:33.545791Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03653","last_updated":"2018-02-15T16:40:22Z","snapshot_observed_at":"2026-08-08T23:44:43.483851Z","submitted_at":"2018-02-10T21:45:46Z","title":"On Symplectic Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03653","snapshot_observed_at":"2026-08-12T14:58:31.955053Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:31.955053Z"},"links":{"cited_paper":"/paper/1802.03653","citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:52bf97105b920e9629d5a645a3436fde3b4f5396239930c8f040fd48fc0b4ee8","observation_id":"177fd121-0377-4c7b-a510-536079e44dcb","resolution":{"observed_at":"2026-08-12T14:58:31.955053Z","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-12T14:58:33.527620Z","title":null,"venue":null,"work_id":"067768cc-656e-455c-b483-adb666452ae7","year":2021},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.001622Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:362844765c391f7b7760d4a62f154534300f06c677ea4c337f94edbd5a4317ec","observation_id":"8974c7b3-f888-4301-9b3c-7dfeb8343f11","resolution":{"observed_at":"2026-08-12T14:58:33.532018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.444266Z","title":null,"venue":null,"work_id":"f852a451-76c5-49f4-8a60-a99dbd0a4ec6","year":2021},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.075588Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:de2e43645655bacf7d4f255cd1695fc7e09e3ddc3437714894ec2cef0ec64f8d","observation_id":"f3b9d75f-c4a8-4069-9f15-d8bf38ff2570","resolution":{"observed_at":"2026-08-12T14:58:33.489836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.05700","last_updated":"2022-12-12T04:36:37Z","snapshot_observed_at":"2026-08-13T13:23:46.887481Z","submitted_at":"2022-12-12T04:36:37Z","title":"Revisiting the acceleration phenomenon via high-resolution differential equations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.05700","snapshot_observed_at":"2026-08-12T14:58:32.112062Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.112062Z"},"links":{"cited_paper":"/paper/2212.05700","citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:e1767988077ac3a141156e9ad361a2972f45f8d0cd84cf06bcb51f2a694f8b39","observation_id":"2b8bbd7f-8cda-4a11-9333-3bfec877f5fd","resolution":{"observed_at":"2026-08-12T14:58:32.112062Z","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-12T14:58:33.332382Z","title":null,"venue":null,"work_id":"7c9e9811-1939-4048-bd79-77b52b71fef6","year":2021},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.129145Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:0d9e2c5919e1f6cdaea939ae18a7f230ba6cc86924dfceac10925ef1be41f4f8","observation_id":"34f17b5c-b10f-4436-b26a-6e6d4c7b52dc","resolution":{"observed_at":"2026-08-12T14:58:33.361538Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.319203Z","title":null,"venue":null,"work_id":"39869755-774f-4e08-bb3d-414741b0431b","year":2022},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.133541Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:34f8bd70e97ee50c74c6d5340b5d8c1b0b99a1facd0c4aece671d819d7ccc67c","observation_id":"aa2548c5-029d-4395-bcea-cddeecd1b990","resolution":{"observed_at":"2026-08-12T14:58:33.323587Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09276","last_updated":"2019-12-24T15:48:06Z","snapshot_observed_at":"2026-08-12T17:56:18.604985Z","submitted_at":"2019-12-19T15:19:38Z","title":"First order optimization methods based on Hessian-driven Nesterov accelerated gradient flow","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09276","snapshot_observed_at":"2026-08-12T14:58:32.137539Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.137539Z"},"links":{"cited_paper":"/paper/1912.09276","citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:9de7e22f5a5404b468f7295f4378d7f530a9bc14f28d76bd8929813ad9124c17","observation_id":"6d780b87-21bf-4c55-8d5f-d8f42f07aeeb","resolution":{"observed_at":"2026-08-12T14:58:32.137539Z","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-12T14:58:33.305770Z","title":null,"venue":null,"work_id":"a6b82e6c-f1b1-4f31-a265-96ce57233935","year":2023},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.142009Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:68494c71f3464c4a67642c68ffc463639ddd0134f9e2f9a6300fa2bd012276df","observation_id":"8a3eaae8-1d06-4f91-bd31-3b64b58be6b8","resolution":{"observed_at":"2026-08-12T14:58:33.309702Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.07672","last_updated":"2025-05-25T05:37:12Z","snapshot_observed_at":"2026-08-13T04:42:47.908545Z","submitted_at":"2024-01-15T13:36:21Z","title":"Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.07672","snapshot_observed_at":"2026-08-12T14:58:32.146240Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.146240Z"},"links":{"cited_paper":"/paper/2401.07672","citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:0b958ab09dea82dd2069ebc8941d8bd4408388d308da276d2526763c56cccf43","observation_id":"e596e54e-ebef-4e23-9f1b-3dc53a846f05","resolution":{"observed_at":"2026-08-12T14:58:32.146240Z","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-12T14:58:33.292980Z","title":null,"venue":null,"work_id":"99b8b3b4-e4a2-40fb-9b75-13e8384b031f","year":2017},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.180249Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:ff37756f15c2315b49a5e865db171d769d003ade1cd6b560f6acd7a346fdb0d1","observation_id":"f907409e-66cd-4495-8825-c3e7abcee534","resolution":{"observed_at":"2026-08-12T14:58:33.296851Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.03690","last_updated":"2022-02-15T13:10:28Z","snapshot_observed_at":"2026-07-06T08:42:52.741268Z","submitted_at":"2019-12-08T14:47:35Z","title":"Dynamical Primal-Dual Accelerated Method with Applications to Network Optimization","version":2},"cited_work":{"arxiv_id":"1912.03690","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.03690","snapshot_observed_at":"2026-08-12T14:58:32.650435Z","title":"Dynamical Primal-Dual Accelerated Method with Applications to Network Optimization","venue":"math.OC","work_id":"a1d40b29-0e9e-4efe-b05a-9545359c5c12","year":2019},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.278064Z"},"links":{"cited_paper":"/paper/1912.03690","citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:4fb6f49d91580aa1f25a2fbdcee85392224e9fb2738d1012f74f9b256727075f","observation_id":"0eb87131-9b27-4d9b-9677-33d326a32333","resolution":{"observed_at":"2026-08-12T14:58:32.695942Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.242775Z","title":"R., Tits, A","venue":null,"work_id":"8a11388a-1836-48f7-97c6-b481d14adf3b","year":1988},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.356358Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:64f132bae0b237d73ee2066ff9109212dcc470e644a0636e80e2f9d0232cb7a2","observation_id":"438ae680-89d9-4233-87d2-d06f698b0045","resolution":{"observed_at":"2026-08-12T14:58:33.268290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.140891Z","title":"B., Pan, H","venue":null,"work_id":"987cd5df-4d60-4fb9-9840-675756c96c08","year":2015},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.379293Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:e3fae3508e1788004897b674a6c5708b9d59c6dbf78865c4d3f0d119d43a0496","observation_id":"636ace5f-d729-4f54-9f5b-e7878fb935c8","resolution":{"observed_at":"2026-08-12T14:58:33.179484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.127054Z","title":null,"venue":null,"work_id":"eb99b1c2-e367-4248-91d0-f17830f6037a","year":2023},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.384868Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:db9298d54bb7df8d606e9995bd6c21f7913aef685e68e4f38ac4025a4aa93cd2","observation_id":"687e887a-475e-4abe-812f-2c573cfa23db","resolution":{"observed_at":"2026-08-12T14:58:33.131430Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.114312Z","title":null,"venue":null,"work_id":"b701b982-372a-40df-a302-43372433684c","year":2021},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.389225Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:ea647e5736c363f33dc3ac2d86a4eb3837c02ebf518ec9d2ccefebf0131dfaee","observation_id":"373173cb-f1b9-4dbf-8dd6-fb2530177cc8","resolution":{"observed_at":"2026-08-12T14:58:33.118247Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:33.017902Z","title":null,"venue":null,"work_id":"c4b8966b-3426-48ac-9ed6-cbdaac50f1a9","year":2022},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.394508Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:a7a826bad2194e9352b24655a1f1a2214af337e6f1e574bc184d740faf90a97d","observation_id":"8409f432-0a46-4624-8bf8-b16abcb4fe66","resolution":{"observed_at":"2026-08-12T14:58:33.093657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:32.890626Z","title":null,"venue":null,"work_id":"27a39e4c-ea66-4cdf-a0d4-3d45040d075b","year":2018},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.398696Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:f5cde7bd4d08877532f206d844816f9d066550dcf172a8faef7b99e714337321","observation_id":"60d1de3a-5ccc-4567-9f96-7b82c3d418a5","resolution":{"observed_at":"2026-08-12T14:58:32.925424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:32.877725Z","title":null,"venue":null,"work_id":"5af6a88a-b56a-44b5-b65b-67021d15f853","year":1982},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.402605Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:b41d270ffc60ec8de3dcc4ea7f5132069ea3c1a9aef1c1c7ac709a6d9573c470","observation_id":"db265f95-3721-4f2d-8608-3b5b58b7edb7","resolution":{"observed_at":"2026-08-12T14:58:32.881690Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:32.863754Z","title":null,"venue":null,"work_id":"0c4172c3-14b0-4159-a004-4a8751a0e309","year":1992},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.519845Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:105a94e6a53d589604845ec42514a4bf8c6b1da3b6c491660c33e84c6aadb0b7","observation_id":"e246d400-8fd9-4c40-9cb5-1885ed83c450","resolution":{"observed_at":"2026-08-12T14:58:32.868488Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:32.798278Z","title":null,"venue":null,"work_id":"3041f49b-ad09-4e99-9d1a-84c301157552","year":1992},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.575684Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:7b8e283eb3ef5b4aff4e0be225a939dc839b7236165c0b64532df1770299f9bc","observation_id":"b8d72e59-4276-495f-8b91-81711ccbd564","resolution":{"observed_at":"2026-08-12T14:58:32.841212Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:58:32.766365Z","title":null,"venue":null,"work_id":"5b727bf6-c6db-4ea7-bc52-5b35b9bdb90d","year":2015},"citing_paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:58:32.614756Z"},"links":{"citing_paper":"/paper/2411.14828"},"observation_digest":"sha256:c1a2c8517941d795b574b4e5a617b8686fe64055d07b483a61f5155e1868c9fd","observation_id":"65ee38f3-2f26-4072-9acc-1eff1caf6aed","resolution":{"observed_at":"2026-08-12T14:58:32.770830Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14828","last_updated":"2024-11-22T10:07:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T14:47:55.568685Z","submitted_at":"2024-11-22T10:07:09Z","title":"Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":40,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":44},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2411.14828."}