{"as_of":"2026-08-08T05:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:526e71ef3d0e3c04fd73149617b2720995746a26b250db1f90939dd30de48266","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-07T06:34:17.273281+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-05-08T01:30:53.740345Z","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-11T23:06:21.927794Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.08208","last_updated":"2021-11-18T19:59:05Z","snapshot_observed_at":"2026-08-04T23:09:37.883779Z","submitted_at":"2021-01-20T16:41:47Z","title":"Solving SDP Faster: A Robust IPM Framework and Efficient Implementation","version":2},"cited_work":{"arxiv_id":"2101.08208","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.08208","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"233–244, IEEE, 2022","venue":null,"work_id":"9d20da21-e90d-424d-96b2-23be2a0752fb","year":2022},"citing_paper":{"arxiv_id":"2604.24488","last_updated":"2026-04-27T13:55:49Z","snapshot_observed_at":"2026-08-02T23:34:26.828090Z","submitted_at":"2026-04-27T13:55:49Z","title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T01:30:53.740345Z"},"links":{"cited_paper":"/paper/2101.08208","citing_paper":"/paper/2604.24488"},"observation_digest":"sha256:178e1f487a6fa842a2d9192d92c892464c9dce423ee04c2cdd028c4205335bf3","observation_id":"81b574c4-b6f6-4f50-9728-3a532838e933","resolution":{"observed_at":"2026-05-11T23:06:21.963439Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2101.08208/citation-record","integrity":"/paper/2101.08208/integrity","json":"/paper/2101.08208/citation-record.json","paper":"/paper/2101.08208"},"outbound":[],"paper":{"arxiv_id":"2101.08208","last_updated":"2021-11-18T19:59:05Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T23:09:37.883779Z","submitted_at":"2021-01-20T16:41:47Z","title":"Solving SDP Faster: A Robust IPM Framework and Efficient Implementation"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2101.08208."}