{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ESRNZAFESWRUPJ6HSPMDP6KQVU","short_pith_number":"pith:ESRNZAFE","canonical_record":{"source":{"id":"1706.02028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-07T02:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"45c324dd997c440df16668377640bd7b68d717fb4ff7183722d88f4baa8d7277","abstract_canon_sha256":"158072ac805202b81bbeb826f32c51e7f8b1a5a94563e61b4b6f9418df8d4501"},"schema_version":"1.0"},"canonical_sha256":"24a2dc80a495a347a7c793d837f950ad39bc7035c9fa6d85db24cb14339aa47f","source":{"kind":"arxiv","id":"1706.02028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02028","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02028v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02028","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"ESRNZAFESWRU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ESRNZAFESWRUPJ6H","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ESRNZAFE","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ESRNZAFESWRUPJ6HSPMDP6KQVU","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-07T02:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"45c324dd997c440df16668377640bd7b68d717fb4ff7183722d88f4baa8d7277","abstract_canon_sha256":"158072ac805202b81bbeb826f32c51e7f8b1a5a94563e61b4b6f9418df8d4501"},"schema_version":"1.0"},"canonical_sha256":"24a2dc80a495a347a7c793d837f950ad39bc7035c9fa6d85db24cb14339aa47f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:50.435097Z","signature_b64":"nmcG2FX7wfo3chzHc4HNVDHq5l0D8QbmNElyAkYzgicxStuGwWf+SzI4g/lSY8U/82lJIqYo/ADlxRT81zWfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24a2dc80a495a347a7c793d837f950ad39bc7035c9fa6d85db24cb14339aa47f","last_reissued_at":"2026-05-18T00:42:50.434344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:50.434344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02028","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:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ayLjuN7bw4+fh7xJKeKWAxLilPa7SoOoJiS+YT01pwDnm3P1M/HzI0g4NmHuCG9A1/WReYxHbbfb76KXpAwcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:38:51.322865Z"},"content_sha256":"9b38fdde2674e16ee73b57dcf619fbcebd97a262b5d6e4c1ef569aa0d4a6c705","schema_version":"1.0","event_id":"sha256:9b38fdde2674e16ee73b57dcf619fbcebd97a262b5d6e4c1ef569aa0d4a6c705"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ESRNZAFESWRUPJ6HSPMDP6KQVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Guarding Orthogonal Polygons with Bounded Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi, Therese Biedl","submitted_at":"2017-06-07T02:16:49Z","abstract_excerpt":"There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along an orthogonal path with at most $k$ bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we show that the problem of finding the minimum number of guards in these models becomes linear-time solvable in orthogonal polygons of bounded treewidth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02028","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:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWlDxbRqDWfmY6lwWNvMDIICHv4j9E+WqKCqbzRn8dAWPBfPTUWLqFmKHzcPBlWCNiiCtVYZ3/owKc/MLkaUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:38:51.323511Z"},"content_sha256":"d0e83b6462b877aed1ca6538e9d556c0d2387fe41e73770a00e75952cd61cb6b","schema_version":"1.0","event_id":"sha256:d0e83b6462b877aed1ca6538e9d556c0d2387fe41e73770a00e75952cd61cb6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESRNZAFESWRUPJ6HSPMDP6KQVU/bundle.json","state_url":"https://pith.science/pith/ESRNZAFESWRUPJ6HSPMDP6KQVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESRNZAFESWRUPJ6HSPMDP6KQVU/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-31T08:38:51Z","links":{"resolver":"https://pith.science/pith/ESRNZAFESWRUPJ6HSPMDP6KQVU","bundle":"https://pith.science/pith/ESRNZAFESWRUPJ6HSPMDP6KQVU/bundle.json","state":"https://pith.science/pith/ESRNZAFESWRUPJ6HSPMDP6KQVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESRNZAFESWRUPJ6HSPMDP6KQVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ESRNZAFESWRUPJ6HSPMDP6KQVU","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":"158072ac805202b81bbeb826f32c51e7f8b1a5a94563e61b4b6f9418df8d4501","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-07T02:16:49Z","title_canon_sha256":"45c324dd997c440df16668377640bd7b68d717fb4ff7183722d88f4baa8d7277"},"schema_version":"1.0","source":{"id":"1706.02028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02028","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02028v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02028","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"ESRNZAFESWRU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ESRNZAFESWRUPJ6H","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ESRNZAFE","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:d0e83b6462b877aed1ca6538e9d556c0d2387fe41e73770a00e75952cd61cb6b","target":"graph","created_at":"2026-05-18T00:42:50Z","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":"There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along an orthogonal path with at most $k$ bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we show that the problem of finding the minimum number of guards in these models becomes linear-time solvable in orthogonal polygons of bounded treewidth.","authors_text":"Saeed Mehrabi, Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-07T02:16:49Z","title":"On Guarding Orthogonal Polygons with Bounded Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02028","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:9b38fdde2674e16ee73b57dcf619fbcebd97a262b5d6e4c1ef569aa0d4a6c705","target":"record","created_at":"2026-05-18T00:42:50Z","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":"158072ac805202b81bbeb826f32c51e7f8b1a5a94563e61b4b6f9418df8d4501","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-07T02:16:49Z","title_canon_sha256":"45c324dd997c440df16668377640bd7b68d717fb4ff7183722d88f4baa8d7277"},"schema_version":"1.0","source":{"id":"1706.02028","kind":"arxiv","version":1}},"canonical_sha256":"24a2dc80a495a347a7c793d837f950ad39bc7035c9fa6d85db24cb14339aa47f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24a2dc80a495a347a7c793d837f950ad39bc7035c9fa6d85db24cb14339aa47f","first_computed_at":"2026-05-18T00:42:50.434344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:50.434344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nmcG2FX7wfo3chzHc4HNVDHq5l0D8QbmNElyAkYzgicxStuGwWf+SzI4g/lSY8U/82lJIqYo/ADlxRT81zWfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:50.435097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b38fdde2674e16ee73b57dcf619fbcebd97a262b5d6e4c1ef569aa0d4a6c705","sha256:d0e83b6462b877aed1ca6538e9d556c0d2387fe41e73770a00e75952cd61cb6b"],"state_sha256":"a72aee33f511f210eab8de561d8a96cd9fc8cf9b595f3e1f0b7d36f04fdb4291"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Scp57IM7pYGY3HY/1QJqVZYvpHuxm+A0dPjz2eFIaa0a651dcwDkM2b7fYETPNKo59Nk9O7V3xuzE+ll3DbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:38:51.327277Z","bundle_sha256":"368cffa68e1c03aeec32728ba8efbe694222f4bdb7a4e8ae791bffb294999ebc"}}