{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3EXPMTX5P2RNYT345CQEJWZDXO","short_pith_number":"pith:3EXPMTX5","schema_version":"1.0","canonical_sha256":"d92ef64efd7ea2dc4f7ce8a044db23bb935fc8612bfc6f2dc483d0ce8bdd2898","source":{"kind":"arxiv","id":"1906.08494","version":1},"attestation_state":"computed","paper":{"title":"Object Placement on Cluttered Surfaces: A Nested Local Search Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Abdul Rahman Dabbour, Esra Erdem, Volkan Patoglu","submitted_at":"2019-06-20T08:21:07Z","abstract_excerpt":"For planning rearrangements of objects in a clutter, it is required to know the goal configuration of the objects. However, in real life scenarios, this information is not available most of the time. We introduce a novel method that computes a collision-free placement of objects on a cluttered surface, while minimizing the total number and amount of displacements of the existing moveable objects. Our method applies nested local searches that perform multi-objective optimizations guided by heuristics. Experimental evaluations demonstrate high computational efficiency and success rate of our met"},"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":"1906.08494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-20T08:21:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"22d9eadc9528f1f975b92dd00e4fb432083efa5ed68dbf8e3102caa677a09549","abstract_canon_sha256":"1003b5cf2e5d0863a9987b4dffd65e867c238752e0293575342d288aa86745d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:52.332065Z","signature_b64":"kHajtzJZi+cXyfxlyhfG6vk7pCima0rDEZRYihMW15EtJO1Gn+gjxUvsSDPNG7/ZrTrDbyGnuB8ZFdnfHM/fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d92ef64efd7ea2dc4f7ce8a044db23bb935fc8612bfc6f2dc483d0ce8bdd2898","last_reissued_at":"2026-05-17T23:42:52.331557Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:52.331557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Object Placement on Cluttered Surfaces: A Nested Local Search Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Abdul Rahman Dabbour, Esra Erdem, Volkan Patoglu","submitted_at":"2019-06-20T08:21:07Z","abstract_excerpt":"For planning rearrangements of objects in a clutter, it is required to know the goal configuration of the objects. However, in real life scenarios, this information is not available most of the time. We introduce a novel method that computes a collision-free placement of objects on a cluttered surface, while minimizing the total number and amount of displacements of the existing moveable objects. Our method applies nested local searches that perform multi-objective optimizations guided by heuristics. Experimental evaluations demonstrate high computational efficiency and success rate of our met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08494","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":""},"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":"1906.08494","created_at":"2026-05-17T23:42:52.331628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08494v1","created_at":"2026-05-17T23:42:52.331628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08494","created_at":"2026-05-17T23:42:52.331628+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EXPMTX5P2RN","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EXPMTX5P2RNYT34","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EXPMTX5","created_at":"2026-05-18T12:33:07.085635+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/3EXPMTX5P2RNYT345CQEJWZDXO","json":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO.json","graph_json":"https://pith.science/api/pith-number/3EXPMTX5P2RNYT345CQEJWZDXO/graph.json","events_json":"https://pith.science/api/pith-number/3EXPMTX5P2RNYT345CQEJWZDXO/events.json","paper":"https://pith.science/paper/3EXPMTX5"},"agent_actions":{"view_html":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO","download_json":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO.json","view_paper":"https://pith.science/paper/3EXPMTX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08494&json=true","fetch_graph":"https://pith.science/api/pith-number/3EXPMTX5P2RNYT345CQEJWZDXO/graph.json","fetch_events":"https://pith.science/api/pith-number/3EXPMTX5P2RNYT345CQEJWZDXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/action/storage_attestation","attest_author":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/action/author_attestation","sign_citation":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/action/citation_signature","submit_replication":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/action/replication_record"}},"created_at":"2026-05-17T23:42:52.331628+00:00","updated_at":"2026-05-17T23:42:52.331628+00:00"}