Improve dataset card: Add task category, tags, sample usage, update language and license info (#2)

- Improve dataset card: Add task category, tags, sample usage, update language and license info (c0343aae366a926f62a7896e8afb45d57b00a952)


Co-authored-by: Niels Rogge <nielsr@users.noreply.huggingface.co>

README.md

@@ -1,8 +1,16 @@
 ---
+language:
+- en
 license: mit
 pretty_name: UQ
-language:
-- code
+task_categories:
+- question-answering
+tags:
+- stack-exchange
+- llm-evaluation
+- benchmark
+- reasoning
+- factuality
 ---
 
 ![UQ](https://github.com/uq-project/UQ/blob/main/visuals/uq.jpg?raw=true)
@@ -17,6 +25,7 @@ language:
   - [Data Instances](#data-instances)
   - [Data Fields](#data-fields)
   - [Data Splits](#data-splits)
+- [Sample Usage](#sample-usage)
 - [Dataset Creation](#dataset-creation)
   - [Curation Rationale](#curation-rationale)
   - [Source Data](#source-data)
@@ -48,7 +57,14 @@ An example looks as follows:
   'question_id': '5',
   'site': 'crypto',
   'title': 'Finding $x$ such that $g^x\\bmod p<p/k$?',
-  'body': "In a Schnorr group as used for DSA, of prime modulus $p$, prime order $q$, generator $g$ (with $p/g$ small), how can we efficiently exhibit an $x$ with $0<x<q$ such that $g^x\\bmod p<p/k$, for sizable $k$ but $k\\ll\\sqrt q$ ?\n\nI see that for small $k$, it is enough to try incremental values of $x$ until finding an $x$ that fits, with expected cost $O(k)$ modular multiplications in $\\mathbb Z_p^*$. Is there better?\n\nAssume $p$ is an $l$-bit prime; $q$ is an $n$-bit prime with $q$ dividing $p-1$; and $g=h^{(p-1)/q}$ for some (random?) $h$ in $\\mathbb Z_p^*$. For concrete values, assume $l\\approx1024$, $n\\approx160$, $k\\approx2^{64}$.\n\nUpdate: I'm expecting the problem to be hard, and thus that the more difficult problem of exhibiting $x$ with $g^x\\bmod p$ in a range of width $p/k$ must be hard.\n",
+  'body': "In a Schnorr group as used for DSA, of prime modulus $p$, prime order $q$, generator $g$ (with $p/g$ small), how can we efficiently exhibit an $x$ with $0<x<q$ such that $g^x\\bmod p<p/k$, for sizable $k$ but $k\\ll\\sqrt q$ ?
+
+I see that for small $k$, it is enough to try incremental values of $x$ until finding an $x$ that fits, with expected cost $O(k)$ modular multiplications in $\\mathbb Z_p^*$. Is there better?
+
+Assume $p$ is an $l$-bit prime; $q$ is an $n$-bit prime with $q$ dividing $p-1$; and $g=h^{(p-1)/q}$ for some (random?) $h$ in $\\mathbb Z_p^*$. For concrete values, assume $l\\approx1024$, $n\\approx160$, $k\\approx2^{64}$.
+
+Update: I'm expecting the problem to be hard, and thus that the more difficult problem of exhibiting $x$ with $g^x\\bmod p$ in a range of width $p/k$ must be hard.\
+\",
   'link': 'https://crypto.stackexchange.com/questions/48503/finding-x-such-that-gx-bmod-pp-k',
   'tags': ['discrete-logarithm', 'group-theory'],
   'votes': 19,
@@ -118,12 +134,21 @@ The data fields are the same among all splits:
 | **Business**          | Quantitative Finance                   | 2           |
 | **Total**             | -                                      | **500**     |
 
+## Sample Usage
+
+You can load the data from [🤗 uq-project/uq](https://huggingface.co/datasets/uq-project/uq) via:
+
+```python
+# pip install -q datasets
+from datasets import load_dataset
+dataset = load_dataset("uq-project/uq", split="test")
+```
 
 ## Additional Information
 
 ### Licensing Information
 
-The license is TODO.
+The dataset is licensed under the MIT License.
 
 ### Citation Information