{"as_of":"2026-08-14T16:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f89a2d4e715879133b3404d3d18bf1e2bb7d26dcbc0510e19c1cc0e966ef2a6e","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:53:43.883206Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T00:53:54.177858Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.06720","last_updated":"2024-04-10T04:15:50Z","snapshot_observed_at":"2026-08-13T00:33:44.176388Z","submitted_at":"2024-04-10T04:15:50Z","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","version":1},"cited_work":{"arxiv_id":"2404.06720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.06720","snapshot_observed_at":"2026-08-07T00:53:54.177858Z","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","venue":"math.OC","work_id":"1d65573d-19c8-4e5f-9f23-2772d39fb923","year":2024},"citing_paper":{"arxiv_id":"2506.13048","last_updated":"2025-06-16T02:31:41Z","snapshot_observed_at":"2026-08-11T22:49:08.183029Z","submitted_at":"2025-06-16T02:31:41Z","title":"The Space Complexity of Learning-Unlearning Algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T00:53:43.883206Z"},"links":{"cited_paper":"/paper/2404.06720","citing_paper":"/paper/2506.13048"},"observation_digest":"sha256:7638d845810e424f4b30575a8213cc5e37ecad76e089b98ea1cc6c388f2cba5d","observation_id":"09bfe4b6-ca42-452b-91cc-5620de368d52","resolution":{"observed_at":"2026-08-07T00:53:54.212674Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.06720/citation-record","integrity":"/paper/2404.06720/integrity","json":"/paper/2404.06720/citation-record.json","paper":"/paper/2404.06720"},"outbound":[],"paper":{"arxiv_id":"2404.06720","last_updated":"2024-04-10T04:15:50Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T00:33:44.176388Z","submitted_at":"2024-04-10T04:15:50Z","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.06720."}