{"as_of":"2026-08-09T13:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdb12a2b1ef647f9b665b2a320eec2aaf0b6cf852c0d8251a760c2d673e6b8d9","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T01:24:12.412433Z","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-07-10T01:26:43.264407Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.00311","last_updated":"2024-02-01T03:50:12Z","snapshot_observed_at":"2026-07-06T17:23:31.057358Z","submitted_at":"2024-02-01T03:50:12Z","title":"A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming","version":1},"cited_work":{"arxiv_id":"2402.00311","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.00311","snapshot_observed_at":"2026-07-10T01:26:43.264407Z","title":"A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming","venue":"math.OC","work_id":"ca95665b-c44f-4237-9f7f-700ac5aaa94d","year":2024},"citing_paper":{"arxiv_id":"2605.07113","last_updated":"2026-05-08T01:41:40Z","snapshot_observed_at":"2026-07-31T16:17:25.056644Z","submitted_at":"2026-05-08T01:41:40Z","title":"Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-05-11T00:55:32.471978Z"},"links":{"cited_paper":"/paper/2402.00311","citing_paper":"/paper/2605.07113"},"observation_digest":"sha256:1aff5fef7105fa4dbbfadcad947e5c1e6c09f8758e9fedced98001dab8c1798c","observation_id":"beffa359-7fa4-4de4-8ac8-a6d9d202d45e","resolution":{"observed_at":"2026-05-11T05:00:55.686337Z","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":"2402.00311","last_updated":"2024-02-01T03:50:12Z","snapshot_observed_at":"2026-07-06T17:23:31.057358Z","submitted_at":"2024-02-01T03:50:12Z","title":"A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming","version":1},"cited_work":{"arxiv_id":"2402.00311","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.00311","snapshot_observed_at":"2026-07-10T01:26:43.264407Z","title":"A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming","venue":"math.OC","work_id":"ca95665b-c44f-4237-9f7f-700ac5aaa94d","year":2024},"citing_paper":{"arxiv_id":"2607.08035","last_updated":"2026-07-09T01:25:30Z","snapshot_observed_at":"2026-08-08T12:52:13.160994Z","submitted_at":"2026-07-09T01:25:30Z","title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-10T01:24:12.412433Z"},"links":{"cited_paper":"/paper/2402.00311","citing_paper":"/paper/2607.08035"},"observation_digest":"sha256:bf08f49e9f653b5928991b823fb47dea44d303673950a509b3a4f503ebaac4e4","observation_id":"bc32b8eb-9815-417b-b541-57409a0bced4","resolution":{"observed_at":"2026-07-10T01:26:43.265616Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2402.00311/citation-record","integrity":"/paper/2402.00311/integrity","json":"/paper/2402.00311/citation-record.json","paper":"/paper/2402.00311"},"outbound":[],"paper":{"arxiv_id":"2402.00311","last_updated":"2024-02-01T03:50:12Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T17:23:31.057358Z","submitted_at":"2024-02-01T03:50:12Z","title":"A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.00311."}