{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NONQU4HWTJQAONNC4REOWG6TT2","short_pith_number":"pith:NONQU4HW","schema_version":"1.0","canonical_sha256":"6b9b0a70f69a600735a2e448eb1bd39e8a7d9a98c4f616f3704268089a82166e","source":{"kind":"arxiv","id":"1607.03039","version":2},"attestation_state":"computed","paper":{"title":"Clearing an Orthogonal Polygon Using Sliding Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ali Narenji Sheshkalani, Mohammad Ghodsi, Salma Sadat Mahdavi","submitted_at":"2016-07-11T17:09:53Z","abstract_excerpt":"In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new variant of the pursuit-evasion problem in which the robots (pursuers) each move back and forth along an orthogonal line segment inside a simple orthogonal polygon $P$. A point $p$ can be covered by a sliding robot that moves along a line segment s, if there exists a point $q\\in s$ such that $\\overline{pq}$ is a line segment perpendicular to $s$. In the pursuit-evasion problem, a polygonal region is given and a robot"},"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":"1607.03039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-11T17:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"d587d02986053f2f14ea8420207222dd4e0cbe31beae7ed61175275758bef709","abstract_canon_sha256":"1226a775b0503b18347187fd58db678b45b453154d60af48b1bd28a0ef8dde33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.260939Z","signature_b64":"Pmr4v6cVldeySyKodLFo9m7/rrvoEa7G1ZPW7v79EjNNCmvUkIC+w5lgIMdkvPHZ3St6p8V+Dg5rXoD6ZAs4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9b0a70f69a600735a2e448eb1bd39e8a7d9a98c4f616f3704268089a82166e","last_reissued_at":"2026-05-18T01:09:06.260507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.260507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clearing an Orthogonal Polygon Using Sliding Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ali Narenji Sheshkalani, Mohammad Ghodsi, Salma Sadat Mahdavi","submitted_at":"2016-07-11T17:09:53Z","abstract_excerpt":"In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new variant of the pursuit-evasion problem in which the robots (pursuers) each move back and forth along an orthogonal line segment inside a simple orthogonal polygon $P$. A point $p$ can be covered by a sliding robot that moves along a line segment s, if there exists a point $q\\in s$ such that $\\overline{pq}$ is a line segment perpendicular to $s$. In the pursuit-evasion problem, a polygonal region is given and a robot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03039","kind":"arxiv","version":2},"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":"1607.03039","created_at":"2026-05-18T01:09:06.260577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03039v2","created_at":"2026-05-18T01:09:06.260577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03039","created_at":"2026-05-18T01:09:06.260577+00:00"},{"alias_kind":"pith_short_12","alias_value":"NONQU4HWTJQA","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NONQU4HWTJQAONNC","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NONQU4HW","created_at":"2026-05-18T12:30:36.002864+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/NONQU4HWTJQAONNC4REOWG6TT2","json":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2.json","graph_json":"https://pith.science/api/pith-number/NONQU4HWTJQAONNC4REOWG6TT2/graph.json","events_json":"https://pith.science/api/pith-number/NONQU4HWTJQAONNC4REOWG6TT2/events.json","paper":"https://pith.science/paper/NONQU4HW"},"agent_actions":{"view_html":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2","download_json":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2.json","view_paper":"https://pith.science/paper/NONQU4HW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03039&json=true","fetch_graph":"https://pith.science/api/pith-number/NONQU4HWTJQAONNC4REOWG6TT2/graph.json","fetch_events":"https://pith.science/api/pith-number/NONQU4HWTJQAONNC4REOWG6TT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/action/storage_attestation","attest_author":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/action/author_attestation","sign_citation":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/action/citation_signature","submit_replication":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/action/replication_record"}},"created_at":"2026-05-18T01:09:06.260577+00:00","updated_at":"2026-05-18T01:09:06.260577+00:00"}