{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PIMPU6NW3REYAQGUTDUV3GNSQC","short_pith_number":"pith:PIMPU6NW","schema_version":"1.0","canonical_sha256":"7a18fa79b6dc498040d498e95d99b28089ee0f9c4d604675d08f7750e76e0561","source":{"kind":"arxiv","id":"1308.2757","version":3},"attestation_state":"computed","paper":{"title":"A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ali Mehrabi, Omrit Filtser, Robert Fraser, Saeed Mehrabi, Stephane Durocher","submitted_at":"2013-08-13T05:16:18Z","abstract_excerpt":"Consider a sliding camera that travels back and forth along an orthogonal line segment $s$ inside an orthogonal polygon $P$ with $n$ vertices. The camera can see a point $p$ inside $P$ if and only if there exists a line segment containing $p$ that crosses $s$ at a right angle and is completely contained in $P$. In the minimum sliding cameras (MSC) problem, the objective is to guard $P$ with the minimum number of sliding cameras. In this paper, we give an $O(n^{5/2})$-time $(7/2)$-approximation algorithm to the MSC problem on any simple orthogonal polygon with $n$ vertices, answering a question"},"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":"1308.2757","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-13T05:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"c6c86aac9f5d6c74da4403497f912255014f9385c5f865375888b46bd3e71fa8","abstract_canon_sha256":"adf885f9cf5316997848ef9109d393cde77f6186215435ef081993da7bed1385"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:59.038256Z","signature_b64":"ca2siRKvze5IEKUEVitBMOVSzW4jQObpwcSL3bp7rqyNXUC/AoXell6XTL2lfNgfprh/gFH++9EUf/ey5ZAfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a18fa79b6dc498040d498e95d99b28089ee0f9c4d604675d08f7750e76e0561","last_reissued_at":"2026-05-18T03:11:59.037667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:59.037667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ali Mehrabi, Omrit Filtser, Robert Fraser, Saeed Mehrabi, Stephane Durocher","submitted_at":"2013-08-13T05:16:18Z","abstract_excerpt":"Consider a sliding camera that travels back and forth along an orthogonal line segment $s$ inside an orthogonal polygon $P$ with $n$ vertices. The camera can see a point $p$ inside $P$ if and only if there exists a line segment containing $p$ that crosses $s$ at a right angle and is completely contained in $P$. In the minimum sliding cameras (MSC) problem, the objective is to guard $P$ with the minimum number of sliding cameras. In this paper, we give an $O(n^{5/2})$-time $(7/2)$-approximation algorithm to the MSC problem on any simple orthogonal polygon with $n$ vertices, answering a question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2757","kind":"arxiv","version":3},"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":"1308.2757","created_at":"2026-05-18T03:11:59.037751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2757v3","created_at":"2026-05-18T03:11:59.037751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2757","created_at":"2026-05-18T03:11:59.037751+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIMPU6NW3REY","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIMPU6NW3REYAQGU","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIMPU6NW","created_at":"2026-05-18T12:27:54.935989+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/PIMPU6NW3REYAQGUTDUV3GNSQC","json":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC.json","graph_json":"https://pith.science/api/pith-number/PIMPU6NW3REYAQGUTDUV3GNSQC/graph.json","events_json":"https://pith.science/api/pith-number/PIMPU6NW3REYAQGUTDUV3GNSQC/events.json","paper":"https://pith.science/paper/PIMPU6NW"},"agent_actions":{"view_html":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC","download_json":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC.json","view_paper":"https://pith.science/paper/PIMPU6NW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2757&json=true","fetch_graph":"https://pith.science/api/pith-number/PIMPU6NW3REYAQGUTDUV3GNSQC/graph.json","fetch_events":"https://pith.science/api/pith-number/PIMPU6NW3REYAQGUTDUV3GNSQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/action/storage_attestation","attest_author":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/action/author_attestation","sign_citation":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/action/citation_signature","submit_replication":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/action/replication_record"}},"created_at":"2026-05-18T03:11:59.037751+00:00","updated_at":"2026-05-18T03:11:59.037751+00:00"}