{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7IPPQZLO5CVLLGV6KPYEWD6QA7","short_pith_number":"pith:7IPPQZLO","schema_version":"1.0","canonical_sha256":"fa1ef8656ee8aab59abe53f04b0fd007cc65b9780966178dd745bdb739208e2e","source":{"kind":"arxiv","id":"2005.09127","version":1},"attestation_state":"computed","paper":{"title":"Synchronized Multi-Arm Rearrangement Guided by Mode Graphs with Capacity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Kostas E. Bekris, Rahul Shome","submitted_at":"2020-05-18T22:55:50Z","abstract_excerpt":"Solving task planning problems involving multiple objects and multiple robotic arms poses scalability challenges. Such problems involve not only coordinating multiple high-DoF arms, but also searching through possible sequences of actions including object placements, and handoffs. The current work identifies a useful connection between multi-arm rearrangement and recent results in multi-body path planning on graphs with vertex capacity constraints. Solving a synchronized multi-arm rearrangement at a high-level involves reasoning over a modal graph, where nodes correspond to stable object place"},"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":"2005.09127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-05-18T22:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"32bff7eacb07bbce17443ff870aa4954729e2e5fc1496cedc4d8e2e49c840e85","abstract_canon_sha256":"97af17ecaf8dac2a30989c8bfe93f979f92b230b367a9c95f9c781e1c9beea71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:49:58.277571Z","signature_b64":"QVKHAGtS6R0iQGDo+CXR62EiHQ8mOLe+pi3F/zNTGoQ/AjJdLQSEmm3bptF+czRYrpf/wt/oP1KFoFiw+M4DCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa1ef8656ee8aab59abe53f04b0fd007cc65b9780966178dd745bdb739208e2e","last_reissued_at":"2026-07-05T03:49:58.277196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:49:58.277196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronized Multi-Arm Rearrangement Guided by Mode Graphs with Capacity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Kostas E. Bekris, Rahul Shome","submitted_at":"2020-05-18T22:55:50Z","abstract_excerpt":"Solving task planning problems involving multiple objects and multiple robotic arms poses scalability challenges. Such problems involve not only coordinating multiple high-DoF arms, but also searching through possible sequences of actions including object placements, and handoffs. The current work identifies a useful connection between multi-arm rearrangement and recent results in multi-body path planning on graphs with vertex capacity constraints. Solving a synchronized multi-arm rearrangement at a high-level involves reasoning over a modal graph, where nodes correspond to stable object place"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.09127","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/2005.09127/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":"2005.09127","created_at":"2026-07-05T03:49:58.277247+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.09127v1","created_at":"2026-07-05T03:49:58.277247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.09127","created_at":"2026-07-05T03:49:58.277247+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IPPQZLO5CVL","created_at":"2026-07-05T03:49:58.277247+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IPPQZLO5CVLLGV6","created_at":"2026-07-05T03:49:58.277247+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IPPQZLO","created_at":"2026-07-05T03:49:58.277247+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15398","citing_title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","ref_index":94,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7","json":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7.json","graph_json":"https://pith.science/api/pith-number/7IPPQZLO5CVLLGV6KPYEWD6QA7/graph.json","events_json":"https://pith.science/api/pith-number/7IPPQZLO5CVLLGV6KPYEWD6QA7/events.json","paper":"https://pith.science/paper/7IPPQZLO"},"agent_actions":{"view_html":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7","download_json":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7.json","view_paper":"https://pith.science/paper/7IPPQZLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.09127&json=true","fetch_graph":"https://pith.science/api/pith-number/7IPPQZLO5CVLLGV6KPYEWD6QA7/graph.json","fetch_events":"https://pith.science/api/pith-number/7IPPQZLO5CVLLGV6KPYEWD6QA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7/action/storage_attestation","attest_author":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7/action/author_attestation","sign_citation":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7/action/citation_signature","submit_replication":"https://pith.science/pith/7IPPQZLO5CVLLGV6KPYEWD6QA7/action/replication_record"}},"created_at":"2026-07-05T03:49:58.277247+00:00","updated_at":"2026-07-05T03:49:58.277247+00:00"}