{"as_of":"2026-08-20T15:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e5fed94d3000a49651ee8760e8efedced058597dbb845bf75d950a48fc226ca4","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-05-19T14:26:58.288381Z","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-05-19T14:27:24.075451Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.00260","last_updated":"2026-07-06T22:40:17Z","snapshot_observed_at":"2026-08-16T13:47:14.713762Z","submitted_at":"2024-06-01T01:49:37Z","title":"Greedy Learning to Optimize with Convergence Guarantees","version":10},"cited_work":{"arxiv_id":"2406.00260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.00260","snapshot_observed_at":"2026-07-08T01:18:17.138077Z","title":"Learning preconditioners for inverse problems","venue":null,"work_id":"baae4dae-4b6a-4cb5-92db-e81c13ad6752","year":2024},"citing_paper":{"arxiv_id":"2509.05288","last_updated":"2026-04-14T06:59:33Z","snapshot_observed_at":"2026-07-06T22:24:42.849960Z","submitted_at":"2025-09-05T17:55:22Z","title":"Learning to accelerate distributed ADMM using graph neural networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T18:46:36.084583Z"},"links":{"cited_paper":"/paper/2406.00260","citing_paper":"/paper/2509.05288"},"observation_digest":"sha256:1f315d6c32dd6db5cbd8c32ab143b6ca3e711bf8b924590900c31130362df8b8","observation_id":"c3532fb6-2173-4617-b12a-2d9fbf8082c9","resolution":{"observed_at":"2026-07-08T01:18:17.138077Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00260","last_updated":"2026-07-06T22:40:17Z","snapshot_observed_at":"2026-08-16T13:47:14.713762Z","submitted_at":"2024-06-01T01:49:37Z","title":"Greedy Learning to Optimize with Convergence Guarantees","version":10},"cited_work":{"arxiv_id":"2406.00260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.00260","snapshot_observed_at":"2026-07-08T01:18:17.138077Z","title":"Learning preconditioners for inverse problems","venue":null,"work_id":"baae4dae-4b6a-4cb5-92db-e81c13ad6752","year":2024},"citing_paper":{"arxiv_id":"2604.26745","last_updated":"2026-04-29T14:43:21Z","snapshot_observed_at":"2026-08-03T04:50:19.023913Z","submitted_at":"2026-04-29T14:43:21Z","title":"Robust Model-Based Iteration for Passive Gamma Emission Tomography","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-07T12:40:13.947200Z"},"links":{"cited_paper":"/paper/2406.00260","citing_paper":"/paper/2604.26745"},"observation_digest":"sha256:dfa97d028ceb394fe19715045ba0e7658888f092bb44330d1525397090a69087","observation_id":"f5a5ff67-277a-4e8e-a5a6-1647b47dd898","resolution":{"observed_at":"2026-07-08T01:18:17.138077Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00260","last_updated":"2026-07-06T22:40:17Z","snapshot_observed_at":"2026-08-16T13:47:14.713762Z","submitted_at":"2024-06-01T01:49:37Z","title":"Greedy Learning to Optimize with Convergence Guarantees","version":10},"cited_work":{"arxiv_id":"2406.00260","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.00260","snapshot_observed_at":"2026-07-08T01:18:17.138077Z","title":"Learning preconditioners for inverse problems","venue":null,"work_id":"baae4dae-4b6a-4cb5-92db-e81c13ad6752","year":2024},"citing_paper":{"arxiv_id":"2605.15456","last_updated":"2026-05-14T22:39:21Z","snapshot_observed_at":"2026-08-15T03:01:26.042003Z","submitted_at":"2026-05-14T22:39:21Z","title":"DIPA: Distilled Preconditioned Algorithms for Solving Imaging Inverse Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T14:26:58.288381Z"},"links":{"cited_paper":"/paper/2406.00260","citing_paper":"/paper/2605.15456"},"observation_digest":"sha256:1e137627349135d05ea8a90067cc4e121d097da636472b54cac67eaa6c8baabc","observation_id":"ecc1e445-7dd8-4720-a421-0ebec5efb3c0","resolution":{"observed_at":"2026-07-08T01:18:17.138077Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.00260/citation-record","integrity":"/paper/2406.00260/integrity","json":"/paper/2406.00260/citation-record.json","paper":"/paper/2406.00260"},"outbound":[],"paper":{"arxiv_id":"2406.00260","last_updated":"2026-07-06T22:40:17Z","latest_version":10,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T13:47:14.713762Z","submitted_at":"2024-06-01T01:49:37Z","title":"Greedy Learning to Optimize with Convergence Guarantees"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.00260."}