{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XXNG47OWFEUADR7QJTF5FVZSK7","short_pith_number":"pith:XXNG47OW","canonical_record":{"source":{"id":"1711.07369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-11-17T15:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"fd6efdad4e21f9bfe11c1572c9aa1104769cb268c4fe1762778e5bb40a4b64d3","abstract_canon_sha256":"f4a9ef958ed240dcf5633db6e28e8119ef71429312423c69b07451ed44a329c6"},"schema_version":"1.0"},"canonical_sha256":"bdda6e7dd6292801c7f04ccbd2d73257c7abf2ef421d8acce1f082d1ae8cee49","source":{"kind":"arxiv","id":"1711.07369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07369","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07369v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07369","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"XXNG47OWFEUA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XXNG47OWFEUADR7Q","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XXNG47OW","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XXNG47OWFEUADR7QJTF5FVZSK7","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-11-17T15:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"fd6efdad4e21f9bfe11c1572c9aa1104769cb268c4fe1762778e5bb40a4b64d3","abstract_canon_sha256":"f4a9ef958ed240dcf5633db6e28e8119ef71429312423c69b07451ed44a329c6"},"schema_version":"1.0"},"canonical_sha256":"bdda6e7dd6292801c7f04ccbd2d73257c7abf2ef421d8acce1f082d1ae8cee49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:10.346601Z","signature_b64":"0wZEwHX2fS1qnCcoigOUolma/sX/PbhhzR7FSzQeRkn8yvfJXUCgVD9FbRe/hyaTtQkcKSlCR3ogpiaF0+kuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdda6e7dd6292801c7f04ccbd2d73257c7abf2ef421d8acce1f082d1ae8cee49","last_reissued_at":"2026-05-18T00:30:10.345870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:10.345870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07369","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-18T00:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwm0nBl838GvuaTXWqYdlQu0CpGoc0Y0QGCtj84p8W8fZ3loTbRnXjUFAmnRBl6sLqN26Z9jjVRhnKiwVg/9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:00:51.964068Z"},"content_sha256":"7fcf61856ec2b856c081579bb9f7c19ff6c596c127f2ca60140ce5cf31e83d2e","schema_version":"1.0","event_id":"sha256:7fcf61856ec2b856c081579bb9f7c19ff6c596c127f2ca60140ce5cf31e83d2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XXNG47OWFEUADR7QJTF5FVZSK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Athanasios Krontiris, Jingjin Yu, Kostas E Bekris, Nicholas M Stiffler, Shuai D Han","submitted_at":"2017-11-17T15:01:40Z","abstract_excerpt":"This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface, where a robot can approach them from above and perform pick-and-place operations to rearrange them. The paper considers both the case where the start and goal object poses overlap, and where they do not. For overlapping poses, the primary objective is to minimize the number of pick-and-place actions and then to minimize the distance traveled by the end-effecto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07369","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-18T00:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swKfD3dUVNGdJvDmZiVGInD7daOh4n1g0r20ftb3/JfdTBP8WbKV0GNSMbR9ONBJhwEy7Vkwy/pu61WxFiWuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:00:51.964758Z"},"content_sha256":"3815580b6be9464050d46e2b4a086d37f6822e36670eafaa39b1f09d79acd672","schema_version":"1.0","event_id":"sha256:3815580b6be9464050d46e2b4a086d37f6822e36670eafaa39b1f09d79acd672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXNG47OWFEUADR7QJTF5FVZSK7/bundle.json","state_url":"https://pith.science/pith/XXNG47OWFEUADR7QJTF5FVZSK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXNG47OWFEUADR7QJTF5FVZSK7/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-26T04:00:51Z","links":{"resolver":"https://pith.science/pith/XXNG47OWFEUADR7QJTF5FVZSK7","bundle":"https://pith.science/pith/XXNG47OWFEUADR7QJTF5FVZSK7/bundle.json","state":"https://pith.science/pith/XXNG47OWFEUADR7QJTF5FVZSK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXNG47OWFEUADR7QJTF5FVZSK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XXNG47OWFEUADR7QJTF5FVZSK7","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":"f4a9ef958ed240dcf5633db6e28e8119ef71429312423c69b07451ed44a329c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-11-17T15:01:40Z","title_canon_sha256":"fd6efdad4e21f9bfe11c1572c9aa1104769cb268c4fe1762778e5bb40a4b64d3"},"schema_version":"1.0","source":{"id":"1711.07369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07369","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07369v1","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07369","created_at":"2026-05-18T00:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"XXNG47OWFEUA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XXNG47OWFEUADR7Q","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XXNG47OW","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:3815580b6be9464050d46e2b4a086d37f6822e36670eafaa39b1f09d79acd672","target":"graph","created_at":"2026-05-18T00:30:10Z","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":"This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface, where a robot can approach them from above and perform pick-and-place operations to rearrange them. The paper considers both the case where the start and goal object poses overlap, and where they do not. For overlapping poses, the primary objective is to minimize the number of pick-and-place actions and then to minimize the distance traveled by the end-effecto","authors_text":"Athanasios Krontiris, Jingjin Yu, Kostas E Bekris, Nicholas M Stiffler, Shuai D Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-11-17T15:01:40Z","title":"Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07369","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:7fcf61856ec2b856c081579bb9f7c19ff6c596c127f2ca60140ce5cf31e83d2e","target":"record","created_at":"2026-05-18T00:30:10Z","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":"f4a9ef958ed240dcf5633db6e28e8119ef71429312423c69b07451ed44a329c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-11-17T15:01:40Z","title_canon_sha256":"fd6efdad4e21f9bfe11c1572c9aa1104769cb268c4fe1762778e5bb40a4b64d3"},"schema_version":"1.0","source":{"id":"1711.07369","kind":"arxiv","version":1}},"canonical_sha256":"bdda6e7dd6292801c7f04ccbd2d73257c7abf2ef421d8acce1f082d1ae8cee49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdda6e7dd6292801c7f04ccbd2d73257c7abf2ef421d8acce1f082d1ae8cee49","first_computed_at":"2026-05-18T00:30:10.345870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:10.345870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0wZEwHX2fS1qnCcoigOUolma/sX/PbhhzR7FSzQeRkn8yvfJXUCgVD9FbRe/hyaTtQkcKSlCR3ogpiaF0+kuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:10.346601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fcf61856ec2b856c081579bb9f7c19ff6c596c127f2ca60140ce5cf31e83d2e","sha256:3815580b6be9464050d46e2b4a086d37f6822e36670eafaa39b1f09d79acd672"],"state_sha256":"1bb4c6b5cefac1ef400b1cba50063c2e11c51da0400911c6dd7ab4aad0eaf0bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kRDpGEZeAvuDUHJ9N84iaNyUnlC1/YXwTIPIsHfOkPR7ymPH0MndxzpR5iO+/VyoVFfXkYfPrMUuuV7OR/ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:00:51.968510Z","bundle_sha256":"0d085b965f37574649786e2b104b4ec78a986a404ec492d76c1b7e6928748046"}}