{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6YIENMDNEOORIWL64I7S43QKCW","short_pith_number":"pith:6YIENMDN","canonical_record":{"source":{"id":"1706.01623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-06T06:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"9e9c7b576c6b14b9e437d676ed235cb7c5c079492c3f0fc8628360c59ada9b4e","abstract_canon_sha256":"b60ab0c1c027e833e296425d6b9d2240259b0fae0610f9d972fbe9ccf9bdf966"},"schema_version":"1.0"},"canonical_sha256":"f61046b06d239d14597ee23f2e6e0a15b900616d7c8c34580b19163b3b63ad65","source":{"kind":"arxiv","id":"1706.01623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01623","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01623v1","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01623","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"6YIENMDNEOOR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YIENMDNEOORIWL6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YIENMDN","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6YIENMDNEOORIWL64I7S43QKCW","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-06T06:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"9e9c7b576c6b14b9e437d676ed235cb7c5c079492c3f0fc8628360c59ada9b4e","abstract_canon_sha256":"b60ab0c1c027e833e296425d6b9d2240259b0fae0610f9d972fbe9ccf9bdf966"},"schema_version":"1.0"},"canonical_sha256":"f61046b06d239d14597ee23f2e6e0a15b900616d7c8c34580b19163b3b63ad65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:56.499685Z","signature_b64":"nt2OcLhHrnMg2SP2XbHajf4ngHO578lT0QOo5KZlFmHbERqnQ66EUMishr+0jCwQXZguu5rEKZSPVF5Inc/BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f61046b06d239d14597ee23f2e6e0a15b900616d7c8c34580b19163b3b63ad65","last_reissued_at":"2026-05-18T00:42:56.498995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:56.498995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01623","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-18T00:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ft8PCI2O4uLoArzsn14yFs+TZ7tobZ2SQUGfKdcHPqNtMpJtzADIICGXKMm6ROy94ZSQr5R5KM0NIfZhdSODDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:08:51.373755Z"},"content_sha256":"68811d3b4315e5479b94997c5e43d180dd86e1fde0d400c67f73aea08e9a37c6","schema_version":"1.0","event_id":"sha256:68811d3b4315e5479b94997c5e43d180dd86e1fde0d400c67f73aea08e9a37c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6YIENMDNEOORIWL64I7S43QKCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hong Shen, Longkun Guo","submitted_at":"2017-06-06T06:51:02Z","abstract_excerpt":"Given a line barrier and a set of mobile sensors distributed in the plane, the Minimizing Maximum Sensor Movement problem (MMSM) for \\textcolor{black}{line barrier coverage} is to compute relocation positions for the sensors in the plane such that the barrier is entirely covered by the monitoring area of the sensors while the maximum relocation movement (distance) is minimized. Its weaker version, decision MMSM is to determine whether the barrier can be covered by the sensors within a given relocation distance bound $D\\in\\mathbb{Z}^{+}$.\n  This paper presents three approximation algorithms for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01623","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-18T00:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSfKJzImj/lb7+IeTkPz/KxTeUOQA5uZAAjYhRnTaORffVyqgPZA3jsLqmuV/FyaEQZNksZTJ6d/1+r8H1vpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:08:51.374184Z"},"content_sha256":"723a3e9f5ca08e87b790e41b289befd37df27e24549c7a401af7839d2bf7a95d","schema_version":"1.0","event_id":"sha256:723a3e9f5ca08e87b790e41b289befd37df27e24549c7a401af7839d2bf7a95d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YIENMDNEOORIWL64I7S43QKCW/bundle.json","state_url":"https://pith.science/pith/6YIENMDNEOORIWL64I7S43QKCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YIENMDNEOORIWL64I7S43QKCW/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-05-21T09:08:51Z","links":{"resolver":"https://pith.science/pith/6YIENMDNEOORIWL64I7S43QKCW","bundle":"https://pith.science/pith/6YIENMDNEOORIWL64I7S43QKCW/bundle.json","state":"https://pith.science/pith/6YIENMDNEOORIWL64I7S43QKCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YIENMDNEOORIWL64I7S43QKCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6YIENMDNEOORIWL64I7S43QKCW","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":"b60ab0c1c027e833e296425d6b9d2240259b0fae0610f9d972fbe9ccf9bdf966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-06T06:51:02Z","title_canon_sha256":"9e9c7b576c6b14b9e437d676ed235cb7c5c079492c3f0fc8628360c59ada9b4e"},"schema_version":"1.0","source":{"id":"1706.01623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01623","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01623v1","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01623","created_at":"2026-05-18T00:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"6YIENMDNEOOR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YIENMDNEOORIWL6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YIENMDN","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:723a3e9f5ca08e87b790e41b289befd37df27e24549c7a401af7839d2bf7a95d","target":"graph","created_at":"2026-05-18T00:42:56Z","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":"Given a line barrier and a set of mobile sensors distributed in the plane, the Minimizing Maximum Sensor Movement problem (MMSM) for \\textcolor{black}{line barrier coverage} is to compute relocation positions for the sensors in the plane such that the barrier is entirely covered by the monitoring area of the sensors while the maximum relocation movement (distance) is minimized. Its weaker version, decision MMSM is to determine whether the barrier can be covered by the sensors within a given relocation distance bound $D\\in\\mathbb{Z}^{+}$.\n  This paper presents three approximation algorithms for","authors_text":"Hong Shen, Longkun Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-06T06:51:02Z","title":"Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01623","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:68811d3b4315e5479b94997c5e43d180dd86e1fde0d400c67f73aea08e9a37c6","target":"record","created_at":"2026-05-18T00:42:56Z","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":"b60ab0c1c027e833e296425d6b9d2240259b0fae0610f9d972fbe9ccf9bdf966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-06T06:51:02Z","title_canon_sha256":"9e9c7b576c6b14b9e437d676ed235cb7c5c079492c3f0fc8628360c59ada9b4e"},"schema_version":"1.0","source":{"id":"1706.01623","kind":"arxiv","version":1}},"canonical_sha256":"f61046b06d239d14597ee23f2e6e0a15b900616d7c8c34580b19163b3b63ad65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f61046b06d239d14597ee23f2e6e0a15b900616d7c8c34580b19163b3b63ad65","first_computed_at":"2026-05-18T00:42:56.498995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:56.498995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nt2OcLhHrnMg2SP2XbHajf4ngHO578lT0QOo5KZlFmHbERqnQ66EUMishr+0jCwQXZguu5rEKZSPVF5Inc/BBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:56.499685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68811d3b4315e5479b94997c5e43d180dd86e1fde0d400c67f73aea08e9a37c6","sha256:723a3e9f5ca08e87b790e41b289befd37df27e24549c7a401af7839d2bf7a95d"],"state_sha256":"d03643847c25e61e68142a6dd3d594cf2136f08030ad0dd2b057772011f8193c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mr2A1n/gfU0btLfrjFwahQg7gr+S5hzgK3YVy9hhKlu3BxLpj8FdcwFFA/E33LN9uqZILKxiJIflmqrRKzbMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T09:08:51.376417Z","bundle_sha256":"73e4dfc95e34a578ece4a74e082ce0743808c7d76a283c326a2634385ad4b571"}}