{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7CQ6NT74TND7A26IWAP4IA3DYG","short_pith_number":"pith:7CQ6NT74","schema_version":"1.0","canonical_sha256":"f8a1e6cffc9b47f06bc8b01fc40363c181ddbf9573113f373a9b1baab1296134","source":{"kind":"arxiv","id":"1706.00007","version":1},"attestation_state":"computed","paper":{"title":"A Learning Based Optimal Human Robot Collaboration with Linear Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.HC"],"primary_cat":"cs.RO","authors_text":"Bin Hu, Bo Wu, Hai Lin","submitted_at":"2017-05-31T17:52:48Z","abstract_excerpt":"This paper considers an optimal task allocation problem for human robot collaboration in human robot systems with persistent tasks. Such human robot systems consist of human operators and intelligent robots collaborating with each other to accomplish complex tasks that cannot be done by either part alone. The system objective is to maximize the probability of successfully executing persistent tasks that are formulated as linear temporal logic specifications and minimize the average cost between consecutive visits of a particular proposition. This paper proposes to model the human robot collabo"},"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":"1706.00007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-05-31T17:52:48Z","cross_cats_sorted":["cs.AI","cs.HC"],"title_canon_sha256":"b4e7cd2f71b39a738ec20aa4ec26e973992fed687db787326d7f04d7eb066b79","abstract_canon_sha256":"cbc79683c7e071134c585f155c85e02be3e7f673cffca7fe7aa74c0668fbecfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.301966Z","signature_b64":"5VricTSwK8bLs/AeBh8WDB05J6LqdK3TgPcXVgtZirex5PS8nz5Wo5nMObFMhAG3hbfLV12jr9/fGY0zU7n4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8a1e6cffc9b47f06bc8b01fc40363c181ddbf9573113f373a9b1baab1296134","last_reissued_at":"2026-05-18T00:43:15.301278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.301278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Learning Based Optimal Human Robot Collaboration with Linear Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.HC"],"primary_cat":"cs.RO","authors_text":"Bin Hu, Bo Wu, Hai Lin","submitted_at":"2017-05-31T17:52:48Z","abstract_excerpt":"This paper considers an optimal task allocation problem for human robot collaboration in human robot systems with persistent tasks. Such human robot systems consist of human operators and intelligent robots collaborating with each other to accomplish complex tasks that cannot be done by either part alone. The system objective is to maximize the probability of successfully executing persistent tasks that are formulated as linear temporal logic specifications and minimize the average cost between consecutive visits of a particular proposition. This paper proposes to model the human robot collabo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00007","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.00007","created_at":"2026-05-18T00:43:15.301411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00007v1","created_at":"2026-05-18T00:43:15.301411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00007","created_at":"2026-05-18T00:43:15.301411+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CQ6NT74TND7","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CQ6NT74TND7A26I","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CQ6NT74","created_at":"2026-05-18T12:31:03.183658+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/7CQ6NT74TND7A26IWAP4IA3DYG","json":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG.json","graph_json":"https://pith.science/api/pith-number/7CQ6NT74TND7A26IWAP4IA3DYG/graph.json","events_json":"https://pith.science/api/pith-number/7CQ6NT74TND7A26IWAP4IA3DYG/events.json","paper":"https://pith.science/paper/7CQ6NT74"},"agent_actions":{"view_html":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG","download_json":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG.json","view_paper":"https://pith.science/paper/7CQ6NT74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00007&json=true","fetch_graph":"https://pith.science/api/pith-number/7CQ6NT74TND7A26IWAP4IA3DYG/graph.json","fetch_events":"https://pith.science/api/pith-number/7CQ6NT74TND7A26IWAP4IA3DYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG/action/storage_attestation","attest_author":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG/action/author_attestation","sign_citation":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG/action/citation_signature","submit_replication":"https://pith.science/pith/7CQ6NT74TND7A26IWAP4IA3DYG/action/replication_record"}},"created_at":"2026-05-18T00:43:15.301411+00:00","updated_at":"2026-05-18T00:43:15.301411+00:00"}