{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EPZSX76ESXYRBJPY6XIEE37ZZV","short_pith_number":"pith:EPZSX76E","schema_version":"1.0","canonical_sha256":"23f32bffc495f110a5f8f5d0426ff9cd6e6f9343157e5ba043c5ffdca436e07f","source":{"kind":"arxiv","id":"2206.05077","version":5},"attestation_state":"computed","paper":{"title":"Tensor Train for Global Optimization Problems in Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SP","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Suhan Shetty, Sylvain Calinon, Teguh Lembono, Tobias Loew","submitted_at":"2022-06-10T13:18:26Z","abstract_excerpt":"The convergence of many numerical optimization techniques is highly dependent on the initial guess given to the solver. To address this issue, we propose a novel approach that utilizes tensor methods to initialize existing optimization solvers near global optima. Our method does not require access to a database of good solutions. We first transform the cost function, which depends on both task parameters and optimization variables, into a probability density function. Unlike existing approaches, the joint probability distribution of the task parameters and optimization variables is approximate"},"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":"2206.05077","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-06-10T13:18:26Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SP","eess.SY","math.OC"],"title_canon_sha256":"4ea7db1e1bf5700b12725df6e413f73081c6293fea897cf88e310e40038465b2","abstract_canon_sha256":"6f95ab62832595183c2a579bedc717ed0aeffc335aec5cb8820c293e70e1cda7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:35.049664Z","signature_b64":"fLh3wqrcjWdteKufqIE4cNmqrdPIu1shtnErIwyTjVfQjUgVKfmhc31pb4fDAxij8Zq24YU6ofDu5TmLKAG9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23f32bffc495f110a5f8f5d0426ff9cd6e6f9343157e5ba043c5ffdca436e07f","last_reissued_at":"2026-07-05T07:15:35.049237Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:35.049237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Train for Global Optimization Problems in Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SP","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Suhan Shetty, Sylvain Calinon, Teguh Lembono, Tobias Loew","submitted_at":"2022-06-10T13:18:26Z","abstract_excerpt":"The convergence of many numerical optimization techniques is highly dependent on the initial guess given to the solver. To address this issue, we propose a novel approach that utilizes tensor methods to initialize existing optimization solvers near global optima. Our method does not require access to a database of good solutions. We first transform the cost function, which depends on both task parameters and optimization variables, into a probability density function. Unlike existing approaches, the joint probability distribution of the task parameters and optimization variables is approximate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05077","kind":"arxiv","version":5},"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/2206.05077/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":"2206.05077","created_at":"2026-07-05T07:15:35.049294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.05077v5","created_at":"2026-07-05T07:15:35.049294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05077","created_at":"2026-07-05T07:15:35.049294+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPZSX76ESXYR","created_at":"2026-07-05T07:15:35.049294+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPZSX76ESXYRBJPY","created_at":"2026-07-05T07:15:35.049294+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPZSX76E","created_at":"2026-07-05T07:15:35.049294+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12383","citing_title":"High-dimensional Optimization with Low Rank Tensor Sampling and Local Search","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV","json":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV.json","graph_json":"https://pith.science/api/pith-number/EPZSX76ESXYRBJPY6XIEE37ZZV/graph.json","events_json":"https://pith.science/api/pith-number/EPZSX76ESXYRBJPY6XIEE37ZZV/events.json","paper":"https://pith.science/paper/EPZSX76E"},"agent_actions":{"view_html":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV","download_json":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV.json","view_paper":"https://pith.science/paper/EPZSX76E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.05077&json=true","fetch_graph":"https://pith.science/api/pith-number/EPZSX76ESXYRBJPY6XIEE37ZZV/graph.json","fetch_events":"https://pith.science/api/pith-number/EPZSX76ESXYRBJPY6XIEE37ZZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV/action/storage_attestation","attest_author":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV/action/author_attestation","sign_citation":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV/action/citation_signature","submit_replication":"https://pith.science/pith/EPZSX76ESXYRBJPY6XIEE37ZZV/action/replication_record"}},"created_at":"2026-07-05T07:15:35.049294+00:00","updated_at":"2026-07-05T07:15:35.049294+00:00"}