{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Y6FBGPUZJ2RUWTBU7XMXYY354A","short_pith_number":"pith:Y6FBGPUZ","schema_version":"1.0","canonical_sha256":"c78a133e994ea34b4c34fdd97c637de01675737d77fdd00b7e998d062b374cac","source":{"kind":"arxiv","id":"2007.04856","version":1},"attestation_state":"computed","paper":{"title":"Computing High-Quality Clutter Removal Solutions for Multiple Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jingjin Yu, Shuai D. Han, Wei N. Tang","submitted_at":"2020-07-09T14:58:53Z","abstract_excerpt":"We investigate the task and motion planning problem of clearing clutter from a workspace with limited ingress/egress access for multiple robots. We call the problem multi-robot clutter removal (MRCR). Targeting practical applications where motion planning is non-trivial but is not a bottleneck, we focus on finding high-quality solutions for feasible MRCR instances, which depends on the ability to efficiently compute high-quality object removal sequences. Despite the challenging multi-robot setting, our proposed search algorithms based on A*, dynamic programming, and best-first heuristics all p"},"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":"2007.04856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-09T14:58:53Z","cross_cats_sorted":[],"title_canon_sha256":"357f1f78b33965848004161ce48d320f70e46c032a195e9f81e319eb6ecb4b9c","abstract_canon_sha256":"86b22e02a80d0eae17c0e05a13c035e88250edceec98359057ff950653d1d3f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:35.333768Z","signature_b64":"mAjBsrWR5Tz28VFMYIk8RGtJU4z5lI3UGUK6p/75cDoSJC/FbX/OFzDGIb+zZjCKa9qPlOjxr/tDy44YYF+RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78a133e994ea34b4c34fdd97c637de01675737d77fdd00b7e998d062b374cac","last_reissued_at":"2026-07-05T01:17:35.333404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:35.333404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing High-Quality Clutter Removal Solutions for Multiple Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jingjin Yu, Shuai D. Han, Wei N. Tang","submitted_at":"2020-07-09T14:58:53Z","abstract_excerpt":"We investigate the task and motion planning problem of clearing clutter from a workspace with limited ingress/egress access for multiple robots. We call the problem multi-robot clutter removal (MRCR). Targeting practical applications where motion planning is non-trivial but is not a bottleneck, we focus on finding high-quality solutions for feasible MRCR instances, which depends on the ability to efficiently compute high-quality object removal sequences. Despite the challenging multi-robot setting, our proposed search algorithms based on A*, dynamic programming, and best-first heuristics all p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04856","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/2007.04856/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":"2007.04856","created_at":"2026-07-05T01:17:35.333465+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.04856v1","created_at":"2026-07-05T01:17:35.333465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04856","created_at":"2026-07-05T01:17:35.333465+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6FBGPUZJ2RU","created_at":"2026-07-05T01:17:35.333465+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6FBGPUZJ2RUWTBU","created_at":"2026-07-05T01:17:35.333465+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6FBGPUZ","created_at":"2026-07-05T01:17:35.333465+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/Y6FBGPUZJ2RUWTBU7XMXYY354A","json":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A.json","graph_json":"https://pith.science/api/pith-number/Y6FBGPUZJ2RUWTBU7XMXYY354A/graph.json","events_json":"https://pith.science/api/pith-number/Y6FBGPUZJ2RUWTBU7XMXYY354A/events.json","paper":"https://pith.science/paper/Y6FBGPUZ"},"agent_actions":{"view_html":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A","download_json":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A.json","view_paper":"https://pith.science/paper/Y6FBGPUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.04856&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6FBGPUZJ2RUWTBU7XMXYY354A/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6FBGPUZJ2RUWTBU7XMXYY354A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/action/storage_attestation","attest_author":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/action/author_attestation","sign_citation":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/action/citation_signature","submit_replication":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/action/replication_record"}},"created_at":"2026-07-05T01:17:35.333465+00:00","updated_at":"2026-07-05T01:17:35.333465+00:00"}