{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CW5CVAY3EFHLGFG6RVWOAGL3KE","short_pith_number":"pith:CW5CVAY3","schema_version":"1.0","canonical_sha256":"15ba2a831b214eb314de8d6ce0197b51080e8d1253f1fbd7590d35b202175e5b","source":{"kind":"arxiv","id":"2412.15053","version":2},"attestation_state":"computed","paper":{"title":"Contiguous Boundary Guarding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell, Saeed Odak, Thomas Shermer, Valentin Polishchuk","submitted_at":"2024-12-19T17:00:22Z","abstract_excerpt":"We study the problem of guarding the boundary of a simple polygon with a minimum number of guards such that each guard covers a contiguous portion of the boundary. First, we present a simple greedy algorithm for this problem that returns a guard set of size at most OPT + 1, where OPT is the number of guards in an optimal solution. Then, we present a polynomial-time exact algorithm. While the algorithm is not complicated, its correctness proof is rather involved. This result is interesting in the sense that guarding problems are typically NP-hard and, in particular, it is NP-hard to minimize th"},"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":"2412.15053","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-12-19T17:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"5de44b91d09e5e97ff1502e96200beb46db39a5b15e70aaa6aee8c468e7485ad","abstract_canon_sha256":"e181e96d7ebf29fb326f81f9e796979bfe4a2bbcf445ef274809589922e87513"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:03.175935Z","signature_b64":"5wBhijsi9H3D8qpx0gDdsmB+lKPav/HYdKb7NgIrQ+UHCyQcWtp6wrZ/jq3D4fW47wFZahh8ovcNWYzwO+hdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15ba2a831b214eb314de8d6ce0197b51080e8d1253f1fbd7590d35b202175e5b","last_reissued_at":"2026-07-05T11:00:03.175445Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:03.175445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contiguous Boundary Guarding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Joseph S. B. Mitchell, Saeed Odak, Thomas Shermer, Valentin Polishchuk","submitted_at":"2024-12-19T17:00:22Z","abstract_excerpt":"We study the problem of guarding the boundary of a simple polygon with a minimum number of guards such that each guard covers a contiguous portion of the boundary. First, we present a simple greedy algorithm for this problem that returns a guard set of size at most OPT + 1, where OPT is the number of guards in an optimal solution. Then, we present a polynomial-time exact algorithm. While the algorithm is not complicated, its correctness proof is rather involved. This result is interesting in the sense that guarding problems are typically NP-hard and, in particular, it is NP-hard to minimize th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15053","kind":"arxiv","version":2},"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/2412.15053/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":"2412.15053","created_at":"2026-07-05T11:00:03.175505+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.15053v2","created_at":"2026-07-05T11:00:03.175505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15053","created_at":"2026-07-05T11:00:03.175505+00:00"},{"alias_kind":"pith_short_12","alias_value":"CW5CVAY3EFHL","created_at":"2026-07-05T11:00:03.175505+00:00"},{"alias_kind":"pith_short_16","alias_value":"CW5CVAY3EFHLGFG6","created_at":"2026-07-05T11:00:03.175505+00:00"},{"alias_kind":"pith_short_8","alias_value":"CW5CVAY3","created_at":"2026-07-05T11:00:03.175505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.02960","citing_title":"The Contiguous Art Gallery Problem is in {\\Theta}(n log n)","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE","json":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE.json","graph_json":"https://pith.science/api/pith-number/CW5CVAY3EFHLGFG6RVWOAGL3KE/graph.json","events_json":"https://pith.science/api/pith-number/CW5CVAY3EFHLGFG6RVWOAGL3KE/events.json","paper":"https://pith.science/paper/CW5CVAY3"},"agent_actions":{"view_html":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE","download_json":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE.json","view_paper":"https://pith.science/paper/CW5CVAY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.15053&json=true","fetch_graph":"https://pith.science/api/pith-number/CW5CVAY3EFHLGFG6RVWOAGL3KE/graph.json","fetch_events":"https://pith.science/api/pith-number/CW5CVAY3EFHLGFG6RVWOAGL3KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE/action/storage_attestation","attest_author":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE/action/author_attestation","sign_citation":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE/action/citation_signature","submit_replication":"https://pith.science/pith/CW5CVAY3EFHLGFG6RVWOAGL3KE/action/replication_record"}},"created_at":"2026-07-05T11:00:03.175505+00:00","updated_at":"2026-07-05T11:00:03.175505+00:00"}