{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WECCIPC3L7UNB34UQ4NQIQTQVO","short_pith_number":"pith:WECCIPC3","schema_version":"1.0","canonical_sha256":"b104243c5b5fe8d0ef94871b044270abb1a213d03c180a439a8a4e484a9a9b1b","source":{"kind":"arxiv","id":"1303.2162","version":1},"attestation_state":"computed","paper":{"title":"New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Stephane Durocher","submitted_at":"2013-03-09T04:22:21Z","abstract_excerpt":"Let $P$ be an orthogonal polygon. Consider a sliding camera that travels back and forth along an orthogonal line segment $s\\in P$ as its \\emph{trajectory}. The camera can see a point $p\\in P$ if there exists a point $q\\in s$ such that $pq$ is a line segment normal to $s$ that is completely inside $P$. In the \\emph{minimum-cardinality sliding cameras problem}, the objective is to find a set $S$ of sliding cameras of minimum cardinality to guard $P$ (i.e., every point in $P$ can be seen by some sliding camera) while in the \\emph{minimum-length sliding cameras problem} the goal is to find such a "},"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":"1303.2162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-09T04:22:21Z","cross_cats_sorted":[],"title_canon_sha256":"25d6bc5dcbda08f33e208b5eab650d23ffe9120c6ca8003b104334c6ef37fdd8","abstract_canon_sha256":"e3726fa6631b0cbda18e70acae45f9226746f6c71aaf2d14db7443a3de59f88f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:19.894982Z","signature_b64":"xTUYUhX10Wap5pYgMfnh+uh607ZqxmrYdcTZlycseGsePIq195J5NEzXT0lnMeG2HMlZq/to73j7IRuWzksSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b104243c5b5fe8d0ef94871b044270abb1a213d03c180a439a8a4e484a9a9b1b","last_reissued_at":"2026-05-18T03:31:19.894162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:19.894162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Stephane Durocher","submitted_at":"2013-03-09T04:22:21Z","abstract_excerpt":"Let $P$ be an orthogonal polygon. Consider a sliding camera that travels back and forth along an orthogonal line segment $s\\in P$ as its \\emph{trajectory}. The camera can see a point $p\\in P$ if there exists a point $q\\in s$ such that $pq$ is a line segment normal to $s$ that is completely inside $P$. In the \\emph{minimum-cardinality sliding cameras problem}, the objective is to find a set $S$ of sliding cameras of minimum cardinality to guard $P$ (i.e., every point in $P$ can be seen by some sliding camera) while in the \\emph{minimum-length sliding cameras problem} the goal is to find such a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2162","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":"1303.2162","created_at":"2026-05-18T03:31:19.894299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2162v1","created_at":"2026-05-18T03:31:19.894299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2162","created_at":"2026-05-18T03:31:19.894299+00:00"},{"alias_kind":"pith_short_12","alias_value":"WECCIPC3L7UN","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WECCIPC3L7UNB34U","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WECCIPC3","created_at":"2026-05-18T12:28:04.890932+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/WECCIPC3L7UNB34UQ4NQIQTQVO","json":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO.json","graph_json":"https://pith.science/api/pith-number/WECCIPC3L7UNB34UQ4NQIQTQVO/graph.json","events_json":"https://pith.science/api/pith-number/WECCIPC3L7UNB34UQ4NQIQTQVO/events.json","paper":"https://pith.science/paper/WECCIPC3"},"agent_actions":{"view_html":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO","download_json":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO.json","view_paper":"https://pith.science/paper/WECCIPC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2162&json=true","fetch_graph":"https://pith.science/api/pith-number/WECCIPC3L7UNB34UQ4NQIQTQVO/graph.json","fetch_events":"https://pith.science/api/pith-number/WECCIPC3L7UNB34UQ4NQIQTQVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO/action/storage_attestation","attest_author":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO/action/author_attestation","sign_citation":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO/action/citation_signature","submit_replication":"https://pith.science/pith/WECCIPC3L7UNB34UQ4NQIQTQVO/action/replication_record"}},"created_at":"2026-05-18T03:31:19.894299+00:00","updated_at":"2026-05-18T03:31:19.894299+00:00"}