{"as_of":"2026-08-10T21:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:862a8db828fc1ed47b7f0e30c5f62a14b183587dc527333a3c888313819c3430","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-10T06:31:04.303077+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-08-03T21:55:26.183046Z","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-20T14:53:23.335233Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.23849","last_updated":"2024-10-31T12:00:43Z","snapshot_observed_at":"2026-08-10T14:10:43.597915Z","submitted_at":"2024-10-31T12:00:43Z","title":"Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.23849","snapshot_observed_at":"2026-08-03T21:55:26.183046Z","title":"Tang and K.-C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13847","last_updated":"2026-06-29T22:01:02Z","snapshot_observed_at":"2026-08-09T03:02:06.049127Z","submitted_at":"2025-11-17T19:04:28Z","title":"Convex relaxation approaches for high-dimensional optimal transport","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T21:55:26.183046Z"},"links":{"cited_paper":"/paper/2410.23849","citing_paper":"/paper/2511.13847"},"observation_digest":"sha256:56c674551b8a9cab67841fba5d8e2b9282a08aa0810087a58af28085da65ae3f","observation_id":"05291756-5d8e-4bd1-847f-f7c32c066e8d","resolution":{"observed_at":"2026-08-03T21:55:26.183046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.23849","last_updated":"2024-10-31T12:00:43Z","snapshot_observed_at":"2026-08-10T14:10:43.597915Z","submitted_at":"2024-10-31T12:00:43Z","title":"Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices","version":1},"cited_work":{"arxiv_id":"2410.23849","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.23849","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tang and K.-C","venue":null,"work_id":"ecb7b19f-e531-43c4-92f5-877f24763b75","year":2024},"citing_paper":{"arxiv_id":"2605.17089","last_updated":"2026-05-16T17:13:47Z","snapshot_observed_at":"2026-08-10T14:11:17.856954Z","submitted_at":"2026-05-16T17:13:47Z","title":"A preconditioned augmented Lagrangian method for solving semidefinite programming problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-20T14:49:01.872179Z"},"links":{"cited_paper":"/paper/2410.23849","citing_paper":"/paper/2605.17089"},"observation_digest":"sha256:d6de3c7c4623a58448762a5113148f225e8894c1abbe4f06fcde3a0da5c0cc60","observation_id":"092a6f81-a88d-4f67-b645-a393f645103a","resolution":{"observed_at":"2026-05-20T14:53:23.336625Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.23849/citation-record","integrity":"/paper/2410.23849/integrity","json":"/paper/2410.23849/citation-record.json","paper":"/paper/2410.23849"},"outbound":[],"paper":{"arxiv_id":"2410.23849","last_updated":"2024-10-31T12:00:43Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T14:10:43.597915Z","submitted_at":"2024-10-31T12:00:43Z","title":"Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.23849."}