{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:O4SY7JBU3XXZILME64IV5Y43MA","short_pith_number":"pith:O4SY7JBU","schema_version":"1.0","canonical_sha256":"77258fa434ddef942d84f7115ee39b6035a48c0014487080c4b7d516c20099ec","source":{"kind":"arxiv","id":"2209.04800","version":3},"attestation_state":"computed","paper":{"title":"Multi-query Robotic Manipulator Task Sequencing with Gromov-Hausdorff Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fouad Sukkar, Jennifer Wakulicz, Ki Myung Brian Lee, Robert Fitch, Weiming Zhi","submitted_at":"2022-09-11T06:31:55Z","abstract_excerpt":"Robotic manipulator applications often require efficient online motion planning. When completing multiple tasks, sequence order and choice of goal configuration can have a drastic impact on planning performance. This is well known as the robot task sequencing problem (RTSP). Existing general-purpose RTSP algorithms are susceptible to producing poor-quality solutions or failing entirely when available computation time is restricted. We propose a new multi-query task sequencing method designed to operate in semi-structured environments with a combination of static and non-static obstacles. Our m"},"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":"2209.04800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-09-11T06:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"6bbc54e799f192add4d9914795baf112be130d72fb5923410d3b4e38efdc5a97","abstract_canon_sha256":"1e524cfe1e11e5b43da915dad28690d257ed04cd320f0b2476c7e2557bda8acf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:11.897979Z","signature_b64":"2NU1Gu8lj92TYBRmZEpnlYkx57PrIn23PIjADC6it8YSbXz1Jj2xIP3YF7n8ryhuy4i+TZetGNYzrYGsLOZmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77258fa434ddef942d84f7115ee39b6035a48c0014487080c4b7d516c20099ec","last_reissued_at":"2026-07-05T10:11:11.897576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:11.897576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-query Robotic Manipulator Task Sequencing with Gromov-Hausdorff Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fouad Sukkar, Jennifer Wakulicz, Ki Myung Brian Lee, Robert Fitch, Weiming Zhi","submitted_at":"2022-09-11T06:31:55Z","abstract_excerpt":"Robotic manipulator applications often require efficient online motion planning. When completing multiple tasks, sequence order and choice of goal configuration can have a drastic impact on planning performance. This is well known as the robot task sequencing problem (RTSP). Existing general-purpose RTSP algorithms are susceptible to producing poor-quality solutions or failing entirely when available computation time is restricted. We propose a new multi-query task sequencing method designed to operate in semi-structured environments with a combination of static and non-static obstacles. Our m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04800","kind":"arxiv","version":3},"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/2209.04800/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":"2209.04800","created_at":"2026-07-05T10:11:11.897627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.04800v3","created_at":"2026-07-05T10:11:11.897627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04800","created_at":"2026-07-05T10:11:11.897627+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4SY7JBU3XXZ","created_at":"2026-07-05T10:11:11.897627+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4SY7JBU3XXZILME","created_at":"2026-07-05T10:11:11.897627+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4SY7JBU","created_at":"2026-07-05T10:11:11.897627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23563","citing_title":"On the Gromov-Hausdorff distance between the cloud of bounded metric spaces and a cloud with nontrivial stabilizer","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA","json":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA.json","graph_json":"https://pith.science/api/pith-number/O4SY7JBU3XXZILME64IV5Y43MA/graph.json","events_json":"https://pith.science/api/pith-number/O4SY7JBU3XXZILME64IV5Y43MA/events.json","paper":"https://pith.science/paper/O4SY7JBU"},"agent_actions":{"view_html":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA","download_json":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA.json","view_paper":"https://pith.science/paper/O4SY7JBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.04800&json=true","fetch_graph":"https://pith.science/api/pith-number/O4SY7JBU3XXZILME64IV5Y43MA/graph.json","fetch_events":"https://pith.science/api/pith-number/O4SY7JBU3XXZILME64IV5Y43MA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/action/storage_attestation","attest_author":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/action/author_attestation","sign_citation":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/action/citation_signature","submit_replication":"https://pith.science/pith/O4SY7JBU3XXZILME64IV5Y43MA/action/replication_record"}},"created_at":"2026-07-05T10:11:11.897627+00:00","updated_at":"2026-07-05T10:11:11.897627+00:00"}