{"as_of":"2026-08-08T14:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eab7528abb4f728dc7c1b0ed5a470d2f6abc207d9598afdc717f627331775dab","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-08T06:32:00.761636+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-04T06:52:00.022796Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.02828","last_updated":"2021-06-08T21:12:01Z","snapshot_observed_at":"2026-07-06T09:18:07.000011Z","submitted_at":"2020-05-06T13:55:03Z","title":"CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.02828","snapshot_observed_at":"2026-08-04T06:52:00.022796Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2511.21666","last_updated":"2026-08-03T13:26:02Z","snapshot_observed_at":"2026-08-07T23:11:21.021918Z","submitted_at":"2025-11-26T18:39:44Z","title":"Uncertainty Quantification for Visual Object Pose Estimation: S-Lemma Ellipsoidal Bounds","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T06:52:00.022796Z"},"links":{"cited_paper":"/paper/2005.02828","citing_paper":"/paper/2511.21666"},"observation_digest":"sha256:2204b493c33918b1efa73397e994a46f356cfd288459ebadbcb4514926f8f9f5","observation_id":"1fde9eb1-d7e0-4800-8413-2c6559908cd9","resolution":{"observed_at":"2026-08-04T06:52:00.022796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2005.02828/citation-record","integrity":"/paper/2005.02828/integrity","json":"/paper/2005.02828/citation-record.json","paper":"/paper/2005.02828"},"outbound":[],"paper":{"arxiv_id":"2005.02828","last_updated":"2021-06-08T21:12:01Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T09:18:07.000011Z","submitted_at":"2020-05-06T13:55:03Z","title":"CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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:2005.02828."}