{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GF6IMBSLB62NQRXVNPWDJRVUTX","short_pith_number":"pith:GF6IMBSL","schema_version":"1.0","canonical_sha256":"317c86064b0fb4d846f56bec34c6b49ddf0bcdf894ac1600a6d51e7f365cc8a0","source":{"kind":"arxiv","id":"2506.03982","version":1},"attestation_state":"computed","paper":{"title":"A Bi-Level Optimization Method for Redundant Dual-Arm Minimum Time Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Jonathan Fried, Santiago Paternain","submitted_at":"2025-06-04T14:11:42Z","abstract_excerpt":"In this work, we present a method for minimizing the time required for a redundant dual-arm robot to follow a desired relative Cartesian path at constant path speed by optimizing its joint trajectories, subject to position, velocity, and acceleration limits. The problem is reformulated as a bi-level optimization whose lower level is a convex, closed-form subproblem that maximizes path speed for a fixed trajectory, while the upper level updates the trajectory using a single-chain kinematic formulation and the subgradient of the lower-level value. Numerical results demonstrate the effectiveness "},"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":"2506.03982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-04T14:11:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5c50bcaafd0249d80ade9b8de300f4007abf168fbf965e0d177fbcd6da27bb6e","abstract_canon_sha256":"baf753d010c499e07b291028fe83bc9dd33ea612a98042ebbd6bb97f329d9919"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:54.868622Z","signature_b64":"QUM05Q1tOHuuMgNAwzX34VcL0Zbu+o2Ijc4/4Y0kQ7T9naJjuP1f7aXnwoZbZOlJWtDenvjFwFFsaJbIDCT0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"317c86064b0fb4d846f56bec34c6b49ddf0bcdf894ac1600a6d51e7f365cc8a0","last_reissued_at":"2026-07-05T11:15:54.868166Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:54.868166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bi-Level Optimization Method for Redundant Dual-Arm Minimum Time Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Jonathan Fried, Santiago Paternain","submitted_at":"2025-06-04T14:11:42Z","abstract_excerpt":"In this work, we present a method for minimizing the time required for a redundant dual-arm robot to follow a desired relative Cartesian path at constant path speed by optimizing its joint trajectories, subject to position, velocity, and acceleration limits. The problem is reformulated as a bi-level optimization whose lower level is a convex, closed-form subproblem that maximizes path speed for a fixed trajectory, while the upper level updates the trajectory using a single-chain kinematic formulation and the subgradient of the lower-level value. Numerical results demonstrate the effectiveness "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03982","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03982/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":"2506.03982","created_at":"2026-07-05T11:15:54.868231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03982v1","created_at":"2026-07-05T11:15:54.868231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03982","created_at":"2026-07-05T11:15:54.868231+00:00"},{"alias_kind":"pith_short_12","alias_value":"GF6IMBSLB62N","created_at":"2026-07-05T11:15:54.868231+00:00"},{"alias_kind":"pith_short_16","alias_value":"GF6IMBSLB62NQRXV","created_at":"2026-07-05T11:15:54.868231+00:00"},{"alias_kind":"pith_short_8","alias_value":"GF6IMBSL","created_at":"2026-07-05T11:15:54.868231+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/GF6IMBSLB62NQRXVNPWDJRVUTX","json":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX.json","graph_json":"https://pith.science/api/pith-number/GF6IMBSLB62NQRXVNPWDJRVUTX/graph.json","events_json":"https://pith.science/api/pith-number/GF6IMBSLB62NQRXVNPWDJRVUTX/events.json","paper":"https://pith.science/paper/GF6IMBSL"},"agent_actions":{"view_html":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX","download_json":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX.json","view_paper":"https://pith.science/paper/GF6IMBSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03982&json=true","fetch_graph":"https://pith.science/api/pith-number/GF6IMBSLB62NQRXVNPWDJRVUTX/graph.json","fetch_events":"https://pith.science/api/pith-number/GF6IMBSLB62NQRXVNPWDJRVUTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX/action/storage_attestation","attest_author":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX/action/author_attestation","sign_citation":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX/action/citation_signature","submit_replication":"https://pith.science/pith/GF6IMBSLB62NQRXVNPWDJRVUTX/action/replication_record"}},"created_at":"2026-07-05T11:15:54.868231+00:00","updated_at":"2026-07-05T11:15:54.868231+00:00"}