{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7TBQJIL6H4O2YDP3YN4PZDST6A","short_pith_number":"pith:7TBQJIL6","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"},"canonical_sha256":"fcc304a17e3f1dac0dfbc378fc8e53f01e7e8203b4946ec91fd37d4857c39b84","source":{"kind":"arxiv","id":"1710.03029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03029","created_at":"2026-05-18T00:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03029v1","created_at":"2026-05-18T00:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03029","created_at":"2026-05-18T00:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"7TBQJIL6H4O2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7TBQJIL6H4O2YDP3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7TBQJIL6","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7TBQJIL6H4O2YDP3YN4PZDST6A","target":"record","payload":{"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"},"canonical_sha256":"fcc304a17e3f1dac0dfbc378fc8e53f01e7e8203b4946ec91fd37d4857c39b84","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"},"source_kind":"arxiv","source_id":"1710.03029","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tbn0Ll1yQeY1/O3uLBXjImPXnCkAIXHyYNwdJNh71T6wdMTJiPCIyFZ1wyDimSHKKiiGvP+Lcl+2q+hwqavJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:38:14.437690Z"},"content_sha256":"c7377b0bd977b330aa3aaef2c190230ec2e9f7fff85cd04a12ab24855a03b0ea","schema_version":"1.0","event_id":"sha256:c7377b0bd977b330aa3aaef2c190230ec2e9f7fff85cd04a12ab24855a03b0ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7TBQJIL6H4O2YDP3YN4PZDST6A","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3E5F7/YsNe6swmuo1hn8GzfALJMOSi8PFYExTsRgLal6dD4TVUwG6DG9rps0Q+5dncxwIh4Pt5frOZ67YZtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:38:14.438035Z"},"content_sha256":"34ebe1e8d41f89f6e3ed9381ca64f60e31847a2b03e94a7d6ca41905ca055733","schema_version":"1.0","event_id":"sha256:34ebe1e8d41f89f6e3ed9381ca64f60e31847a2b03e94a7d6ca41905ca055733"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/bundle.json","state_url":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T16:38:14Z","links":{"resolver":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A","bundle":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/bundle.json","state":"https://pith.science/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TBQJIL6H4O2YDP3YN4PZDST6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7TBQJIL6H4O2YDP3YN4PZDST6A","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c897f26f1abff572fb44f0949b3e16e76a01dc30a8027886162a1b0fe70e8b18","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-09T11:02:29Z","title_canon_sha256":"817a66497101b9927d56297ff3a87300494dbbd93125d15f5c6a00345c6589db"},"schema_version":"1.0","source":{"id":"1710.03029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03029","created_at":"2026-05-18T00:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03029v1","created_at":"2026-05-18T00:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03029","created_at":"2026-05-18T00:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"7TBQJIL6H4O2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7TBQJIL6H4O2YDP3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7TBQJIL6","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:34ebe1e8d41f89f6e3ed9381ca64f60e31847a2b03e94a7d6ca41905ca055733","target":"graph","created_at":"2026-05-18T00:33:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Atsuo Takanishi, Kenji Hashimoto, Martim Brandao","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-09T11:02:29Z","title":"SGD for robot motion? The effectiveness of stochastic optimization on a new benchmark for biped locomotion tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03029","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c7377b0bd977b330aa3aaef2c190230ec2e9f7fff85cd04a12ab24855a03b0ea","target":"record","created_at":"2026-05-18T00:33:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c897f26f1abff572fb44f0949b3e16e76a01dc30a8027886162a1b0fe70e8b18","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-10-09T11:02:29Z","title_canon_sha256":"817a66497101b9927d56297ff3a87300494dbbd93125d15f5c6a00345c6589db"},"schema_version":"1.0","source":{"id":"1710.03029","kind":"arxiv","version":1}},"canonical_sha256":"fcc304a17e3f1dac0dfbc378fc8e53f01e7e8203b4946ec91fd37d4857c39b84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcc304a17e3f1dac0dfbc378fc8e53f01e7e8203b4946ec91fd37d4857c39b84","first_computed_at":"2026-05-18T00:33:27.262200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:27.262200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"otYivqx1qJnzVmJ457lz4eyDFxMtjZUDoT+o+7p8ehBJuzll8a9AQ67IESKt79dE8FfCB5RBaz7tUx+ZD0fdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:27.262876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7377b0bd977b330aa3aaef2c190230ec2e9f7fff85cd04a12ab24855a03b0ea","sha256:34ebe1e8d41f89f6e3ed9381ca64f60e31847a2b03e94a7d6ca41905ca055733"],"state_sha256":"58997f405caf0168789167b9a3575d498353c1f33d3d3eec425bc768ff6a7374"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtqJLPVm8b7mI6JspBXubQVfzgEZnT0Oc+ZWN9qW/pUEvO5RUyHA/MvlNVmlSfzgAlnYGve69z4YAF1LiHBHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:38:14.439940Z","bundle_sha256":"dcd71df55dfa92a5f03aa0773c1a8e79ce7bd4e0845a5b6ebb933eccd9d21eb1"}}