{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7AGRSDCQIZ2FRO33ZE5YEBJBVH","short_pith_number":"pith:7AGRSDCQ","schema_version":"1.0","canonical_sha256":"f80d190c50467458bb7bc93b820521a9d8f38aa0a43d0d3e16f182b516e3b7ec","source":{"kind":"arxiv","id":"1611.05092","version":1},"attestation_state":"computed","paper":{"title":"Partitioning Strategies and Task Allocation for Target-tracking with Multiple Guards in Polygonal Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hamid Emadi, Sourabh Bhattacharya, Tianshuang Gao","submitted_at":"2016-11-15T22:59:07Z","abstract_excerpt":"This paper presents an algorithm to deploy a team of {\\it free} guards equipped with omni-directional cameras for tracking a bounded speed intruder inside a simply-connected polygonal environment. The proposed algorithm partitions the environment into smaller polygons, and assigns a guard to each partition so that the intruder is visible to at least one guard at all times. Based on the concept of {\\it dynamic zones} introduced in this paper, we propose event-triggered strategies for the guards to track the intruder. We show that the number of guards deployed by the algorithm for tracking is st"},"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":"1611.05092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-11-15T22:59:07Z","cross_cats_sorted":[],"title_canon_sha256":"4e1c4c104fa67fe73e23eda55c3758f3cda483b274a5a108205ae093dfc372e9","abstract_canon_sha256":"34210d9fbb0e4cf67f6156b8dd43b2da49698f17393af7ad32290ddd14fe1f8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:28.014571Z","signature_b64":"5SqlY5nqfZ2Fwb5Y6x8Jpr7pfDiJ5RpBT2JuqAPw1D4pFJ8icqyfzy8XT7/vhZNGOJLvrD/lphdXe76NF8mxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f80d190c50467458bb7bc93b820521a9d8f38aa0a43d0d3e16f182b516e3b7ec","last_reissued_at":"2026-05-18T00:58:28.013907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:28.013907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning Strategies and Task Allocation for Target-tracking with Multiple Guards in Polygonal Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hamid Emadi, Sourabh Bhattacharya, Tianshuang Gao","submitted_at":"2016-11-15T22:59:07Z","abstract_excerpt":"This paper presents an algorithm to deploy a team of {\\it free} guards equipped with omni-directional cameras for tracking a bounded speed intruder inside a simply-connected polygonal environment. The proposed algorithm partitions the environment into smaller polygons, and assigns a guard to each partition so that the intruder is visible to at least one guard at all times. Based on the concept of {\\it dynamic zones} introduced in this paper, we propose event-triggered strategies for the guards to track the intruder. We show that the number of guards deployed by the algorithm for tracking is st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05092","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":"1611.05092","created_at":"2026-05-18T00:58:28.013998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05092v1","created_at":"2026-05-18T00:58:28.013998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05092","created_at":"2026-05-18T00:58:28.013998+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AGRSDCQIZ2F","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AGRSDCQIZ2FRO33","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AGRSDCQ","created_at":"2026-05-18T12:30:04.600751+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/7AGRSDCQIZ2FRO33ZE5YEBJBVH","json":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH.json","graph_json":"https://pith.science/api/pith-number/7AGRSDCQIZ2FRO33ZE5YEBJBVH/graph.json","events_json":"https://pith.science/api/pith-number/7AGRSDCQIZ2FRO33ZE5YEBJBVH/events.json","paper":"https://pith.science/paper/7AGRSDCQ"},"agent_actions":{"view_html":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH","download_json":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH.json","view_paper":"https://pith.science/paper/7AGRSDCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05092&json=true","fetch_graph":"https://pith.science/api/pith-number/7AGRSDCQIZ2FRO33ZE5YEBJBVH/graph.json","fetch_events":"https://pith.science/api/pith-number/7AGRSDCQIZ2FRO33ZE5YEBJBVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH/action/storage_attestation","attest_author":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH/action/author_attestation","sign_citation":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH/action/citation_signature","submit_replication":"https://pith.science/pith/7AGRSDCQIZ2FRO33ZE5YEBJBVH/action/replication_record"}},"created_at":"2026-05-18T00:58:28.013998+00:00","updated_at":"2026-05-18T00:58:28.013998+00:00"}