{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BVGJ5RUFNXOFPPYYTSIGWAW35X","short_pith_number":"pith:BVGJ5RUF","canonical_record":{"source":{"id":"1603.04338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T16:43:06Z","cross_cats_sorted":[],"title_canon_sha256":"805d0d73011823a5c934024a0d4cb1c9bf7e55168b98811f3422f3549a9710a9","abstract_canon_sha256":"04eb223c9ac46bd3d79da2461057690e9a0729efacd2df4821265b1c286ce2cd"},"schema_version":"1.0"},"canonical_sha256":"0d4c9ec6856ddc57bf189c906b02dbedeed6a965e9b7cd661efa12830f962e0b","source":{"kind":"arxiv","id":"1603.04338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04338","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04338v1","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04338","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"BVGJ5RUFNXOF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVGJ5RUFNXOFPPYY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVGJ5RUF","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BVGJ5RUFNXOFPPYYTSIGWAW35X","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T16:43:06Z","cross_cats_sorted":[],"title_canon_sha256":"805d0d73011823a5c934024a0d4cb1c9bf7e55168b98811f3422f3549a9710a9","abstract_canon_sha256":"04eb223c9ac46bd3d79da2461057690e9a0729efacd2df4821265b1c286ce2cd"},"schema_version":"1.0"},"canonical_sha256":"0d4c9ec6856ddc57bf189c906b02dbedeed6a965e9b7cd661efa12830f962e0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:06.983074Z","signature_b64":"UEfmxOK6HvdTa1Lo5SUK1IT+xdhM/+/SDaFLMdQmVMjytEDoBP4Wm9whQvqERXcjSb2xEL0OIQRT1jRbVklgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d4c9ec6856ddc57bf189c906b02dbedeed6a965e9b7cd661efa12830f962e0b","last_reissued_at":"2026-05-18T01:19:06.982350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:06.982350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04338","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-18T01:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXPMAbzLb41FnjXJaGdJBg3JXunuxnKZYP6/wSp61QgJPgxZq2dAvqXQCUCrM+Mc6VgeKw/rU4B1pjKk2HYpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:24:40.304567Z"},"content_sha256":"a015253e7640b27623831b596da6bfffb898c66a97a40c7146cb95a5c31dd13c","schema_version":"1.0","event_id":"sha256:a015253e7640b27623831b596da6bfffb898c66a97a40c7146cb95a5c31dd13c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BVGJ5RUFNXOFPPYYTSIGWAW35X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grasping for a Purpose: Using Task Goals for Efficient Manipulation Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ana Huaman Quispe, Heni Ben Amor, Henrik Christensen, Mike Stilman","submitted_at":"2016-03-14T16:43:06Z","abstract_excerpt":"In this paper we propose an approach for efficient grasp selection for manipulation tasks of unknown objects. Even for simple tasks such as pick-and-place, a unique solution is rare to occur. Rather, multiple candidate grasps must be considered and (potentially) tested till a successful, kinematically feasible path is found. To make this process efficient, the grasps should be ordered such that those more likely to succeed are tested first. We propose to use grasp manipulability as a metric to prioritize grasps. We present results of simulation experiments which demonstrate the usefulness of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04338","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-18T01:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4Afc8mNZEoliOEvXV9+DAWGUyc4O23G0A+ncQgYd70n5C+6F9RviUUCNm+d6ftUGbRF0baE9ieQz71dKUrkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:24:40.304907Z"},"content_sha256":"0196104970aeb8d9c694df18f3e1667721f0103435e099eba32592e9a4141af1","schema_version":"1.0","event_id":"sha256:0196104970aeb8d9c694df18f3e1667721f0103435e099eba32592e9a4141af1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVGJ5RUFNXOFPPYYTSIGWAW35X/bundle.json","state_url":"https://pith.science/pith/BVGJ5RUFNXOFPPYYTSIGWAW35X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVGJ5RUFNXOFPPYYTSIGWAW35X/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-02T05:24:40Z","links":{"resolver":"https://pith.science/pith/BVGJ5RUFNXOFPPYYTSIGWAW35X","bundle":"https://pith.science/pith/BVGJ5RUFNXOFPPYYTSIGWAW35X/bundle.json","state":"https://pith.science/pith/BVGJ5RUFNXOFPPYYTSIGWAW35X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVGJ5RUFNXOFPPYYTSIGWAW35X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BVGJ5RUFNXOFPPYYTSIGWAW35X","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":"04eb223c9ac46bd3d79da2461057690e9a0729efacd2df4821265b1c286ce2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T16:43:06Z","title_canon_sha256":"805d0d73011823a5c934024a0d4cb1c9bf7e55168b98811f3422f3549a9710a9"},"schema_version":"1.0","source":{"id":"1603.04338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04338","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04338v1","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04338","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"BVGJ5RUFNXOF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVGJ5RUFNXOFPPYY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVGJ5RUF","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:0196104970aeb8d9c694df18f3e1667721f0103435e099eba32592e9a4141af1","target":"graph","created_at":"2026-05-18T01:19:06Z","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":"In this paper we propose an approach for efficient grasp selection for manipulation tasks of unknown objects. Even for simple tasks such as pick-and-place, a unique solution is rare to occur. Rather, multiple candidate grasps must be considered and (potentially) tested till a successful, kinematically feasible path is found. To make this process efficient, the grasps should be ordered such that those more likely to succeed are tested first. We propose to use grasp manipulability as a metric to prioritize grasps. We present results of simulation experiments which demonstrate the usefulness of o","authors_text":"Ana Huaman Quispe, Heni Ben Amor, Henrik Christensen, Mike Stilman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T16:43:06Z","title":"Grasping for a Purpose: Using Task Goals for Efficient Manipulation Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04338","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:a015253e7640b27623831b596da6bfffb898c66a97a40c7146cb95a5c31dd13c","target":"record","created_at":"2026-05-18T01:19:06Z","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":"04eb223c9ac46bd3d79da2461057690e9a0729efacd2df4821265b1c286ce2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-03-14T16:43:06Z","title_canon_sha256":"805d0d73011823a5c934024a0d4cb1c9bf7e55168b98811f3422f3549a9710a9"},"schema_version":"1.0","source":{"id":"1603.04338","kind":"arxiv","version":1}},"canonical_sha256":"0d4c9ec6856ddc57bf189c906b02dbedeed6a965e9b7cd661efa12830f962e0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d4c9ec6856ddc57bf189c906b02dbedeed6a965e9b7cd661efa12830f962e0b","first_computed_at":"2026-05-18T01:19:06.982350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:06.982350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UEfmxOK6HvdTa1Lo5SUK1IT+xdhM/+/SDaFLMdQmVMjytEDoBP4Wm9whQvqERXcjSb2xEL0OIQRT1jRbVklgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:06.983074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a015253e7640b27623831b596da6bfffb898c66a97a40c7146cb95a5c31dd13c","sha256:0196104970aeb8d9c694df18f3e1667721f0103435e099eba32592e9a4141af1"],"state_sha256":"cb8dd6230bdcfdb1c58acf2340525a085a6b59a198dcd3c9388cffe1ac234e6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZPTk7SRBdAnnZPn591x/e8ypAQMLhvSYT8z2CrL1Sc3T/17v5pVPH6czSrYVY6BfqRHZjrWB6M7Lo85Ttz3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:24:40.306783Z","bundle_sha256":"dac4699bbb941cb4be605dd53aa6c973d2dce8ee86563635a8a97e3f6fa51675"}}