{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DOUO4KHNWXG2OU3MBCWI4V53UN","short_pith_number":"pith:DOUO4KHN","schema_version":"1.0","canonical_sha256":"1ba8ee28edb5cda7536c08ac8e57bba3666adc3863b2c4e2c0d88784dea2a912","source":{"kind":"arxiv","id":"1604.07100","version":1},"attestation_state":"computed","paper":{"title":"On $r$-Guarding Thin Orthogonal Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Therese Biedl","submitted_at":"2016-04-25T00:21:59Z","abstract_excerpt":"Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a point $q$ if and only if the minimum axis-aligned rectangle spanned by $p$ and $q$ is inside the polygon. A simple proof shows that this problem is NP-hard on orthogonal polygons with holes, even if the polygon is thin. If there are no holes, then a thin polygon becomes a tree polygon in the sense that the so-called dual graph of the polygon is a tree. It w"},"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.07100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-25T00:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"940554b203a9de09ec7678fb9bb8fa651a68c5b65bce4ba0e767da2a8f524e0c","abstract_canon_sha256":"53ed2743cf4d7935f27cb5d029b8e54ed5bf8476a7fba42bbf399f7103974a3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.053793Z","signature_b64":"azRZy/o5/VqQ35SscpX3cE/k5/k+7Rn/d1SWW2tAuLc7WpGLzZuZtby4VffE/CD72Nw3dGeJnruVpBff/j0vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba8ee28edb5cda7536c08ac8e57bba3666adc3863b2c4e2c0d88784dea2a912","last_reissued_at":"2026-05-18T01:16:23.053271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.053271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $r$-Guarding Thin Orthogonal Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Therese Biedl","submitted_at":"2016-04-25T00:21:59Z","abstract_excerpt":"Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a point $q$ if and only if the minimum axis-aligned rectangle spanned by $p$ and $q$ is inside the polygon. A simple proof shows that this problem is NP-hard on orthogonal polygons with holes, even if the polygon is thin. If there are no holes, then a thin polygon becomes a tree polygon in the sense that the so-called dual graph of the polygon is a tree. It w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07100","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.07100","created_at":"2026-05-18T01:16:23.053359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07100v1","created_at":"2026-05-18T01:16:23.053359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07100","created_at":"2026-05-18T01:16:23.053359+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOUO4KHNWXG2","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOUO4KHNWXG2OU3M","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOUO4KHN","created_at":"2026-05-18T12:30:12.583610+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/DOUO4KHNWXG2OU3MBCWI4V53UN","json":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN.json","graph_json":"https://pith.science/api/pith-number/DOUO4KHNWXG2OU3MBCWI4V53UN/graph.json","events_json":"https://pith.science/api/pith-number/DOUO4KHNWXG2OU3MBCWI4V53UN/events.json","paper":"https://pith.science/paper/DOUO4KHN"},"agent_actions":{"view_html":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN","download_json":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN.json","view_paper":"https://pith.science/paper/DOUO4KHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07100&json=true","fetch_graph":"https://pith.science/api/pith-number/DOUO4KHNWXG2OU3MBCWI4V53UN/graph.json","fetch_events":"https://pith.science/api/pith-number/DOUO4KHNWXG2OU3MBCWI4V53UN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN/action/storage_attestation","attest_author":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN/action/author_attestation","sign_citation":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN/action/citation_signature","submit_replication":"https://pith.science/pith/DOUO4KHNWXG2OU3MBCWI4V53UN/action/replication_record"}},"created_at":"2026-05-18T01:16:23.053359+00:00","updated_at":"2026-05-18T01:16:23.053359+00:00"}