{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H5O5MDIQ4HFWFW5EOPUNARRCNM","short_pith_number":"pith:H5O5MDIQ","schema_version":"1.0","canonical_sha256":"3f5dd60d10e1cb62dba473e8d046226b3d1bce577d1e7976f43118cfd180d9ac","source":{"kind":"arxiv","id":"1611.08315","version":2},"attestation_state":"computed","paper":{"title":"Universal Guard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Scheffer, Joseph S. B. Mitchell, Qian Li, S\\'andor P. Fekete","submitted_at":"2016-11-24T21:38:59Z","abstract_excerpt":"We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points (\"guards\") that are \"universal\" in their ability to guard any of a set of possible polygonal domains in the plane. We give upper and lower bounds on the number of universal guards that are always sufficient to guard all polygons having a given set of n vertices, or to guard all polygons in a given set of k polygons on an n-point vertex set. Our upper bound proofs include algorithms to construct universal guard sets of the respective cardinalities."},"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":"1611.08315","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-24T21:38:59Z","cross_cats_sorted":[],"title_canon_sha256":"cce3864d0179409734b44761cddbfa85f7a345eac11089b0991cf4299da722a9","abstract_canon_sha256":"fb52da4c86c65928059a7f4b8a0f31a1e3b6fd9005489c9926460c3ab2fb7d80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:56.624903Z","signature_b64":"k2DdEbTkPAyh+KJ7Oy1LOQIHehYAz8q0YILzOQo1dI/wxgwNK7cTjdmcAehFW2Fnujyyj1HSFh8D9z3crVrNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f5dd60d10e1cb62dba473e8d046226b3d1bce577d1e7976f43118cfd180d9ac","last_reissued_at":"2026-05-18T00:47:56.624507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:56.624507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Guard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Scheffer, Joseph S. B. Mitchell, Qian Li, S\\'andor P. Fekete","submitted_at":"2016-11-24T21:38:59Z","abstract_excerpt":"We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points (\"guards\") that are \"universal\" in their ability to guard any of a set of possible polygonal domains in the plane. We give upper and lower bounds on the number of universal guards that are always sufficient to guard all polygons having a given set of n vertices, or to guard all polygons in a given set of k polygons on an n-point vertex set. Our upper bound proofs include algorithms to construct universal guard sets of the respective cardinalities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08315","kind":"arxiv","version":2},"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":"1611.08315","created_at":"2026-05-18T00:47:56.624560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08315v2","created_at":"2026-05-18T00:47:56.624560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08315","created_at":"2026-05-18T00:47:56.624560+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5O5MDIQ4HFW","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5O5MDIQ4HFWFW5E","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5O5MDIQ","created_at":"2026-05-18T12:30:19.053100+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/H5O5MDIQ4HFWFW5EOPUNARRCNM","json":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM.json","graph_json":"https://pith.science/api/pith-number/H5O5MDIQ4HFWFW5EOPUNARRCNM/graph.json","events_json":"https://pith.science/api/pith-number/H5O5MDIQ4HFWFW5EOPUNARRCNM/events.json","paper":"https://pith.science/paper/H5O5MDIQ"},"agent_actions":{"view_html":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM","download_json":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM.json","view_paper":"https://pith.science/paper/H5O5MDIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08315&json=true","fetch_graph":"https://pith.science/api/pith-number/H5O5MDIQ4HFWFW5EOPUNARRCNM/graph.json","fetch_events":"https://pith.science/api/pith-number/H5O5MDIQ4HFWFW5EOPUNARRCNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM/action/storage_attestation","attest_author":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM/action/author_attestation","sign_citation":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM/action/citation_signature","submit_replication":"https://pith.science/pith/H5O5MDIQ4HFWFW5EOPUNARRCNM/action/replication_record"}},"created_at":"2026-05-18T00:47:56.624560+00:00","updated_at":"2026-05-18T00:47:56.624560+00:00"}