{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3SRKAKQOGLOD76445LEIMR26BG","short_pith_number":"pith:3SRKAKQO","schema_version":"1.0","canonical_sha256":"dca2a02a0e32dc3ffb9ceac886475e09be1b77688c2778a17a82e6ee20bb7af9","source":{"kind":"arxiv","id":"1604.07099","version":1},"attestation_state":"computed","paper":{"title":"On Guarding Orthogonal Polygons with Sliding Cameras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabrizio Montecchiani, Hamideh Vosoughpour, Saeed Mehrabi, Stephanie Lee, Therese Biedl, Timothy M. Chan","submitted_at":"2016-04-25T00:16:25Z","abstract_excerpt":"A sliding camera inside an orthogonal polygon $P$ is a point guard that travels back and forth along an orthogonal line segment $\\gamma$ in $P$. The sliding camera $g$ can see a point $p$ in $P$ if the perpendicular from $p$ onto $\\gamma$ is inside $P$. In this paper, we give the first constant-factor approximation algorithm for the problem of guarding $P$ with the minimum number of sliding cameras. Next, we show that the sliding guards problem is linear-time solvable if the (suitably defined) dual graph of the polygon has bounded treewidth. Finally, we study art gallery theorems for sliding c"},"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":"1604.07099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-25T00:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"ed635f65b5a9d810c3a309153a590a0ecc4184c669420ac8ed6b38c558867888","abstract_canon_sha256":"4a6ce62768f3f8d3334e20753d8f5f2d3429f28d86cc283c08b3454bb6abba12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.063696Z","signature_b64":"XeI9nOfekIUtC27ZQvBJtwyQUe6dHbtI/hqoxYVcQlV+yLPRxREYJTEQFQZBRpD37GTpRV4BHh0Du4NHvEhzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dca2a02a0e32dc3ffb9ceac886475e09be1b77688c2778a17a82e6ee20bb7af9","last_reissued_at":"2026-05-18T01:16:23.063109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.063109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Guarding Orthogonal Polygons with Sliding Cameras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fabrizio Montecchiani, Hamideh Vosoughpour, Saeed Mehrabi, Stephanie Lee, Therese Biedl, Timothy M. Chan","submitted_at":"2016-04-25T00:16:25Z","abstract_excerpt":"A sliding camera inside an orthogonal polygon $P$ is a point guard that travels back and forth along an orthogonal line segment $\\gamma$ in $P$. The sliding camera $g$ can see a point $p$ in $P$ if the perpendicular from $p$ onto $\\gamma$ is inside $P$. In this paper, we give the first constant-factor approximation algorithm for the problem of guarding $P$ with the minimum number of sliding cameras. Next, we show that the sliding guards problem is linear-time solvable if the (suitably defined) dual graph of the polygon has bounded treewidth. Finally, we study art gallery theorems for sliding c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07099","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":"1604.07099","created_at":"2026-05-18T01:16:23.063200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07099v1","created_at":"2026-05-18T01:16:23.063200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07099","created_at":"2026-05-18T01:16:23.063200+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SRKAKQOGLOD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SRKAKQOGLOD7644","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SRKAKQO","created_at":"2026-05-18T12:29:58.707656+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/3SRKAKQOGLOD76445LEIMR26BG","json":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG.json","graph_json":"https://pith.science/api/pith-number/3SRKAKQOGLOD76445LEIMR26BG/graph.json","events_json":"https://pith.science/api/pith-number/3SRKAKQOGLOD76445LEIMR26BG/events.json","paper":"https://pith.science/paper/3SRKAKQO"},"agent_actions":{"view_html":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG","download_json":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG.json","view_paper":"https://pith.science/paper/3SRKAKQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07099&json=true","fetch_graph":"https://pith.science/api/pith-number/3SRKAKQOGLOD76445LEIMR26BG/graph.json","fetch_events":"https://pith.science/api/pith-number/3SRKAKQOGLOD76445LEIMR26BG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG/action/storage_attestation","attest_author":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG/action/author_attestation","sign_citation":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG/action/citation_signature","submit_replication":"https://pith.science/pith/3SRKAKQOGLOD76445LEIMR26BG/action/replication_record"}},"created_at":"2026-05-18T01:16:23.063200+00:00","updated_at":"2026-05-18T01:16:23.063200+00:00"}