{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:Y6FBGPUZJ2RUWTBU7XMXYY354A","short_pith_number":"pith:Y6FBGPUZ","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"},"canonical_sha256":"c78a133e994ea34b4c34fdd97c637de01675737d77fdd00b7e998d062b374cac","source":{"kind":"arxiv","id":"2007.04856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04856","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04856v1","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04856","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y6FBGPUZJ2RU","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_16","alias_value":"Y6FBGPUZJ2RUWTBU","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_8","alias_value":"Y6FBGPUZ","created_at":"2026-07-05T01:17:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:Y6FBGPUZJ2RUWTBU7XMXYY354A","target":"record","payload":{"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"},"canonical_sha256":"c78a133e994ea34b4c34fdd97c637de01675737d77fdd00b7e998d062b374cac","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"},"source_kind":"arxiv","source_id":"2007.04856","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXpY7XSJxj1CvzK+tjANflQGVTQw+X4ce/h1q9MrXNeowOfybsW4rxcwGEpP7ATm4oi+ISdT2ODjiPsx/1hqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:58:28.746431Z"},"content_sha256":"c07d48a9da0a0450d268877242faa7fdc867bf83ec29d801959ff7c0260cf9d9","schema_version":"1.0","event_id":"sha256:c07d48a9da0a0450d268877242faa7fdc867bf83ec29d801959ff7c0260cf9d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:Y6FBGPUZJ2RUWTBU7XMXYY354A","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdDEeOPoDWsJuJbvPJaJ9u5rsajUB9qbDo/jx7I1VRxTZ5WQigTOiaOtKamwxnJLP5FgHSwdKBuETae4467WAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:58:28.746812Z"},"content_sha256":"d15e89fc527835a721ab052b2c042d54fdf84a9984ad3ec8214cb7477c910e42","schema_version":"1.0","event_id":"sha256:d15e89fc527835a721ab052b2c042d54fdf84a9984ad3ec8214cb7477c910e42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/bundle.json","state_url":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T05:58:28Z","links":{"resolver":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A","bundle":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/bundle.json","state":"https://pith.science/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6FBGPUZJ2RUWTBU7XMXYY354A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:Y6FBGPUZJ2RUWTBU7XMXYY354A","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"86b22e02a80d0eae17c0e05a13c035e88250edceec98359057ff950653d1d3f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-09T14:58:53Z","title_canon_sha256":"357f1f78b33965848004161ce48d320f70e46c032a195e9f81e319eb6ecb4b9c"},"schema_version":"1.0","source":{"id":"2007.04856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04856","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04856v1","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04856","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"Y6FBGPUZJ2RU","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_16","alias_value":"Y6FBGPUZJ2RUWTBU","created_at":"2026-07-05T01:17:35Z"},{"alias_kind":"pith_short_8","alias_value":"Y6FBGPUZ","created_at":"2026-07-05T01:17:35Z"}],"graph_snapshots":[{"event_id":"sha256:d15e89fc527835a721ab052b2c042d54fdf84a9984ad3ec8214cb7477c910e42","target":"graph","created_at":"2026-07-05T01:17:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.04856/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jingjin Yu, Shuai D. Han, Wei N. Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-09T14:58:53Z","title":"Computing High-Quality Clutter Removal Solutions for Multiple Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04856","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c07d48a9da0a0450d268877242faa7fdc867bf83ec29d801959ff7c0260cf9d9","target":"record","created_at":"2026-07-05T01:17:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"86b22e02a80d0eae17c0e05a13c035e88250edceec98359057ff950653d1d3f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-07-09T14:58:53Z","title_canon_sha256":"357f1f78b33965848004161ce48d320f70e46c032a195e9f81e319eb6ecb4b9c"},"schema_version":"1.0","source":{"id":"2007.04856","kind":"arxiv","version":1}},"canonical_sha256":"c78a133e994ea34b4c34fdd97c637de01675737d77fdd00b7e998d062b374cac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c78a133e994ea34b4c34fdd97c637de01675737d77fdd00b7e998d062b374cac","first_computed_at":"2026-07-05T01:17:35.333404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:35.333404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mAjBsrWR5Tz28VFMYIk8RGtJU4z5lI3UGUK6p/75cDoSJC/FbX/OFzDGIb+zZjCKa9qPlOjxr/tDy44YYF+RDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:35.333768Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.04856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c07d48a9da0a0450d268877242faa7fdc867bf83ec29d801959ff7c0260cf9d9","sha256:d15e89fc527835a721ab052b2c042d54fdf84a9984ad3ec8214cb7477c910e42"],"state_sha256":"ca424c0040da787c8e919591c1d2c4381b87d6f5649987a62ba493357aedd33f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QgOk2pK4mcqd0aT1qdFD3VakifMxLb+C+HQQPo1LogIwGerxzfHkDKaNa231DR9DHo6S3GwfTNRuC+/o5KYRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:58:28.749147Z","bundle_sha256":"5c13035e4b16cc814881f2204947b3a5a9a53905c7f655a055e15cbbc9e8f4a1"}}