{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GDNTKUMGHTNE3OTH4HWLP65JMS","short_pith_number":"pith:GDNTKUMG","canonical_record":{"source":{"id":"1901.07914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-23T14:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"088f510613e3766da79ddf853749589a4071a220667c4b4b1d1dea5a8d81b870","abstract_canon_sha256":"05553b8c0762bc3e5f6813826731f34be945fdbe456dd7a9282aef713d1cd576"},"schema_version":"1.0"},"canonical_sha256":"30db3551863cda4dba67e1ecb7fba964b1768d8a6182811b2a541353724b8b53","source":{"kind":"arxiv","id":"1901.07914","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07914","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07914v1","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07914","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"GDNTKUMGHTNE","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"GDNTKUMGHTNE3OTH","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"GDNTKUMG","created_at":"2026-07-05T07:58:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GDNTKUMGHTNE3OTH4HWLP65JMS","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-23T14:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"088f510613e3766da79ddf853749589a4071a220667c4b4b1d1dea5a8d81b870","abstract_canon_sha256":"05553b8c0762bc3e5f6813826731f34be945fdbe456dd7a9282aef713d1cd576"},"schema_version":"1.0"},"canonical_sha256":"30db3551863cda4dba67e1ecb7fba964b1768d8a6182811b2a541353724b8b53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:41.646365Z","signature_b64":"7hBhCn2lF2eTHk/XaKEwS5CTxu5mYpyKd2t0o6d2Hw6COr8YWtSCVVtZsFwsUcHqiaRtrGFKTMak1PAI202QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30db3551863cda4dba67e1ecb7fba964b1768d8a6182811b2a541353724b8b53","last_reissued_at":"2026-07-05T07:58:41.645934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:41.645934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07914","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-07-05T07:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixqqj19OFRQSTntu7D5hnqFUxlW2WeKLCxm0ofK5QwARvJkOLWzef8bExwiiPkF+yPTedkhCkEXv84OuvuokBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T23:54:02.384203Z"},"content_sha256":"b1517b184bce3c5684a9bb8870def108e9beeabb762e81bc5204618fbfd17577","schema_version":"1.0","event_id":"sha256:b1517b184bce3c5684a9bb8870def108e9beeabb762e81bc5204618fbfd17577"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GDNTKUMGHTNE3OTH4HWLP65JMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constraint Programming Approach to Simultaneous Task Allocation and Motion Scheduling for Industrial Dual-Arm Manipulation Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jan Kristof Behrens, Masoumeh Mansouri, Ralph Lange","submitted_at":"2019-01-23T14:37:29Z","abstract_excerpt":"Modern lightweight dual-arm robots bring the physical capabilities to quickly take over tasks at typical industrial workplaces designed for workers. In times of mass-customization, low setup times including the instructing/specifying of new tasks are crucial to stay competitive. We propose a constraint programming approach to simultaneous task allocation and motion scheduling for such industrial manipulation and assembly tasks. The proposed approach covers dual-arm and even multi-arm robots as well as connected machines. The key concept are Ordered Visiting Constraints, a descriptive and exten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07914","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.07914/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8WKT0Z0z5p1ml6qIEHWvPsqoTAgJl36Kio6yqvTqOreQlABQCZBJ0Zr4zM7Bd3HY0x2qaZk6tOb7DlS0czYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T23:54:02.384595Z"},"content_sha256":"fdd77f310167180ced6426ad0361d44df8e62083d8e60397d82c2d8e3c93b12f","schema_version":"1.0","event_id":"sha256:fdd77f310167180ced6426ad0361d44df8e62083d8e60397d82c2d8e3c93b12f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/bundle.json","state_url":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/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-07-08T23:54:02Z","links":{"resolver":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS","bundle":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/bundle.json","state":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GDNTKUMGHTNE3OTH4HWLP65JMS","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":"05553b8c0762bc3e5f6813826731f34be945fdbe456dd7a9282aef713d1cd576","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-23T14:37:29Z","title_canon_sha256":"088f510613e3766da79ddf853749589a4071a220667c4b4b1d1dea5a8d81b870"},"schema_version":"1.0","source":{"id":"1901.07914","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07914","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07914v1","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07914","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"GDNTKUMGHTNE","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"GDNTKUMGHTNE3OTH","created_at":"2026-07-05T07:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"GDNTKUMG","created_at":"2026-07-05T07:58:41Z"}],"graph_snapshots":[{"event_id":"sha256:fdd77f310167180ced6426ad0361d44df8e62083d8e60397d82c2d8e3c93b12f","target":"graph","created_at":"2026-07-05T07:58:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.07914/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modern lightweight dual-arm robots bring the physical capabilities to quickly take over tasks at typical industrial workplaces designed for workers. In times of mass-customization, low setup times including the instructing/specifying of new tasks are crucial to stay competitive. We propose a constraint programming approach to simultaneous task allocation and motion scheduling for such industrial manipulation and assembly tasks. The proposed approach covers dual-arm and even multi-arm robots as well as connected machines. The key concept are Ordered Visiting Constraints, a descriptive and exten","authors_text":"Jan Kristof Behrens, Masoumeh Mansouri, Ralph Lange","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-23T14:37:29Z","title":"A Constraint Programming Approach to Simultaneous Task Allocation and Motion Scheduling for Industrial Dual-Arm Manipulation Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07914","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:b1517b184bce3c5684a9bb8870def108e9beeabb762e81bc5204618fbfd17577","target":"record","created_at":"2026-07-05T07:58:41Z","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":"05553b8c0762bc3e5f6813826731f34be945fdbe456dd7a9282aef713d1cd576","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-23T14:37:29Z","title_canon_sha256":"088f510613e3766da79ddf853749589a4071a220667c4b4b1d1dea5a8d81b870"},"schema_version":"1.0","source":{"id":"1901.07914","kind":"arxiv","version":1}},"canonical_sha256":"30db3551863cda4dba67e1ecb7fba964b1768d8a6182811b2a541353724b8b53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30db3551863cda4dba67e1ecb7fba964b1768d8a6182811b2a541353724b8b53","first_computed_at":"2026-07-05T07:58:41.645934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:58:41.645934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hBhCn2lF2eTHk/XaKEwS5CTxu5mYpyKd2t0o6d2Hw6COr8YWtSCVVtZsFwsUcHqiaRtrGFKTMak1PAI202QDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:58:41.646365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07914","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1517b184bce3c5684a9bb8870def108e9beeabb762e81bc5204618fbfd17577","sha256:fdd77f310167180ced6426ad0361d44df8e62083d8e60397d82c2d8e3c93b12f"],"state_sha256":"ffe5d97f6fc0f91eb754bcd254b87e9ff028ffed785682ad932fb121eca59c6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZixt8mbzRZ6RtcfiU+MAOgWVeH1HNdx7EQA/a/PhLoCiI7lQflweHj+xV+U+TgO1VqA99Xct+JPCxX6tgE/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T23:54:02.386722Z","bundle_sha256":"c0e03ce8d685cccc11041214f7787cfd7ffc78f51fc3c7fd2567992f296e318b"}}