{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4N7WWSTCEMK7FBNRTCSHPSU55U","short_pith_number":"pith:4N7WWSTC","schema_version":"1.0","canonical_sha256":"e37f6b4a622315f285b198a477ca9ded0b819fe278f0d485c59d3e5568572938","source":{"kind":"arxiv","id":"2508.09734","version":1},"attestation_state":"computed","paper":{"title":"Simpler and Faster Contiguous Art Gallery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Ivor van der Hoog, Jacobus Conradi, Sarita de Berg","submitted_at":"2025-08-13T11:59:58Z","abstract_excerpt":"The contiguous art gallery problem was introduced at SoCG'25 in a merged paper that combined three simultaneous results, each achieving a polynomial-time algorithm for the problem. This problem is a variant of the classical art gallery problem, first introduced by Klee in 1973. In the contiguous art gallery problem, we are given a polygon P and asked to determine the minimum number of guards needed, where each guard is assigned a contiguous portion of the boundary of P that it can see, such that all assigned portions together cover the boundary of P. The classical art gallery problem is NP-har"},"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":"2508.09734","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-08-13T11:59:58Z","cross_cats_sorted":[],"title_canon_sha256":"f55b3edd73409fc825bdf59d7985493c2a567cb945835fe35db77f7af88abbf1","abstract_canon_sha256":"bf9654ea535447afb9e9f4475419fb5f1f22a875a0fd37a158ccd7c3a8040313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:20.957227Z","signature_b64":"Cf/ikdJ8hXgMBWXCX+SWHeXit3ecBPHIOPavpDCVto0CdGsFFTu8/JN4HabCEO0fZB1HmfyirHrG/ZRHuEehDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37f6b4a622315f285b198a477ca9ded0b819fe278f0d485c59d3e5568572938","last_reissued_at":"2026-07-05T11:53:20.956725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:20.956725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simpler and Faster Contiguous Art Gallery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Ivor van der Hoog, Jacobus Conradi, Sarita de Berg","submitted_at":"2025-08-13T11:59:58Z","abstract_excerpt":"The contiguous art gallery problem was introduced at SoCG'25 in a merged paper that combined three simultaneous results, each achieving a polynomial-time algorithm for the problem. This problem is a variant of the classical art gallery problem, first introduced by Klee in 1973. In the contiguous art gallery problem, we are given a polygon P and asked to determine the minimum number of guards needed, where each guard is assigned a contiguous portion of the boundary of P that it can see, such that all assigned portions together cover the boundary of P. The classical art gallery problem is NP-har"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09734","kind":"arxiv","version":1},"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/2508.09734/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":"2508.09734","created_at":"2026-07-05T11:53:20.956785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.09734v1","created_at":"2026-07-05T11:53:20.956785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09734","created_at":"2026-07-05T11:53:20.956785+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N7WWSTCEMK7","created_at":"2026-07-05T11:53:20.956785+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N7WWSTCEMK7FBNR","created_at":"2026-07-05T11:53:20.956785+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N7WWSTC","created_at":"2026-07-05T11:53:20.956785+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/4N7WWSTCEMK7FBNRTCSHPSU55U","json":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U.json","graph_json":"https://pith.science/api/pith-number/4N7WWSTCEMK7FBNRTCSHPSU55U/graph.json","events_json":"https://pith.science/api/pith-number/4N7WWSTCEMK7FBNRTCSHPSU55U/events.json","paper":"https://pith.science/paper/4N7WWSTC"},"agent_actions":{"view_html":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U","download_json":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U.json","view_paper":"https://pith.science/paper/4N7WWSTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.09734&json=true","fetch_graph":"https://pith.science/api/pith-number/4N7WWSTCEMK7FBNRTCSHPSU55U/graph.json","fetch_events":"https://pith.science/api/pith-number/4N7WWSTCEMK7FBNRTCSHPSU55U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U/action/storage_attestation","attest_author":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U/action/author_attestation","sign_citation":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U/action/citation_signature","submit_replication":"https://pith.science/pith/4N7WWSTCEMK7FBNRTCSHPSU55U/action/replication_record"}},"created_at":"2026-07-05T11:53:20.956785+00:00","updated_at":"2026-07-05T11:53:20.956785+00:00"}