{"as_of":"2026-08-09T17:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2e46edf26b66cdc620a042e2761cf2b32ec2c97b74b0b355cfb262bb24ed0d3","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T12:53:50.379258Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T14:05:53.557310Z","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-06-29T23:24:01.327990Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"cited_work":{"arxiv_id":"2510.01943","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2510.01943","snapshot_observed_at":"2026-07-16T01:21:41.617160Z","title":"Martínez-Rubio","venue":null,"work_id":"e53c71a7-6764-48de-9181-db2b63b5864b","year":2025},"citing_paper":{"arxiv_id":"2605.25255","last_updated":"2026-05-24T21:04:26Z","snapshot_observed_at":"2026-07-06T23:35:16.647496Z","submitted_at":"2026-05-24T21:04:26Z","title":"Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T23:22:12.108099Z"},"links":{"cited_paper":"/paper/2510.01943","citing_paper":"/paper/2605.25255"},"observation_digest":"sha256:0df346457b33079b54401c03b515b001950218812ecc0acec060ed89717b8d91","observation_id":"fe76aac7-7fe2-43a6-9e9b-3da987e529be","resolution":{"observed_at":"2026-07-16T01:21:41.617160Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.01943","snapshot_observed_at":"2026-08-01T11:19:23.085558Z","title":"Mart \\' nez-Rubio , Smooth quasar-convex optimization with constraints , arXiv preprint arXiv:2510.01943, (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19965","last_updated":"2026-07-22T09:48:50Z","snapshot_observed_at":"2026-08-08T16:19:57.914989Z","submitted_at":"2026-07-22T09:48:50Z","title":"Accelerated Stochastic Zeroth-Order Quasar-Convex Optimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T11:19:23.085558Z"},"links":{"cited_paper":"/paper/2510.01943","citing_paper":"/paper/2607.19965"},"observation_digest":"sha256:1ac3f85d4c06d22ce19b35cc7556d98f0d94bae1192bc9c7fe16a45ee022987b","observation_id":"2bc71f5a-d62f-4fb5-9694-468613dfda15","resolution":{"observed_at":"2026-08-01T11:19:23.085558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.01943","snapshot_observed_at":"2026-08-02T14:05:53.557310Z","title":"arXiv:2510.01943v2https://arxiv.org/abs/2510.01943v2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.557310Z"},"links":{"cited_paper":"/paper/2510.01943","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:2e6ebb33a9f978b2ce90ed6b028ddb2b7b143733749c5a0bafadce0a5c3b4d62","observation_id":"8865e970-a83e-4b6f-9eef-3ade399d0b20","resolution":{"observed_at":"2026-08-02T14:05:53.557310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2510.01943/citation-record","integrity":"/paper/2510.01943/integrity","json":"/paper/2510.01943/citation-record.json","paper":"/paper/2510.01943"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:53:49.784447Z","title":"Thus, if we detect that y satisfies∥∇F (y)∥2≤ √ 2Lδ, then we have F (y)−F (y∗)≤ δ","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T12:53:49.784447Z"},"links":{"citing_paper":"/paper/2510.01943"},"observation_digest":"sha256:b7df4f68aad663d637df2070b51d0b75298d628220a71f5369fb91769c858e54","observation_id":"b9f6e235-91e1-4cea-a27a-303fbfd689e8","resolution":{"observed_at":"2026-08-04T12:53:49.784447Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:53:49.912005Z","title":"Since the condition number of F (yk) is O(1), we can do so with PGD in ˜O(log( LD2 δ )) iterations, cf","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T12:53:49.912005Z"},"links":{"citing_paper":"/paper/2510.01943"},"observation_digest":"sha256:7b80997f1f875f91c86c0971897375caccaafc48fb32401de889ab4d1446e532","observation_id":"cc23eb81-4c3a-4584-9370-22609eb878fd","resolution":{"observed_at":"2026-08-04T12:53:49.912005Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:53:50.035904Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T12:53:50.035904Z"},"links":{"citing_paper":"/paper/2510.01943"},"observation_digest":"sha256:b675973b9669f6a933fbe8edad0abe51a9c5959cc6f4483815c6beb54c771d49","observation_id":"aeeaf8ea-7d71-40a9-9ac7-ffa40476b386","resolution":{"observed_at":"2026-08-04T12:53:50.035904Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:53:50.245072Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T12:53:50.245072Z"},"links":{"citing_paper":"/paper/2510.01943"},"observation_digest":"sha256:54d89cd8bebeb600fcebce9a43ed84c939bde0a6a2df88adc8ba137ccee883d5","observation_id":"a82661a5-216b-4202-b56c-b0e5427f6a0c","resolution":{"observed_at":"2026-08-04T12:53:50.245072Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T12:53:50.379258Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T12:53:50.379258Z"},"links":{"citing_paper":"/paper/2510.01943"},"observation_digest":"sha256:a484816040d665a32acc0adb84ff18037a192f8e2c35c52b155f664fa035aeb4","observation_id":"82baef6d-6432-4256-aab9-ee7ac57d1707","resolution":{"observed_at":"2026-08-04T12:53:50.379258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":5},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 3 inbound Pith citation observations for arXiv:2510.01943."}