{"as_of":"2026-08-18T05:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb3138649dd1ab095c25199dff59969cb6494fc5fe69966579e5a5392dc5b435","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-17T06:30:58.91139+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-08-16T05:06:58.688403Z","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-08-14T13:26:19.247941Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.00476","last_updated":"2026-05-10T19:56:23Z","snapshot_observed_at":"2026-08-14T20:56:35.449274Z","submitted_at":"2017-06-01T19:58:38Z","title":"The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints","version":4},"cited_work":{"arxiv_id":"1706.00476","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.00476","snapshot_observed_at":"2026-08-14T13:26:19.247941Z","title":"The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints","venue":"math.OC","work_id":"c3ff4041-dfb0-49d6-b153-89fcc93042b0","year":2017},"citing_paper":{"arxiv_id":"1908.05209","last_updated":"2019-12-16T19:18:32Z","snapshot_observed_at":"2026-08-15T00:01:18.953961Z","submitted_at":"2019-08-14T16:37:42Z","title":"A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics","version":3},"reference_index":116,"source":"pdf_text","source_observed_at":"2026-08-14T13:26:18.851017Z"},"links":{"cited_paper":"/paper/1706.00476","citing_paper":"/paper/1908.05209"},"observation_digest":"sha256:b0fdd5edf0472af096b699a5909b9e3e7a7e28faa7b42bf651b5bd0f0261483f","observation_id":"d0a3c167-0f84-4774-99be-8806a303ce7b","resolution":{"observed_at":"2026-08-14T13:26:19.264958Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.00476","last_updated":"2026-05-10T19:56:23Z","snapshot_observed_at":"2026-08-14T20:56:35.449274Z","submitted_at":"2017-06-01T19:58:38Z","title":"The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.00476","snapshot_observed_at":"2026-08-16T05:06:58.688403Z","title":"The mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.00221","last_updated":"2025-04-30T23:54:09Z","snapshot_observed_at":"2026-08-16T04:45:32.083701Z","submitted_at":"2025-04-30T23:54:09Z","title":"Strongly Convex Maximization via the Frank-Wolfe Algorithm with the Kurdyka-{\\L}ojasiewicz Inequality","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T05:06:58.688403Z"},"links":{"cited_paper":"/paper/1706.00476","citing_paper":"/paper/2505.00221"},"observation_digest":"sha256:8ecc0a885fe7e650099104fbd94b84c15608115e3ae654863a6b563cd49d20a8","observation_id":"ae503df0-58df-4cea-ba82-4fbabeaf4da7","resolution":{"observed_at":"2026-08-16T05:06:58.688403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.00476","last_updated":"2026-05-10T19:56:23Z","snapshot_observed_at":"2026-08-14T20:56:35.449274Z","submitted_at":"2017-06-01T19:58:38Z","title":"The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.00476","snapshot_observed_at":"2026-08-15T17:48:01.414317Z","title":"Zico Kolter","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.20386","last_updated":"2026-06-16T20:37:05Z","snapshot_observed_at":"2026-08-15T17:41:35.158499Z","submitted_at":"2025-07-27T19:03:54Z","title":"The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:48:01.414317Z"},"links":{"cited_paper":"/paper/1706.00476","citing_paper":"/paper/2507.20386"},"observation_digest":"sha256:987582e4d06b623e1f70e7b80d53036e4a7746c83b4b97ddd45675f7d405b41e","observation_id":"1de4bd84-4b22-407f-9901-276eacde85db","resolution":{"observed_at":"2026-08-15T17:48:01.414317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1706.00476/citation-record","integrity":"/paper/1706.00476/integrity","json":"/paper/1706.00476/citation-record.json","paper":"/paper/1706.00476"},"outbound":[],"paper":{"arxiv_id":"1706.00476","last_updated":"2026-05-10T19:56:23Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T20:56:35.449274Z","submitted_at":"2017-06-01T19:58:38Z","title":"The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1706.00476."}