init

README.md

@@ -15,7 +15,7 @@ pretty_name: relentless
 ***RelEntLess*** is a new benchmark, in which entity pairs have to be ranked according to how much they satisfy a given graded relation.
 Essentially, the task is a ranking task where we provide five prototypical examples to each relation. Following brief description of each relation type 
 is used in our baseline in addition to the prototypical examples.
-Please check our paper "[A RelEntLess Benchmark for Modelling Graded Relations between Named Entities](paper-link)" for more detail.
+Please check our paper "[A RelEntLess Benchmark for Modelling Graded Relations between Named Entities](https://arxiv.org/abs/2305.15002)" for more detail.
 THe test set is private at the moment.
 
 ```python
@@ -33,7 +33,7 @@ THe test set is private at the moment.
 
 ## Dataset Description
 - **Repository:** [https://huggingface.co/datasets/cardiffnlp/relentless](https://huggingface.co/datasets/cardiffnlp/relentless)
-- **Paper:** [A RelEntLess Benchmark for Modelling Graded Relations between Named Entities](paper-link)
+- **Paper:** [A RelEntLess Benchmark for Modelling Graded Relations between Named Entities](https://arxiv.org/abs/2305.15002)
 - **Dataset:** [https://huggingface.co/datasets/cardiffnlp/relentless](https://huggingface.co/datasets/cardiffnlp/relentless)
 
 ### Dataset Summary
@@ -63,7 +63,14 @@ THe test set is private at the moment.
 
 ### Citation Information
 ```
-TBA
+@misc{ushio2023relentless,
+      title={A RelEntLess Benchmark for Modelling Graded Relations between Named Entities}, 
+      author={Asahi Ushio and Jose Camacho Collados and Steven Schockaert},
+      year={2023},
+      eprint={2305.15002},
+      archivePrefix={arXiv},
+      primaryClass={cs.CL}
+}
 ```
 
 ### LICENSE