{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KYDVHUC53E5L23A5JNRDZUNNKA","short_pith_number":"pith:KYDVHUC5","canonical_record":{"source":{"id":"1505.05106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-19T18:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"2abae871586cedac20d85da05df5dee84918cf0058cba275ca0968cd6f312466","abstract_canon_sha256":"e54da72ced0f18feb6504854f45f9edfceecfce1c085b623dfd020e782a0b254"},"schema_version":"1.0"},"canonical_sha256":"560753d05dd93abd6c1d4b623cd1ad502bcba2547a74a1ab73c44d27e932e5d3","source":{"kind":"arxiv","id":"1505.05106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05106","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05106v1","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05106","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"KYDVHUC53E5L","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KYDVHUC53E5L23A5","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KYDVHUC5","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KYDVHUC53E5L23A5JNRDZUNNKA","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-19T18:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"2abae871586cedac20d85da05df5dee84918cf0058cba275ca0968cd6f312466","abstract_canon_sha256":"e54da72ced0f18feb6504854f45f9edfceecfce1c085b623dfd020e782a0b254"},"schema_version":"1.0"},"canonical_sha256":"560753d05dd93abd6c1d4b623cd1ad502bcba2547a74a1ab73c44d27e932e5d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:22.173831Z","signature_b64":"H39HcOJGLZdIlnt1Ni11s7uEdeuL+LJAF4wAb9YH9ysRLW41kDhiUWB0B4jfxp39lfozdn8yZDLxXumER1sbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"560753d05dd93abd6c1d4b623cd1ad502bcba2547a74a1ab73c44d27e932e5d3","last_reissued_at":"2026-05-18T02:05:22.173156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:22.173156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05106","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-05-18T02:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ia/uCN9lllwKq9WCaiaRM0O3SUk82rW2aRBbOkUXbS2gHMDKPPjdQkjh0ISSl0ncsov5+vOQruJztLz7zuFwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:30:45.048084Z"},"content_sha256":"ac05711dc01255b9b72016e791721a3d31ed2e10e748680f446f950f38307e93","schema_version":"1.0","event_id":"sha256:ac05711dc01255b9b72016e791721a3d31ed2e10e748680f446f950f38307e93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KYDVHUC53E5L23A5JNRDZUNNKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Chan-Su Shin, Sang Won Bae","submitted_at":"2015-05-19T18:15:07Z","abstract_excerpt":"We establish tight bounds for beacon-based coverage problems, and improve the bounds for beacon-based routing problems in simple rectilinear polygons. Specifically, we show that $\\lfloor \\frac{n}{6} \\rfloor$ beacons are always sufficient and sometimes necessary to cover a simple rectilinear polygon $P$ with $n$ vertices. We also prove tight bounds for the case where $P$ is monotone, and we present an optimal linear-time algorithm that computes the beacon-based kernel of $P$. For the routing problem, we show that $\\lfloor \\frac{3n-4}{8} \\rfloor - 1$ beacons are always sufficient, and $\\lceil \\f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05106","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":""},"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:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEP82ooaEHLIxDSnCLh0SmsARYiS6iBowL++CEFnhxzOUhDZh0YhAZmNLuKIUPsYj0gqKF8Bhn4p0SZI3xK5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:30:45.048730Z"},"content_sha256":"1f9777ceaed7d1f41fad8c942b970510978346232716d3418b30c4287d45d3bd","schema_version":"1.0","event_id":"sha256:1f9777ceaed7d1f41fad8c942b970510978346232716d3418b30c4287d45d3bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYDVHUC53E5L23A5JNRDZUNNKA/bundle.json","state_url":"https://pith.science/pith/KYDVHUC53E5L23A5JNRDZUNNKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYDVHUC53E5L23A5JNRDZUNNKA/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-06T19:30:45Z","links":{"resolver":"https://pith.science/pith/KYDVHUC53E5L23A5JNRDZUNNKA","bundle":"https://pith.science/pith/KYDVHUC53E5L23A5JNRDZUNNKA/bundle.json","state":"https://pith.science/pith/KYDVHUC53E5L23A5JNRDZUNNKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYDVHUC53E5L23A5JNRDZUNNKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KYDVHUC53E5L23A5JNRDZUNNKA","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":"e54da72ced0f18feb6504854f45f9edfceecfce1c085b623dfd020e782a0b254","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-19T18:15:07Z","title_canon_sha256":"2abae871586cedac20d85da05df5dee84918cf0058cba275ca0968cd6f312466"},"schema_version":"1.0","source":{"id":"1505.05106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05106","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05106v1","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05106","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"KYDVHUC53E5L","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KYDVHUC53E5L23A5","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KYDVHUC5","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:1f9777ceaed7d1f41fad8c942b970510978346232716d3418b30c4287d45d3bd","target":"graph","created_at":"2026-05-18T02:05:22Z","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":"We establish tight bounds for beacon-based coverage problems, and improve the bounds for beacon-based routing problems in simple rectilinear polygons. Specifically, we show that $\\lfloor \\frac{n}{6} \\rfloor$ beacons are always sufficient and sometimes necessary to cover a simple rectilinear polygon $P$ with $n$ vertices. We also prove tight bounds for the case where $P$ is monotone, and we present an optimal linear-time algorithm that computes the beacon-based kernel of $P$. For the routing problem, we show that $\\lfloor \\frac{3n-4}{8} \\rfloor - 1$ beacons are always sufficient, and $\\lceil \\f","authors_text":"Antoine Vigneron, Chan-Su Shin, Sang Won Bae","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-19T18:15:07Z","title":"Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05106","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:ac05711dc01255b9b72016e791721a3d31ed2e10e748680f446f950f38307e93","target":"record","created_at":"2026-05-18T02:05:22Z","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":"e54da72ced0f18feb6504854f45f9edfceecfce1c085b623dfd020e782a0b254","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-19T18:15:07Z","title_canon_sha256":"2abae871586cedac20d85da05df5dee84918cf0058cba275ca0968cd6f312466"},"schema_version":"1.0","source":{"id":"1505.05106","kind":"arxiv","version":1}},"canonical_sha256":"560753d05dd93abd6c1d4b623cd1ad502bcba2547a74a1ab73c44d27e932e5d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"560753d05dd93abd6c1d4b623cd1ad502bcba2547a74a1ab73c44d27e932e5d3","first_computed_at":"2026-05-18T02:05:22.173156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:22.173156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H39HcOJGLZdIlnt1Ni11s7uEdeuL+LJAF4wAb9YH9ysRLW41kDhiUWB0B4jfxp39lfozdn8yZDLxXumER1sbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:22.173831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac05711dc01255b9b72016e791721a3d31ed2e10e748680f446f950f38307e93","sha256:1f9777ceaed7d1f41fad8c942b970510978346232716d3418b30c4287d45d3bd"],"state_sha256":"463cdfccc51eb04621aacaca790e5ac641541712b36cd6b7ea2b1d576e6caf05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IL2DWsW7a+8m4t4yDKhzDj+xIR2+PHthnifeLKRkOvf2HKcov+hYo4xStoFkYnw9q9+7hr5LYH2hEsTWCJ/eAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:30:45.051763Z","bundle_sha256":"edbe4289138835c4f3639affd91fb3f1d0b1136a78ed4e22b17a0d7437437f02"}}