{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IHMUU2M4FUZYOSEGDPZVJUJOPH","short_pith_number":"pith:IHMUU2M4","canonical_record":{"source":{"id":"1708.05815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-19T07:15:23Z","cross_cats_sorted":[],"title_canon_sha256":"aa5874a1a12150cb666a54cc3aae6aaf0f75e84dad115c9fd73e3de2148cdfdc","abstract_canon_sha256":"845dbbb87eb2ebe25a4b661e951f29fa1a3c3d9bc4c6f448dd7425f7da606c7f"},"schema_version":"1.0"},"canonical_sha256":"41d94a699c2d338748861bf354d12e79ed64f9b62e1cd75125a067588a6005a6","source":{"kind":"arxiv","id":"1708.05815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05815","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05815v1","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05815","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"IHMUU2M4FUZY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IHMUU2M4FUZYOSEG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IHMUU2M4","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IHMUU2M4FUZYOSEGDPZVJUJOPH","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-19T07:15:23Z","cross_cats_sorted":[],"title_canon_sha256":"aa5874a1a12150cb666a54cc3aae6aaf0f75e84dad115c9fd73e3de2148cdfdc","abstract_canon_sha256":"845dbbb87eb2ebe25a4b661e951f29fa1a3c3d9bc4c6f448dd7425f7da606c7f"},"schema_version":"1.0"},"canonical_sha256":"41d94a699c2d338748861bf354d12e79ed64f9b62e1cd75125a067588a6005a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:44.154070Z","signature_b64":"OphW0GjOViQfk7OOGf6oIFUSqRnm+UTcTh0quPrEyycsUSBHTRe7qZa5/m5MmNKI9ITRwNCRMUfkiEvwwFSrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41d94a699c2d338748861bf354d12e79ed64f9b62e1cd75125a067588a6005a6","last_reissued_at":"2026-05-18T00:37:44.153402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:44.153402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05815","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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4Nimh6I8fqU8g6fYZbXmvkNnaeTdRea1MNrCARimgSYJn/Qpf8kD07xHKOuIIIbMQ+E/NRMY34vIUovi28mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:45:38.358103Z"},"content_sha256":"04b662d666e340aa12dc21569a11ef4d224fd22929e9f65515c69dac9cf0c676","schema_version":"1.0","event_id":"sha256:04b662d666e340aa12dc21569a11ef4d224fd22929e9f65515c69dac9cf0c676"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IHMUU2M4FUZYOSEGDPZVJUJOPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Hidden Guarding of Histogram Polygons","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-08-19T07:15:23Z","abstract_excerpt":"A hidden guard set $ G $ is a set of point guards in polygon $ P $ that all points of the polygon are visible from some guards in $ G $ under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points $ p $ and $ q $ are orthogonally visible if the orthogonal bounding rectangle for $ p $ and $ q $ lies within $ P $. It is known that the problem is NP-hard for simple polygon with general visibility and it is true for simple orthogonal polygon. We proposed a linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05815","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:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQ0gThCZy4fFTESITptLWhAZZaLlDfibyq1fN4EX1Gm8nkv4GejDYajRMYPjTqmGPPX9zQWMRcG9Se4ixivLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:45:38.358466Z"},"content_sha256":"a8286cfbb3b2d729661c653f109e9cddcc3ceb12ed5729ebec515b868f411aab","schema_version":"1.0","event_id":"sha256:a8286cfbb3b2d729661c653f109e9cddcc3ceb12ed5729ebec515b868f411aab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHMUU2M4FUZYOSEGDPZVJUJOPH/bundle.json","state_url":"https://pith.science/pith/IHMUU2M4FUZYOSEGDPZVJUJOPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHMUU2M4FUZYOSEGDPZVJUJOPH/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:45:38Z","links":{"resolver":"https://pith.science/pith/IHMUU2M4FUZYOSEGDPZVJUJOPH","bundle":"https://pith.science/pith/IHMUU2M4FUZYOSEGDPZVJUJOPH/bundle.json","state":"https://pith.science/pith/IHMUU2M4FUZYOSEGDPZVJUJOPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHMUU2M4FUZYOSEGDPZVJUJOPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IHMUU2M4FUZYOSEGDPZVJUJOPH","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":"845dbbb87eb2ebe25a4b661e951f29fa1a3c3d9bc4c6f448dd7425f7da606c7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-19T07:15:23Z","title_canon_sha256":"aa5874a1a12150cb666a54cc3aae6aaf0f75e84dad115c9fd73e3de2148cdfdc"},"schema_version":"1.0","source":{"id":"1708.05815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05815","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05815v1","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05815","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"IHMUU2M4FUZY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IHMUU2M4FUZYOSEG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IHMUU2M4","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:a8286cfbb3b2d729661c653f109e9cddcc3ceb12ed5729ebec515b868f411aab","target":"graph","created_at":"2026-05-18T00:37:44Z","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":"A hidden guard set $ G $ is a set of point guards in polygon $ P $ that all points of the polygon are visible from some guards in $ G $ under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points $ p $ and $ q $ are orthogonally visible if the orthogonal bounding rectangle for $ p $ and $ q $ lies within $ P $. It is known that the problem is NP-hard for simple polygon with general visibility and it is true for simple orthogonal polygon. We proposed a linea","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-08-19T07:15:23Z","title":"Minimum Hidden Guarding of Histogram Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05815","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:04b662d666e340aa12dc21569a11ef4d224fd22929e9f65515c69dac9cf0c676","target":"record","created_at":"2026-05-18T00:37:44Z","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":"845dbbb87eb2ebe25a4b661e951f29fa1a3c3d9bc4c6f448dd7425f7da606c7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-19T07:15:23Z","title_canon_sha256":"aa5874a1a12150cb666a54cc3aae6aaf0f75e84dad115c9fd73e3de2148cdfdc"},"schema_version":"1.0","source":{"id":"1708.05815","kind":"arxiv","version":1}},"canonical_sha256":"41d94a699c2d338748861bf354d12e79ed64f9b62e1cd75125a067588a6005a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41d94a699c2d338748861bf354d12e79ed64f9b62e1cd75125a067588a6005a6","first_computed_at":"2026-05-18T00:37:44.153402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:44.153402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OphW0GjOViQfk7OOGf6oIFUSqRnm+UTcTh0quPrEyycsUSBHTRe7qZa5/m5MmNKI9ITRwNCRMUfkiEvwwFSrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:44.154070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04b662d666e340aa12dc21569a11ef4d224fd22929e9f65515c69dac9cf0c676","sha256:a8286cfbb3b2d729661c653f109e9cddcc3ceb12ed5729ebec515b868f411aab"],"state_sha256":"30c83aa026312f1ff5b37fcc8001e605950efa786fa9b32e338940fad1374f99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZPCu8dD0vBLVriT7j1ovPoBaJd0ywji0Pr1AS18xeUZD1Q3pAnhPlSH1k4QASyXDe7QEq5AjkUe2jwxwS+7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:45:38.360568Z","bundle_sha256":"23e852d8b0b44996b390a7966f95d50718d4547d7d9db747ec1887d757e3e10a"}}