{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:77ELMZDKQCXWHSVDFBE7FH752N","short_pith_number":"pith:77ELMZDK","schema_version":"1.0","canonical_sha256":"ffc8b6646a80af63caa32849f29ffdd3620aa63b3018258197d7e8d7351db1de","source":{"kind":"arxiv","id":"1601.03648","version":1},"attestation_state":"computed","paper":{"title":"Functional Gradient Motion Planning in Reproducing Kernel Hilbert Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anca Dragan, Arun Byravan, Byron Boots, Geoffrey Gordon, Siddhartha Srinivasa, Zita Marinho","submitted_at":"2016-01-14T16:25:48Z","abstract_excerpt":"We introduce a functional gradient descent trajectory optimization algorithm for robot motion planning in Reproducing Kernel Hilbert Spaces (RKHSs). Functional gradient algorithms are a popular choice for motion planning in complex many-degree-of-freedom robots, since they (in theory) work by directly optimizing within a space of continuous trajectories to avoid obstacles while maintaining geometric properties such as smoothness. However, in practice, functional gradient algorithms typically commit to a fixed, finite parameterization of trajectories, often as a list of waypoints. Such a parame"},"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":"1601.03648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-01-14T16:25:48Z","cross_cats_sorted":[],"title_canon_sha256":"106ffb891063f5825ff6facd23af40e1098ae5ac40ee94b95a58fb4ec57477ea","abstract_canon_sha256":"c7eec7f4f41e3a3f9e79bf75f68423738d931d79e38cd6b08f7797580a46d09c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:52.933506Z","signature_b64":"kcFhzkbzN9eUM58kaOpeGd82prXEnJm36rxGVD7r6asBAhKI+Cj+J1GleKFhfZJOPIUU6tegSzwBkLSxb958Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffc8b6646a80af63caa32849f29ffdd3620aa63b3018258197d7e8d7351db1de","last_reissued_at":"2026-05-18T01:22:52.932837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:52.932837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Functional Gradient Motion Planning in Reproducing Kernel Hilbert Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anca Dragan, Arun Byravan, Byron Boots, Geoffrey Gordon, Siddhartha Srinivasa, Zita Marinho","submitted_at":"2016-01-14T16:25:48Z","abstract_excerpt":"We introduce a functional gradient descent trajectory optimization algorithm for robot motion planning in Reproducing Kernel Hilbert Spaces (RKHSs). Functional gradient algorithms are a popular choice for motion planning in complex many-degree-of-freedom robots, since they (in theory) work by directly optimizing within a space of continuous trajectories to avoid obstacles while maintaining geometric properties such as smoothness. However, in practice, functional gradient algorithms typically commit to a fixed, finite parameterization of trajectories, often as a list of waypoints. Such a parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03648","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":"1601.03648","created_at":"2026-05-18T01:22:52.932931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03648v1","created_at":"2026-05-18T01:22:52.932931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03648","created_at":"2026-05-18T01:22:52.932931+00:00"},{"alias_kind":"pith_short_12","alias_value":"77ELMZDKQCXW","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"77ELMZDKQCXWHSVD","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"77ELMZDK","created_at":"2026-05-18T12:30:04.600751+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/77ELMZDKQCXWHSVDFBE7FH752N","json":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N.json","graph_json":"https://pith.science/api/pith-number/77ELMZDKQCXWHSVDFBE7FH752N/graph.json","events_json":"https://pith.science/api/pith-number/77ELMZDKQCXWHSVDFBE7FH752N/events.json","paper":"https://pith.science/paper/77ELMZDK"},"agent_actions":{"view_html":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N","download_json":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N.json","view_paper":"https://pith.science/paper/77ELMZDK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03648&json=true","fetch_graph":"https://pith.science/api/pith-number/77ELMZDKQCXWHSVDFBE7FH752N/graph.json","fetch_events":"https://pith.science/api/pith-number/77ELMZDKQCXWHSVDFBE7FH752N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N/action/storage_attestation","attest_author":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N/action/author_attestation","sign_citation":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N/action/citation_signature","submit_replication":"https://pith.science/pith/77ELMZDKQCXWHSVDFBE7FH752N/action/replication_record"}},"created_at":"2026-05-18T01:22:52.932931+00:00","updated_at":"2026-05-18T01:22:52.932931+00:00"}