all_domains list | all_methods list | all_novelty_signals list | all_query_ids list | archived bool | candidate_status string | created_at string | description string | domains list | evidence_signals list | evidence_tier string | evidence_version string | first_observed_at string | fork bool | forks int64 | github_id int64 | homepage string | language string | license string | methods list | name string | novelty_signals list | observation_count int64 | observed_at string | pushed_at string | query_ids list | selection_reason string | selection_signals list | selection_status string | selection_version string | stars int64 | topics list | updated_at string | url string | extra_json string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
[
"control",
"robotics",
"robotics-and-control"
] | [
"control",
"neural-network"
] | [
"description",
"github-topics",
"query-match",
"repository-metadata"
] | [
"robotics.robot-control"
] | true | candidate | 2016-01-15T14:16:57Z | Diverse, Noisy and Parallel: a New Spiking Neural Network Approach for Humanoid Robot Control | [
"control",
"robotics",
"robotics-and-control"
] | [
"neural-network"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T16:52:35Z | false | 5 | 49,722,881 | http://ieeexplore.ieee.org/document/7727325/ | Jupyter Notebook | null | [
"control",
"neural network"
] | ricardodeazambuja/IJCNN2016 | [
"description",
"github-topics",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T16:52:35Z | 2021-07-14T09:07:50Z | [
"robotics.robot-control"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 17 | [
"baxter-robot",
"liquid-state-machines",
"lsm",
"robot",
"snn",
"spiking-neural-networks",
"vrep-simulator"
] | 2026-05-05T13:38:49Z | https://github.com/ricardodeazambuja/IJCNN2016 | null |
[
"imitation-learning",
"reinforcement-learning"
] | [
"imitation-learning",
"inverse-reinforcement-learning",
"reinforcement-learning"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"rl.inverse"
] | false | candidate | 2017-06-29T22:47:01Z | Implementations of Inverse Reinforcement Learning and new algorithms | [
"imitation-learning",
"reinforcement-learning"
] | [
"reinforcement-learning"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 3 | 95,826,414 | null | Python | null | [
"imitation-learning",
"inverse-reinforcement-learning",
"reinforcement learning"
] | siddharthanpr/irl | [
"description",
"query-match",
"repository-metadata"
] | 2 | 2026-09-24T15:29:21Z | 2017-06-29T22:55:35Z | [
"rl.inverse"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 8 | [] | 2023-04-19T19:16:30Z | https://github.com/siddharthanpr/irl | null |
[
"deep-learning",
"graph-learning"
] | [
"graph-neural-network",
"message-passing",
"neural-network"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"graph.gnn-description"
] | false | candidate | 2019-08-05T07:56:32Z | a novel DTA predition method using graph neural network | [
"deep-learning",
"graph-learning"
] | [
"neural-network"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 42 | 200,609,566 | null | Python | null | [
"graph neural network",
"graph-neural-network",
"message-passing",
"neural network"
] | 595693085/DGraphDTA | [
"description",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2023-07-12T16:23:50Z | [
"graph.gnn-description"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 77 | [] | 2026-07-10T04:59:29Z | https://github.com/595693085/DGraphDTA | null |
[
"general-ml"
] | [
"novel-method",
"random-forest"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2019-10-05T10:16:30Z | The code implements a novel method for converting random forest into a single decision tree | [
"general-ml"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 4 | 212,979,949 | null | Python | null | [
"novel-method",
"random forest"
] | sagyome/forest_based_tree | [
"description",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2020-01-24T21:55:20Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 10 | [] | 2026-07-06T18:12:51Z | https://github.com/sagyome/forest_based_tree | null |
[
"general-ml"
] | [
"novel-method",
"support-vector-machine"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2019-11-27T01:18:51Z | SGL-SVM: a novel method for tumor classification via support vector machine with sparse group Lasso | [
"general-ml"
] | [
"classifier"
] | ml_related_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 2 | 224,317,097 | null | R | null | [
"novel-method",
"support vector machine"
] | QUST-AIBBDRC/SGL-SVM | [
"description",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2019-11-27T01:26:51Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 3 | [] | 2026-08-16T01:25:53Z | https://github.com/QUST-AIBBDRC/SGL-SVM | null |
[
"computer-vision",
"general-ml",
"generative-ai",
"interpretability-and-safety",
"language"
] | [
"language-model",
"novel-method",
"transformer"
] | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"general.novel-method",
"llm.transformers"
] | false | candidate | 2020-11-23T21:00:00Z | [CVPR 2021] Official PyTorch implementation for Transformer Interpretability Beyond Attention Visualization, a novel method to visualize classifications by Transformer based networks. | [
"computer-vision",
"general-ml",
"interpretability-and-safety"
] | [
"deep-learning",
"transformer"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 260 | 315,439,501 | null | Jupyter Notebook | MIT | [
"novel-method",
"transformer"
] | hila-chefer/Transformer-Explainability | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2024-01-24T05:59:39Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 2,016 | [
"attention-matrix",
"attention-visualization",
"bert",
"bert-model",
"cvpr2021",
"deep-learning",
"explainability",
"perturbation",
"transformer-interpretability",
"vision-transformer",
"visualize-classifications",
"vit"
] | 2026-09-17T01:58:13Z | https://github.com/hila-chefer/Transformer-Explainability | null |
[
"computational-science",
"computer-vision",
"physics"
] | [
"neural-operator",
"neural-operators",
"surrogate-modeling"
] | [
"description",
"github-topics",
"license-metadata",
"paper-reference",
"query-match",
"repository-metadata"
] | [
"science.neural-operators"
] | false | candidate | 2021-01-29T15:16:07Z | [CVPR 2021] Involution: Inverting the Inherence of Convolution for Visual Recognition, a brand new neural operator | [
"computational-science",
"computer-vision",
"physics"
] | [
"classifier"
] | ml_related_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 175 | 334,181,506 | https://arxiv.org/abs/2103.06255 | Python | MIT | [
"neural operator",
"neural-operators",
"surrogate-modeling"
] | d-li14/involution | [
"description",
"github-topics",
"license-metadata",
"paper-reference",
"query-match",
"repository-metadata"
] | 2 | 2026-09-24T15:29:21Z | 2021-07-16T06:01:08Z | [
"science.neural-operators"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 1,310 | [
"cvpr2021",
"image-classification",
"instance-segmentation",
"involution",
"object-detection",
"operator",
"pre-trained-model",
"pytorch",
"semantic-segmentation"
] | 2026-08-06T07:33:28Z | https://github.com/d-li14/involution | null |
[
"general-ml",
"interpretability-and-safety"
] | [
"novel-method",
"transformer"
] | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2021-03-23T22:11:18Z | [ICCV 2021- Oral] Official PyTorch implementation for Generic Attention-model Explainability for Interpreting Bi-Modal and Encoder-Decoder Transformers, a novel method to visualize any Transformer-based network. Including examples for DETR, VQA. | [
"general-ml",
"interpretability-and-safety"
] | [
"transformer"
] | ml_related_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 117 | 350,871,478 | null | Jupyter Notebook | MIT | [
"novel-method",
"transformer"
] | hila-chefer/Transformer-MM-Explainability | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2023-08-24T17:45:14Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 914 | [
"clip",
"detr",
"explainability",
"explainable-ai",
"interpretability",
"lxmert",
"transformer",
"transformers",
"visualbert",
"visualization",
"vqa"
] | 2026-09-22T11:16:00Z | https://github.com/hila-chefer/Transformer-MM-Explainability | null |
[
"bioinformatics",
"biology",
"genomics",
"natural-language-processing"
] | [
"language-model",
"self-supervised-learning",
"sequence-model"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"bio.dna-language-models"
] | false | candidate | 2022-03-26T13:22:38Z | iEnhancer-BERT: A novel transfer learning architecture based on DNA-language model for identifying enhancers and their strength | [
"bioinformatics",
"biology",
"genomics",
"natural-language-processing"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 1 | 474,354,460 | null | Python | MIT | [
"language-model",
"self-supervised-learning",
"sequence-model"
] | lhy0322/iEnhancer-BERT | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 2 | 2026-09-24T15:29:21Z | 2022-12-08T07:58:41Z | [
"bio.dna-language-models"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 5 | [] | 2025-03-25T16:43:28Z | https://github.com/lhy0322/iEnhancer-BERT | null |
[
"imitation-learning",
"reinforcement-learning"
] | [
"imitation-learning",
"inverse-reinforcement-learning",
"reinforcement-learning"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"rl.inverse"
] | false | candidate | 2022-05-25T11:21:12Z | A new model-based algorithm for offline inverse reinforcement learning | [
"imitation-learning",
"reinforcement-learning"
] | [
"reinforcement-learning"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 0 | 496,199,499 | null | Python | MIT | [
"imitation-learning",
"inverse-reinforcement-learning",
"reinforcement learning"
] | shaunyue/clare | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 2 | 2026-09-24T15:29:21Z | 2023-02-20T15:58:14Z | [
"rl.inverse"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 15 | [] | 2025-10-24T16:19:54Z | https://github.com/shaunyue/clare | null |
[
"privacy-ml",
"trustworthy-ml"
] | [
"distillation",
"membership-inference",
"privacy-auditing"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"trust.membership-inference"
] | false | candidate | 2022-06-21T18:48:35Z | [USENIX Security 2022] Mitigating Membership Inference Attacks by Self-Distillation Through a Novel Ensemble Architecture | [
"privacy-ml",
"trustworthy-ml"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T14:28:44Z | false | 6 | 505,966,143 | null | Python | MIT | [
"distillation",
"membership-inference",
"privacy-auditing"
] | inspire-group/MIAdefenseSELENA | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 2 | 2026-09-24T15:29:21Z | 2022-08-29T22:07:12Z | [
"trust.membership-inference"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 16 | [] | 2026-02-13T05:14:14Z | https://github.com/inspire-group/MIAdefenseSELENA | null |
[
"general-ml",
"privacy-and-federated-learning"
] | [
"federated-learning",
"novel-method"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2022-06-28T19:00:56Z | Code for novel methods for one-shot Federated Learning under high statistical heterogeneity. | [
"general-ml",
"privacy-and-federated-learning"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 3 | 508,421,680 | null | Python | MIT | [
"federated learning",
"novel-method"
] | ceh-2000/fed_cvae | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2023-10-02T16:42:27Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 19 | [] | 2026-06-21T15:35:14Z | https://github.com/ceh-2000/fed_cvae | null |
[
"chemistry",
"drug-discovery",
"graph-learning",
"health-and-biomedicine",
"structural-biology"
] | [
"graph-neural-network",
"neural-network",
"property-prediction",
"protein-ligand-modeling"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"chem-binding-affinity"
] | false | candidate | 2023-02-23T12:04:24Z | A novel graph neural network strategy with the Vina distance optimization terms to predict protein-ligand binding affinity | [
"chemistry",
"drug-discovery",
"graph-learning",
"health-and-biomedicine",
"structural-biology"
] | [
"neural-network"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 11 | 605,554,209 | null | Python | GPL-3.0 | [
"graph neural network",
"neural network",
"property-prediction",
"protein-ligand-modeling"
] | CSUBioGroup/GraphscoreDTA | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2024-05-16T13:47:46Z | [
"chem-binding-affinity"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 32 | [] | 2026-03-15T16:00:15Z | https://github.com/CSUBioGroup/GraphscoreDTA | null |
[
"deep-learning",
"graph-learning"
] | [
"graph-neural-network",
"graph-transformer",
"message-passing",
"neural-network",
"transformer"
] | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"graph.graph-transformer"
] | false | candidate | 2023-08-16T01:27:07Z | Unified Graph Transformer (UGT) is a novel Graph Transformer model specialised in preserving both local and global graph structures and developed by NS Lab @ CUK based on pure PyTorch backend. | [
"deep-learning",
"graph-learning"
] | [
"neural-network",
"representation-learning",
"self-supervised-learning",
"transformer"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 5 | 679,043,439 | https://nslab-cuk.github.io/2023/08/17/UGT/ | Python | MIT | [
"graph neural network",
"graph-transformer",
"message-passing",
"neural network",
"transformer"
] | NSLab-CUK/Unified-Graph-Transformer | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | 3 | 2026-09-24T16:52:35Z | 2025-07-17T02:55:20Z | [
"graph.graph-transformer"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 28 | [
"graph",
"graph-neural-networks",
"graph-representation-learning",
"graph-transformer",
"pretrained-graph-model",
"self-supervised-graph-learning",
"structure-preserving-graph-transformer",
"transformers"
] | 2025-12-19T07:46:24Z | https://github.com/NSLab-CUK/Unified-Graph-Transformer | null |
[
"generative-ai",
"generative-modeling",
"graph-learning"
] | [
"diffusion",
"graph-diffusion",
"graph-generation"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"graph.graph-diffusion"
] | false | candidate | 2024-04-09T06:46:16Z | A novel molecular graph diffusion model | [
"generative-ai",
"generative-modeling",
"graph-learning"
] | [
"diffusion-model"
] | ml_related_text | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 0 | 784,084,707 | null | Python | MIT | [
"diffusion",
"graph-diffusion",
"graph-generation"
] | zhang-xuan1314/MG-Diff | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 2 | 2026-09-24T15:29:21Z | 2024-04-09T06:48:19Z | [
"graph.graph-diffusion"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2024-04-09T06:48:22Z | https://github.com/zhang-xuan1314/MG-Diff | null |
[
"sequence-modeling",
"time-series"
] | [
"sequence-modeling",
"state-space-model"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"timeseries.state-space-models"
] | false | candidate | 2024-05-02T15:03:57Z | OverlapMamba: Novel Shift State Space Model for LiDAR-based Place Recognition | [
"sequence-modeling",
"time-series"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T10:49:00Z | false | 5 | 795,089,156 | null | Python | GPL-3.0 | [
"sequence-modeling",
"state space model",
"state-space-model"
] | SCNU-RISLAB/OverlapMamba | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 2 | 2026-09-24T15:29:21Z | 2024-05-21T01:34:16Z | [
"timeseries.state-space-models"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 73 | [] | 2026-03-18T13:21:24Z | https://github.com/SCNU-RISLAB/OverlapMamba | null |
[
"graph-learning"
] | [
"graph-classification",
"graph-neural-network",
"graph-representation-learning",
"neural-network"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"graph.graph-classification"
] | false | candidate | 2025-01-20T09:39:32Z | Novel edge-based pooling technique for graph neural networks, optimizing graph classification and node classification tasks. | [
"graph-learning"
] | [
"neural-network",
"classifier"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T17:03:46Z | false | 0 | 919,381,676 | null | null | null | [
"graph-classification",
"graph-neural-network",
"graph-representation-learning",
"neural-network"
] | Marysoulka/Graph-Neural-Network-Pooling-by-Edge-Cut | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T17:03:46Z | 2025-01-20T09:48:48Z | [
"graph.graph-classification"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2025-01-20T09:48:49Z | https://github.com/Marysoulka/Graph-Neural-Network-Pooling-by-Edge-Cut | null |
[
"general-ml",
"health-and-biomedicine",
"natural-language-processing"
] | [
"novel-method"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2025-01-27T04:33:09Z | ESM4SL is a novel method using the pre-trained protein language model ESM-2 for the prediction of cancer cell line-specific synthetic lethality. | [
"general-ml",
"health-and-biomedicine",
"natural-language-processing"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T17:43:44Z | false | 0 | 922,792,923 | null | Python | MIT | [
"novel-method"
] | JieZheng-ShanghaiTech/ESM4SL | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T17:43:44Z | 2026-05-15T08:25:40Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2026-05-15T08:25:45Z | https://github.com/JieZheng-ShanghaiTech/ESM4SL | null |
[
"deep-learning",
"efficient-ml",
"language",
"sequence-modeling",
"time-series"
] | [
"conditional-computation",
"mamba",
"mixture-of-experts",
"sequence-modeling",
"sparse-activation",
"state-space-model"
] | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"efficiency.mixture-of-experts",
"timeseries.state-space-models"
] | false | candidate | 2025-01-29T06:19:13Z | Mamba R1 represents a novel architecture that combines the efficiency of Mamba's state space models with the scalability of Mixture of Experts (MoE). | [
"deep-learning",
"efficient-ml",
"language",
"sequence-modeling",
"time-series"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T17:43:44Z | false | 2 | 923,956,748 | https://swarms.ai | Python | MIT | [
"conditional-computation",
"mamba",
"mixture-of-experts",
"sequence-modeling",
"sparse-activation",
"state-space-model"
] | The-Swarm-Corporation/Mamba-R1 | [
"description",
"github-topics",
"license-metadata",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T17:43:44Z | 2025-10-13T02:21:50Z | [
"efficiency.mixture-of-experts",
"timeseries.state-space-models"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 26 | [
"agents",
"ai",
"alibaba",
"chat",
"deepseek",
"qwen",
"swarm-agents",
"swarms"
] | 2026-09-04T21:57:16Z | https://github.com/The-Swarm-Corporation/Mamba-R1 | null |
[
"computer-vision",
"earth-observation",
"earth-science",
"generative-modeling",
"geospatial",
"geospatial-science",
"remote-sensing",
"science-and-engineering"
] | [
"deep-learning",
"diffusion",
"foundation-model",
"geospatial-learning",
"machine-learning",
"remote-sensing"
] | [
"description",
"github-topics",
"license-metadata",
"paper-reference",
"query-match",
"repository-metadata"
] | [
"geo.topic-remote-sensing",
"science.remote-sensing"
] | false | candidate | 2025-03-12T14:24:33Z | [CVPR 2025] The official implementation of EMRDM, which is a novel diffusion model for cloud removal of remote sensing images. | [
"computer-vision",
"earth-observation",
"earth-science",
"generative-modeling",
"geospatial",
"geospatial-science",
"remote-sensing",
"science-and-engineering"
] | [
"deep-learning",
"diffusion-model"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T17:43:44Z | false | 2 | 947,335,059 | https://arxiv.org/abs/2503.23717 | Python | AGPL-3.0 | [
"deep-learning",
"diffusion",
"foundation-model",
"geospatial-learning",
"machine-learning",
"remote-sensing"
] | Ly403/EMRDM | [
"description",
"github-topics",
"license-metadata",
"paper-reference",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T17:43:44Z | 2026-01-10T07:40:15Z | [
"geo.topic-remote-sensing",
"science.remote-sensing"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 67 | [
"cloud-removal",
"deep-learning",
"diffusion",
"low-level-vision",
"multitemporal-remote-sensing",
"open-source",
"python",
"pytorch",
"pytorch-lightning",
"remote-sensing",
"sentinel-2"
] | 2026-09-18T12:17:15Z | https://github.com/Ly403/EMRDM | null |
[
"general-ml",
"generative-modeling"
] | [
"diffusion",
"distillation",
"novel-method"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2025-06-18T20:00:56Z | This repo introduces a Novel method for distillation of diffusion model leveraging the teacher's intermediate steps for supervision while distillation training. | [
"general-ml",
"generative-modeling"
] | [
"diffusion-model"
] | ml_related_text | gh-ml-relevance-v1 | 2026-09-24T17:43:44Z | false | 1 | 1,004,549,833 | null | Jupyter Notebook | Apache-2.0 | [
"diffusion",
"distillation",
"novel-method"
] | dsgiitr/SADD | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T17:43:44Z | 2026-02-08T13:22:44Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 6 | [] | 2026-02-08T13:22:48Z | https://github.com/dsgiitr/SADD | null |
[
"imitation-learning",
"reinforcement-learning"
] | [
"imitation-learning",
"inverse-reinforcement-learning",
"reinforcement-learning"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"rl.inverse"
] | false | candidate | 2025-09-12T05:48:00Z | IRL-CC: A novel Congestion Control algorithm based on inverse reinforcement learning with parallel training | [
"imitation-learning",
"reinforcement-learning"
] | [
"reinforcement-learning"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T17:03:46Z | false | 1 | 1,055,332,357 | null | Python | null | [
"imitation-learning",
"inverse-reinforcement-learning",
"reinforcement-learning"
] | luopeng69131/IRL-CC | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T17:03:46Z | 2025-09-12T05:49:15Z | [
"rl.inverse"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2025-09-12T05:49:21Z | https://github.com/luopeng69131/IRL-CC | null |
[
"chemistry",
"computational-chemistry",
"drug-discovery",
"graph-learning",
"materials-science"
] | [
"benchmarking",
"graph-neural-network",
"neural-network",
"property-prediction",
"representation-learning"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"chem-molecular-property-benchmark"
] | false | candidate | 2025-11-14T08:39:56Z | This repository provides the official PyTorch implementation for CHAMP (Coupled Hierarchical Atom-Motif Predictor), a novel hierarchical Graph Neural Network framework designed to achieve state-of-the-art performance in molecular property prediction. | [
"chemistry",
"computational-chemistry",
"drug-discovery",
"graph-learning",
"materials-science"
] | [
"neural-network"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T16:16:53Z | false | 0 | 1,096,311,897 | null | Python | null | [
"benchmarking",
"graph neural network",
"neural network",
"property-prediction",
"representation-learning"
] | xbtc-lab/CHAMP | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T16:16:53Z | 2026-07-07T07:24:24Z | [
"chem-molecular-property-benchmark"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 4 | [] | 2026-08-14T07:11:05Z | https://github.com/xbtc-lab/CHAMP | null |
[
"general-ml",
"machine-learning-systems"
] | [
"novel-method",
"pruning"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2026-01-22T11:21:45Z | Evaluation of various ML unlearning approaches, ranging from established techniques like finetuning and poisoning to novel methods like Pruning Complex, in an ablation study. | [
"general-ml",
"machine-learning-systems"
] | [
"machine-learning"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T14:59:41Z | false | 0 | 1,139,754,650 | null | Jupyter Notebook | null | [
"novel-method",
"pruning"
] | vstrozzi/assessing-machine-unlearning-approaches | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T14:59:41Z | 2026-01-22T15:40:02Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 1 | [] | 2026-01-22T15:46:06Z | https://github.com/vstrozzi/assessing-machine-unlearning-approaches | null |
[
"embodied-ai",
"robotics",
"robotics-and-control"
] | [
"manipulation"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"robotics.manipulation"
] | false | candidate | 2026-01-25T07:09:06Z | Trustworthy Evaluation of Robotic Manipulation: A New Benchmark and AutoEval Methods | [
"embodied-ai",
"robotics",
"robotics-and-control"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T14:59:41Z | false | 0 | 1,141,654,235 | null | Python | Apache-2.0 | [
"manipulation"
] | LogSSim/TERM-Bench | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T14:59:41Z | 2026-01-27T06:58:32Z | [
"robotics.manipulation"
] | specific-method-with-novelty-claim | [
"contribution-language",
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 11 | [] | 2026-08-17T20:10:16Z | https://github.com/LogSSim/TERM-Bench | null |
[
"general-ml",
"generative-modeling",
"privacy-and-federated-learning"
] | [
"diffusion",
"federated-learning",
"novel-method"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2026-01-27T05:29:48Z | A novel method to deploy federated learning with diffusion model | [
"general-ml",
"generative-modeling",
"privacy-and-federated-learning"
] | [
"diffusion-model"
] | ml_related_text | gh-ml-relevance-v1 | 2026-09-24T14:59:41Z | false | 0 | 1,143,039,570 | null | Python | null | [
"diffusion",
"federated learning",
"novel-method"
] | suxas/DMFL | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T14:59:41Z | 2026-09-04T04:30:24Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2026-04-08T07:53:10Z | https://github.com/suxas/DMFL | null |
[
"graph-learning"
] | [
"graph-classification",
"graph-neural-network",
"graph-representation-learning",
"neural-network"
] | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | [
"graph.graph-classification"
] | false | candidate | 2026-05-14T21:36:18Z | Official repository for SumGCN: A novel Graph Neural Network architecture based on the anti-Laplacian operator. Includes theoretical foundations, source code, and full reproducibility for node/graph classification experiments and ADHD detection. | [
"graph-learning"
] | [
"neural-network",
"classifier"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T13:58:11Z | false | 0 | 1,239,203,796 | null | Jupyter Notebook | MIT | [
"graph neural network",
"graph-classification",
"graph-representation-learning",
"neural network"
] | MauricioAguasFonseca/SumGCN-Research | [
"description",
"license-metadata",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T13:58:11Z | 2026-06-01T14:48:30Z | [
"graph.graph-classification"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2026-06-01T15:19:12Z | https://github.com/MauricioAguasFonseca/SumGCN-Research | null |
[
"general-ml"
] | [
"novel-method",
"transformer"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2026-05-21T20:50:51Z | Soft Clustering and Weighted Transformer-Based Novel Method for Missing Data Imputation | [
"general-ml"
] | [
"transformer"
] | ml_related_text | gh-ml-relevance-v1 | 2026-09-24T14:59:41Z | false | 0 | 1,246,064,184 | null | Python | null | [
"novel-method",
"transformer"
] | caferbudak/Soft-Clustering-and-Weighted-Transformer-Based-Novel-Method-for-Missing-Data-Imputation- | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T14:59:41Z | 2026-05-21T22:00:55Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2026-05-21T22:00:59Z | https://github.com/caferbudak/Soft-Clustering-and-Weighted-Transformer-Based-Novel-Method-for-Missing-Data-Imputation- | null |
[
"finance-and-economics",
"general-ml",
"time-series-and-forecasting"
] | [
"meta-learning",
"novel-method"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"general.novel-method"
] | false | candidate | 2026-06-02T17:46:19Z | News-Informed Cross-sectional Temporal Meta-learning (NICTM), our new novel method for Financial Forecasting | [
"finance-and-economics",
"general-ml",
"time-series-and-forecasting"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T14:59:41Z | false | 0 | 1,257,462,261 | null | Python | null | [
"meta learning",
"novel-method"
] | varunbly/NICTM | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T14:59:41Z | 2026-06-26T11:23:18Z | [
"general.novel-method"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2026-06-26T11:26:31Z | https://github.com/varunbly/NICTM | null |
[
"generative-ai",
"language",
"natural-language-processing",
"optimization",
"safety"
] | [
"alignment",
"preference-optimization"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"llm.preference-optimization"
] | false | candidate | 2026-06-08T18:56:46Z | A new direct preference optimization algorithm that simultaneously align LLM with multiple positive and negative responses | [
"generative-ai",
"language",
"natural-language-processing",
"optimization",
"safety"
] | [
"large-language-model"
] | direct_ml_text | gh-ml-relevance-v1 | 2026-09-24T14:59:41Z | false | 0 | 1,263,236,917 | null | Python | null | [
"alignment",
"preference-optimization"
] | yaochenzhu/Mult_DPO | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T14:59:41Z | 2026-06-08T18:57:57Z | [
"llm.preference-optimization"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 4 | [] | 2026-06-15T15:03:09Z | https://github.com/yaochenzhu/Mult_DPO | null |
[
"computational-science",
"physics"
] | [
"neural-operator",
"neural-operators",
"surrogate-modeling"
] | [
"description",
"query-match",
"repository-metadata"
] | [
"science.neural-operators"
] | false | candidate | 2026-07-09T09:02:54Z | Resolvent Neural Operator is a new transform-free neural operator framework for solving PDEs. | [
"computational-science",
"physics"
] | [] | no_text_signal | gh-ml-relevance-v1 | 2026-09-24T14:59:41Z | false | 0 | 1,294,950,319 | null | Python | null | [
"neural operator",
"neural-operators",
"surrogate-modeling"
] | JohnJoeZhu/Resolvent-Neural-Operator-RNO | [
"description",
"query-match",
"repository-metadata"
] | 1 | 2026-09-24T14:59:41Z | 2026-07-17T02:31:56Z | [
"science.neural-operators"
] | specific-method-with-novelty-claim | [
"method-tied-novelty-claim",
"ml-method-cue"
] | include | ml-contribution-v1 | 0 | [] | 2026-07-12T02:35:03Z | https://github.com/JohnJoeZhu/Resolvent-Neural-Operator-RNO | null |
GitHub ML
A continually refreshed registry of GitHub repositories that may contribute an ML method, model, or technique across fields. Broad Search retrieval is retained as raw provenance. The default current view applies the versioned ml-contribution-v1 selector to prioritize repositories whose own text makes a method-specific novelty claim.
The selector is a high-precision text heuristic, not verification. Self-description cannot establish actual novelty, correctness, reproducibility, or scientific quality. Its rules screen common forks, owner/profile repositories, coursework, resource collections, tutorial-only projects, and unrelated utilities. Rows with uncertain evidence or explicit exclusion cues are not in the default view; the complete append-only retrieval history remains available in the named observations configuration for audit. Metadata can be incomplete or stale, and the registry is not a comprehensive census of ML work.
The display name is GitHub ML; gh-ml is the dataset and code repository slug.
Data files
The collector appends machine-readable JSON Lines observations by UTC publication date, with run coverage and resumable checkpoints, using this layout:
README.md # uploaded with the first current snapshot
data/current/repositories.parquet # strict current view
data/history/observations.parquet # Parquet projection for the observations config
data/current/manifest.json # v5 source and selection counts, hashes, and provenance
data/observations/YYYY/MM/DD/<run-id>.jsonl
coverage/<run-id>.json
state/checkpoint.json
state/sample.json
state/historical-sample.json
state/backfill.json
state/backfill-fair.json
Each JSONL row is one raw repository observation, not a unique repository across the full history. Daily Search passes append observations and coverage. GitHub Search excludes forks by default; query qualifiers are preserved when explicitly configured. Snapshot publication derives data/history/observations.parquet from the append-only JSONL source files without applying the novelty selector, so the named observations config can be read by the Datasets library alongside the default Parquet config. The current Parquet is derived by selecting the greatest observed_at row per numeric github_id, then applying ml-contribution-v1. Manifest version 5 records input revisions and hashes, raw observation-row count and Parquet hash, distinct latest-repository count, included/review/excluded counts, and selection reasons. state/sample.json stores breadth-sample progress, state/historical-sample.json annual-sample progress, state/checkpoint.json recent collection progress, and state/backfill-fair.json fair backfill progress; legacy state/backfill.json remains available for historical runs. Coverage records attempted query or date partitions, result counts, pages scanned, outcomes, and known gaps. Search observations and coverage are append-only, while checkpoints are replaced as collection continues. The daily workflow has four bounded Search passes followed by a snapshot step; a local queryless census is experimental and not part of the scheduled workflow. See Hugging Face repository structure and dataset cards.
The snapshot publisher commits data/current/repositories.parquet, data/history/observations.parquet, this card, and data/current/manifest.json together in one atomic Hub commit after the four Search collectors have committed their raw observations. The scheduled workflow rebuilds both Parquet files from the observation files on main; a manual snapshot_only dispatch can refresh them without running Search. If a collector fails, the snapshot step still derives from any successful collector commits, then the workflow reports the collector failure at its final gate. The default Parquet is one latest row per GitHub ID with selection_status == "include"; review and exclude rows are not included in it. The observations Parquet retains every raw observation row without filtering. Manifest version 5 records source files, hashes, counts, and selector version.
Fields
| Field | Meaning |
|---|---|
github_id |
Stable numeric GitHub repository ID and deduplication key |
name, url |
Current repository name and URL |
description |
Repository description, nullable |
created_at, updated_at, pushed_at |
GitHub timestamps |
stars, forks |
Observed repository counts |
language, license, topics, homepage |
GitHub metadata; nullable or empty when missing |
archived, fork |
Repository state flags; GitHub Search excludes forks by default |
domains, methods |
Multi-label tags represented as lists of lowercase hyphenated slugs |
query_ids |
Collection queries that matched the repository |
observed_at |
UTC timestamp for this metadata snapshot |
novelty_signals |
Evidence labels such as query match, paper reference, or model weights; not novelty verification |
candidate_status |
candidate; not novelty verification |
evidence_version, evidence_tier, evidence_signals |
Versioned text hints from repository name, description, and topics; they do not verify ML use or novelty. |
selection_version, selection_status, selection_reason, selection_signals |
Derived current-view fields. The local projection evaluates each latest observation, but the published Parquet contains only include rows; the manifest reports aggregate review and exclude counts. Raw observations do not contain these decision fields. |
first_observed_at, observation_count, all_query_ids, all_domains, all_methods, all_novelty_signals |
Current-view additions. Counts refer to raw observation history per repository; all_* values are sorted unions across that history. |
Labels are open vocabulary, multi-label, and subject to change. They can describe both a field (for example, computer-vision or bioinformatics) and a method (for example, quantization, retrieval, or reinforcement-learning). Missing labels do not mean a project is irrelevant.
Updates and deduplication
The scheduled workflow runs four Search passes with a default total budget of 2,000 requests: breadth sample (500), recent collection (600), annual historical sample (200), and fair historical backfill (700), subject to Actions timeout and GitHub API limits. The 561-query catalog includes 29 additions addressing observed gaps. Its broad matches form raw provenance; GitHub Search excludes forks by default, and explicit query qualifiers are preserved. The breadth pass rotates through the catalog with one created: first-page search per selected query, so a daily budget may leave some queries untouched and ranking can omit matches. The algorithmic-trading query specifically requires both “algorithmic trading” and “machine learning” in the README. These retrieval passes improve recall in the audit history but do not determine the default dataset or verify novelty.
The historical-sample pass takes one ranked first-page search for every query/year lane from 2008 through a campaign end date fixed when the campaign starts. That end date stays fixed across partial runs and later runs with an expanded catalog. Its v2 completion ledger preserves completed (query ID, query text, year) lanes across catalog additions and edits. New or changed queries are sampled for every year in the fixed campaign, removed queries are dropped, and a legacy v1 cursor is safely migrated by matching query signatures. The checkpoint is state/historical-sample.json on the Hub and historical-sample-state.json in local output. Completed ledger entries persist, so future catalog additions resume only their missing lanes. The bounded request budget remains 200 per scheduled day, processed round-robin across query groups. These annual samples can improve breadth across creation years, but ranked first-page sampling can omit matching repositories; they do not replace historical backfill or establish completeness. The scheduled backfill-fair pass rotates through query/date-partition work, issuing one Search request per query in each rotation to spread its bounded budget across queries. Its checkpoints are state/backfill-fair.json on the Hub and backfill-fair-state.json in local output. The legacy backfill command still uses state/backfill.json / backfill-state.json; fair backfill uses a separate checkpoint and does not migrate the old cursor. Do not claim exhaustive coverage until all date partitions have been scanned and coverage records show a completed sweep. Recent and breadth checkpoints remain at state/checkpoint.json and state/sample.json, respectively. Within a run, matches merge by numeric github_id, never by mutable name. Across runs, the observation history is append-only; uv run gh-ml current-view /path/to/downloaded-dataset --output ~/.local/share/modelomics-gh-ml/current-view.jsonl builds one row per ID from the local data/observations/**/*.jsonl files. It selects the greatest observed_at; any all_* accumulated-label fields retain values across the history while the other fields come from that latest row. The command also writes a manifest and does not modify the Hub. For Parquet output, install uv sync --extra parquet and provide --parquet-output <path>.
The current projection selects the greatest observed_at observation for each GitHub ID, adds first_observed_at, observation_count, and sorted unions of labels, then evaluates repository-owned text with ml-contribution-v1. Inclusion requires new or novel followed within three tokens by a method-class noun (architecture, method, model, technique, algorithm, policy, network, operator, or optimizer), plus a recognized ML method cue within 48 characters of that claim in the same sentence of the repository name or description. Orphan introduce or propose language does not qualify. Tutorials and survey/paper-list repositories are excluded. Overview, reflection, reproduction, and dataset cues go to review. Course and utility cues are excluded unless the method-specific novelty condition is met, in which case they go to review. Forks and owner/profile repositories are excluded. The selector assigns include, review, or exclude; only include is exported, while review/exclude rows remain in raw observations. Decision fields are derived and query labels do not satisfy the rule. The Parquet's observation_count counts every raw historical observation for that repository; the manifest separately reports total raw observation rows, unique latest repositories before selection, and included/review/excluded counts. This text filter cannot verify claims or guarantee actual novelty; false positives and missed candidates remain possible.
The source query catalog currently contains 561 queries, including 29 added for known coverage gaps. It is intentionally broad and serves only as retrieval provenance for the raw observations config. Query-derived methods or domains cannot satisfy the contribution selector. All records are keyed by numeric github_id, and the latest row is chosen by observed_at before selection. A queryless GitHub Core API census remains an experimental local tool and is not scheduled or published as part of this dataset.
The source is GitHub's public repository metadata and Search API. GitHub Search caps each query at 1,000 returned results and at 4,000 repositories searched, and is subject to request limits, timeouts, incomplete responses, and indexing gaps. Annual historical sampling covers only the ranked first page for each query/year, so its query/year attempts do not mean it collected every matching repository. A coverage status of capped or incomplete, or coverage_gap: true, flags known gaps; check coverage_gap_reason and the other per-query fields. Broad query coverage and exhaustive backfills improve recall but cannot guarantee exhaustiveness. Results can include false positives, and not all novel ML work is hosted on GitHub or discoverable by the configured queries. See the official Search API documentation.
Access
This dataset is maintained at modelomics/gh-ml. The append-only JSONL observations are the source history on main; the current config provides the strict Parquet view, and the observations config provides raw-history Parquet derived from the append-only JSONL source files. Hugging Face Trusted Publisher authentication is configured for repository modelomics/gh-ml, branch main, and workflow daily.yml. The workflow requests id-token: write and exchanges its GitHub identity using HF_OIDC_RESOURCE=datasets/modelomics/gh-ml; see Hugging Face Trusted Publishers. An HF_TOKEN secret, when set, takes precedence over OIDC. Actions supplies GITHUB_TOKEN for GitHub Search. To recover a scheduled Search run, use Run workflow in Actions: each successful pass commits its cursor with observations and coverage, while a failed search leaves the prior checkpoint available for retry.
For local publishing, set HF_TOKEN in the environment or sign in with uv run hf auth login; the collector reads the saved Hugging Face CLI token. GitHub authentication can be provided through GITHUB_TOKEN or gh auth login (the collector reads gh auth token). The HF token must have write permission on modelomics/gh-ml. For local recovery, rerun using the same --output-dir so the local cursor is reused; the default is ~/.local/share/modelomics-gh-ml/runs. Use --no-publish for local-only collection, which writes run files without requiring Hugging Face credentials.
The source card YAML below declares both configs as Parquet, with current as the default and observations as the named, opt-in raw history. The current config is the default strict view; observations points to raw-history Parquet regenerated from the JSONL source files and preserves all unfiltered rows. The snapshot publisher commits both Parquet artifacts, the manifest, and this card atomically. These configs follow the Hub's dataset repository structure; datasets is needed only by consumers, not by the collector.
from datasets import load_dataset
# Default config: one strict high-precision row per included GitHub ID.
current_default = load_dataset("modelomics/gh-ml")["train"]
current = load_dataset("modelomics/gh-ml", "current")["train"]
# Opt-in audit history: append-only, unfiltered observations.
observations = load_dataset("modelomics/gh-ml", "observations")["train"]
Coverage is per run; it is not a list of repositories. Breadth sample coverage describes one first page per selected catalog query; annual historical-sample coverage describes one first page per query/year; daily recent coverage describes pushed-date search windows; fair and legacy backfill coverage describe created-date partitions. A complete_sweep of false usually means the request budget left a cursor to resume. Within each run's queries, review status, coverage_gap, coverage_gap_reason, incomplete_results, and search_limit_reached. Fair backfill is not evidence of exhaustive coverage until all date partitions have been scanned and coverage records show the completed sweep. Coverage and checkpoint JSON are operational metadata, not rows in the repository table. Hub checkpoints let scheduled or manually dispatched Actions runs resume; locally, reuse the same --output-dir to resume local state. Run the breadth sample locally with uv run gh-ml sample --max-requests 500 --since-days 1; run the annual sample with uv run gh-ml historical-sample --max-requests 200; run fair backfill locally without publishing with uv run gh-ml backfill-fair --max-requests 700 --no-publish. The local fair checkpoint is backfill-fair-state.json and is independent from the legacy backfill checkpoint. Add --no-publish to keep output local.
License and attribution
Repository metadata is sourced from GitHub. Repositories retain their own licenses and terms; this registry does not relicense or redistribute their code. Check the license field and the source repository before reusing any project. Dataset-level licensing should be set to the license selected by the maintainers after review of applicable metadata and policies; license: other above is a placeholder for that decision.
- Downloads last month
- -