{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GDNTKUMGHTNE3OTH4HWLP65JMS","short_pith_number":"pith:GDNTKUMG","schema_version":"1.0","canonical_sha256":"30db3551863cda4dba67e1ecb7fba964b1768d8a6182811b2a541353724b8b53","source":{"kind":"arxiv","id":"1901.07914","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.07914","created_at":"2026-07-05T07:58:41.645991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07914v1","created_at":"2026-07-05T07:58:41.645991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07914","created_at":"2026-07-05T07:58:41.645991+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDNTKUMGHTNE","created_at":"2026-07-05T07:58:41.645991+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDNTKUMGHTNE3OTH","created_at":"2026-07-05T07:58:41.645991+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDNTKUMG","created_at":"2026-07-05T07:58:41.645991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS","json":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS.json","graph_json":"https://pith.science/api/pith-number/GDNTKUMGHTNE3OTH4HWLP65JMS/graph.json","events_json":"https://pith.science/api/pith-number/GDNTKUMGHTNE3OTH4HWLP65JMS/events.json","paper":"https://pith.science/paper/GDNTKUMG"},"agent_actions":{"view_html":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS","download_json":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS.json","view_paper":"https://pith.science/paper/GDNTKUMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07914&json=true","fetch_graph":"https://pith.science/api/pith-number/GDNTKUMGHTNE3OTH4HWLP65JMS/graph.json","fetch_events":"https://pith.science/api/pith-number/GDNTKUMGHTNE3OTH4HWLP65JMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/action/storage_attestation","attest_author":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/action/author_attestation","sign_citation":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/action/citation_signature","submit_replication":"https://pith.science/pith/GDNTKUMGHTNE3OTH4HWLP65JMS/action/replication_record"}},"created_at":"2026-07-05T07:58:41.645991+00:00","updated_at":"2026-07-05T07:58:41.645991+00:00"}