midas-edge 0.1.0

data/lib/midas/detector.rb

@@ -0,0 +1,25 @@
+module Midas
+  class Detector
+    def initialize(rows: 2, buckets: 769, alpha: 0.6, relations: true, directed: true)
+      @rows = rows
+      @buckets = buckets
+      @alpha = alpha
+      @relations = relations
+      @directed = directed
+    end
+
+    def fit_predict(x)
+      result =
+        if x.is_a?(String)
+          _fit_predict_file(x, @rows, @buckets, @alpha, @relations, @directed)
+        else
+          x = Numo::Int32.cast(x) unless x.is_a?(Numo::NArray)
+          x = x.cast_to(Numo::Int32) unless x.is_a?(Numo::Int32)
+          raise ArgumentError, "Bad shape: #{x.shape}" unless x.rank == 2 && x.shape[1] == 3
+          _fit_predict_str(x.to_binary, @rows, @buckets, @alpha, @relations, @directed)
+        end
+
+      Numo::DFloat.from_binary(result)
+    end
+  end
+end

data/lib/midas/version.rb

@@ -0,0 +1,3 @@
+module Midas
+  VERSION = "0.1.0"
+end

data/vendor/MIDAS/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/vendor/MIDAS/README.md

@@ -0,0 +1,66 @@
+# MIDAS
+[![Conference](http://img.shields.io/badge/AAAI-2020-red.svg)](https://aaai.org/Conferences/AAAI-20/)
+[![Paper](http://img.shields.io/badge/Paper-pdf-brightgreen.svg)](https://www.comp.nus.edu.sg/~sbhatia/assets/pdf/midas.pdf)
+[![Poster](http://img.shields.io/badge/Poster-pdf-blueviolet.svg)](https://www.comp.nus.edu.sg/~sbhatia/assets/pdf/midasposter.pdf)
+[![License](https://img.shields.io/badge/License-Apache%202.0-blue.svg)](https://github.com/bhatiasiddharth/MIDAS/blob/master/LICENSE)
+
+<p align="center">
+  <img align="center" src="https://www.comp.nus.edu.sg/~sbhatia/assets/img/midasstream.png" alt="...">
+</p>
+
+
+Anomaly detection in graphs is a critical problem for finding suspicious behavior in innumerable systems, such as intrusion detection, fake ratings, and financial fraud. This has been a well-researched problem with majority of the proposed approaches focusing on static graphs. However, many real-world graphs are dynamic in nature, and methods based on static connections may miss temporal characteristics of the graphs and anomalies.
+
+Among the methods focusing on dynamic graphs, most of them have edges aggregated into graph snapshots. However, to minimize the effect of malicious activities and start recovery as soon as possible, we need to detect anomalies in real-time or near real-time i.e. to identify whether an incoming edge is anomalous or not, as soon as we receive it. In addition, since the number of vertices can increase as we process the stream of edges, we need an algorithm which uses constant memory in graph size. Moreover, fraudulent or anomalous events in many applications occur in microclusters or suddenly arriving groups of suspiciously similar edges e.g. denial of service attacks in network traffic data and lockstep behavior.
+
+In this work, we propose MIDAS, short for Microcluster-Based Detector of Anomalies in Edge Streams, which detects microcluster anomalies, or suddenly arriving groups of suspiciously similar edges, in edge streams, using constant time and memory. In addition, by using a principled hypothesis testing framework, MIDAS provides theoretical bounds on the false positive probability, which earlier methods do not provide. Also, we are up to 48% more accurate while being up to 644 times faster than state of the art approaches.
+
+For more details, please read the paper - [MIDAS:Microcluster-Based Detector of Anomalies in Edge Streams](https://www.comp.nus.edu.sg/~sbhatia/assets/pdf/midas.pdf). *Siddharth Bhatia, Bryan Hooi, Minji Yoon, Kijung Shin, Christos Faloutsos*. AAAI 2020.
+
+
+## Getting started
+1. Run `make` to compile code and create the binary.
+2. Run `./midas -i ` followed by the input file path and name.
+3. Run `make clean` to clean binaries.
+
+
+## Demo
+1. Run `./demo.sh` to compile the code and run it on example dataset.
+
+
+## Command line options
+  * `-h --help`: produce help message
+  * `-i --input`: input file name
+  * `-o --output`: output file name (default: scores.txt)  
+  * `-r --rows`: Number of Hash Functions (default: 2)  
+  * `-b --buckets`: Number of Buckets (default: 769)  
+  * `-a --alpha`: Temporal Decay Factor (default: 0.6)  
+  * `--norelations` : Run MIDAS instead of MIDAS-R
+  * `--undirected` : Treat graph as undirected instead of directed
+
+
+## Input file format
+MIDAS expects the input edge stream to be stored in a single file containing the following three columns in order:
+1. `source (int)`: source ID of the edge
+2. `destination (int)`: destination ID of the edge
+3. `time (int)`: time stamp of the edge
+
+Thus, each line represents an edge. Edges should be sorted in non-decreasing order of their time stamps and the column delimiter should be `,`
+
+
+## Datasets
+1. [DARPA](https://www.ll.mit.edu/r-d/datasets/1998-darpa-intrusion-detection-evaluation-dataset)
+2. [TwitterWorldCup2014](http://odds.cs.stonybrook.edu/twitterworldcup2014-dataset)
+3. [TwitterSecurity](http://odds.cs.stonybrook.edu/twittersecurity-dataset)
+
+## Citation
+If you use this code for your research, please consider citing our paper.
+
+```
+@article{bhatia2019midas,
+  title={MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams},
+  author={Bhatia, Siddharth and Hooi, Bryan and Yoon, Minji and Shin, Kijung and Faloutsos, Christos},
+  journal={arXiv preprint arXiv:1911.04464},
+  year={2019}
+}
+```

data/vendor/MIDAS/anom.cpp

@@ -0,0 +1,88 @@
+#define MIN(X, Y) (((X) < (Y)) ? (X) : (Y))
+#define MAX(X, Y) (((X) > (Y)) ? (X) : (Y))
+
+#include <iostream>
+#include <math.h>
+#include <algorithm>
+#include <vector>
+#include "anom.hpp"
+#include "edgehash.hpp"
+#include "nodehash.hpp"
+
+vector<double>* midas(vector<int>& src, vector<int>& dst, vector<int>& times, int num_rows, int num_buckets)
+{
+    int m = *max_element(src.begin(), src.end());
+    Edgehash cur_count(num_rows, num_buckets, m);
+    Edgehash total_count(num_rows, num_buckets, m);
+    vector<double>* anom_score = new vector<double>(src.size());
+    int cur_t = 1, size = src.size(), cur_src, cur_dst;
+    double cur_mean, sqerr, cur_score;
+    for (int i = 0; i < size; i++) {
+
+        if (i == 0 || times[i] > cur_t) {
+            cur_count.clear();
+            cur_t = times[i];
+        }
+
+        cur_src = src[i];
+        cur_dst = dst[i];
+        cur_count.insert(cur_src, cur_dst, 1);
+        total_count.insert(cur_src, cur_dst, 1);
+        cur_mean = total_count.get_count(cur_src, cur_dst) / cur_t;
+        sqerr = pow(cur_count.get_count(cur_src, cur_dst) - cur_mean, 2);
+        if (cur_t == 1) cur_score = 0;
+        else cur_score = sqerr / cur_mean + sqerr / (cur_mean * (cur_t - 1));
+        (*anom_score)[i] = cur_score;
+    }
+
+    return anom_score;
+}
+
+double counts_to_anom(double tot, double cur, int cur_t)
+{
+    double cur_mean = tot / cur_t;
+    double sqerr = pow(MAX(0, cur - cur_mean), 2);
+    return sqerr / cur_mean + sqerr / (cur_mean * MAX(1, cur_t - 1));
+}
+
+vector<double>* midasR(vector<int>& src, vector<int>& dst, vector<int>& times, int num_rows, int num_buckets, double factor)
+{
+    int m = *max_element(src.begin(), src.end());
+    Edgehash cur_count(num_rows, num_buckets, m);
+    Edgehash total_count(num_rows, num_buckets, m);
+    Nodehash src_score(num_rows, num_buckets);
+    Nodehash dst_score(num_rows, num_buckets);
+    Nodehash src_total(num_rows, num_buckets);
+    Nodehash dst_total(num_rows, num_buckets);
+    vector<double>* anom_score = new vector<double>(src.size());
+    int cur_t = 1, size = src.size(), cur_src, cur_dst;
+    double cur_score, cur_score_src, cur_score_dst, combined_score;
+
+    for (int i = 0; i < size; i++) {
+    	
+        if (i == 0 || times[i] > cur_t) {
+            cur_count.lower(factor);
+            src_score.lower(factor);
+            dst_score.lower(factor);
+            cur_t = times[i];
+        }
+
+        cur_src = src[i];
+        cur_dst = dst[i];
+        cur_count.insert(cur_src, cur_dst, 1);
+        total_count.insert(cur_src, cur_dst, 1);
+        src_score.insert(cur_src, 1);
+        dst_score.insert(cur_dst, 1);
+        src_total.insert(cur_src, 1);
+        dst_total.insert(cur_dst, 1);
+        cur_score = counts_to_anom(total_count.get_count(cur_src, cur_dst), cur_count.get_count(cur_src, cur_dst), cur_t);
+        cur_score_src = counts_to_anom(src_total.get_count(cur_src), src_score.get_count(cur_src), cur_t);
+        cur_score_dst = counts_to_anom(dst_total.get_count(cur_dst), dst_score.get_count(cur_dst), cur_t);
+        //combined_score = MAX(cur_score_src, cur_score_dst) + cur_score;
+        //combined_score = cur_score_src + cur_score_dst + cur_score;
+        combined_score = MAX(MAX(cur_score_src, cur_score_dst), cur_score);
+        (*anom_score)[i] = log(1 + combined_score);
+    }
+
+    return anom_score;
+}

data/vendor/MIDAS/anom.hpp

@@ -0,0 +1,10 @@
+#ifndef anom_hpp
+#define anom_hpp
+
+#include <vector>
+using namespace std;
+
+vector<double>* midas(vector<int>& src, vector<int>& dst, vector<int>& times, int num_rows, int num_buckets);
+vector<double>* midasR(vector<int>& src, vector<int>& dst, vector<int>& times, int num_rows, int num_buckets, double factor);
+
+#endif /* anom_hpp */

data/vendor/MIDAS/argparse.hpp

@@ -0,0 +1,539 @@
+/*
+  __ _ _ __ __ _ _ __   __ _ _ __ ___  ___
+ / _` | '__/ _` | '_ \ / _` | '__/ __|/ _ \ Argument Parser for Modern C++
+| (_| | | | (_| | |_) | (_| | |  \__ \  __/ http://github.com/p-ranav/argparse
+ \__,_|_|  \__, | .__/ \__,_|_|  |___/\___|
+           |___/|_|
+
+Licensed under the MIT License <http://opensource.org/licenses/MIT>.
+SPDX-License-Identifier: MIT
+Copyright (c) 2019 Pranav Srinivas Kumar <pranav.srinivas.kumar@gmail.com>.
+
+Permission is hereby  granted, free of charge, to any  person obtaining a copy
+of this software and associated  documentation files (the "Software"), to deal
+in the Software  without restriction, including without  limitation the rights
+to  use, copy,  modify, merge,  publish, distribute,  sublicense, and/or  sell
+copies  of  the Software,  and  to  permit persons  to  whom  the Software  is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE  IS PROVIDED "AS  IS", WITHOUT WARRANTY  OF ANY KIND,  EXPRESS OR
+IMPLIED,  INCLUDING BUT  NOT  LIMITED TO  THE  WARRANTIES OF  MERCHANTABILITY,
+FITNESS FOR  A PARTICULAR PURPOSE AND  NONINFRINGEMENT. IN NO EVENT  SHALL THE
+AUTHORS  OR COPYRIGHT  HOLDERS  BE  LIABLE FOR  ANY  CLAIM,  DAMAGES OR  OTHER
+LIABILITY, WHETHER IN AN ACTION OF  CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE  OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+*/
+#pragma once
+#include <algorithm>
+#include <any>
+#include <functional>
+#include <iomanip>
+#include <iostream>
+#include <iterator>
+#include <list>
+#include <map>
+#include <memory>
+#include <numeric>
+#include <sstream>
+#include <stdexcept>
+#include <string>
+#include <type_traits>
+#include <vector>
+
+namespace argparse {
+
+namespace details { // namespace for helper methods
+
+template <typename... Ts> struct is_container_helper {};
+
+template <typename T, typename _ = void>
+struct is_container : std::false_type {};
+
+template <> struct is_container<std::string> : std::false_type {};
+
+template <typename T>
+struct is_container<
+    T,
+    std::conditional_t<false,
+                       is_container_helper<typename T::value_type,
+                                           decltype(std::declval<T>().begin()),
+                                           decltype(std::declval<T>().end()),
+                                           decltype(std::declval<T>().size())>,
+                       void>> : public std::true_type {};
+
+template <typename T>
+static constexpr bool is_container_v = is_container<T>::value;
+
+template <typename T>
+using enable_if_container = std::enable_if_t<is_container_v<T>, T>;
+
+template <typename T>
+using enable_if_not_container = std::enable_if_t<!is_container_v<T>, T>;
+} // namespace
+
+class Argument {
+  friend class ArgumentParser;
+
+public:
+  Argument() = default;
+
+  template <typename... Args>
+  explicit Argument(Args... args)
+      : mNames({std::move(args)...}), mIsOptional((is_optional(args) || ...)) {
+    std::sort(
+        mNames.begin(), mNames.end(), [](const auto &lhs, const auto &rhs) {
+          return lhs.size() == rhs.size() ? lhs < rhs : lhs.size() < rhs.size();
+        });
+  }
+
+  Argument &help(std::string aHelp) {
+    mHelp = std::move(aHelp);
+    return *this;
+  }
+
+  Argument &default_value(std::any aDefaultValue) {
+    mDefaultValue = std::move(aDefaultValue);
+    return *this;
+  }
+
+  Argument &required() {
+    mIsRequired = true;
+    return *this;
+  }
+
+  Argument &implicit_value(std::any aImplicitValue) {
+    mImplicitValue = std::move(aImplicitValue);
+    mNumArgs = 0;
+    return *this;
+  }
+
+  Argument &action(std::function<std::any(const std::string &)> aAction) {
+    mAction = std::move(aAction);
+    return *this;
+  }
+
+  Argument &nargs(size_t aNumArgs) {
+    mNumArgs = aNumArgs;
+    return *this;
+  }
+
+  template <typename Iterator>
+  Iterator consume(Iterator start, Iterator end, std::string usedName = {}) {
+    if (mIsUsed) {
+      throw std::runtime_error("Duplicate argument");
+    }
+    mIsUsed = true;
+    mUsedName = std::move(usedName);
+    if (mNumArgs == 0) {
+      mValues.emplace_back(mImplicitValue);
+      return start;
+    } else if (mNumArgs <= static_cast<size_t>(std::distance(start, end))) {
+      end = std::next(start, mNumArgs);
+      if (std::any_of(start, end, Argument::is_optional)) {
+        throw std::runtime_error("optional argument in parameter sequence");
+      }
+      std::transform(start, end, std::back_inserter(mValues), mAction);
+      return end;
+    } else if (mDefaultValue.has_value()) {
+      return start;
+    } else {
+      throw std::runtime_error("Too few arguments");
+    }
+  }
+
+  /*
+   * @throws std::runtime_error if argument values are not valid
+   */
+  void validate() const {
+    if (mIsOptional) {
+      if (mIsUsed && mValues.size() != mNumArgs && !mDefaultValue.has_value()) {
+        std::stringstream stream;
+        stream << mUsedName << ": expected " << mNumArgs
+               << " argument(s). " << mValues.size() << " provided.";
+        throw std::runtime_error(stream.str());
+      } else {
+        // TODO: check if an implicit value was programmed for this argument
+        if (!mIsUsed && !mDefaultValue.has_value() && mIsRequired) {
+          std::stringstream stream;
+          stream << mNames[0] << ": required.";
+          throw std::runtime_error(stream.str());
+        }
+        if (mIsUsed && mIsRequired && mValues.size() == 0) {
+          std::stringstream stream;
+          stream << mUsedName << ": no value provided.";
+          throw std::runtime_error(stream.str());
+        }
+      }
+    } else {
+      if (mValues.size() != mNumArgs && !mDefaultValue.has_value()) {
+        std::stringstream stream;
+        stream << mUsedName << ": expected " << mNumArgs
+               << " argument(s). " << mValues.size() << " provided.";
+        throw std::runtime_error(stream.str());
+      }
+    }
+  }
+
+  size_t get_arguments_length() const {
+    return std::accumulate(std::begin(mNames), std::end(mNames), size_t(0),
+                           [](const auto &sum, const auto &s) {
+                             return sum + s.size() +
+                                    1; // +1 for space between names
+                           });
+  }
+
+  friend std::ostream &operator<<(std::ostream &stream,
+                                  const Argument &argument) {
+    std::stringstream nameStream;
+    std::copy(std::begin(argument.mNames), std::end(argument.mNames),
+              std::ostream_iterator<std::string>(nameStream, " "));
+    stream << nameStream.str() << "\t" << argument.mHelp;
+    if (argument.mIsRequired)
+      stream << "[Required]";
+    stream << "\n";
+    return stream;
+  }
+
+  template <typename T> bool operator!=(const T &aRhs) const {
+    return !(*this == aRhs);
+  }
+
+  /*
+   * Entry point for template non-container types
+   * @throws std::logic_error in case of incompatible types
+   */
+  template <typename T>
+  std::enable_if_t<!details::is_container_v<T>, bool> operator==(const T &aRhs) const {
+    return get<T>() == aRhs;
+  }
+
+  /*
+   * Template specialization for containers
+   * @throws std::logic_error in case of incompatible types
+   */
+  template <typename T>
+  std::enable_if_t<details::is_container_v<T>, bool> operator==(const T &aRhs) const {
+    using ValueType = typename T::value_type;
+    auto tLhs = get<T>();
+    if (tLhs.size() != aRhs.size())
+      return false;
+    else {
+      return std::equal(std::begin(tLhs), std::end(tLhs), std::begin(aRhs),
+                        [](const auto &lhs, const auto &rhs) {
+                          return std::any_cast<const ValueType &>(lhs) == rhs;
+                        });
+    }
+  }
+
+private:
+  static bool is_integer(const std::string &aValue) {
+    if (aValue.empty() ||
+        ((!isdigit(aValue[0])) && (aValue[0] != '-') && (aValue[0] != '+')))
+      return false;
+    char *tPtr;
+    strtol(aValue.c_str(), &tPtr, 10);
+    return (*tPtr == 0);
+  }
+
+  static bool is_float(const std::string &aValue) {
+    std::istringstream tStream(aValue);
+    float tFloat;
+    // noskipws considers leading whitespace invalid
+    tStream >> std::noskipws >> tFloat;
+    // Check the entire string was consumed
+    // and if either failbit or badbit is set
+    return tStream.eof() && !tStream.fail();
+  }
+
+  // If an argument starts with "-" or "--", then it's optional
+  static bool is_optional(const std::string &aName) {
+    return (!aName.empty() && aName[0] == '-' && !is_integer(aName) &&
+            !is_float(aName));
+  }
+
+  static bool is_positional(const std::string &aName) {
+    return !is_optional(aName);
+  }
+
+  /*
+   * Getter for template non-container types
+   * @throws std::logic_error in case of incompatible types
+   */
+  template <typename T> details::enable_if_not_container<T> get() const {
+    if (!mValues.empty()) {
+      return std::any_cast<T>(mValues.front());
+    }
+    if (mDefaultValue.has_value()) {
+      return std::any_cast<T>(mDefaultValue);
+    }
+    throw std::logic_error("No value provided");
+  }
+
+  /*
+   * Getter for container types
+   * @throws std::logic_error in case of incompatible types
+   */
+  template <typename CONTAINER> details::enable_if_container<CONTAINER> get() const {
+    using ValueType = typename CONTAINER::value_type;
+    CONTAINER tResult;
+    if (!mValues.empty()) {
+      std::transform(
+          std::begin(mValues), std::end(mValues), std::back_inserter(tResult),
+          [](const auto &value) { return std::any_cast<ValueType>(value); });
+      return tResult;
+    }
+    if (mDefaultValue.has_value()) {
+      const auto &tDefaultValues =
+          std::any_cast<const CONTAINER &>(mDefaultValue);
+      std::transform(std::begin(tDefaultValues), std::end(tDefaultValues),
+                     std::back_inserter(tResult), [](const auto &value) {
+                       return std::any_cast<ValueType>(value);
+                     });
+      return tResult;
+    }
+    throw std::logic_error("No value provided");
+  }
+
+  std::vector<std::string> mNames;
+  std::string mUsedName;
+  std::string mHelp;
+  std::any mDefaultValue;
+  std::any mImplicitValue;
+  std::function<std::any(const std::string &)> mAction =
+      [](const std::string &aValue) { return aValue; };
+  std::vector<std::any> mValues;
+  std::vector<std::string> mRawValues;
+  size_t mNumArgs = 1;
+  bool mIsOptional = false;
+  bool mIsRequired = false;
+  bool mIsUsed = false; // relevant for optional arguments. True if used by user
+
+public:
+  static constexpr auto mHelpOption = "-h";
+  static constexpr auto mHelpOptionLong = "--help";
+};
+
+class ArgumentParser {
+public:
+  explicit ArgumentParser(std::string aProgramName = {})
+      : mProgramName(std::move(aProgramName)) {
+    add_argument(Argument::mHelpOption, Argument::mHelpOptionLong)
+        .help("show this help message and exit")
+        .nargs(0)
+        .default_value(false)
+        .implicit_value(true);
+  }
+
+  // Parameter packing
+  // Call add_argument with variadic number of string arguments
+  template <typename... Targs> Argument &add_argument(Targs... Fargs) {
+    std::shared_ptr<Argument> tArgument =
+        std::make_shared<Argument>(std::move(Fargs)...);
+
+    if (tArgument->mIsOptional)
+      mOptionalArguments.emplace_back(tArgument);
+    else
+      mPositionalArguments.emplace_back(tArgument);
+
+    for (const auto &mName : tArgument->mNames) {
+      mArgumentMap.insert_or_assign(mName, tArgument);
+    }
+    return *tArgument;
+  }
+
+  // Parameter packed add_parents method
+  // Accepts a variadic number of ArgumentParser objects
+  template <typename... Targs> void add_parents(Targs... Fargs) {
+    const auto tNewParentParsers = {Fargs...};
+    for (const auto &tParentParser : tNewParentParsers) {
+      const auto &tPositionalArguments = tParentParser.mPositionalArguments;
+      std::copy(std::begin(tPositionalArguments),
+                std::end(tPositionalArguments),
+                std::back_inserter(mPositionalArguments));
+
+      const auto &tOptionalArguments = tParentParser.mOptionalArguments;
+      std::copy(std::begin(tOptionalArguments), std::end(tOptionalArguments),
+                std::back_inserter(mOptionalArguments));
+
+      const auto &tArgumentMap = tParentParser.mArgumentMap;
+      for (const auto &[tKey, tValue] : tArgumentMap) {
+        mArgumentMap.insert_or_assign(tKey, tValue);
+      }
+    }
+    std::move(std::begin(tNewParentParsers), std::end(tNewParentParsers),
+              std::back_inserter(mParentParsers));
+  }
+
+  /* Call parse_args_internal - which does all the work
+   * Then, validate the parsed arguments
+   * This variant is used mainly for testing
+   * @throws std::runtime_error in case of any invalid argument
+   */
+  void parse_args(const std::vector<std::string> &aArguments) {
+    parse_args_internal(aArguments);
+    parse_args_validate();
+  }
+
+  /* Main entry point for parsing command-line arguments using this
+   * ArgumentParser
+   * @throws std::runtime_error in case of any invalid argument
+   */
+  void parse_args(int argc, const char *const argv[]) {
+    std::vector<std::string> arguments;
+    std::copy(argv, argv + argc, std::back_inserter(arguments));
+    parse_args(arguments);
+  }
+
+  /* Getter enabled for all template types other than std::vector and std::list
+   * @throws std::logic_error in case of an invalid argument name
+   * @throws std::logic_error in case of incompatible types
+   */
+  template <typename T = std::string> T get(const std::string &aArgumentName) {
+    auto tIterator = mArgumentMap.find(aArgumentName);
+    if (tIterator != mArgumentMap.end()) {
+      return tIterator->second->get<T>();
+    }
+    throw std::logic_error("No such argument");
+  }
+
+  /* Indexing operator. Return a reference to an Argument object
+   * Used in conjuction with Argument.operator== e.g., parser["foo"] == true
+   * @throws std::logic_error in case of an invalid argument name
+   */
+  Argument &operator[](const std::string &aArgumentName) {
+    auto tIterator = mArgumentMap.find(aArgumentName);
+    if (tIterator != mArgumentMap.end()) {
+      return *(tIterator->second);
+    }
+    throw std::logic_error("No such argument");
+  }
+
+  // Printing the one and only help message
+  // I've stuck with a simple message format, nothing fancy.
+  // TODO: support user-defined help and usage messages for the ArgumentParser
+  std::string print_help() {
+    std::stringstream stream;
+    stream << std::left;
+    stream << "Usage: ./" << mProgramName << " [options] ";
+    size_t tLongestArgumentLength = get_length_of_longest_argument();
+
+    for (const auto &argument : mPositionalArguments) {
+      stream << argument->mNames.front() << " ";
+    }
+    stream << "\n\n";
+
+    if (!mPositionalArguments.empty())
+      stream << "Positional arguments:\n";
+
+    for (const auto &mPositionalArgument : mPositionalArguments) {
+      stream.width(tLongestArgumentLength);
+      stream << *mPositionalArgument;
+    }
+
+    if (!mOptionalArguments.empty())
+      stream << (mPositionalArguments.empty() ? "" : "\n")
+             << "Options:\n";
+
+    for (const auto &mOptionalArgument : mOptionalArguments) {
+      stream.width(tLongestArgumentLength);
+      stream << *mOptionalArgument;
+    }
+
+    std::cout << stream.str();
+    return stream.str();
+  }
+
+private:
+  /*
+   * @throws std::runtime_error in case of any invalid argument
+   */
+  void parse_args_internal(const std::vector<std::string> &aArguments) {
+    if (mProgramName.empty() && !aArguments.empty()) {
+      mProgramName = aArguments.front();
+    }
+    auto end = std::end(aArguments);
+    auto positionalArgumentIt = std::begin(mPositionalArguments);
+    for (auto it = std::next(std::begin(aArguments)); it != end;) {
+      const auto &tCurrentArgument = *it;
+      if (tCurrentArgument == Argument::mHelpOption ||
+          tCurrentArgument == Argument::mHelpOptionLong) {
+        throw std::runtime_error("help called");
+      }
+      if (Argument::is_positional(tCurrentArgument)) {
+        if (positionalArgumentIt == std::end(mPositionalArguments)) {
+          throw std::runtime_error(
+              "Maximum number of positional arguments exceeded");
+        }
+        auto tArgument = *(positionalArgumentIt++);
+        it = tArgument->consume(it, end);
+      } else if (auto tIterator = mArgumentMap.find(tCurrentArgument);
+                 tIterator != mArgumentMap.end()) {
+        auto tArgument = tIterator->second;
+        it = tArgument->consume(std::next(it), end, tCurrentArgument);
+      } else if (const auto &tCompoundArgument = tCurrentArgument;
+                 tCompoundArgument.size() > 1 && tCompoundArgument[0] == '-' &&
+                 tCompoundArgument[1] != '-') {
+        ++it;
+        for (size_t j = 1; j < tCompoundArgument.size(); j++) {
+          auto tCurrentArgument = std::string{'-', tCompoundArgument[j]};
+          if (auto tIterator = mArgumentMap.find(tCurrentArgument);
+              tIterator != mArgumentMap.end()) {
+            auto tArgument = tIterator->second;
+            it = tArgument->consume(it, end, tCurrentArgument);
+          } else {
+            throw std::runtime_error("Unknown argument");
+          }
+        }
+      } else {
+        throw std::runtime_error("Unknown argument");
+      }
+    }
+  }
+
+  /*
+   * @throws std::runtime_error in case of any invalid argument
+   */
+  void parse_args_validate() {
+    // Check if all arguments are parsed
+    std::for_each(std::begin(mArgumentMap), std::end(mArgumentMap),
+                  [](const auto &argPair) {
+                    const auto &tArgument = argPair.second;
+                    tArgument->validate();
+                  });
+  }
+
+  // Used by print_help.
+  size_t get_length_of_longest_argument() {
+    if (mArgumentMap.empty())
+      return 0;
+    std::vector<size_t> argumentLengths(mArgumentMap.size());
+    std::transform(std::begin(mArgumentMap), std::end(mArgumentMap),
+                   std::begin(argumentLengths), [](const auto &argPair) {
+                     const auto &tArgument = argPair.second;
+                     return tArgument->get_arguments_length();
+                   });
+    return *std::max_element(std::begin(argumentLengths),
+                             std::end(argumentLengths));
+  }
+
+  std::string mProgramName;
+  std::vector<ArgumentParser> mParentParsers;
+  std::vector<std::shared_ptr<Argument>> mPositionalArguments;
+  std::vector<std::shared_ptr<Argument>> mOptionalArguments;
+  std::map<std::string, std::shared_ptr<Argument>> mArgumentMap;
+};
+
+#define PARSE_ARGS(parser, argc, argv)                                         \
+  try {                                                                        \
+    parser.parse_args(argc, argv);                                             \
+  } catch (const std::runtime_error &err) {                                    \
+    std::cout << err.what() << std::endl;                                      \
+    parser.print_help();                                                       \
+    exit(0);                                                                   \
+  }
+
+} // namespace argparse