{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KWRRM2X7MUSCB4ZWZHMO5ZJS6X","short_pith_number":"pith:KWRRM2X7","schema_version":"1.0","canonical_sha256":"55a3166aff652420f336c9d8eee532f5ce435ede59223119122fca8006f72a34","source":{"kind":"arxiv","id":"2011.06194","version":1},"attestation_state":"computed","paper":{"title":"A Factor-Graph Approach for Optimization Problems with Dynamics Constraints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alejandro Escontrela, Frank Dellaert, Mandy Xie","submitted_at":"2020-11-11T00:53:41Z","abstract_excerpt":"In this paper, we introduce dynamics factor graphs as a graphical framework to solve dynamics problems and kinodynamic motion planning problems with full consideration of whole-body dynamics and contacts. A factor graph representation of dynamics problems provides an insightful visualization of their mathematical structure and can be used in conjunction with sparse nonlinear optimizers to solve challenging, high-dimensional optimization problems in robotics. We can easily formulate kinodynamic motion planning as a trajectory optimization problem with factor graphs. We demonstrate the flexibili"},"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":"2011.06194","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2020-11-11T00:53:41Z","cross_cats_sorted":[],"title_canon_sha256":"80b43529772fb425de783fdde513f2fe669770c237e6ff129710164ed2316b37","abstract_canon_sha256":"14259c43b476116678ad4bfb8f31f8dfd6d97ced0509c8ebaefbe835e0696648"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:12.863983Z","signature_b64":"AvRw6awyu2Zvrgt5UwF6A/CkSfCMy9aOEaM+4QoaP11swJWOaOQYSnVsNP9qqzlfCdWkiw7Oqh0L/0znZwbQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a3166aff652420f336c9d8eee532f5ce435ede59223119122fca8006f72a34","last_reissued_at":"2026-07-05T01:51:12.863660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:12.863660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Factor-Graph Approach for Optimization Problems with Dynamics Constraints","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alejandro Escontrela, Frank Dellaert, Mandy Xie","submitted_at":"2020-11-11T00:53:41Z","abstract_excerpt":"In this paper, we introduce dynamics factor graphs as a graphical framework to solve dynamics problems and kinodynamic motion planning problems with full consideration of whole-body dynamics and contacts. A factor graph representation of dynamics problems provides an insightful visualization of their mathematical structure and can be used in conjunction with sparse nonlinear optimizers to solve challenging, high-dimensional optimization problems in robotics. We can easily formulate kinodynamic motion planning as a trajectory optimization problem with factor graphs. We demonstrate the flexibili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06194","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/2011.06194/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":"2011.06194","created_at":"2026-07-05T01:51:12.863710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06194v1","created_at":"2026-07-05T01:51:12.863710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06194","created_at":"2026-07-05T01:51:12.863710+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWRRM2X7MUSC","created_at":"2026-07-05T01:51:12.863710+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWRRM2X7MUSCB4ZW","created_at":"2026-07-05T01:51:12.863710+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWRRM2X7","created_at":"2026-07-05T01:51:12.863710+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20796","citing_title":"CMC-Opt: Constraint Manifold with Corners for Inequality-Constrained Optimization","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12897","citing_title":"DynoJEPP: Joint Estimation, Prediction and Planning in Dynamic Environments","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X","json":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X.json","graph_json":"https://pith.science/api/pith-number/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/graph.json","events_json":"https://pith.science/api/pith-number/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/events.json","paper":"https://pith.science/paper/KWRRM2X7"},"agent_actions":{"view_html":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X","download_json":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X.json","view_paper":"https://pith.science/paper/KWRRM2X7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06194&json=true","fetch_graph":"https://pith.science/api/pith-number/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/graph.json","fetch_events":"https://pith.science/api/pith-number/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/action/storage_attestation","attest_author":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/action/author_attestation","sign_citation":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/action/citation_signature","submit_replication":"https://pith.science/pith/KWRRM2X7MUSCB4ZWZHMO5ZJS6X/action/replication_record"}},"created_at":"2026-07-05T01:51:12.863710+00:00","updated_at":"2026-07-05T01:51:12.863710+00:00"}