Add metadata and link to paper and Github (#1)

- Add metadata and link to paper and Github (255136670154598c938ddcb17aa1020ac64ff3c5)


Co-authored-by: Niels Rogge <[email protected]>

README.md

@@ -1,3 +1,11 @@
+---
+license: mit
+library_name: transformers
+pipeline_tag: text-generation
+base_model:
+- TechxGenus/CursorCore-DS-1.3B
+---
+
 Quantization made by Richard Erkhov.
 
 [Github](https://github.com/RichardErkhov)
@@ -6,11 +14,11 @@ Quantization made by Richard Erkhov.
 
 [Request more models](https://github.com/RichardErkhov/quant_request)
 
-
 CursorCore-DS-1.3B - GGUF
 - Model creator: https://huggingface.co/TechxGenus/
 - Original model: https://huggingface.co/TechxGenus/CursorCore-DS-1.3B/
-
+- Paper: https://huggingface.co/papers/2410.07002
+- Code: https://github.com/TechxGenus/CursorCore
 
 | Name | Quant method | Size |
 | ---- | ---- | ---- |
@@ -37,9 +45,6 @@ CursorCore-DS-1.3B - GGUF
 | [CursorCore-DS-1.3B.Q6_K.gguf](https://huggingface.co/RichardErkhov/TechxGenus_-_CursorCore-DS-1.3B-gguf/blob/main/CursorCore-DS-1.3B.Q6_K.gguf) | Q6_K | 1.09GB |
 | [CursorCore-DS-1.3B.Q8_0.gguf](https://huggingface.co/RichardErkhov/TechxGenus_-_CursorCore-DS-1.3B-gguf/blob/main/CursorCore-DS-1.3B.Q8_0.gguf) | Q8_0 | 1.33GB |
 
-
-
-
 Original model description:
 ---
 tags:
@@ -159,13 +164,27 @@ sample = {
         {
             "type": "code",
             "lang": "python",
-            "code": """def quick_sort(arr):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+            "code": """def quick_sort(arr):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
         }
     ],
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": ""
 }
@@ -247,7 +266,14 @@ sample = {
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": "Add Docstring."
 }
@@ -318,7 +344,14 @@ sample = {
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": "Add Docstring."
 }
@@ -387,7 +420,14 @@ sample = {
     "current": {
         "type": "code",
         "lang": "python",
-        "code": """def quick_sort(array):\n    if len(arr) <= 1:\n        return arr\n    pivot = arr[len(arr) // 2]\n    left = [x for x in arr if x < pivot]\n    middle = [x for x in arr if x == pivot]\n    right = [x for x in arr if x > pivot]\n    return quick_sort(left) + middle + quick_sort(right)"""
+        "code": """def quick_sort(array):
+    if len(arr) <= 1:
+        return arr
+    pivot = arr[len(arr) // 2]
+    left = [x for x in arr if x < pivot]
+    middle = [x for x in arr if x == pivot]
+    right = [x for x in arr if x > pivot]
+    return quick_sort(left) + middle + quick_sort(right)"""
     },
     "user": "Add Docstring."
 }
@@ -461,6 +501,4 @@ CursorCore is still in a very early stage, and lots of work is needed to achieve
 
 Contributions are welcome! If you find any bugs or have suggestions for improvements, please open an issue or submit a pull request.
 
-
-
 Additional thanks to @nicoboss for giving me access to his private supercomputer, enabling me to provide many more quants, at much higher speed, than I would otherwise be able to.