{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RM4VPLFJGW5CBVW52IV7VDOQDW","short_pith_number":"pith:RM4VPLFJ","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"},"canonical_sha256":"8b3957aca935ba20d6ddd22bfa8dd01d89191baa06c5c6c7b7f1274c5f517be7","source":{"kind":"arxiv","id":"2505.02373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.02373","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"2505.02373v1","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02373","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"RM4VPLFJGW5C","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"pith_short_16","alias_value":"RM4VPLFJGW5CBVW5","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"pith_short_8","alias_value":"RM4VPLFJ","created_at":"2026-07-05T10:58:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RM4VPLFJGW5CBVW52IV7VDOQDW","target":"record","payload":{"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"},"canonical_sha256":"8b3957aca935ba20d6ddd22bfa8dd01d89191baa06c5c6c7b7f1274c5f517be7","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"},"source_kind":"arxiv","source_id":"2505.02373","source_version":1,"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-07-05T10:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fL8XDZpD0Ojwg7XwGqK2Piwdx1un0gGm4cH7f7dtVlAKqJDjVcbijt1BUSSz2/03170yzLgDe8UJjuyDA8FeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:52:25.052160Z"},"content_sha256":"348773822258c356280f2b6be2c5f689b03babc9674c2f86aa1c63a49a51803a","schema_version":"1.0","event_id":"sha256:348773822258c356280f2b6be2c5f689b03babc9674c2f86aa1c63a49a51803a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RM4VPLFJGW5CBVW52IV7VDOQDW","target":"graph","payload":{"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"},"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-07-05T10:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKmB/2Ep9Mw/2J1/HNOxRURKCR9YNMfkml2FzY+X8YcXsjwjjRMYB9nwwDoicSHRYPpzoIoRuK5cdNGpVaqXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:52:25.052777Z"},"content_sha256":"f7dfdaae1a402d092cb56a4f08bdd1a62665ae0747f653bd02c76de9c992264a","schema_version":"1.0","event_id":"sha256:f7dfdaae1a402d092cb56a4f08bdd1a62665ae0747f653bd02c76de9c992264a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/bundle.json","state_url":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/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-08-16T15:52:25Z","links":{"resolver":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW","bundle":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/bundle.json","state":"https://pith.science/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RM4VPLFJGW5CBVW52IV7VDOQDW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RM4VPLFJGW5CBVW52IV7VDOQDW","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":"8a3f10730f986ff12b277ca37966782cf5ad97b77baec10833dd860fbe0aacf3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-05T05:23:28Z","title_canon_sha256":"12682a6166591105abc22fc772ff070ba30ba2f799c23096acbbdd72c44b0040"},"schema_version":"1.0","source":{"id":"2505.02373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.02373","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"2505.02373v1","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02373","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"RM4VPLFJGW5C","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"pith_short_16","alias_value":"RM4VPLFJGW5CBVW5","created_at":"2026-07-05T10:58:36Z"},{"alias_kind":"pith_short_8","alias_value":"RM4VPLFJ","created_at":"2026-07-05T10:58:36Z"}],"graph_snapshots":[{"event_id":"sha256:f7dfdaae1a402d092cb56a4f08bdd1a62665ae0747f653bd02c76de9c992264a","target":"graph","created_at":"2026-07-05T10:58:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.02373/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Byeonguk Kang, Hee-Kap Ahn, Hwi Kim","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-05T05:23:28Z","title":"Guarding Terrains with Guards on a Line"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02373","kind":"arxiv","version":1},"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:348773822258c356280f2b6be2c5f689b03babc9674c2f86aa1c63a49a51803a","target":"record","created_at":"2026-07-05T10:58:36Z","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":"8a3f10730f986ff12b277ca37966782cf5ad97b77baec10833dd860fbe0aacf3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-05T05:23:28Z","title_canon_sha256":"12682a6166591105abc22fc772ff070ba30ba2f799c23096acbbdd72c44b0040"},"schema_version":"1.0","source":{"id":"2505.02373","kind":"arxiv","version":1}},"canonical_sha256":"8b3957aca935ba20d6ddd22bfa8dd01d89191baa06c5c6c7b7f1274c5f517be7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b3957aca935ba20d6ddd22bfa8dd01d89191baa06c5c6c7b7f1274c5f517be7","first_computed_at":"2026-07-05T10:58:36.126995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:36.126995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4t4+V+FDXyqhRdXGAyKLrJg2u1EmIeHyktAFFdZwdIkIpM/TnyO/ZKk/hiKImf1MS9tkAsMqaJ5HGdp0Yvk8BA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:36.127485Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.02373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:348773822258c356280f2b6be2c5f689b03babc9674c2f86aa1c63a49a51803a","sha256:f7dfdaae1a402d092cb56a4f08bdd1a62665ae0747f653bd02c76de9c992264a"],"state_sha256":"1ebc3f2badaa80cc7fefafb6e1b3c0f4253ec570511c8de6fedaefa4d6c4e1cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAt8NTr4Lae5VQQfwuJzxrJnP5/xzkY1BbW64zYcTSN8G+hjeByeKOkjDMxM0mGP+h75yyqEp28qEjs60n5vDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:52:25.057908Z","bundle_sha256":"081e0020bb37d15e07ff1a6e724a94e6d09a13db415594458ac209ce3868917f"}}