{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FTC57QNWVJIKKW4BIXIG636GPN","short_pith_number":"pith:FTC57QNW","schema_version":"1.0","canonical_sha256":"2cc5dfc1b6aa50a55b8145d06f6fc67b5faeeb26a0c52675d5ef07adf7978edd","source":{"kind":"arxiv","id":"2111.06437","version":1},"attestation_state":"computed","paper":{"title":"Scalable Operator Allocation for Multi-Robot Assistance: A Restless Bandit Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Abhinav Dahiya, Aditya Mahajan, Nima Akbarzadeh, Stephen L. Smith","submitted_at":"2021-11-11T19:31:35Z","abstract_excerpt":"In this paper, we consider the problem of allocating human operators in a system with multiple semi-autonomous robots. Each robot is required to perform an independent sequence of tasks, subjected to a chance of failing and getting stuck in a fault state at every task. If and when required, a human operator can assist or teleoperate a robot. Conventional MDP techniques used to solve such problems face scalability issues due to exponential growth of state and action spaces with the number of robots and operators. In this paper we derive conditions under which the operator allocation problem is "},"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":"2111.06437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-11-11T19:31:35Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"715fd8e6608695e3ebb94266a4d2fdb3b3ee0695c576bf142bb4e8a7f1bceb85","abstract_canon_sha256":"4b5c4affd5ef634916cbc926869bcec0d023def923dc192d59f67e55a125e2eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:04.593601Z","signature_b64":"Xn2z1xKDfIn63u5qF4C8jesrNCg2mh4OWGNBrSRJQg7n2HRbANkIc7VNWbeNFrPQVmVj94tKOaOpJZzuEAnTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc5dfc1b6aa50a55b8145d06f6fc67b5faeeb26a0c52675d5ef07adf7978edd","last_reissued_at":"2026-07-05T03:31:04.593102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:04.593102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Operator Allocation for Multi-Robot Assistance: A Restless Bandit Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Abhinav Dahiya, Aditya Mahajan, Nima Akbarzadeh, Stephen L. Smith","submitted_at":"2021-11-11T19:31:35Z","abstract_excerpt":"In this paper, we consider the problem of allocating human operators in a system with multiple semi-autonomous robots. Each robot is required to perform an independent sequence of tasks, subjected to a chance of failing and getting stuck in a fault state at every task. If and when required, a human operator can assist or teleoperate a robot. Conventional MDP techniques used to solve such problems face scalability issues due to exponential growth of state and action spaces with the number of robots and operators. In this paper we derive conditions under which the operator allocation problem is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06437","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/2111.06437/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":"2111.06437","created_at":"2026-07-05T03:31:04.593161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06437v1","created_at":"2026-07-05T03:31:04.593161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06437","created_at":"2026-07-05T03:31:04.593161+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTC57QNWVJIK","created_at":"2026-07-05T03:31:04.593161+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTC57QNWVJIKKW4B","created_at":"2026-07-05T03:31:04.593161+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTC57QNW","created_at":"2026-07-05T03:31:04.593161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2503.15510","citing_title":"Joint Decision-Making in Robot Teleoperation: When are Two Heads Better Than One?","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN","json":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN.json","graph_json":"https://pith.science/api/pith-number/FTC57QNWVJIKKW4BIXIG636GPN/graph.json","events_json":"https://pith.science/api/pith-number/FTC57QNWVJIKKW4BIXIG636GPN/events.json","paper":"https://pith.science/paper/FTC57QNW"},"agent_actions":{"view_html":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN","download_json":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN.json","view_paper":"https://pith.science/paper/FTC57QNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06437&json=true","fetch_graph":"https://pith.science/api/pith-number/FTC57QNWVJIKKW4BIXIG636GPN/graph.json","fetch_events":"https://pith.science/api/pith-number/FTC57QNWVJIKKW4BIXIG636GPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN/action/storage_attestation","attest_author":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN/action/author_attestation","sign_citation":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN/action/citation_signature","submit_replication":"https://pith.science/pith/FTC57QNWVJIKKW4BIXIG636GPN/action/replication_record"}},"created_at":"2026-07-05T03:31:04.593161+00:00","updated_at":"2026-07-05T03:31:04.593161+00:00"}