{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WFYXWB4NEZEWWULI5UNGMSYMS7","short_pith_number":"pith:WFYXWB4N","schema_version":"1.0","canonical_sha256":"b1717b078d26496b5168ed1a664b0c97d43534b7e5b8ebc3ccd3b5d6996b08b0","source":{"kind":"arxiv","id":"1709.01569","version":1},"attestation_state":"computed","paper":{"title":"Guarding Path Polygons with Orthogonal Visibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Hamid Hoorfar","submitted_at":"2017-09-05T19:45:35Z","abstract_excerpt":"We are interested in the problem of guarding simple orthogonal polygons with the minimum number of $ r $-guards. The interior point $ p $ belongs an orthogonal polygon $ P $ is visible from $ r $-guard $ g $, if the minimum area rectangle contained $ p $ and $ q $ lies within $ P $. A set of point guards in polygon $ P $ is named guard set (as denoted $ G $) if the union of visibility areas of these point guards be equal to polygon $ P $ i.e. every point in $ P $ be visible from at least one point guards in $ G $. For an orthogonal polygon, if dual graph of vertical decomposition is a path, it"},"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":"1709.01569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-05T19:45:35Z","cross_cats_sorted":[],"title_canon_sha256":"3d8c7bed5e248108e136a78ada7f5ff188106c235e9df0cd95d62fadf6484b78","abstract_canon_sha256":"e81bfa69f09ca65d9b4ce76d2483105ad89a003bac12d4fe8bcf88d02791c5cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:15.892633Z","signature_b64":"N/TaIYNesYroztcR1p68GfqcWvPyEsAMQZ0mG8429Kaztk/MdZh7Mv38gdD36W2RYErT15yjwW5nriEadoZhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1717b078d26496b5168ed1a664b0c97d43534b7e5b8ebc3ccd3b5d6996b08b0","last_reissued_at":"2026-05-18T00:35:15.892082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:15.892082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarding Path Polygons with Orthogonal Visibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Hamid Hoorfar","submitted_at":"2017-09-05T19:45:35Z","abstract_excerpt":"We are interested in the problem of guarding simple orthogonal polygons with the minimum number of $ r $-guards. The interior point $ p $ belongs an orthogonal polygon $ P $ is visible from $ r $-guard $ g $, if the minimum area rectangle contained $ p $ and $ q $ lies within $ P $. A set of point guards in polygon $ P $ is named guard set (as denoted $ G $) if the union of visibility areas of these point guards be equal to polygon $ P $ i.e. every point in $ P $ be visible from at least one point guards in $ G $. For an orthogonal polygon, if dual graph of vertical decomposition is a path, it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01569","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":"1709.01569","created_at":"2026-05-18T00:35:15.892160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01569v1","created_at":"2026-05-18T00:35:15.892160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01569","created_at":"2026-05-18T00:35:15.892160+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFYXWB4NEZEW","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFYXWB4NEZEWWULI","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFYXWB4N","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.02960","citing_title":"The Contiguous Art Gallery Problem is in {\\Theta}(n log n)","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7","json":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7.json","graph_json":"https://pith.science/api/pith-number/WFYXWB4NEZEWWULI5UNGMSYMS7/graph.json","events_json":"https://pith.science/api/pith-number/WFYXWB4NEZEWWULI5UNGMSYMS7/events.json","paper":"https://pith.science/paper/WFYXWB4N"},"agent_actions":{"view_html":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7","download_json":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7.json","view_paper":"https://pith.science/paper/WFYXWB4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01569&json=true","fetch_graph":"https://pith.science/api/pith-number/WFYXWB4NEZEWWULI5UNGMSYMS7/graph.json","fetch_events":"https://pith.science/api/pith-number/WFYXWB4NEZEWWULI5UNGMSYMS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/action/storage_attestation","attest_author":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/action/author_attestation","sign_citation":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/action/citation_signature","submit_replication":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/action/replication_record"}},"created_at":"2026-05-18T00:35:15.892160+00:00","updated_at":"2026-05-18T00:35:15.892160+00:00"}