Update README.md
Browse files
README.md
CHANGED
|
@@ -1,46 +1,16 @@
|
|
| 1 |
-
---
|
| 2 |
-
license: mit
|
| 3 |
-
task_categories:
|
| 4 |
-
- text-generation
|
| 5 |
-
- token-classification
|
| 6 |
-
pretty_name: Terminal Recording Group Boundary Timestamps
|
| 7 |
-
size_categories:
|
| 8 |
-
- n < 1K
|
| 9 |
-
tags:
|
| 10 |
-
- terminal
|
| 11 |
-
- xml
|
| 12 |
-
- boundary-detection
|
| 13 |
-
---
|
| 14 |
-
|
| 15 |
-
# Terminal Recording Group Boundary Dataset
|
| 16 |
-
|
| 17 |
-
This dataset consists of raw terminal recording logs in XML format, paired with ground-truth timestamps for shell prompt boundaries.
|
| 18 |
-
|
| 19 |
-
## Dataset Structure
|
| 20 |
-
|
| 21 |
-
Each entry in the `.jsonl` file contains:
|
| 22 |
-
* **instruction**: A specialized prompt identifying the `start_timestamp` and the extraction rules.
|
| 23 |
-
* **input**: Raw XML chunks including `<user_input>` and `<system_output>` tags, preserving all ANSI escape codes.
|
| 24 |
-
* **output**: The target timestamp of the **first-most** shell prompt found after the starting point.
|
| 25 |
-
|
| 26 |
-
## Purpose
|
| 27 |
-
|
| 28 |
-
This data is designed to train **Model 0** to navigate messy terminal logs and precisely identify the point where a command execution ends and the shell prompt returns.
|
| 29 |
-
|
| 30 |
## Generation Logic & Sliding Windows (Important)
|
| 31 |
|
| 32 |
The ultimate goal of **Model 0** is to accurately chunk continuous terminal recordings into distinct "events." The label the model must predict is the **boundary timestamp**—the exact moment one event ends and a new one begins.
|
| 33 |
|
| 34 |
-
To generate robust training data, we use a sliding window approach encompassing exactly **three consecutive boundary timestamps** (
|
| 35 |
-
|
| 36 |
-
* **$T_1$ (The Anchor):** The known starting timestamp of the current event.
|
| 37 |
-
* **$T_2$ (The Target):** The actual event boundary the model must predict.
|
| 38 |
-
* **$T_3$ (The Context Cutoff):** The end of the input window.
|
| 39 |
|
|
|
|
|
|
|
|
|
|
| 40 |
|
| 41 |
-
### Why include the third timestamp (
|
| 42 |
|
| 43 |
-
Each input is fed to the model containing all `<user_input>` and `<system_output>` XML tags from
|
| 44 |
|
| 45 |
### Example
|
| 46 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
## Generation Logic & Sliding Windows (Important)
|
| 2 |
|
| 3 |
The ultimate goal of **Model 0** is to accurately chunk continuous terminal recordings into distinct "events." The label the model must predict is the **boundary timestamp**—the exact moment one event ends and a new one begins.
|
| 4 |
|
| 5 |
+
To generate robust training data, we use a sliding window approach encompassing exactly **three consecutive boundary timestamps** (**T1**, **T2**, and **T3**) for each input:
|
|
|
|
|
|
|
|
|
|
|
|
|
| 6 |
|
| 7 |
+
* **T1 (The Anchor):** The known starting timestamp of the current event.
|
| 8 |
+
* **T2 (The Target):** The actual event boundary the model must predict.
|
| 9 |
+
* **T3 (The Context Cutoff):** The end of the input window.
|
| 10 |
|
| 11 |
+
### Why include the third timestamp (T3)?
|
| 12 |
|
| 13 |
+
Each input is fed to the model containing all `<user_input>` and `<system_output>` XML tags from **T1** all the way to **T3**. If the input simply stopped at **T2**, the task would be trivial: the model would just learn a shortcut to extract the very last timestamp present in the text. By including the data up to **T3**, the model is forced to semantically identify the actual boundary dividing the two separate events within the continuous log.
|
| 14 |
|
| 15 |
### Example
|
| 16 |
|