{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GF6IMBSLB62NQRXVNPWDJRVUTX","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":"baf753d010c499e07b291028fe83bc9dd33ea612a98042ebbd6bb97f329d9919","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-04T14:11:42Z","title_canon_sha256":"5c50bcaafd0249d80ade9b8de300f4007abf168fbf965e0d177fbcd6da27bb6e"},"schema_version":"1.0","source":{"id":"2506.03982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03982","created_at":"2026-07-05T11:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03982v1","created_at":"2026-07-05T11:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03982","created_at":"2026-07-05T11:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"GF6IMBSLB62N","created_at":"2026-07-05T11:15:54Z"},{"alias_kind":"pith_short_16","alias_value":"GF6IMBSLB62NQRXV","created_at":"2026-07-05T11:15:54Z"},{"alias_kind":"pith_short_8","alias_value":"GF6IMBSL","created_at":"2026-07-05T11:15:54Z"}],"graph_snapshots":[{"event_id":"sha256:5ba94924293229ff5333b3e30c014b621db8121b53716674cbb099194ba9b083","target":"graph","created_at":"2026-07-05T11:15:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.03982/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Jonathan Fried, Santiago Paternain","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-04T14:11:42Z","title":"A Bi-Level Optimization Method for Redundant Dual-Arm Minimum Time Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03982","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:b937de14e315759eb582d677d148eeb810c505100424a40d90227edc7ae8a542","target":"record","created_at":"2026-07-05T11:15:54Z","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":"baf753d010c499e07b291028fe83bc9dd33ea612a98042ebbd6bb97f329d9919","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-06-04T14:11:42Z","title_canon_sha256":"5c50bcaafd0249d80ade9b8de300f4007abf168fbf965e0d177fbcd6da27bb6e"},"schema_version":"1.0","source":{"id":"2506.03982","kind":"arxiv","version":1}},"canonical_sha256":"317c86064b0fb4d846f56bec34c6b49ddf0bcdf894ac1600a6d51e7f365cc8a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"317c86064b0fb4d846f56bec34c6b49ddf0bcdf894ac1600a6d51e7f365cc8a0","first_computed_at":"2026-07-05T11:15:54.868166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:54.868166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QUM05Q1tOHuuMgNAwzX34VcL0Zbu+o2Ijc4/4Y0kQ7T9naJjuP1f7aXnwoZbZOlJWtDenvjFwFFsaJbIDCT0DA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:54.868622Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b937de14e315759eb582d677d148eeb810c505100424a40d90227edc7ae8a542","sha256:5ba94924293229ff5333b3e30c014b621db8121b53716674cbb099194ba9b083"],"state_sha256":"a6caee1c10e210090e44f9fc48bffbe99f13a357fa65d1be55f11130d450e62f"}