{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F7QVESINXYISQFBSCJW725UYNE","short_pith_number":"pith:F7QVESIN","schema_version":"1.0","canonical_sha256":"2fe152490dbe11281432126dfd7698691add65145d9d7689bdcc5d37f853b9fc","source":{"kind":"arxiv","id":"2203.02616","version":1},"attestation_state":"computed","paper":{"title":"Chance-Constrained Optimization in Contact-Rich Systems for Robust Manipulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Arvind Raghunathan, Devesh K. Jha, Diego Romeres, Yuki Shirai","submitted_at":"2022-03-05T00:16:22Z","abstract_excerpt":"This paper presents a chance-constrained formulation for robust trajectory optimization during manipulation. In particular, we present a chance-constrained optimization for Stochastic Discrete-time Linear Complementarity Systems (SDLCS). To solve the optimization problem, we formulate Mixed-Integer Quadratic Programming with Chance Constraints (MIQPCC). In our formulation, we explicitly consider joint chance constraints for complementarity as well as states to capture the stochastic evolution of dynamics. We evaluate robustness of our optimized trajectories in simulation on several systems. Th"},"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":"2203.02616","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-03-05T00:16:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"127934c9e7a37dc1b2515dc8a0c8c3f0c270a5b299c80452a027a7a9ffe29021","abstract_canon_sha256":"643828a452ad3f4eede8cdf11e0498afb13ed31c457dd974a141b8d948b34ee4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:02:25.092266Z","signature_b64":"SmUI12nZP22qL98U7W9+TTMMUG2qnfW4RHLLiqWdTeD8zUUTIIV8eKLsKKLbUlZrltc4Lpt8Z/JdVJuRmxfuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe152490dbe11281432126dfd7698691add65145d9d7689bdcc5d37f853b9fc","last_reissued_at":"2026-07-05T04:02:25.091790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:02:25.091790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chance-Constrained Optimization in Contact-Rich Systems for Robust Manipulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Arvind Raghunathan, Devesh K. Jha, Diego Romeres, Yuki Shirai","submitted_at":"2022-03-05T00:16:22Z","abstract_excerpt":"This paper presents a chance-constrained formulation for robust trajectory optimization during manipulation. In particular, we present a chance-constrained optimization for Stochastic Discrete-time Linear Complementarity Systems (SDLCS). To solve the optimization problem, we formulate Mixed-Integer Quadratic Programming with Chance Constraints (MIQPCC). In our formulation, we explicitly consider joint chance constraints for complementarity as well as states to capture the stochastic evolution of dynamics. We evaluate robustness of our optimized trajectories in simulation on several systems. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.02616","kind":"arxiv","version":1},"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/2203.02616/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":"2203.02616","created_at":"2026-07-05T04:02:25.091849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.02616v1","created_at":"2026-07-05T04:02:25.091849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.02616","created_at":"2026-07-05T04:02:25.091849+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7QVESINXYIS","created_at":"2026-07-05T04:02:25.091849+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7QVESINXYISQFBS","created_at":"2026-07-05T04:02:25.091849+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7QVESIN","created_at":"2026-07-05T04:02:25.091849+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31494","citing_title":"Robustness of Robotic Manipulation: Foundations and Frontiers","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE","json":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE.json","graph_json":"https://pith.science/api/pith-number/F7QVESINXYISQFBSCJW725UYNE/graph.json","events_json":"https://pith.science/api/pith-number/F7QVESINXYISQFBSCJW725UYNE/events.json","paper":"https://pith.science/paper/F7QVESIN"},"agent_actions":{"view_html":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE","download_json":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE.json","view_paper":"https://pith.science/paper/F7QVESIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.02616&json=true","fetch_graph":"https://pith.science/api/pith-number/F7QVESINXYISQFBSCJW725UYNE/graph.json","fetch_events":"https://pith.science/api/pith-number/F7QVESINXYISQFBSCJW725UYNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE/action/storage_attestation","attest_author":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE/action/author_attestation","sign_citation":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE/action/citation_signature","submit_replication":"https://pith.science/pith/F7QVESINXYISQFBSCJW725UYNE/action/replication_record"}},"created_at":"2026-07-05T04:02:25.091849+00:00","updated_at":"2026-07-05T04:02:25.091849+00:00"}