{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QWONT5LSZUTZAZ2MOJHWX25EZM","short_pith_number":"pith:QWONT5LS","schema_version":"1.0","canonical_sha256":"859cd9f572cd2790674c724f6beba4cb1d75f710589d61956309b3acff534b93","source":{"kind":"arxiv","id":"2210.12817","version":3},"attestation_state":"computed","paper":{"title":"The Point-Boundary Art Gallery Problem is $\\exists\\mathbb{R}$-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jack Stade","submitted_at":"2022-10-23T18:30:59Z","abstract_excerpt":"We resolve the complexity of the point-boundary variant of the art gallery problem, showing that it is $\\exists\\mathbb{R}$-complete, meaning that it is equivalent under polynomial time reductions to deciding whether a system of polynomial equations has a real solution. The art gallery problem asks whether there is a configuration of {\\it guards} that together can see every point inside of an {\\it art gallery} modeled by a simple polygon. The original version of this problem (which we call the point-point variant) was shown to be $\\exists\\mathbb{R}$-hard [Abrahamsen, Adamaszek, and Miltzow, JAC"},"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":"2210.12817","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2022-10-23T18:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"83588dbf6704f8a2c42c0e4998e606c473c5a015659cadf1b58994fd24df05a5","abstract_canon_sha256":"80f30ff11aac340b27a87447abb1009210af2575a3509c209d6f4c2df323ebfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:51.931367Z","signature_b64":"TtgHy0L+Ahs/3hO8V4DS9FPoyP6CCM1+QFONMHHYQrWGDj1PKhXWt7Gz37PiW1oIZIC27nMDa+GSqEHxCflcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859cd9f572cd2790674c724f6beba4cb1d75f710589d61956309b3acff534b93","last_reissued_at":"2026-07-05T10:46:51.930726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:51.930726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Point-Boundary Art Gallery Problem is $\\exists\\mathbb{R}$-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jack Stade","submitted_at":"2022-10-23T18:30:59Z","abstract_excerpt":"We resolve the complexity of the point-boundary variant of the art gallery problem, showing that it is $\\exists\\mathbb{R}$-complete, meaning that it is equivalent under polynomial time reductions to deciding whether a system of polynomial equations has a real solution. The art gallery problem asks whether there is a configuration of {\\it guards} that together can see every point inside of an {\\it art gallery} modeled by a simple polygon. The original version of this problem (which we call the point-point variant) was shown to be $\\exists\\mathbb{R}$-hard [Abrahamsen, Adamaszek, and Miltzow, JAC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12817","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.12817/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.12817","created_at":"2026-07-05T10:46:51.930786+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.12817v3","created_at":"2026-07-05T10:46:51.930786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12817","created_at":"2026-07-05T10:46:51.930786+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWONT5LSZUTZ","created_at":"2026-07-05T10:46:51.930786+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWONT5LSZUTZAZ2M","created_at":"2026-07-05T10:46:51.930786+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWONT5LS","created_at":"2026-07-05T10:46:51.930786+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26749","citing_title":"The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26749","citing_title":"The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM","json":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM.json","graph_json":"https://pith.science/api/pith-number/QWONT5LSZUTZAZ2MOJHWX25EZM/graph.json","events_json":"https://pith.science/api/pith-number/QWONT5LSZUTZAZ2MOJHWX25EZM/events.json","paper":"https://pith.science/paper/QWONT5LS"},"agent_actions":{"view_html":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM","download_json":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM.json","view_paper":"https://pith.science/paper/QWONT5LS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.12817&json=true","fetch_graph":"https://pith.science/api/pith-number/QWONT5LSZUTZAZ2MOJHWX25EZM/graph.json","fetch_events":"https://pith.science/api/pith-number/QWONT5LSZUTZAZ2MOJHWX25EZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM/action/storage_attestation","attest_author":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM/action/author_attestation","sign_citation":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM/action/citation_signature","submit_replication":"https://pith.science/pith/QWONT5LSZUTZAZ2MOJHWX25EZM/action/replication_record"}},"created_at":"2026-07-05T10:46:51.930786+00:00","updated_at":"2026-07-05T10:46:51.930786+00:00"}