{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AJ4IYUR4WBHSFAZFVLONQ62DS2","short_pith_number":"pith:AJ4IYUR4","schema_version":"1.0","canonical_sha256":"02788c523cb04f228325aadcd87b4396a1f959a1f75567688f2892c20732101b","source":{"kind":"arxiv","id":"1407.0414","version":1},"attestation_state":"computed","paper":{"title":"Newton methods for k-order Markov Constrained Motion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Marc Toussaint","submitted_at":"2014-07-01T21:45:48Z","abstract_excerpt":"This is a documentation of a framework for robot motion optimization that aims to draw on classical constrained optimization methods. With one exception the underlying algorithms are classical ones: Gauss-Newton (with adaptive step size and damping), Augmented Lagrangian, log-barrier, etc. The exception is a novel any-time version of the Augmented Lagrangian. The contribution of this framework is to frame motion optimization problems in a way that makes the application of these methods efficient, especially by defining a very general class of robot motion problems while at the same time introd"},"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":"1407.0414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-07-01T21:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"81870febd7eeb5b5779de10a36985b99e3a799f90b05613594586ec19a1b1950","abstract_canon_sha256":"86aec53f07a3587d8e5e9cce11198666f01c49aff811d60bc21d15af4d484ef0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:33.870272Z","signature_b64":"c56FI9HO327BubJF5iU6hfSsKF80uKB44FrzaXJ5QXKHXyQvXuyiAtwIVj1Gr3PH6nHJ1kyxWGF4igSg23k7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02788c523cb04f228325aadcd87b4396a1f959a1f75567688f2892c20732101b","last_reissued_at":"2026-05-18T02:48:33.869487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:33.869487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Newton methods for k-order Markov Constrained Motion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Marc Toussaint","submitted_at":"2014-07-01T21:45:48Z","abstract_excerpt":"This is a documentation of a framework for robot motion optimization that aims to draw on classical constrained optimization methods. With one exception the underlying algorithms are classical ones: Gauss-Newton (with adaptive step size and damping), Augmented Lagrangian, log-barrier, etc. The exception is a novel any-time version of the Augmented Lagrangian. The contribution of this framework is to frame motion optimization problems in a way that makes the application of these methods efficient, especially by defining a very general class of robot motion problems while at the same time introd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0414","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":""},"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":"1407.0414","created_at":"2026-05-18T02:48:33.869596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0414v1","created_at":"2026-05-18T02:48:33.869596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0414","created_at":"2026-05-18T02:48:33.869596+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJ4IYUR4WBHS","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJ4IYUR4WBHSFAZF","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJ4IYUR4","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01860","citing_title":"Optimizing Trajectory-Trees in Belief Space: An Application from Model Predictive Control to Task and Motion Planning","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2","json":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2.json","graph_json":"https://pith.science/api/pith-number/AJ4IYUR4WBHSFAZFVLONQ62DS2/graph.json","events_json":"https://pith.science/api/pith-number/AJ4IYUR4WBHSFAZFVLONQ62DS2/events.json","paper":"https://pith.science/paper/AJ4IYUR4"},"agent_actions":{"view_html":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2","download_json":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2.json","view_paper":"https://pith.science/paper/AJ4IYUR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0414&json=true","fetch_graph":"https://pith.science/api/pith-number/AJ4IYUR4WBHSFAZFVLONQ62DS2/graph.json","fetch_events":"https://pith.science/api/pith-number/AJ4IYUR4WBHSFAZFVLONQ62DS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2/action/storage_attestation","attest_author":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2/action/author_attestation","sign_citation":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2/action/citation_signature","submit_replication":"https://pith.science/pith/AJ4IYUR4WBHSFAZFVLONQ62DS2/action/replication_record"}},"created_at":"2026-05-18T02:48:33.869596+00:00","updated_at":"2026-05-18T02:48:33.869596+00:00"}