{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XNMXYLBUINHI6XBG65JMYMF4Y7","short_pith_number":"pith:XNMXYLBU","canonical_record":{"source":{"id":"1907.02555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-04T18:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"5bfa2287e47f803633aed63072386451c871102ff4065709dbc6d02eb93beb72","abstract_canon_sha256":"2b40ead89e37bd55eb948a4b3e054c70a1fd4aafa08e8b287f48fdc32052155a"},"schema_version":"1.0"},"canonical_sha256":"bb597c2c34434e8f5c26f752cc30bcc7e4e5a98d697265cee284869f3b99b7fa","source":{"kind":"arxiv","id":"1907.02555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02555","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02555v1","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02555","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"XNMXYLBUINHI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XNMXYLBUINHI6XBG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XNMXYLBU","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XNMXYLBUINHI6XBG65JMYMF4Y7","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-04T18:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"5bfa2287e47f803633aed63072386451c871102ff4065709dbc6d02eb93beb72","abstract_canon_sha256":"2b40ead89e37bd55eb948a4b3e054c70a1fd4aafa08e8b287f48fdc32052155a"},"schema_version":"1.0"},"canonical_sha256":"bb597c2c34434e8f5c26f752cc30bcc7e4e5a98d697265cee284869f3b99b7fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:24.034233Z","signature_b64":"PPlNQolxIJYXoowGwSlThJ1jL1vxQ0sCwYgd7jbX9O3RJVfYG4KqvWa6qdKFW/vGq0QQRrOz5RD4T/VexCOaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb597c2c34434e8f5c26f752cc30bcc7e4e5a98d697265cee284869f3b99b7fa","last_reissued_at":"2026-05-17T23:41:24.033502Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:24.033502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02555","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:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pypeycP1ALVtg8wQVy95f386jgrWB8Pz+Ohtz07RMRZKkxfqi+TmBFBOh4VsdsztshWOoFydROxTr4mo5ZJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:38:16.354402Z"},"content_sha256":"1ce1c658b5dfa2d08120e373efbb4bf07b38f59f041ecb03e55f199cf82f81f5","schema_version":"1.0","event_id":"sha256:1ce1c658b5dfa2d08120e373efbb4bf07b38f59f041ecb03e55f199cf82f81f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XNMXYLBUINHI6XBG65JMYMF4Y7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Object Placement Planning and Optimization for Robot Manipulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Danica Kragic, Johannes Stork, Joshua A. Haustein, Kaiyu Hang","submitted_at":"2019-07-04T18:21:49Z","abstract_excerpt":"We address the problem of motion planning for a robotic manipulator with the task to place a grasped object in a cluttered environment. In this task, we need to locate a collision-free pose for the object that a) facilitates the stable placement of the object, b) is reachable by the robot manipulator and c) optimizes a user-given placement objective. Because of the placement objective, this problem is more challenging than classical motion planning where the target pose is defined from the start. To solve this task, we propose an anytime algorithm that integrates sampling-based motion planning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02555","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:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3s4bk11NiDxHcWiJfkMC6lNSETyj4v0PNSodd8bYR2VQr8xxpsjbbNse234wlCd5LQGRaKmOFy33J/EMxjWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:38:16.355110Z"},"content_sha256":"bde95cbfd6ff06c4b5a33382d41fda05d74bb7eca822f29388783a6a01a9f430","schema_version":"1.0","event_id":"sha256:bde95cbfd6ff06c4b5a33382d41fda05d74bb7eca822f29388783a6a01a9f430"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNMXYLBUINHI6XBG65JMYMF4Y7/bundle.json","state_url":"https://pith.science/pith/XNMXYLBUINHI6XBG65JMYMF4Y7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNMXYLBUINHI6XBG65JMYMF4Y7/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-06-09T10:38:16Z","links":{"resolver":"https://pith.science/pith/XNMXYLBUINHI6XBG65JMYMF4Y7","bundle":"https://pith.science/pith/XNMXYLBUINHI6XBG65JMYMF4Y7/bundle.json","state":"https://pith.science/pith/XNMXYLBUINHI6XBG65JMYMF4Y7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNMXYLBUINHI6XBG65JMYMF4Y7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XNMXYLBUINHI6XBG65JMYMF4Y7","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":"2b40ead89e37bd55eb948a4b3e054c70a1fd4aafa08e8b287f48fdc32052155a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-04T18:21:49Z","title_canon_sha256":"5bfa2287e47f803633aed63072386451c871102ff4065709dbc6d02eb93beb72"},"schema_version":"1.0","source":{"id":"1907.02555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02555","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02555v1","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02555","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"XNMXYLBUINHI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XNMXYLBUINHI6XBG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XNMXYLBU","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:bde95cbfd6ff06c4b5a33382d41fda05d74bb7eca822f29388783a6a01a9f430","target":"graph","created_at":"2026-05-17T23:41:24Z","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":"We address the problem of motion planning for a robotic manipulator with the task to place a grasped object in a cluttered environment. In this task, we need to locate a collision-free pose for the object that a) facilitates the stable placement of the object, b) is reachable by the robot manipulator and c) optimizes a user-given placement objective. Because of the placement objective, this problem is more challenging than classical motion planning where the target pose is defined from the start. To solve this task, we propose an anytime algorithm that integrates sampling-based motion planning","authors_text":"Danica Kragic, Johannes Stork, Joshua A. Haustein, Kaiyu Hang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-04T18:21:49Z","title":"Object Placement Planning and Optimization for Robot Manipulators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02555","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:1ce1c658b5dfa2d08120e373efbb4bf07b38f59f041ecb03e55f199cf82f81f5","target":"record","created_at":"2026-05-17T23:41:24Z","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":"2b40ead89e37bd55eb948a4b3e054c70a1fd4aafa08e8b287f48fdc32052155a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-04T18:21:49Z","title_canon_sha256":"5bfa2287e47f803633aed63072386451c871102ff4065709dbc6d02eb93beb72"},"schema_version":"1.0","source":{"id":"1907.02555","kind":"arxiv","version":1}},"canonical_sha256":"bb597c2c34434e8f5c26f752cc30bcc7e4e5a98d697265cee284869f3b99b7fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb597c2c34434e8f5c26f752cc30bcc7e4e5a98d697265cee284869f3b99b7fa","first_computed_at":"2026-05-17T23:41:24.033502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:24.033502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PPlNQolxIJYXoowGwSlThJ1jL1vxQ0sCwYgd7jbX9O3RJVfYG4KqvWa6qdKFW/vGq0QQRrOz5RD4T/VexCOaAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:24.034233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ce1c658b5dfa2d08120e373efbb4bf07b38f59f041ecb03e55f199cf82f81f5","sha256:bde95cbfd6ff06c4b5a33382d41fda05d74bb7eca822f29388783a6a01a9f430"],"state_sha256":"1000255c2fa6fc8f03f34bf2d2e0bad380286b0d7976a76453160bdca577240c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S50HL2ZvwdKk8GdmOPqqd22nOifCD+YUxzPhQqgIeL25V6iZB5RfLaSbyqVCMzdnpmiJtRhExz6IeXvwreF5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:38:16.359172Z","bundle_sha256":"30ffb16a19142bfb838b4a760f4624b0c93c51db66a7d667074534c845c866b8"}}