{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6DY4WXRTSHYAAQHXBAAMLIZ5JB","short_pith_number":"pith:6DY4WXRT","schema_version":"1.0","canonical_sha256":"f0f1cb5e3391f00040f70800c5a33d4865ed805fb812d08037eab0cd91f0fd07","source":{"kind":"arxiv","id":"2106.01352","version":2},"attestation_state":"computed","paper":{"title":"NeRP: Neural Rearrangement Planning for Unknown Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Arsalan Mousavian, Chris Paxton, Dieter Fox, Michael C. Yip","submitted_at":"2021-06-02T17:56:27Z","abstract_excerpt":"Robots will be expected to manipulate a wide variety of objects in complex and arbitrary ways as they become more widely used in human environments. As such, the rearrangement of objects has been noted to be an important benchmark for AI capabilities in recent years. We propose NeRP (Neural Rearrangement Planning), a deep learning based approach for multi-step neural object rearrangement planning which works with never-before-seen objects, that is trained on simulation data, and generalizes to the real world. We compare NeRP to several naive and model-based baselines, demonstrating that our ap"},"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":"2106.01352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-02T17:56:27Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"681a96110c609a6cf45c1203958fb8d0e5c184638bca3ccf468e7ea5fe575ca9","abstract_canon_sha256":"3beb6601c4eb5c98d38b4610213ca728be72c34ad89c5e45f930c904353aa3ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:28.686066Z","signature_b64":"K52eMbVFyBeporoCpmhRaZ5NMYG2Ych3fuNUdoDL3kXDQmGEGGE+N7V4My2JhTPSPRb3yUZEemUF9cozTZgvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f1cb5e3391f00040f70800c5a33d4865ed805fb812d08037eab0cd91f0fd07","last_reissued_at":"2026-07-05T02:46:28.685633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:28.685633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeRP: Neural Rearrangement Planning for Unknown Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Ahmed H. Qureshi, Arsalan Mousavian, Chris Paxton, Dieter Fox, Michael C. Yip","submitted_at":"2021-06-02T17:56:27Z","abstract_excerpt":"Robots will be expected to manipulate a wide variety of objects in complex and arbitrary ways as they become more widely used in human environments. As such, the rearrangement of objects has been noted to be an important benchmark for AI capabilities in recent years. We propose NeRP (Neural Rearrangement Planning), a deep learning based approach for multi-step neural object rearrangement planning which works with never-before-seen objects, that is trained on simulation data, and generalizes to the real world. We compare NeRP to several naive and model-based baselines, demonstrating that our ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.01352","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/2106.01352/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":"2106.01352","created_at":"2026-07-05T02:46:28.685707+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.01352v2","created_at":"2026-07-05T02:46:28.685707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.01352","created_at":"2026-07-05T02:46:28.685707+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DY4WXRTSHYA","created_at":"2026-07-05T02:46:28.685707+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DY4WXRTSHYAAQHX","created_at":"2026-07-05T02:46:28.685707+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DY4WXRT","created_at":"2026-07-05T02:46:28.685707+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15157","citing_title":"Cascaded Diffusion Models for Neural Motion Planning","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB","json":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB.json","graph_json":"https://pith.science/api/pith-number/6DY4WXRTSHYAAQHXBAAMLIZ5JB/graph.json","events_json":"https://pith.science/api/pith-number/6DY4WXRTSHYAAQHXBAAMLIZ5JB/events.json","paper":"https://pith.science/paper/6DY4WXRT"},"agent_actions":{"view_html":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB","download_json":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB.json","view_paper":"https://pith.science/paper/6DY4WXRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.01352&json=true","fetch_graph":"https://pith.science/api/pith-number/6DY4WXRTSHYAAQHXBAAMLIZ5JB/graph.json","fetch_events":"https://pith.science/api/pith-number/6DY4WXRTSHYAAQHXBAAMLIZ5JB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB/action/storage_attestation","attest_author":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB/action/author_attestation","sign_citation":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB/action/citation_signature","submit_replication":"https://pith.science/pith/6DY4WXRTSHYAAQHXBAAMLIZ5JB/action/replication_record"}},"created_at":"2026-07-05T02:46:28.685707+00:00","updated_at":"2026-07-05T02:46:28.685707+00:00"}