{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4NB6OYTIQTUT7BA6VOPFMPOHVN","short_pith_number":"pith:4NB6OYTI","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"},"canonical_sha256":"e343e7626884e93f841eab9e563dc7ab6e937b648f1021100d3a3a818d778f72","source":{"kind":"arxiv","id":"1405.6564","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6564","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6564v3","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6564","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"4NB6OYTIQTUT","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4NB6OYTIQTUT7BA6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4NB6OYTI","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4NB6OYTIQTUT7BA6VOPFMPOHVN","target":"record","payload":{"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"},"canonical_sha256":"e343e7626884e93f841eab9e563dc7ab6e937b648f1021100d3a3a818d778f72","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"},"source_kind":"arxiv","source_id":"1405.6564","source_version":3,"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-05-18T02:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mb6AtowcCGAqf5vnKm7xxmQGWvWJijg3D9UKfRRfDkopYbFMx55J2ad3OfjbyapS3JzolhBhXIMeiD0BolpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:32:16.406209Z"},"content_sha256":"64cf749c5b4aafdff9bc75dc8d55fe1f982e940a1ae91cd9569257d6ed93108e","schema_version":"1.0","event_id":"sha256:64cf749c5b4aafdff9bc75dc8d55fe1f982e940a1ae91cd9569257d6ed93108e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4NB6OYTIQTUT7BA6VOPFMPOHVN","target":"graph","payload":{"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"},"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-05-18T02:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NU+O3a2HAv5Y1Khuc3DopbOYeu5RyOF+FiwAAS+dNpszfbeSQEN+BI0kMKvgPZ5J18kI+ETKVjm1A+36hl4QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:32:16.406886Z"},"content_sha256":"d19d2748530e486c144fb006fd296902900225f9a3d024f8c8effed7a62d40c9","schema_version":"1.0","event_id":"sha256:d19d2748530e486c144fb006fd296902900225f9a3d024f8c8effed7a62d40c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/bundle.json","state_url":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/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-06-09T02:32:16Z","links":{"resolver":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN","bundle":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/bundle.json","state":"https://pith.science/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NB6OYTIQTUT7BA6VOPFMPOHVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4NB6OYTIQTUT7BA6VOPFMPOHVN","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":"5685db56a3cdea35cdd621ea2004ee4a53fd7d298ff90890e5cab1f6602a43bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-26T13:13:37Z","title_canon_sha256":"90a428d881bcc3d5224bc42ecbfe0df2d2bf410ea84ff694b94989f9e8cbc001"},"schema_version":"1.0","source":{"id":"1405.6564","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6564","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6564v3","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6564","created_at":"2026-05-18T02:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"4NB6OYTIQTUT","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4NB6OYTIQTUT7BA6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4NB6OYTI","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:d19d2748530e486c144fb006fd296902900225f9a3d024f8c8effed7a62d40c9","target":"graph","created_at":"2026-05-18T02:46:24Z","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"},"paper":{"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","authors_text":"Christiane Schmidt, Michael Hemmer, Stephan Friedrichs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-26T13:13:37Z","title":"A PTAS for the continuous 1.5D Terrain Guarding Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6564","kind":"arxiv","version":3},"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:64cf749c5b4aafdff9bc75dc8d55fe1f982e940a1ae91cd9569257d6ed93108e","target":"record","created_at":"2026-05-18T02:46:24Z","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":"5685db56a3cdea35cdd621ea2004ee4a53fd7d298ff90890e5cab1f6602a43bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-26T13:13:37Z","title_canon_sha256":"90a428d881bcc3d5224bc42ecbfe0df2d2bf410ea84ff694b94989f9e8cbc001"},"schema_version":"1.0","source":{"id":"1405.6564","kind":"arxiv","version":3}},"canonical_sha256":"e343e7626884e93f841eab9e563dc7ab6e937b648f1021100d3a3a818d778f72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e343e7626884e93f841eab9e563dc7ab6e937b648f1021100d3a3a818d778f72","first_computed_at":"2026-05-18T02:46:24.213538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:24.213538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VQlACP+fSixWAqmrd/r/DUrCXkN49sg5MILI5eq/5PqxkZUi4VXuC6DRqawmi62HPI5RMwAyNniWqSyPFgjxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:24.213951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6564","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64cf749c5b4aafdff9bc75dc8d55fe1f982e940a1ae91cd9569257d6ed93108e","sha256:d19d2748530e486c144fb006fd296902900225f9a3d024f8c8effed7a62d40c9"],"state_sha256":"a6296c3ac1dd533b8cbef381f29fa362bb86e8a84b27222994b72bf5469a492a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JixHI6zDPqkXN1Jwm4CVLbN+JLPzQ7xA5KZj0YK5MkFrpaQDZnweQvyXcr6cjR95USI1CwOmBTQKtkaYtJXRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:32:16.411441Z","bundle_sha256":"ab8eb35ed59289d33a0ba9a944478fe9403dde3deef582d3cc86440da0a67765"}}