{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OQAPRVHBIHA45D5TPGRZUO2OCS","short_pith_number":"pith:OQAPRVHB","schema_version":"1.0","canonical_sha256":"7400f8d4e141c1ce8fb379a39a3b4e148e4b8b624fcdd54e53f198918b8594f1","source":{"kind":"arxiv","id":"2201.04280","version":1},"attestation_state":"computed","paper":{"title":"Object Gathering with a Tethered Robot Duo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hangxin Liu, Yao Su, Yixin Zhu, Yuhong Jiang","submitted_at":"2022-01-12T03:12:40Z","abstract_excerpt":"We devise a cooperative planning framework to generate optimal trajectories for a tethered robot duo, who is tasked to gather scattered objects spread in a large area using a flexible net. Specifically, the proposed planning framework first produces a set of dense waypoints for each robot, serving as the initialization for optimization. Next, we formulate an iterative optimization scheme to generate smooth and collision-free trajectories while ensuring cooperation within the robot duo to efficiently gather objects and properly avoid obstacles. We validate the generated trajectories in simulati"},"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":"2201.04280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-01-12T03:12:40Z","cross_cats_sorted":[],"title_canon_sha256":"9c83e6d435454a3b4fa20168c80558e860a040fe9a8d7125cbf41fa1501b0fa4","abstract_canon_sha256":"0bb0b3ae60e0f0ac658249b370f528e5051ff4f79856d40fc7ebf98c2b185633"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:47:58.633242Z","signature_b64":"M4Yblwqn/AOYQLlL60B2QUvkT+qAOKfa9hhGsjEtGi1iM9Td7el3SYAQIECXhNu0THtPkrficPwRja841SzHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7400f8d4e141c1ce8fb379a39a3b4e148e4b8b624fcdd54e53f198918b8594f1","last_reissued_at":"2026-07-05T03:47:58.632836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:47:58.632836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Object Gathering with a Tethered Robot Duo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hangxin Liu, Yao Su, Yixin Zhu, Yuhong Jiang","submitted_at":"2022-01-12T03:12:40Z","abstract_excerpt":"We devise a cooperative planning framework to generate optimal trajectories for a tethered robot duo, who is tasked to gather scattered objects spread in a large area using a flexible net. Specifically, the proposed planning framework first produces a set of dense waypoints for each robot, serving as the initialization for optimization. Next, we formulate an iterative optimization scheme to generate smooth and collision-free trajectories while ensuring cooperation within the robot duo to efficiently gather objects and properly avoid obstacles. We validate the generated trajectories in simulati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04280","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/2201.04280/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":"2201.04280","created_at":"2026-07-05T03:47:58.632894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.04280v1","created_at":"2026-07-05T03:47:58.632894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04280","created_at":"2026-07-05T03:47:58.632894+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQAPRVHBIHA4","created_at":"2026-07-05T03:47:58.632894+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQAPRVHBIHA45D5T","created_at":"2026-07-05T03:47:58.632894+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQAPRVHB","created_at":"2026-07-05T03:47:58.632894+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/OQAPRVHBIHA45D5TPGRZUO2OCS","json":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS.json","graph_json":"https://pith.science/api/pith-number/OQAPRVHBIHA45D5TPGRZUO2OCS/graph.json","events_json":"https://pith.science/api/pith-number/OQAPRVHBIHA45D5TPGRZUO2OCS/events.json","paper":"https://pith.science/paper/OQAPRVHB"},"agent_actions":{"view_html":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS","download_json":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS.json","view_paper":"https://pith.science/paper/OQAPRVHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.04280&json=true","fetch_graph":"https://pith.science/api/pith-number/OQAPRVHBIHA45D5TPGRZUO2OCS/graph.json","fetch_events":"https://pith.science/api/pith-number/OQAPRVHBIHA45D5TPGRZUO2OCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS/action/storage_attestation","attest_author":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS/action/author_attestation","sign_citation":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS/action/citation_signature","submit_replication":"https://pith.science/pith/OQAPRVHBIHA45D5TPGRZUO2OCS/action/replication_record"}},"created_at":"2026-07-05T03:47:58.632894+00:00","updated_at":"2026-07-05T03:47:58.632894+00:00"}