{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2NWC5XG2YY25SK4TEVUIHVPKFO","short_pith_number":"pith:2NWC5XG2","schema_version":"1.0","canonical_sha256":"d36c2edcdac635d92b93256883d5ea2b933081c0fa85521cbb0886070f3dd032","source":{"kind":"arxiv","id":"2405.19309","version":3},"attestation_state":"computed","paper":{"title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Connor Holmes, Frederike D\\\"umbgen, Timothy D. Barfoot","submitted_at":"2024-05-29T17:33:34Z","abstract_excerpt":"A recent set of techniques in the robotics community, known as certifiably correct methods, frames robotics problems as polynomial optimization problems (POPs) and applies convex, semidefinite programming (SDP) relaxations to either find or certify their global optima. In parallel, differentiable optimization allows optimization problems to be embedded into end-to-end learning frameworks and has received considerable attention in the robotics community. In this paper, we consider the ill effect of convergence to spurious local minima in the context of learning frameworks that use differentiabl"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.19309","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-05-29T17:33:34Z","cross_cats_sorted":[],"title_canon_sha256":"f9f7189d3449ce8b05338f1d29d0214b5ab4d5958bb2a34349a3bb755749a067","abstract_canon_sha256":"77197100f98641c0bd7439518cf835f167457cb6d0ec328a06031aaf167210fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:20.986916Z","signature_b64":"vyOu5UamBMK/OS4bKC9KxeSK0SSuNMmRrdFj2NifvUDZa1BB6uN6sSkxpL2IVm//eIgeSjKlkI68+VY8D4CHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d36c2edcdac635d92b93256883d5ea2b933081c0fa85521cbb0886070f3dd032","last_reissued_at":"2026-07-05T09:58:20.986427Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:20.986427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Connor Holmes, Frederike D\\\"umbgen, Timothy D. Barfoot","submitted_at":"2024-05-29T17:33:34Z","abstract_excerpt":"A recent set of techniques in the robotics community, known as certifiably correct methods, frames robotics problems as polynomial optimization problems (POPs) and applies convex, semidefinite programming (SDP) relaxations to either find or certify their global optima. In parallel, differentiable optimization allows optimization problems to be embedded into end-to-end learning frameworks and has received considerable attention in the robotics community. In this paper, we consider the ill effect of convergence to spurious local minima in the context of learning frameworks that use differentiabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19309","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.19309/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.19309","created_at":"2026-07-05T09:58:20.986494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19309v3","created_at":"2026-07-05T09:58:20.986494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19309","created_at":"2026-07-05T09:58:20.986494+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NWC5XG2YY25","created_at":"2026-07-05T09:58:20.986494+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NWC5XG2YY25SK4T","created_at":"2026-07-05T09:58:20.986494+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NWC5XG2","created_at":"2026-07-05T09:58:20.986494+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09162","citing_title":"A Certificate of Unboundedness for Polynomial Optimization Problems","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO","json":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO.json","graph_json":"https://pith.science/api/pith-number/2NWC5XG2YY25SK4TEVUIHVPKFO/graph.json","events_json":"https://pith.science/api/pith-number/2NWC5XG2YY25SK4TEVUIHVPKFO/events.json","paper":"https://pith.science/paper/2NWC5XG2"},"agent_actions":{"view_html":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO","download_json":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO.json","view_paper":"https://pith.science/paper/2NWC5XG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19309&json=true","fetch_graph":"https://pith.science/api/pith-number/2NWC5XG2YY25SK4TEVUIHVPKFO/graph.json","fetch_events":"https://pith.science/api/pith-number/2NWC5XG2YY25SK4TEVUIHVPKFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO/action/storage_attestation","attest_author":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO/action/author_attestation","sign_citation":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO/action/citation_signature","submit_replication":"https://pith.science/pith/2NWC5XG2YY25SK4TEVUIHVPKFO/action/replication_record"}},"created_at":"2026-07-05T09:58:20.986494+00:00","updated_at":"2026-07-05T09:58:20.986494+00:00"}