{"as_of":"2026-08-09T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:63b6922be88599b6c8a1466f74301d12f1415b074197092a3711c67a9bd625fd","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:00:50.998665Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T16:45:51.397704Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.19506","last_updated":"2024-10-25T12:19:31Z","snapshot_observed_at":"2026-07-06T19:39:42.675941Z","submitted_at":"2024-10-25T12:19:31Z","title":"Optimization with First Order Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19506","snapshot_observed_at":"2026-08-07T14:00:50.998665Z","title":"Optimization with first order algo- rithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20160","last_updated":"2025-06-17T12:45:51Z","snapshot_observed_at":"2026-08-09T02:00:31.933557Z","submitted_at":"2025-05-26T16:04:17Z","title":"DeepInverse: A Python package for solving imaging inverse problems with deep learning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:00:50.998665Z"},"links":{"cited_paper":"/paper/2410.19506","citing_paper":"/paper/2505.20160"},"observation_digest":"sha256:34b980c7fd7b9b7ff49f55b516e4767bc4398fc143546e18ba5d2f3eeafec325","observation_id":"5f08bda3-a2f1-4a6f-a24c-7792398f5bbd","resolution":{"observed_at":"2026-08-07T14:00:50.998665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19506","last_updated":"2024-10-25T12:19:31Z","snapshot_observed_at":"2026-07-06T19:39:42.675941Z","submitted_at":"2024-10-25T12:19:31Z","title":"Optimization with First Order Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19506","snapshot_observed_at":"2026-08-05T10:27:41.210482Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.04264","last_updated":"2026-06-16T14:22:33Z","snapshot_observed_at":"2026-08-05T10:27:39.238144Z","submitted_at":"2025-09-04T14:42:13Z","title":"On computing sparse universal solvers for key problems in statistics","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T10:27:41.210482Z"},"links":{"cited_paper":"/paper/2410.19506","citing_paper":"/paper/2509.04264"},"observation_digest":"sha256:efff6a647f61d19a3f8a82de27e7193fbd1934b5861a64a5a1a86cda2e58ac69","observation_id":"642ce1c0-af9b-4545-890b-14bc24a6e731","resolution":{"observed_at":"2026-08-05T10:27:41.210482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19506","last_updated":"2024-10-25T12:19:31Z","snapshot_observed_at":"2026-07-06T19:39:42.675941Z","submitted_at":"2024-10-25T12:19:31Z","title":"Optimization with First Order Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19506","snapshot_observed_at":"2026-08-03T01:09:06.391639Z","title":"Optimization with first order algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.10691","last_updated":"2026-07-15T07:42:51Z","snapshot_observed_at":"2026-08-08T13:45:32.808902Z","submitted_at":"2026-02-11T09:47:52Z","title":"Convergence Rates for Distribution Matching with Sliced Optimal Transport","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T01:09:06.391639Z"},"links":{"cited_paper":"/paper/2410.19506","citing_paper":"/paper/2602.10691"},"observation_digest":"sha256:95f053723e30958de6607699ef4789c790239f5ba02761a467dd8a9faabcf173","observation_id":"05445484-8ff3-4b6c-a014-e23af5462503","resolution":{"observed_at":"2026-08-03T01:09:06.391639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19506","last_updated":"2024-10-25T12:19:31Z","snapshot_observed_at":"2026-07-06T19:39:42.675941Z","submitted_at":"2024-10-25T12:19:31Z","title":"Optimization with First Order Algorithms","version":1},"cited_work":{"arxiv_id":"2410.19506","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19506","snapshot_observed_at":"2026-07-01T16:45:51.397704Z","title":"arXiv preprint arXiv:2410.19506 , year=","venue":null,"work_id":"b643a238-f556-4c7e-808d-3e4f541abf5d","year":2024},"citing_paper":{"arxiv_id":"2605.12085","last_updated":"2026-05-12T13:07:35Z","snapshot_observed_at":"2026-07-06T23:23:48.960874Z","submitted_at":"2026-05-12T13:07:35Z","title":"A Line--Search--Based Stochastic Gradient Method for 3D Computed Tomography","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-13T04:18:06.285491Z"},"links":{"cited_paper":"/paper/2410.19506","citing_paper":"/paper/2605.12085"},"observation_digest":"sha256:572690dc89d54ad00481627290921953e6bac881d761bb31424b4f98da6eacec","observation_id":"85ecc5cc-9d3a-43b2-9742-9b9ec9d673bb","resolution":{"observed_at":"2026-05-13T04:22:14.766764Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":{"arxiv_id":"2410.19506","last_updated":"2024-10-25T12:19:31Z","snapshot_observed_at":"2026-07-06T19:39:42.675941Z","submitted_at":"2024-10-25T12:19:31Z","title":"Optimization with First Order Algorithms","version":1},"cited_work":{"arxiv_id":"2410.19506","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19506","snapshot_observed_at":"2026-07-01T16:45:51.397704Z","title":"arXiv preprint arXiv:2410.19506 , year=","venue":null,"work_id":"b643a238-f556-4c7e-808d-3e4f541abf5d","year":2024},"citing_paper":{"arxiv_id":"2605.20962","last_updated":"2026-05-20T09:48:46Z","snapshot_observed_at":"2026-07-06T23:31:27.989406Z","submitted_at":"2026-05-20T09:48:46Z","title":"No-regret optimization of time-varying bilevel problems","version":1},"reference_index":165,"source":"arxiv_source","source_observed_at":"2026-05-21T03:41:35.753370Z"},"links":{"cited_paper":"/paper/2410.19506","citing_paper":"/paper/2605.20962"},"observation_digest":"sha256:a19f0d5e8a07e93e73e4d509dd80f8f160028ae320b2d0be779e6441d137c711","observation_id":"188a6847-8ab6-4d43-bec1-8890701c2b81","resolution":{"observed_at":"2026-05-21T03:43:56.292276Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":{"arxiv_id":"2410.19506","last_updated":"2024-10-25T12:19:31Z","snapshot_observed_at":"2026-07-06T19:39:42.675941Z","submitted_at":"2024-10-25T12:19:31Z","title":"Optimization with First Order Algorithms","version":1},"cited_work":{"arxiv_id":"2410.19506","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19506","snapshot_observed_at":"2026-07-01T16:45:51.397704Z","title":"arXiv preprint arXiv:2410.19506 , year=","venue":null,"work_id":"b643a238-f556-4c7e-808d-3e4f541abf5d","year":2024},"citing_paper":{"arxiv_id":"2605.26318","last_updated":"2026-05-25T20:25:30Z","snapshot_observed_at":"2026-08-03T01:50:29.589086Z","submitted_at":"2026-05-25T20:25:30Z","title":"Sparse symmetric generalized inverses for sparse symmetric matrices","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T20:14:43.541001Z"},"links":{"cited_paper":"/paper/2410.19506","citing_paper":"/paper/2605.26318"},"observation_digest":"sha256:234527efcb92cd85fb8a72f4a048cd243f339e81a366b6fb6b621fb90d6fbdc0","observation_id":"850bb1f9-0737-4580-b95b-f8f8e0aef3ec","resolution":{"observed_at":"2026-07-01T16:45:51.399051Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2410.19506/citation-record","integrity":"/paper/2410.19506/integrity","json":"/paper/2410.19506/citation-record.json","paper":"/paper/2410.19506"},"outbound":[],"paper":{"arxiv_id":"2410.19506","last_updated":"2024-10-25T12:19:31Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T19:39:42.675941Z","submitted_at":"2024-10-25T12:19:31Z","title":"Optimization with First Order Algorithms"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2410.19506."}