{"as_of":"2026-08-11T08:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:36bb13d8bb38d6d33a0c4446d64e4ee5ec67bdf82daa7175c77f9bf6aafeb9af","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-11T06:34:44.6726+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-08T22:06:07.649496Z","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-12T07:21:25.487627Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.19309","last_updated":"2025-01-08T18:29:33Z","snapshot_observed_at":"2026-07-06T18:22:10.094519Z","submitted_at":"2024-05-29T17:33:34Z","title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19309","snapshot_observed_at":"2026-08-08T22:06:07.649496Z","title":"Sdprlayers: Certifiable backpropagation through polynomial optimization problems in robotics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04640","last_updated":"2025-07-01T15:58:18Z","snapshot_observed_at":"2026-08-10T01:06:47.962093Z","submitted_at":"2025-02-07T03:53:46Z","title":"Building Rome with Convex Optimization","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T22:06:07.649496Z"},"links":{"cited_paper":"/paper/2405.19309","citing_paper":"/paper/2502.04640"},"observation_digest":"sha256:9846ba061385b020f6fd6762caf0ae97efda982c085c1e8daed4437f2d029800","observation_id":"d2d08b44-3be8-4bbc-83e9-d7b894350230","resolution":{"observed_at":"2026-08-08T22:06:07.649496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19309","last_updated":"2025-01-08T18:29:33Z","snapshot_observed_at":"2026-07-06T18:22:10.094519Z","submitted_at":"2024-05-29T17:33:34Z","title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics","version":3},"cited_work":{"arxiv_id":"2405.19309","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.19309","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint (2024) arXiv:2405.19309 [cs.RO]","venue":null,"work_id":"0bc23fcf-51ae-4c61-a31c-84ff9b4f40f7","year":2024},"citing_paper":{"arxiv_id":"2605.09162","last_updated":"2026-05-09T20:52:06Z","snapshot_observed_at":"2026-07-31T11:36:58.170541Z","submitted_at":"2026-05-09T20:52:06Z","title":"A Certificate of Unboundedness for Polynomial Optimization Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-12T03:27:41.542114Z"},"links":{"cited_paper":"/paper/2405.19309","citing_paper":"/paper/2605.09162"},"observation_digest":"sha256:8ca02320d06dcf18d49b699267c3a417244b5f1958227628d5204c07190b8b37","observation_id":"23fcd927-33f2-4ca9-86b4-d01544a7fb33","resolution":{"observed_at":"2026-05-12T07:21:25.490074Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.19309/citation-record","integrity":"/paper/2405.19309/integrity","json":"/paper/2405.19309/citation-record.json","paper":"/paper/2405.19309"},"outbound":[],"paper":{"arxiv_id":"2405.19309","last_updated":"2025-01-08T18:29:33Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-07-06T18:22:10.094519Z","submitted_at":"2024-05-29T17:33:34Z","title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.19309."}