Continuous Mapping of Covering Approximate Space and Topology Induced by Arbitrary Covering Relation
Bibliographic record
Abstract
In the study of rough sets, there are many covering approximation spaces, how to classify covering approximation spaces has become a hot issue. In this paper, we propose concepts covering approximation $T_{1}$-space, $F-$symmtry, covering rough continuous mapping, covering rough homeomorphism mapping to solve this question. We also propose a new method for constructing topology in Theorem 5.1, and get the following properties: (1) For each $x\in U$, $\{X_{i}:i\in I\}\subseteq \mathcal{P}(U)$ is all the subsets of $U$ which contains $x$ and $*$ is a reflexive relation on $U$. If $V\in \tau$ is a subset of $U$ and $x\in V$, then $\underline{*}(\bigcap \limits_{i\in I}X_{i})$ is the smallest subset of $U$ and $x \in \underline{*}(\bigcap \limits_{i\in I}X_{i})\subseteq V$. Denoted by $C(x)=\bigcap \{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$. (2)If $V\in \tau$ is a subset of $U$, then $V =$ $\bigcup \limits_{x\in V} C(x)$. (3) Let $\{\underline{*}(X_{i}):x\notin \underline{*}(X_{i}), i\in I\}$, then $\overline{\{x\}}$ $=$ $U \setminus \bigcup \limits_{x\notin \underline{*}(X_{i}), i\in I}\underline{*}(X_{i})$; (4) Let $*$ be a reflexive relation on $U$. For every $X\subseteq U$, we have $int(\underline{*}(X))=\underline{*}(X)$. Where $int(\underline{*}(X))$ represents the interior of $\underline{*}(X)$. (5) Let $\{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$ be a family subsets of $U$, then $\{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$ is a base for $(U,\tau)$ at the point $x$. \\
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".