Pith. sign in

Paper Citation Record · LEDGER

SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2405.19309 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T22:06:07.649496Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-12T07:21:25.487627Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation d2d08b44-3be8-4bbc-83e9-d7b894350230 · inbound

Building Rome with Convex Optimization cites this paper.

Building Rome with Convex Optimization SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-08T22:06:07.649496Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-08T22:06:07.649496Z digest=sha256:9846ba061385b020f6fd6762caf0ae97efda982c085c1e8daed4437f2d029800

Observation 23fcd927-33f2-4ca9-86b4-d01544a7fb33 · inbound

A Certificate of Unboundedness for Polynomial Optimization Problems cites this paper.

A Certificate of Unboundedness for Polynomial Optimization Problems SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics

Reference 8

Resolution
verified exact
arxiv_id, observed 2026-05-12T07:21:25.490074Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-05-12T03:27:41.542114Z digest=sha256:62a961a75afd34c3f8e23a073a153a429a0dfc79a2d147220d13e346e95a82fb