{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WFYXWB4NEZEWWULI5UNGMSYMS7","short_pith_number":"pith:WFYXWB4N","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"},"canonical_sha256":"b1717b078d26496b5168ed1a664b0c97d43534b7e5b8ebc3ccd3b5d6996b08b0","source":{"kind":"arxiv","id":"1709.01569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01569","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01569v1","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01569","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"WFYXWB4NEZEW","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WFYXWB4NEZEWWULI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WFYXWB4N","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WFYXWB4NEZEWWULI5UNGMSYMS7","target":"record","payload":{"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"},"canonical_sha256":"b1717b078d26496b5168ed1a664b0c97d43534b7e5b8ebc3ccd3b5d6996b08b0","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"},"source_kind":"arxiv","source_id":"1709.01569","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0LeWQlhlXoc9DsoGSRCIxvIGGaU7WD+IxrsKYHhlDQi6/TauLn8mxOLBwnCA8aWmCw/sE1D+UqaoZ/4LMrjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:42.576135Z"},"content_sha256":"6fa5c973f5d0511c20cac4711a20a6978fdbfa8f86c3fd2b1fd4df76461e9163","schema_version":"1.0","event_id":"sha256:6fa5c973f5d0511c20cac4711a20a6978fdbfa8f86c3fd2b1fd4df76461e9163"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WFYXWB4NEZEWWULI5UNGMSYMS7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2h6TZzuiTjlb4K3PtIk7jVv72bIsEqH/U+FSc9lNko9ZpfiijtGpC8g2iUxRwPZv9NYhd7r6C+RHNHM8widbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:42.576789Z"},"content_sha256":"61835e8144aa3251631b0263ea4fbc4d7fa4abf39da86c18a07a703149f5d5ae","schema_version":"1.0","event_id":"sha256:61835e8144aa3251631b0263ea4fbc4d7fa4abf39da86c18a07a703149f5d5ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/bundle.json","state_url":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T10:44:42Z","links":{"resolver":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7","bundle":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/bundle.json","state":"https://pith.science/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFYXWB4NEZEWWULI5UNGMSYMS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WFYXWB4NEZEWWULI5UNGMSYMS7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e81bfa69f09ca65d9b4ce76d2483105ad89a003bac12d4fe8bcf88d02791c5cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-05T19:45:35Z","title_canon_sha256":"3d8c7bed5e248108e136a78ada7f5ff188106c235e9df0cd95d62fadf6484b78"},"schema_version":"1.0","source":{"id":"1709.01569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01569","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01569v1","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01569","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"WFYXWB4NEZEW","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WFYXWB4NEZEWWULI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WFYXWB4N","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:61835e8144aa3251631b0263ea4fbc4d7fa4abf39da86c18a07a703149f5d5ae","target":"graph","created_at":"2026-05-18T00:35:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alireza Bagheri, Hamid Hoorfar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-05T19:45:35Z","title":"Guarding Path Polygons with Orthogonal Visibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01569","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6fa5c973f5d0511c20cac4711a20a6978fdbfa8f86c3fd2b1fd4df76461e9163","target":"record","created_at":"2026-05-18T00:35:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e81bfa69f09ca65d9b4ce76d2483105ad89a003bac12d4fe8bcf88d02791c5cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-05T19:45:35Z","title_canon_sha256":"3d8c7bed5e248108e136a78ada7f5ff188106c235e9df0cd95d62fadf6484b78"},"schema_version":"1.0","source":{"id":"1709.01569","kind":"arxiv","version":1}},"canonical_sha256":"b1717b078d26496b5168ed1a664b0c97d43534b7e5b8ebc3ccd3b5d6996b08b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1717b078d26496b5168ed1a664b0c97d43534b7e5b8ebc3ccd3b5d6996b08b0","first_computed_at":"2026-05-18T00:35:15.892082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:15.892082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N/TaIYNesYroztcR1p68GfqcWvPyEsAMQZ0mG8429Kaztk/MdZh7Mv38gdD36W2RYErT15yjwW5nriEadoZhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:15.892633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fa5c973f5d0511c20cac4711a20a6978fdbfa8f86c3fd2b1fd4df76461e9163","sha256:61835e8144aa3251631b0263ea4fbc4d7fa4abf39da86c18a07a703149f5d5ae"],"state_sha256":"ea14a3e07e83c0947b5837246c2117def9339715f16540e3f81822272a9966fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SPa3T9QtVw/Dbn+O8RzxwebNr4Z8uVmwctlbotd56YuKdtT2lKaAkAq8wl89k0iCzaPSfOOKYoSsZVAbWysDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:44:42.580260Z","bundle_sha256":"4cb8892fbd252eb4d1e0cb939095af3e520abec3a9a05b611e15eaff695de370"}}