{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3Y3C5IMSHGUEPUDDF5BJO64MCJ","short_pith_number":"pith:3Y3C5IMS","schema_version":"1.0","canonical_sha256":"de362ea19239a847d0632f42977b8c125348135d09386edb80567bd8768932cd","source":{"kind":"arxiv","id":"1201.2097","version":4},"attestation_state":"computed","paper":{"title":"Partial Searchlight Scheduling is Strongly PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Giovanni Viglietta","submitted_at":"2012-01-10T16:12:35Z","abstract_excerpt":"The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Scheduling Problem. Determining the computational complexity of deciding if the polygon can be searched by a given set of guards is a long-standing open problem.\n  Here we propose a generalization called the Partial Searchlight Scheduling Problem, in which only a given subregion of the environment has to be searched, as opposed to the entire area. We prove that the corresponding decision problem is strongly PSPACE-complet"},"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":"1201.2097","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-01-10T16:12:35Z","cross_cats_sorted":[],"title_canon_sha256":"63f700e162807cd0076c1fa11dd198f23deafaa222a1aa15f4c06942cdc9984e","abstract_canon_sha256":"ac89fcaf3980c063535477eb1ee29319bdb18cc5691df7320316492a58a4acb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.599159Z","signature_b64":"YPQJy74V/oOhEpyI/AU+r+sAVrIPqADU9ecXceRKzYgsEqcHCLtXwT8jXsLYxdoXHXiZTWK/o4zZWcAFVWbGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de362ea19239a847d0632f42977b8c125348135d09386edb80567bd8768932cd","last_reissued_at":"2026-05-18T02:21:18.598457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.598457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Searchlight Scheduling is Strongly PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Giovanni Viglietta","submitted_at":"2012-01-10T16:12:35Z","abstract_excerpt":"The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Scheduling Problem. Determining the computational complexity of deciding if the polygon can be searched by a given set of guards is a long-standing open problem.\n  Here we propose a generalization called the Partial Searchlight Scheduling Problem, in which only a given subregion of the environment has to be searched, as opposed to the entire area. We prove that the corresponding decision problem is strongly PSPACE-complet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2097","kind":"arxiv","version":4},"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":"1201.2097","created_at":"2026-05-18T02:21:18.598560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.2097v4","created_at":"2026-05-18T02:21:18.598560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2097","created_at":"2026-05-18T02:21:18.598560+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Y3C5IMSHGUE","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Y3C5IMSHGUEPUDD","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Y3C5IMS","created_at":"2026-05-18T12:26:53.410803+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/3Y3C5IMSHGUEPUDDF5BJO64MCJ","json":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ.json","graph_json":"https://pith.science/api/pith-number/3Y3C5IMSHGUEPUDDF5BJO64MCJ/graph.json","events_json":"https://pith.science/api/pith-number/3Y3C5IMSHGUEPUDDF5BJO64MCJ/events.json","paper":"https://pith.science/paper/3Y3C5IMS"},"agent_actions":{"view_html":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ","download_json":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ.json","view_paper":"https://pith.science/paper/3Y3C5IMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.2097&json=true","fetch_graph":"https://pith.science/api/pith-number/3Y3C5IMSHGUEPUDDF5BJO64MCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3Y3C5IMSHGUEPUDDF5BJO64MCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/action/storage_attestation","attest_author":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/action/author_attestation","sign_citation":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/action/citation_signature","submit_replication":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/action/replication_record"}},"created_at":"2026-05-18T02:21:18.598560+00:00","updated_at":"2026-05-18T02:21:18.598560+00:00"}