{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7TBQJIL6H4O2YDP3YN4PZDST6A","short_pith_number":"pith:7TBQJIL6","schema_version":"1.0","canonical_sha256":"fcc304a17e3f1dac0dfbc378fc8e53f01e7e8203b4946ec91fd37d4857c39b84","source":{"kind":"arxiv","id":"1710.03029","version":1},"attestation_state":"computed","paper":{"title":"SGD for robot motion? The effectiveness of stochastic optimization on a new benchmark for biped locomotion tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.RO","authors_text":"Atsuo Takanishi, Kenji Hashimoto, Martim Brandao","submitted_at":"2017-10-09T11:02:29Z","abstract_excerpt":"Trajectory optimization and posture generation are hard problems in robot locomotion, which can be non-convex and have multiple local optima. Progress on these problems is further hindered by a lack of open benchmarks, since comparisons of different solutions are difficult to make. In this paper we introduce a new benchmark for trajectory optimization and posture generation of legged robots, using a pre-defined scenario, robot and constraints, as well as evaluation criteria. We evaluate state-of-the-art trajectory optimization algorithms based on sequential quadratic programming (SQP) on the b"},"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":"1710.03029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-09T11:02:29Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"817a66497101b9927d56297ff3a87300494dbbd93125d15f5c6a00345c6589db","abstract_canon_sha256":"c897f26f1abff572fb44f0949b3e16e76a01dc30a8027886162a1b0fe70e8b18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:27.262876Z","signature_b64":"otYivqx1qJnzVmJ457lz4eyDFxMtjZUDoT+o+7p8ehBJuzll8a9AQ67IESKt79dE8FfCB5RBaz7tUx+ZD0fdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcc304a17e3f1dac0dfbc378fc8e53f01e7e8203b4946ec91fd37d4857c39b84","last_reissued_at":"2026-05-18T00:33:27.262200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:27.262200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SGD for robot motion? The effectiveness of stochastic optimization on a new benchmark for biped locomotion tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.RO","authors_text":"Atsuo Takanishi, Kenji Hashimoto, Martim Brandao","submitted_at":"2017-10-09T11:02:29Z","abstract_excerpt":"Trajectory optimization and posture generation are hard problems in robot locomotion, which can be non-convex and have multiple local optima. Progress on these problems is further hindered by a lack of open benchmarks, since comparisons of different solutions are difficult to make. In this paper we introduce a new benchmark for trajectory optimization and posture generation of legged robots, using a pre-defined scenario, robot and constraints, as well as evaluation criteria. We evaluate state-of-the-art trajectory optimization algorithms based on sequential quadratic programming (SQP) on the b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03029","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":"1710.03029","created_at":"2026-05-18T00:33:27.262328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03029v1","created_at":"2026-05-18T00:33:27.262328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03029","created_at":"2026-05-18T00:33:27.262328+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TBQJIL6H4O2","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TBQJIL6H4O2YDP3","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TBQJIL6","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A","json":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A.json","graph_json":"https://pith.science/api/pith-number/7TBQJIL6H4O2YDP3YN4PZDST6A/graph.json","events_json":"https://pith.science/api/pith-number/7TBQJIL6H4O2YDP3YN4PZDST6A/events.json","paper":"https://pith.science/paper/7TBQJIL6"},"agent_actions":{"view_html":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A","download_json":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A.json","view_paper":"https://pith.science/paper/7TBQJIL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03029&json=true","fetch_graph":"https://pith.science/api/pith-number/7TBQJIL6H4O2YDP3YN4PZDST6A/graph.json","fetch_events":"https://pith.science/api/pith-number/7TBQJIL6H4O2YDP3YN4PZDST6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/action/storage_attestation","attest_author":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/action/author_attestation","sign_citation":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/action/citation_signature","submit_replication":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/action/replication_record"}},"created_at":"2026-05-18T00:33:27.262328+00:00","updated_at":"2026-05-18T00:33:27.262328+00:00"}