{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X4BUBDNRN4UK6BDTT5RIIAGCPF","short_pith_number":"pith:X4BUBDNR","schema_version":"1.0","canonical_sha256":"bf03408db16f28af04739f628400c2794cdae3a00ab4e6f23d22139dfef662ea","source":{"kind":"arxiv","id":"1412.2300","version":1},"attestation_state":"computed","paper":{"title":"Minimizing the Aggregate Movements for Interval Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Aaron M. Andrews, Haitao Wang","submitted_at":"2014-12-07T00:43:36Z","abstract_excerpt":"We consider an interval coverage problem. Given $n$ intervals of the same length on a line $L$ and a line segment $B$ on $L$, we want to move the intervals along $L$ such that every point of $B$ is covered by at least one interval and the sum of the moving distances of all intervals is minimized. As a basic geometry problem, it has applications in mobile sensor barrier coverage in wireless sensor networks. The previous work solved the problem in $O(n^2)$ time. In this paper, by discovering many interesting observations and developing new algorithmic techniques, we present an $O(n\\log n)$ time "},"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":"1412.2300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-07T00:43:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cf1293e93f85edc9834cf8961563d07ad510383f33aac6d1ff8250ce6545d2f4","abstract_canon_sha256":"24d10b55263d6636829e4bc21873f0659f041fd28d84f315db36b5f7795098b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:58.392705Z","signature_b64":"DuDuK/EsA9cIWu8E7rf1JEK70AvNxwQ/15meGcT5jmpAap5mrrs8BnXhxABb74YL4LPTZuZu01/ewAxu3dLwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf03408db16f28af04739f628400c2794cdae3a00ab4e6f23d22139dfef662ea","last_reissued_at":"2026-05-18T02:31:58.392156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:58.392156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing the Aggregate Movements for Interval Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Aaron M. Andrews, Haitao Wang","submitted_at":"2014-12-07T00:43:36Z","abstract_excerpt":"We consider an interval coverage problem. Given $n$ intervals of the same length on a line $L$ and a line segment $B$ on $L$, we want to move the intervals along $L$ such that every point of $B$ is covered by at least one interval and the sum of the moving distances of all intervals is minimized. As a basic geometry problem, it has applications in mobile sensor barrier coverage in wireless sensor networks. The previous work solved the problem in $O(n^2)$ time. In this paper, by discovering many interesting observations and developing new algorithmic techniques, we present an $O(n\\log n)$ time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2300","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.2300","created_at":"2026-05-18T02:31:58.392243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2300v1","created_at":"2026-05-18T02:31:58.392243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2300","created_at":"2026-05-18T02:31:58.392243+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4BUBDNRN4UK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4BUBDNRN4UK6BDT","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4BUBDNR","created_at":"2026-05-18T12:28:54.890064+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/X4BUBDNRN4UK6BDTT5RIIAGCPF","json":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF.json","graph_json":"https://pith.science/api/pith-number/X4BUBDNRN4UK6BDTT5RIIAGCPF/graph.json","events_json":"https://pith.science/api/pith-number/X4BUBDNRN4UK6BDTT5RIIAGCPF/events.json","paper":"https://pith.science/paper/X4BUBDNR"},"agent_actions":{"view_html":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF","download_json":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF.json","view_paper":"https://pith.science/paper/X4BUBDNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2300&json=true","fetch_graph":"https://pith.science/api/pith-number/X4BUBDNRN4UK6BDTT5RIIAGCPF/graph.json","fetch_events":"https://pith.science/api/pith-number/X4BUBDNRN4UK6BDTT5RIIAGCPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF/action/storage_attestation","attest_author":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF/action/author_attestation","sign_citation":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF/action/citation_signature","submit_replication":"https://pith.science/pith/X4BUBDNRN4UK6BDTT5RIIAGCPF/action/replication_record"}},"created_at":"2026-05-18T02:31:58.392243+00:00","updated_at":"2026-05-18T02:31:58.392243+00:00"}