{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XOIQDLQVMAJ3VZR6EY4COPNZI3","short_pith_number":"pith:XOIQDLQV","schema_version":"1.0","canonical_sha256":"bb9101ae156013bae63e2638273db946d03cec0fabc2a918c4448ea159430682","source":{"kind":"arxiv","id":"1410.5952","version":5},"attestation_state":"computed","paper":{"title":"Algorithms for Art Gallery Illumination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Kr\\\"oller, Christiane Schmidt, Jan Kokem\\\"uller, Mahdi Moeini, Maximilian Ernestus, Michael Hemmer, Stephan Friedrichs","submitted_at":"2014-10-22T08:59:34Z","abstract_excerpt":"The Art Gallery Problem (AGP) is one of the classical problems in computational geometry. It asks for the minimum number of guards required to achieve visibility coverage of a given polygon. The AGP is well-known to be NP-hard even in restricted cases. In this paper, we consider the Art Gallery Problem with Fading (AGPF): A polygonal region is to be illuminated with light sources such that every point is illuminated with at least a global threshold, light intensity decreases over distance, and we seek to minimize the total energy consumption. Choosing fading exponents of zero, one, and two are"},"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":"1410.5952","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-10-22T08:59:34Z","cross_cats_sorted":[],"title_canon_sha256":"a302c3b223af3b4a41bb51df4253e136267a35742b8c1d5a9f705dc0f703f34e","abstract_canon_sha256":"d3489c8648be54bb6fdfb990467f64e35d13283c12c20ac6bffbb61c71750a19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:28.824255Z","signature_b64":"DahKU/WHTjhjESgqhiY8/EkC/Hg6WFTaVsgGSROCONmmUgU4sDFkwx5u/gWJVHe0SOW9IDuoPt2xbWdi92akDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb9101ae156013bae63e2638273db946d03cec0fabc2a918c4448ea159430682","last_reissued_at":"2026-05-18T01:13:28.823819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:28.823819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Art Gallery Illumination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Kr\\\"oller, Christiane Schmidt, Jan Kokem\\\"uller, Mahdi Moeini, Maximilian Ernestus, Michael Hemmer, Stephan Friedrichs","submitted_at":"2014-10-22T08:59:34Z","abstract_excerpt":"The Art Gallery Problem (AGP) is one of the classical problems in computational geometry. It asks for the minimum number of guards required to achieve visibility coverage of a given polygon. The AGP is well-known to be NP-hard even in restricted cases. In this paper, we consider the Art Gallery Problem with Fading (AGPF): A polygonal region is to be illuminated with light sources such that every point is illuminated with at least a global threshold, light intensity decreases over distance, and we seek to minimize the total energy consumption. Choosing fading exponents of zero, one, and two are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5952","kind":"arxiv","version":5},"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":"1410.5952","created_at":"2026-05-18T01:13:28.823883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5952v5","created_at":"2026-05-18T01:13:28.823883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5952","created_at":"2026-05-18T01:13:28.823883+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOIQDLQVMAJ3","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOIQDLQVMAJ3VZR6","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOIQDLQV","created_at":"2026-05-18T12:28:57.508820+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/XOIQDLQVMAJ3VZR6EY4COPNZI3","json":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3.json","graph_json":"https://pith.science/api/pith-number/XOIQDLQVMAJ3VZR6EY4COPNZI3/graph.json","events_json":"https://pith.science/api/pith-number/XOIQDLQVMAJ3VZR6EY4COPNZI3/events.json","paper":"https://pith.science/paper/XOIQDLQV"},"agent_actions":{"view_html":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3","download_json":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3.json","view_paper":"https://pith.science/paper/XOIQDLQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5952&json=true","fetch_graph":"https://pith.science/api/pith-number/XOIQDLQVMAJ3VZR6EY4COPNZI3/graph.json","fetch_events":"https://pith.science/api/pith-number/XOIQDLQVMAJ3VZR6EY4COPNZI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3/action/storage_attestation","attest_author":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3/action/author_attestation","sign_citation":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3/action/citation_signature","submit_replication":"https://pith.science/pith/XOIQDLQVMAJ3VZR6EY4COPNZI3/action/replication_record"}},"created_at":"2026-05-18T01:13:28.823883+00:00","updated_at":"2026-05-18T01:13:28.823883+00:00"}