{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4NB6OYTIQTUT7BA6VOPFMPOHVN","short_pith_number":"pith:4NB6OYTI","schema_version":"1.0","canonical_sha256":"e343e7626884e93f841eab9e563dc7ab6e937b648f1021100d3a3a818d778f72","source":{"kind":"arxiv","id":"1405.6564","version":3},"attestation_state":"computed","paper":{"title":"A PTAS for the continuous 1.5D Terrain Guarding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christiane Schmidt, Michael Hemmer, Stephan Friedrichs","submitted_at":"2014-05-26T13:13:37Z","abstract_excerpt":"In the continuous 1.5-dimensional terrain guarding problem we are given an $x$-monotone chain (the \\emph{terrain} $T$) and ask for the minimum number of point guards (located anywhere on $T$), such that all points of $T$ are covered by at least one guard. It has been shown that the 1.5-dimensional terrain guarding problem is \\NP-hard. The currently best known approximation algorithm achieves a factor of $4$. For the discrete problem version with a finite set of guard candidates and a finite set of points on the terrain that need to be monitored, a polynomial time approximation scheme (PTAS) ha"},"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":"1405.6564","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-26T13:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"90a428d881bcc3d5224bc42ecbfe0df2d2bf410ea84ff694b94989f9e8cbc001","abstract_canon_sha256":"5685db56a3cdea35cdd621ea2004ee4a53fd7d298ff90890e5cab1f6602a43bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:24.213951Z","signature_b64":"VQlACP+fSixWAqmrd/r/DUrCXkN49sg5MILI5eq/5PqxkZUi4VXuC6DRqawmi62HPI5RMwAyNniWqSyPFgjxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e343e7626884e93f841eab9e563dc7ab6e937b648f1021100d3a3a818d778f72","last_reissued_at":"2026-05-18T02:46:24.213538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:24.213538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A PTAS for the continuous 1.5D Terrain Guarding Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christiane Schmidt, Michael Hemmer, Stephan Friedrichs","submitted_at":"2014-05-26T13:13:37Z","abstract_excerpt":"In the continuous 1.5-dimensional terrain guarding problem we are given an $x$-monotone chain (the \\emph{terrain} $T$) and ask for the minimum number of point guards (located anywhere on $T$), such that all points of $T$ are covered by at least one guard. It has been shown that the 1.5-dimensional terrain guarding problem is \\NP-hard. The currently best known approximation algorithm achieves a factor of $4$. For the discrete problem version with a finite set of guard candidates and a finite set of points on the terrain that need to be monitored, a polynomial time approximation scheme (PTAS) ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6564","kind":"arxiv","version":3},"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":"1405.6564","created_at":"2026-05-18T02:46:24.213593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6564v3","created_at":"2026-05-18T02:46:24.213593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6564","created_at":"2026-05-18T02:46:24.213593+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NB6OYTIQTUT","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NB6OYTIQTUT7BA6","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NB6OYTI","created_at":"2026-05-18T12:28:14.216126+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/4NB6OYTIQTUT7BA6VOPFMPOHVN","json":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN.json","graph_json":"https://pith.science/api/pith-number/4NB6OYTIQTUT7BA6VOPFMPOHVN/graph.json","events_json":"https://pith.science/api/pith-number/4NB6OYTIQTUT7BA6VOPFMPOHVN/events.json","paper":"https://pith.science/paper/4NB6OYTI"},"agent_actions":{"view_html":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN","download_json":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN.json","view_paper":"https://pith.science/paper/4NB6OYTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6564&json=true","fetch_graph":"https://pith.science/api/pith-number/4NB6OYTIQTUT7BA6VOPFMPOHVN/graph.json","fetch_events":"https://pith.science/api/pith-number/4NB6OYTIQTUT7BA6VOPFMPOHVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/action/storage_attestation","attest_author":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/action/author_attestation","sign_citation":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/action/citation_signature","submit_replication":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/action/replication_record"}},"created_at":"2026-05-18T02:46:24.213593+00:00","updated_at":"2026-05-18T02:46:24.213593+00:00"}