{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2BPH7H2F3LBNI4MCC6MHJTRB47","short_pith_number":"pith:2BPH7H2F","schema_version":"1.0","canonical_sha256":"d05e7f9f45dac2d47182179874ce21e7ef4d01b7d2533ab64e08984276bf7dcc","source":{"kind":"arxiv","id":"2210.04333","version":2},"attestation_state":"computed","paper":{"title":"Hypergraph-based Multi-Robot Task and Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"James Motes, Marco Morales, Nancy M. Amato, Tan Chen, Timothy Bretl","submitted_at":"2022-10-09T19:43:21Z","abstract_excerpt":"We present a multi-robot task and motion planning method that, when applied to the rearrangement of objects by manipulators, results in solution times up to three orders of magnitude faster than existing methods and successfully plans for problems with up to twenty objects, more than three times as many objects as comparable methods. We achieve this improvement by decomposing the planning space to consider manipulators alone, objects, and manipulators holding objects. We represent this decomposition with a hypergraph where vertices are decomposed elements of the planning spaces and hyperarcs a"},"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":"2210.04333","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-10-09T19:43:21Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"c24c850138f108d826cb9c5eabac1a7a4a1d03c927396209aa11a45c7e638553","abstract_canon_sha256":"a6bc7fd8754ea3d000fd9379a0ea9b3097747a12af227cb1ee6553cdecfde314"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:29.994895Z","signature_b64":"QVKXbSdI+59Sazmf7h6mi1z+e25CdhVvgBC8Xtk9gJfnly71say3DMoJzBEa6pxWMCzhvkSlo3FetvbzCmZMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d05e7f9f45dac2d47182179874ce21e7ef4d01b7d2533ab64e08984276bf7dcc","last_reissued_at":"2026-07-05T06:02:29.994420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:29.994420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph-based Multi-Robot Task and Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"James Motes, Marco Morales, Nancy M. Amato, Tan Chen, Timothy Bretl","submitted_at":"2022-10-09T19:43:21Z","abstract_excerpt":"We present a multi-robot task and motion planning method that, when applied to the rearrangement of objects by manipulators, results in solution times up to three orders of magnitude faster than existing methods and successfully plans for problems with up to twenty objects, more than three times as many objects as comparable methods. We achieve this improvement by decomposing the planning space to consider manipulators alone, objects, and manipulators holding objects. We represent this decomposition with a hypergraph where vertices are decomposed elements of the planning spaces and hyperarcs a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04333","kind":"arxiv","version":2},"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/2210.04333/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":"2210.04333","created_at":"2026-07-05T06:02:29.994480+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.04333v2","created_at":"2026-07-05T06:02:29.994480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04333","created_at":"2026-07-05T06:02:29.994480+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BPH7H2F3LBN","created_at":"2026-07-05T06:02:29.994480+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BPH7H2F3LBNI4MC","created_at":"2026-07-05T06:02:29.994480+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BPH7H2F","created_at":"2026-07-05T06:02:29.994480+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/2BPH7H2F3LBNI4MCC6MHJTRB47","json":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47.json","graph_json":"https://pith.science/api/pith-number/2BPH7H2F3LBNI4MCC6MHJTRB47/graph.json","events_json":"https://pith.science/api/pith-number/2BPH7H2F3LBNI4MCC6MHJTRB47/events.json","paper":"https://pith.science/paper/2BPH7H2F"},"agent_actions":{"view_html":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47","download_json":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47.json","view_paper":"https://pith.science/paper/2BPH7H2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.04333&json=true","fetch_graph":"https://pith.science/api/pith-number/2BPH7H2F3LBNI4MCC6MHJTRB47/graph.json","fetch_events":"https://pith.science/api/pith-number/2BPH7H2F3LBNI4MCC6MHJTRB47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47/action/storage_attestation","attest_author":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47/action/author_attestation","sign_citation":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47/action/citation_signature","submit_replication":"https://pith.science/pith/2BPH7H2F3LBNI4MCC6MHJTRB47/action/replication_record"}},"created_at":"2026-07-05T06:02:29.994480+00:00","updated_at":"2026-07-05T06:02:29.994480+00:00"}