{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5FEX5DAGHVSSNTIFJPRBQAP4MD","short_pith_number":"pith:5FEX5DAG","schema_version":"1.0","canonical_sha256":"e9497e8c063d6526cd054be21801fc60f2219bfe604af84b6340574b0e5d8c13","source":{"kind":"arxiv","id":"1706.06051","version":1},"attestation_state":"computed","paper":{"title":"Learning to Schedule Deadline- and Operator-Sensitive Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hanan Rosemarin, John P. Dickerson, Sarit Kraus","submitted_at":"2017-06-19T16:42:23Z","abstract_excerpt":"The use of semi-autonomous and autonomous robotic assistants to aid in care of the elderly is expected to ease the burden on human caretakers, with small-stage testing already occurring in a variety of countries. Yet, it is likely that these robots will need to request human assistance via teleoperation when domain expertise is needed for a specific task. As deployment of robotic assistants moves to scale, mapping these requests for human aid to the teleoperators themselves will be a difficult online optimization problem. In this paper, we design a system that allocates requests to a limited n"},"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.06051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-19T16:42:23Z","cross_cats_sorted":[],"title_canon_sha256":"aa55b942795d2238ad956dba2a1b9e80173245326b4a113d6ecd59a69718fdbd","abstract_canon_sha256":"e3b95615729eabb356461d7ac0701bdd8ee264c392697ab8d808b63a07d2a460"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:08.209342Z","signature_b64":"GiPPqcG/Cam/RFD3b9Rrfw51eDWHhx90UnlG7vbPDM5dpgLTcYDypoyU72640p/elYS+8rqVXr9iz/mQfVGhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9497e8c063d6526cd054be21801fc60f2219bfe604af84b6340574b0e5d8c13","last_reissued_at":"2026-05-18T00:42:08.208863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:08.208863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Schedule Deadline- and Operator-Sensitive Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hanan Rosemarin, John P. Dickerson, Sarit Kraus","submitted_at":"2017-06-19T16:42:23Z","abstract_excerpt":"The use of semi-autonomous and autonomous robotic assistants to aid in care of the elderly is expected to ease the burden on human caretakers, with small-stage testing already occurring in a variety of countries. Yet, it is likely that these robots will need to request human assistance via teleoperation when domain expertise is needed for a specific task. As deployment of robotic assistants moves to scale, mapping these requests for human aid to the teleoperators themselves will be a difficult online optimization problem. In this paper, we design a system that allocates requests to a limited n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06051","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.06051","created_at":"2026-05-18T00:42:08.208926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06051v1","created_at":"2026-05-18T00:42:08.208926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06051","created_at":"2026-05-18T00:42:08.208926+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FEX5DAGHVSS","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FEX5DAGHVSSNTIF","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FEX5DAG","created_at":"2026-05-18T12:31:00.734936+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/5FEX5DAGHVSSNTIFJPRBQAP4MD","json":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD.json","graph_json":"https://pith.science/api/pith-number/5FEX5DAGHVSSNTIFJPRBQAP4MD/graph.json","events_json":"https://pith.science/api/pith-number/5FEX5DAGHVSSNTIFJPRBQAP4MD/events.json","paper":"https://pith.science/paper/5FEX5DAG"},"agent_actions":{"view_html":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD","download_json":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD.json","view_paper":"https://pith.science/paper/5FEX5DAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06051&json=true","fetch_graph":"https://pith.science/api/pith-number/5FEX5DAGHVSSNTIFJPRBQAP4MD/graph.json","fetch_events":"https://pith.science/api/pith-number/5FEX5DAGHVSSNTIFJPRBQAP4MD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD/action/storage_attestation","attest_author":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD/action/author_attestation","sign_citation":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD/action/citation_signature","submit_replication":"https://pith.science/pith/5FEX5DAGHVSSNTIFJPRBQAP4MD/action/replication_record"}},"created_at":"2026-05-18T00:42:08.208926+00:00","updated_at":"2026-05-18T00:42:08.208926+00:00"}