{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3Y3C5IMSHGUEPUDDF5BJO64MCJ","short_pith_number":"pith:3Y3C5IMS","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"},"canonical_sha256":"de362ea19239a847d0632f42977b8c125348135d09386edb80567bd8768932cd","source":{"kind":"arxiv","id":"1201.2097","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2097","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2097v4","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2097","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"3Y3C5IMSHGUE","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3Y3C5IMSHGUEPUDD","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3Y3C5IMS","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3Y3C5IMSHGUEPUDDF5BJO64MCJ","target":"record","payload":{"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"},"canonical_sha256":"de362ea19239a847d0632f42977b8c125348135d09386edb80567bd8768932cd","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"},"source_kind":"arxiv","source_id":"1201.2097","source_version":4,"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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZy+rP2BOK8Om+vouWxTsIELbbC6qNMsHp+S/zTn3XHrGmBjS/CjfuUsTGqFzeymhy6fyoUScM3oDpXW6XKRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:58:08.110504Z"},"content_sha256":"fe29dbb409150c2a324ce42a7b73e37f28367d1c477b8b6fe625427012be4f35","schema_version":"1.0","event_id":"sha256:fe29dbb409150c2a324ce42a7b73e37f28367d1c477b8b6fe625427012be4f35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3Y3C5IMSHGUEPUDDF5BJO64MCJ","target":"graph","payload":{"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"},"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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xYEEwn0XG6Bkh6KRF5UEIFdqKj2z3OmVBEJYnYR67in+HNRqq3rIlNNLbGK2YyqFvmJT0Q+berPooqJyjRSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:58:08.110849Z"},"content_sha256":"79381e58d318b1b98f1bfa24507d433c93f41d26386b3dc01584af50fa210447","schema_version":"1.0","event_id":"sha256:79381e58d318b1b98f1bfa24507d433c93f41d26386b3dc01584af50fa210447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/bundle.json","state_url":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/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-07-03T09:58:08Z","links":{"resolver":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ","bundle":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/bundle.json","state":"https://pith.science/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Y3C5IMSHGUEPUDDF5BJO64MCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3Y3C5IMSHGUEPUDDF5BJO64MCJ","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":"ac89fcaf3980c063535477eb1ee29319bdb18cc5691df7320316492a58a4acb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-01-10T16:12:35Z","title_canon_sha256":"63f700e162807cd0076c1fa11dd198f23deafaa222a1aa15f4c06942cdc9984e"},"schema_version":"1.0","source":{"id":"1201.2097","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2097","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2097v4","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2097","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"3Y3C5IMSHGUE","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3Y3C5IMSHGUEPUDD","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3Y3C5IMS","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:79381e58d318b1b98f1bfa24507d433c93f41d26386b3dc01584af50fa210447","target":"graph","created_at":"2026-05-18T02:21:18Z","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":"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","authors_text":"Giovanni Viglietta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-01-10T16:12:35Z","title":"Partial Searchlight Scheduling is Strongly PSPACE-Complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2097","kind":"arxiv","version":4},"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:fe29dbb409150c2a324ce42a7b73e37f28367d1c477b8b6fe625427012be4f35","target":"record","created_at":"2026-05-18T02:21:18Z","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":"ac89fcaf3980c063535477eb1ee29319bdb18cc5691df7320316492a58a4acb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-01-10T16:12:35Z","title_canon_sha256":"63f700e162807cd0076c1fa11dd198f23deafaa222a1aa15f4c06942cdc9984e"},"schema_version":"1.0","source":{"id":"1201.2097","kind":"arxiv","version":4}},"canonical_sha256":"de362ea19239a847d0632f42977b8c125348135d09386edb80567bd8768932cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de362ea19239a847d0632f42977b8c125348135d09386edb80567bd8768932cd","first_computed_at":"2026-05-18T02:21:18.598457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.598457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YPQJy74V/oOhEpyI/AU+r+sAVrIPqADU9ecXceRKzYgsEqcHCLtXwT8jXsLYxdoXHXiZTWK/o4zZWcAFVWbGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.599159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2097","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe29dbb409150c2a324ce42a7b73e37f28367d1c477b8b6fe625427012be4f35","sha256:79381e58d318b1b98f1bfa24507d433c93f41d26386b3dc01584af50fa210447"],"state_sha256":"af6077ec721854b90ce937cf3d737be0fcd8a94b42694665a2302a02369bd4bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oWkQsSdED8q83j58tDxyCjif+0zTxsUVIiVb49VxLiVbBaksQ2PVeG+l9R40sFTVjMguD3aavyR6ADpMgN7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:58:08.112750Z","bundle_sha256":"0fa7ea30d42418913b27a982c3e62ad85d827a1aed515a4ff18dc0383c393514"}}