{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3EXPMTX5P2RNYT345CQEJWZDXO","short_pith_number":"pith:3EXPMTX5","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"},"canonical_sha256":"d92ef64efd7ea2dc4f7ce8a044db23bb935fc8612bfc6f2dc483d0ce8bdd2898","source":{"kind":"arxiv","id":"1906.08494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08494","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08494v1","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08494","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"3EXPMTX5P2RN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3EXPMTX5P2RNYT34","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3EXPMTX5","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3EXPMTX5P2RNYT345CQEJWZDXO","target":"record","payload":{"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"},"canonical_sha256":"d92ef64efd7ea2dc4f7ce8a044db23bb935fc8612bfc6f2dc483d0ce8bdd2898","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"},"source_kind":"arxiv","source_id":"1906.08494","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-05-17T23:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqRNowyKTT995nnP37FMrMqzwRummnSQLuSo9R+48oitDngL5WaPlicvDHx3Ki9q3MJjznfbOUZIi6Ho4javBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:46:08.359696Z"},"content_sha256":"22dd81a5c61e683de31738947ad5878544ab172e1dca20053c9141fec1728cfd","schema_version":"1.0","event_id":"sha256:22dd81a5c61e683de31738947ad5878544ab172e1dca20053c9141fec1728cfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3EXPMTX5P2RNYT345CQEJWZDXO","target":"graph","payload":{"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"},"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-05-17T23:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofS93s6s61WG1OHH/kHA1Hwb7gDTsBmUj1L3K8oruWdoIrB5xZV+9eZQpXfvsy6Qx/LZViCWcVOSP+ij1qjkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:46:08.360375Z"},"content_sha256":"6b2d87e2647fefd63dbc47006b47496841f023e2827963d69aa6e8f33e9c2c67","schema_version":"1.0","event_id":"sha256:6b2d87e2647fefd63dbc47006b47496841f023e2827963d69aa6e8f33e9c2c67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/bundle.json","state_url":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EXPMTX5P2RNYT345CQEJWZDXO/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-05-26T09:46:08Z","links":{"resolver":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO","bundle":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/bundle.json","state":"https://pith.science/pith/3EXPMTX5P2RNYT345CQEJWZDXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EXPMTX5P2RNYT345CQEJWZDXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3EXPMTX5P2RNYT345CQEJWZDXO","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":"1003b5cf2e5d0863a9987b4dffd65e867c238752e0293575342d288aa86745d8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-20T08:21:07Z","title_canon_sha256":"22d9eadc9528f1f975b92dd00e4fb432083efa5ed68dbf8e3102caa677a09549"},"schema_version":"1.0","source":{"id":"1906.08494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08494","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08494v1","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08494","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"3EXPMTX5P2RN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3EXPMTX5P2RNYT34","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3EXPMTX5","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:6b2d87e2647fefd63dbc47006b47496841f023e2827963d69aa6e8f33e9c2c67","target":"graph","created_at":"2026-05-17T23:42:52Z","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"},"paper":{"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","authors_text":"Abdul Rahman Dabbour, Esra Erdem, Volkan Patoglu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-20T08:21:07Z","title":"Object Placement on Cluttered Surfaces: A Nested Local Search Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08494","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:22dd81a5c61e683de31738947ad5878544ab172e1dca20053c9141fec1728cfd","target":"record","created_at":"2026-05-17T23:42:52Z","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":"1003b5cf2e5d0863a9987b4dffd65e867c238752e0293575342d288aa86745d8","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-06-20T08:21:07Z","title_canon_sha256":"22d9eadc9528f1f975b92dd00e4fb432083efa5ed68dbf8e3102caa677a09549"},"schema_version":"1.0","source":{"id":"1906.08494","kind":"arxiv","version":1}},"canonical_sha256":"d92ef64efd7ea2dc4f7ce8a044db23bb935fc8612bfc6f2dc483d0ce8bdd2898","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d92ef64efd7ea2dc4f7ce8a044db23bb935fc8612bfc6f2dc483d0ce8bdd2898","first_computed_at":"2026-05-17T23:42:52.331557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:52.331557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kHajtzJZi+cXyfxlyhfG6vk7pCima0rDEZRYihMW15EtJO1Gn+gjxUvsSDPNG7/ZrTrDbyGnuB8ZFdnfHM/fAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:52.332065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22dd81a5c61e683de31738947ad5878544ab172e1dca20053c9141fec1728cfd","sha256:6b2d87e2647fefd63dbc47006b47496841f023e2827963d69aa6e8f33e9c2c67"],"state_sha256":"9b74e1217a0e3a6086f2664807638e4fdd2f48d4830975ca446c158adb1eeeb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHPjhlSZ3Yuc8hYJO254kQSK+9K4HFP6z7h4UdotDGiazFKCRu3R0ldvI934BZjjK+uF/fabtXXLr6KLMXPxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:46:08.364551Z","bundle_sha256":"a97ebc51e2814536eab32fbf7fc270134ae4975f2d105a7af3273c19a1a06321"}}