{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RM4VPLFJGW5CBVW52IV7VDOQDW","short_pith_number":"pith:RM4VPLFJ","schema_version":"1.0","canonical_sha256":"8b3957aca935ba20d6ddd22bfa8dd01d89191baa06c5c6c7b7f1274c5f517be7","source":{"kind":"arxiv","id":"2505.02373","version":1},"attestation_state":"computed","paper":{"title":"Guarding Terrains with Guards on a Line","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Byeonguk Kang, Hee-Kap Ahn, Hwi Kim","submitted_at":"2025-05-05T05:23:28Z","abstract_excerpt":"Given an $x$-monotone polygonal chain $T$ with $n$ vertices, and an integer $k$, we consider the problem of finding the lowest horizontal line $L$ lying above $T$ with $k$ point guards lying on $L$, so that every point on the chain is \\emph{visible} from some guard. A natural optimization is to minimize the $y$-coordinate of $L$. We present an algorithm for finding the optimal placements of $L$ and $k$ point guards for $T$ in $O(k^2\\lambda_{k-1}(n)\\log n)$ time for even numbers $k\\ge 2$, and in $O(k^2\\lambda_{k-2}(n)\\log n)$ time for odd numbers $k \\ge 3$, where $\\lambda_{s}(n)$ is the length "},"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":"2505.02373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-05T05:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"12682a6166591105abc22fc772ff070ba30ba2f799c23096acbbdd72c44b0040","abstract_canon_sha256":"8a3f10730f986ff12b277ca37966782cf5ad97b77baec10833dd860fbe0aacf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:36.127485Z","signature_b64":"4t4+V+FDXyqhRdXGAyKLrJg2u1EmIeHyktAFFdZwdIkIpM/TnyO/ZKk/hiKImf1MS9tkAsMqaJ5HGdp0Yvk8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b3957aca935ba20d6ddd22bfa8dd01d89191baa06c5c6c7b7f1274c5f517be7","last_reissued_at":"2026-07-05T10:58:36.126995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:36.126995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarding Terrains with Guards on a Line","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Byeonguk Kang, Hee-Kap Ahn, Hwi Kim","submitted_at":"2025-05-05T05:23:28Z","abstract_excerpt":"Given an $x$-monotone polygonal chain $T$ with $n$ vertices, and an integer $k$, we consider the problem of finding the lowest horizontal line $L$ lying above $T$ with $k$ point guards lying on $L$, so that every point on the chain is \\emph{visible} from some guard. A natural optimization is to minimize the $y$-coordinate of $L$. We present an algorithm for finding the optimal placements of $L$ and $k$ point guards for $T$ in $O(k^2\\lambda_{k-1}(n)\\log n)$ time for even numbers $k\\ge 2$, and in $O(k^2\\lambda_{k-2}(n)\\log n)$ time for odd numbers $k \\ge 3$, where $\\lambda_{s}(n)$ is the length "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02373","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/2505.02373/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":"2505.02373","created_at":"2026-07-05T10:58:36.127052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.02373v1","created_at":"2026-07-05T10:58:36.127052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02373","created_at":"2026-07-05T10:58:36.127052+00:00"},{"alias_kind":"pith_short_12","alias_value":"RM4VPLFJGW5C","created_at":"2026-07-05T10:58:36.127052+00:00"},{"alias_kind":"pith_short_16","alias_value":"RM4VPLFJGW5CBVW5","created_at":"2026-07-05T10:58:36.127052+00:00"},{"alias_kind":"pith_short_8","alias_value":"RM4VPLFJ","created_at":"2026-07-05T10:58:36.127052+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/RM4VPLFJGW5CBVW52IV7VDOQDW","json":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW.json","graph_json":"https://pith.science/api/pith-number/RM4VPLFJGW5CBVW52IV7VDOQDW/graph.json","events_json":"https://pith.science/api/pith-number/RM4VPLFJGW5CBVW52IV7VDOQDW/events.json","paper":"https://pith.science/paper/RM4VPLFJ"},"agent_actions":{"view_html":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW","download_json":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW.json","view_paper":"https://pith.science/paper/RM4VPLFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.02373&json=true","fetch_graph":"https://pith.science/api/pith-number/RM4VPLFJGW5CBVW52IV7VDOQDW/graph.json","fetch_events":"https://pith.science/api/pith-number/RM4VPLFJGW5CBVW52IV7VDOQDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/action/storage_attestation","attest_author":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/action/author_attestation","sign_citation":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/action/citation_signature","submit_replication":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/action/replication_record"}},"created_at":"2026-07-05T10:58:36.127052+00:00","updated_at":"2026-07-05T10:58:36.127052+00:00"}