{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K7B5DA6WAYM4ZZ7GVWD2VIZDO3","short_pith_number":"pith:K7B5DA6W","schema_version":"1.0","canonical_sha256":"57c3d183d60619cce7e6ad87aaa32376f99e7bbaa65b47a95e5576608d957c17","source":{"kind":"arxiv","id":"1702.04700","version":1},"attestation_state":"computed","paper":{"title":"Target assignment for robots constrained by limited communication range","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO","math.PR"],"primary_cat":"math.OC","authors_text":"Jie Huang, Ming Cao, Weisheng Yan, Xiaoshan Bai","submitted_at":"2017-02-15T18:09:18Z","abstract_excerpt":"This paper investigates the task assignment problem for multiple dispersed robots constrained by limited communication range. The robots are initially randomly distributed and need to visit several target locations while minimizing the total travel time. A centralized rendezvous-based algorithm is proposed, under which all the robots first move towards a rendezvous position until communication paths are established between every pair of robots either directly or through intermediate peers, and then one robot is chosen as the leader to make a centralized task assignment for the other robots. Fu"},"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":"1702.04700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-15T18:09:18Z","cross_cats_sorted":["cs.MA","cs.RO","math.PR"],"title_canon_sha256":"28b9526f23fa5ac6c5fea0742bf9e2d3bd96bdadac65a16dba04baa3bdf6a871","abstract_canon_sha256":"fb20c6b7848815dfc9e39e8ac6473cc1b3c897c7a9827cd32eb63389a420cda1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:40.879454Z","signature_b64":"AD7avMsdJpKYDPqpVmS8bTEO8sW55wDIJXnIbDwtuwVBJsDq5AChOE5WkxoihNT/ru9DSDUG6FyBPm2wVDqYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c3d183d60619cce7e6ad87aaa32376f99e7bbaa65b47a95e5576608d957c17","last_reissued_at":"2026-05-18T00:50:40.878757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:40.878757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Target assignment for robots constrained by limited communication range","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO","math.PR"],"primary_cat":"math.OC","authors_text":"Jie Huang, Ming Cao, Weisheng Yan, Xiaoshan Bai","submitted_at":"2017-02-15T18:09:18Z","abstract_excerpt":"This paper investigates the task assignment problem for multiple dispersed robots constrained by limited communication range. The robots are initially randomly distributed and need to visit several target locations while minimizing the total travel time. A centralized rendezvous-based algorithm is proposed, under which all the robots first move towards a rendezvous position until communication paths are established between every pair of robots either directly or through intermediate peers, and then one robot is chosen as the leader to make a centralized task assignment for the other robots. Fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04700","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":"1702.04700","created_at":"2026-05-18T00:50:40.878859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04700v1","created_at":"2026-05-18T00:50:40.878859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04700","created_at":"2026-05-18T00:50:40.878859+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7B5DA6WAYM4","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7B5DA6WAYM4ZZ7G","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7B5DA6W","created_at":"2026-05-18T12:31:24.725408+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/K7B5DA6WAYM4ZZ7GVWD2VIZDO3","json":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3.json","graph_json":"https://pith.science/api/pith-number/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/graph.json","events_json":"https://pith.science/api/pith-number/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/events.json","paper":"https://pith.science/paper/K7B5DA6W"},"agent_actions":{"view_html":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3","download_json":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3.json","view_paper":"https://pith.science/paper/K7B5DA6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04700&json=true","fetch_graph":"https://pith.science/api/pith-number/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/graph.json","fetch_events":"https://pith.science/api/pith-number/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/action/storage_attestation","attest_author":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/action/author_attestation","sign_citation":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/action/citation_signature","submit_replication":"https://pith.science/pith/K7B5DA6WAYM4ZZ7GVWD2VIZDO3/action/replication_record"}},"created_at":"2026-05-18T00:50:40.878859+00:00","updated_at":"2026-05-18T00:50:40.878859+00:00"}