{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ITHC3KMIY2CESJFLW5CJEKISG6","short_pith_number":"pith:ITHC3KMI","schema_version":"1.0","canonical_sha256":"44ce2da988c6844924abb74492291237a50fa8db5c0100301ac4d0af00b11e13","source":{"kind":"arxiv","id":"1704.04332","version":2},"attestation_state":"computed","paper":{"title":"Point Sweep Coverage on Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dieyan Liang, Hong Shen","submitted_at":"2017-04-14T02:24:56Z","abstract_excerpt":"An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sweep Coverage is to deploy fewest sensors to periodically cover the set of PoIs. For PoIs in a Eulerian graph, this problem is known NP-Hard even if all sensors are with uniform velocity. In this paper, we study the problem when PoIs are on a line and prove that the decision version of the problem is NP-Complete if the sensors are with different velocities. We first formulate the problem of Max-PoI sweep coverage on p"},"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":"1704.04332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T02:24:56Z","cross_cats_sorted":[],"title_canon_sha256":"4e323e5e16e700beae44a206afff9026c9aecdc11e0a59337c7de56f3831027f","abstract_canon_sha256":"d69e0a7d6da6decb83d78d32058d67173dd89c51fe753327432bf7d12501236c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:33.692148Z","signature_b64":"biP/wWXCcV0pE+Jc6KhPHBqAoAq4w9qn0SoEvHLeLwnjjVVoBh8zJHBfDQMtJZj9/tQNjF0sPz/l9VPN3U0wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44ce2da988c6844924abb74492291237a50fa8db5c0100301ac4d0af00b11e13","last_reissued_at":"2026-05-18T00:41:33.691566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:33.691566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Point Sweep Coverage on Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dieyan Liang, Hong Shen","submitted_at":"2017-04-14T02:24:56Z","abstract_excerpt":"An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sweep Coverage is to deploy fewest sensors to periodically cover the set of PoIs. For PoIs in a Eulerian graph, this problem is known NP-Hard even if all sensors are with uniform velocity. In this paper, we study the problem when PoIs are on a line and prove that the decision version of the problem is NP-Complete if the sensors are with different velocities. We first formulate the problem of Max-PoI sweep coverage on p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04332","kind":"arxiv","version":2},"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":"1704.04332","created_at":"2026-05-18T00:41:33.691647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04332v2","created_at":"2026-05-18T00:41:33.691647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04332","created_at":"2026-05-18T00:41:33.691647+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITHC3KMIY2CE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITHC3KMIY2CESJFL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITHC3KMI","created_at":"2026-05-18T12:31:21.493067+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/ITHC3KMIY2CESJFLW5CJEKISG6","json":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6.json","graph_json":"https://pith.science/api/pith-number/ITHC3KMIY2CESJFLW5CJEKISG6/graph.json","events_json":"https://pith.science/api/pith-number/ITHC3KMIY2CESJFLW5CJEKISG6/events.json","paper":"https://pith.science/paper/ITHC3KMI"},"agent_actions":{"view_html":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6","download_json":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6.json","view_paper":"https://pith.science/paper/ITHC3KMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04332&json=true","fetch_graph":"https://pith.science/api/pith-number/ITHC3KMIY2CESJFLW5CJEKISG6/graph.json","fetch_events":"https://pith.science/api/pith-number/ITHC3KMIY2CESJFLW5CJEKISG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6/action/storage_attestation","attest_author":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6/action/author_attestation","sign_citation":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6/action/citation_signature","submit_replication":"https://pith.science/pith/ITHC3KMIY2CESJFLW5CJEKISG6/action/replication_record"}},"created_at":"2026-05-18T00:41:33.691647+00:00","updated_at":"2026-05-18T00:41:33.691647+00:00"}