Vision-Language Models for automated quality control: a benchmarking framework and comprehensive study.
The 3 matches
- [1] § Methodology › Evaluation protocol ↔ src/core/response_parser.py, lines 102–125 · score 0.80 · Fuzzy matching, parsing attempts, Parsing Strategy, confidence scores, Regex, parser
- [2] § Methodology › Evaluation protocol ↔ src/core/prompt_engine.py, lines 24–172 · score 0.54 · Prompt templates, task instructions, classification
- [3] § Experiments › Models and configuration ↔ src/evaluators/gemini.py, lines 65–184 · score 0.51 · top_p, temperature, tokens, max, configurations, models
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 516 lines · 21 KB · no license · 1 match
- """Universal response parser for handling multiple VLM response formats."""
- import json
- import re
- import logging
- from typing import List, Dict, Optional, Any, Tuple
- from dataclasses import dataclass
- from enum import Enum
- logger = logging.getLogger(__name__)
- class ParsingStrategy(Enum):
- """Available parsing strategies."""
- DIRECT_JSON = "direct_json"
- CONFIDENCE_SCORES = "confidence_scores"
- NESTED_STRUCTURES = "nested_structures"
- MIXED_CONTENT = "mixed_content"
- REGEX_EXTRACTION = "regex_extraction"
- FUZZY_MATCHING = "fuzzy_matching"
- @dataclass
- class ParseResult:
- """Result of parsing a model response."""
- success: bool
- predicted_class: str
- confidence: Optional[float] = None
- reasoning: str = ""
- strategy_used: Optional[ParsingStrategy] = None
- raw_extracted: Optional[Dict] = None
- class UniversalResponseParser:
- """Handles multiple JSON response formats from different models."""
- # Default parsing strategy order (most reliable first)
- DEFAULT_STRATEGIES = [
- ParsingStrategy.DIRECT_JSON,
- ParsingStrategy.CONFIDENCE_SCORES,
- ParsingStrategy.NESTED_STRUCTURES,
- ParsingStrategy.MIXED_CONTENT,
- ParsingStrategy.REGEX_EXTRACTION,
- ParsingStrategy.FUZZY_MATCHING
- ]
- def __init__(self,
- allowed_classes: List[str],
- strategies: Optional[List[str]] = None,
- enable_fuzzy_matching: bool = True,
- confidence_threshold: float = 0.0):
- """Initialize parser.
- Args:
- allowed_classes: List of valid class names
- strategies: Custom parsing strategy order
- enable_fuzzy_matching: Whether to enable fuzzy matching
- confidence_threshold: Minimum confidence threshold
- """
- self.allowed_classes = allowed_classes
- self.enable_fuzzy_matching = enable_fuzzy_matching
- self.confidence_threshold = confidence_threshold
- # Build strategy list
- if strategies:
- self.strategies = [ParsingStrategy(s) for s in strategies
- if s in [e.value for e in ParsingStrategy]]
- else:
- self.strategies = self.DEFAULT_STRATEGIES.copy()
- if not enable_fuzzy_matching:
- self.strategies = [s for s in self.strategies if s != ParsingStrategy.FUZZY_MATCHING]
- def parse_response(self, response: str) -> ParseResult:
- """Try multiple parsing strategies in order of reliability.
- Args:
- response: Raw model response
- Returns:
- ParseResult: Parsing result with success status
- """
- if not response or not response.strip():
- return ParseResult(success=False, predicted_class="")
- # Try each strategy in order
- for strategy in self.strategies:
- try:
- result = self._apply_strategy(strategy, response)
- if result.success:
- result.strategy_used = strategy
- logger.debug(f"Successfully parsed with strategy: {strategy.value}")
- return result
- except Exception as e:
- logger.debug(f"Strategy {strategy.value} failed: {e}")
- continue
- # All strategies failed
- logger.warning(f"Failed to parse response with any strategy: {response[:100]}...")
- return ParseResult(success=False, predicted_class="")
- def _apply_strategy(self, strategy: ParsingStrategy, response: str) -> ParseResult:
- """Apply a specific parsing strategy.
- Args:
- strategy: Parsing strategy to use
- response: Raw response text
- Returns:
- ParseResult: Result of parsing attempt
- """
- if strategy == ParsingStrategy.DIRECT_JSON:
- return self._parse_direct_json(response)
- elif strategy == ParsingStrategy.CONFIDENCE_SCORES:
- return self._parse_confidence_scores(response)
- elif strategy == ParsingStrategy.NESTED_STRUCTURES:
- return self._parse_nested_structures(response)
- elif strategy == ParsingStrategy.MIXED_CONTENT:
- return self._parse_mixed_content(response)
- elif strategy == ParsingStrategy.REGEX_EXTRACTION:
- return self._parse_regex_extraction(response)
- elif strategy == ParsingStrategy.FUZZY_MATCHING:
- return self._parse_fuzzy_matching(response)
- else:
- return ParseResult(success=False, predicted_class="")
- def _parse_direct_json(self, response: str) -> ParseResult:
- """Parse standard JSON classification formats."""
- text = self._strip_fences(response)
- # Find JSON in response
- json_start = text.find('{')
- json_end = text.rfind('}') + 1
- if json_start < 0:
- return ParseResult(success=False, predicted_class="")
- # Handle cases where closing brace is missing or not found
- if json_end <= json_start:
- # Try to extract from opening brace to end of text
- json_str = text[json_start:].strip()
- # If it doesn't end with }, try adding one
- if not json_str.endswith('}'):
- json_str = json_str.rstrip() + '}'
- else:
- json_str = text[json_start:json_end]
- # Try parsing the JSON
- try:
- parsed = json.loads(json_str)
- if not isinstance(parsed, dict):
- return ParseResult(success=False, predicted_class="")
- # Try standard field names
- raw_class = (parsed.get('class') or
- parsed.get('classification') or
- parsed.get('label') or
- parsed.get('predicted_label') or
- parsed.get('prediction'))
- if raw_class:
- normalized_class = self._normalize_class_name(raw_class)
- if normalized_class:
- confidence = parsed.get('confidence', parsed.get('score'))
- reasoning = parsed.get('reason', parsed.get('reasoning', ''))
- return ParseResult(
- success=True,
- predicted_class=normalized_class,
- confidence=confidence,
- reasoning=reasoning,
- raw_extracted=parsed
- )
- except json.JSONDecodeError:
- # If simple closing brace addition failed, try more robust repair
- try:
- # Try to repair truncated JSON by finding the last complete field
- repaired_json = self._repair_truncated_json(text[json_start:])
- if repaired_json:
- parsed = json.loads(repaired_json)
- if isinstance(parsed, dict):
- raw_class = (parsed.get('class') or
- parsed.get('classification') or
- parsed.get('label') or
- parsed.get('predicted_label') or
- parsed.get('prediction'))
- if raw_class:
- normalized_class = self._normalize_class_name(raw_class)
- if normalized_class:
- confidence = parsed.get('confidence', parsed.get('score'))
- reasoning = parsed.get('reason', parsed.get('reasoning', ''))
- return ParseResult(
- success=True,
- predicted_class=normalized_class,
- confidence=confidence,
- reasoning=reasoning,
- raw_extracted=parsed
- )
- except json.JSONDecodeError:
- pass
- return ParseResult(success=False, predicted_class="")
- def _parse_confidence_scores(self, response: str) -> ParseResult:
- """Parse confidence-based responses like {"Bundle":0.2,"Single-Item":0.8}."""
- text = self._strip_fences(response)
- # Find JSON in response
- json_start = text.find('{')
- json_end = text.rfind('}') + 1
- if json_start < 0 or json_end <= json_start:
- return ParseResult(success=False, predicted_class="")
- json_str = text[json_start:json_end]
- try:
- parsed = json.loads(json_str)
- if not isinstance(parsed, dict):
- return ParseResult(success=False, predicted_class="")
- # Check if this is a confidence-based format (all values are numeric)
- if not all(isinstance(v, (int, float)) for v in parsed.values()):
- return ParseResult(success=False, predicted_class="")
- # Check if all keys are potential class names with numeric values
- class_scores = {}
- for key, value in parsed.items():
- normalized_key = self._normalize_class_name(key)
- if normalized_key:
- class_scores[normalized_key] = float(value)
- if class_scores:
- # Find class with highest confidence
- best_class = max(class_scores.items(), key=lambda x: x[1])
- if best_class[1] >= self.confidence_threshold:
- return ParseResult(
- success=True,
- predicted_class=best_class[0],
- confidence=best_class[1],
- raw_extracted=parsed
- )
- else:
- # Failed threshold but still parsed correctly
- logger.debug(f"Confidence {best_class[1]} below threshold {self.confidence_threshold}")
- return ParseResult(success=False, predicted_class="")
- except json.JSONDecodeError:
- pass
- return ParseResult(success=False, predicted_class="")
- def _parse_nested_structures(self, response: str) -> ParseResult:
- """Parse nested JSON structures."""
- text = self._strip_fences(response)
- json_start = text.find('{')
- json_end = text.rfind('}') + 1
- if json_start < 0 or json_end <= json_start:
- return ParseResult(success=False, predicted_class="")
- json_str = text[json_start:json_end]
- try:
- parsed = json.loads(json_str)
- if not isinstance(parsed, dict):
- return ParseResult(success=False, predicted_class="")
- # Handle nested classifications array structure
- if 'classifications' in parsed:
- classifications = parsed['classifications']
- if isinstance(classifications, list) and classifications:
- first_classification = classifications[0]
- if isinstance(first_classification, dict):
- raw_class = (first_classification.get('name') or
- first_classification.get('class') or
- first_classification.get('label'))
- if raw_class:
- normalized_class = self._normalize_class_name(raw_class)
- if normalized_class:
- confidence = first_classification.get('confidence',
- first_classification.get('score'))
- return ParseResult(
- success=True,
- predicted_class=normalized_class,
- confidence=confidence,
- raw_extracted=parsed
- )
- # Handle result wrapper
- if 'result' in parsed and isinstance(parsed['result'], dict):
- result = parsed['result']
- raw_class = (result.get('class') or
- result.get('classification') or
- result.get('label'))
- if raw_class:
- normalized_class = self._normalize_class_name(raw_class)
- if normalized_class:
- return ParseResult(
- success=True,
- predicted_class=normalized_class,
- raw_extracted=parsed
- )
- except json.JSONDecodeError:
- pass
- return ParseResult(success=False, predicted_class="")
- def _parse_mixed_content(self, response: str) -> ParseResult:
- """Parse responses that mix text with JSON."""
- # Look for JSON embedded in text
- json_patterns = [
- r'```json\s*(.*?)\s*```',
- r'```\s*(.*?)\s*```',
- r'JSON:\s*(\{.*?\})',
- r'json\s*(\{.*?\})',
- r'(\{[^}]*"(?:class|classification|label)"[^}]*\})'
- ]
- for pattern in json_patterns:
- matches = re.finditer(pattern, response, re.DOTALL | re.IGNORECASE)
- for match in matches:
- json_candidate = match.group(1).strip()
- try:
- parsed = json.loads(json_candidate)
- if isinstance(parsed, dict):
- raw_class = (parsed.get('class') or
- parsed.get('classification') or
- parsed.get('label'))
- if raw_class:
- normalized_class = self._normalize_class_name(raw_class)
- if normalized_class:
- return ParseResult(
- success=True,
- predicted_class=normalized_class,
- raw_extracted=parsed
- )
- except json.JSONDecodeError:
- continue
- return ParseResult(success=False, predicted_class="")
- def _parse_regex_extraction(self, response: str) -> ParseResult:
- """Extract class names using regex patterns."""
- # Patterns for finding class names in various contexts
- patterns = [
- r'"(?:class|classification|label|prediction)"\s*:\s*"([^"]+)"',
- r'(?:class|classification|label):\s*"?([^",\s\}]+)"?',
- r'classify(?:ing|ied)?\s+(?:as|to)\s+["\']?([^"\'.,\s]+)["\']?',
- ]
- # First try structured patterns
- for pattern in patterns:
- matches = re.finditer(pattern, response, re.IGNORECASE)
- for match in matches:
- candidate = match.group(1).strip()
- normalized_class = self._normalize_class_name(candidate)
- if normalized_class:
- return ParseResult(
- success=True,
- predicted_class=normalized_class
- )
- # Only try direct class name matching if it's clearly in a classification context
- classification_context_pattern = r'\b(?:is|are|classify|class|label|prediction|result).*?\b(Bundle|Single-Item)\b'
- matches = re.finditer(classification_context_pattern, response, re.IGNORECASE)
- for match in matches:
- candidate = match.group(1).strip()
- normalized_class = self._normalize_class_name(candidate)
- if normalized_class:
- return ParseResult(
- success=True,
- predicted_class=normalized_class
- )
- return ParseResult(success=False, predicted_class="")
- def _parse_fuzzy_matching(self, response: str) -> ParseResult:
- """Last resort fuzzy matching of class names."""
- response_lower = response.lower()
- # Score each class based on presence in response
- class_scores = {}
- for class_name in self.allowed_classes:
- class_lower = class_name.lower()
- score = 0
- # Exact match (highest score)
- if class_lower in response_lower:
- score += 10
- # Partial matches for compound words
- if '-' in class_lower:
- parts = class_lower.split('-')
- for part in parts:
- if part in response_lower:
- score += 3
- # Enhanced Single/Bundle specific fuzzy logic
- if class_lower == 'single-item' or 'single' in class_lower:
- single_keywords = ['single', 'one', 'individual', 'solo', 'alone', 'isolated', 'separate']
- for keyword in single_keywords:
- if keyword in response_lower:
- score += 2
- elif class_lower == 'bundle' or 'bundle' in class_lower:
- bundle_keywords = ['bundle', 'multiple', 'group', 'several', 'many', 'grouped', 'together', 'collection']
- for keyword in bundle_keywords:
- if keyword in response_lower:
- score += 2
- # Generic class name matching
- class_words = class_name.lower().replace('-', ' ').split()
- for word in class_words:
- if len(word) > 2 and word in response_lower: # Avoid matching tiny words
- score += 1
- if score > 0:
- class_scores[class_name] = score
- if class_scores:
- best_class = max(class_scores.items(), key=lambda x: x[1])
- # Lower threshold for fuzzy matching
- if best_class[1] >= 1:
- return ParseResult(
- success=True,
- predicted_class=best_class[0],
- confidence=min(best_class[1] / 10.0, 1.0) # Normalize to 0-1, cap at 1.0
- )
- return ParseResult(success=False, predicted_class="")
- def _normalize_class_name(self, raw_class: str) -> str:
- """Normalize class name to allowed classes."""
- if not raw_class:
- return ""
- raw_lower = raw_class.lower().strip()
- # Exact case-insensitive match (exact matching first)
- for allowed_class in self.allowed_classes:
- if raw_lower == allowed_class.lower():
- return allowed_class
- # Conservative substring matching for common variations
- for allowed_class in self.allowed_classes:
- allowed_lower = allowed_class.lower()
- # Check for partial word matches in allowed_class
- allowed_words = allowed_lower.replace('-', ' ').split()
- raw_words = raw_lower.replace('-', ' ').split()
- # Check if any raw words completely match any allowed words
- if any(raw_word in allowed_words for raw_word in raw_words):
- return allowed_class
- return ""
- def _repair_truncated_json(self, json_text: str) -> str:
- """Attempt to repair truncated JSON by finding the last complete field.
- Args:
- json_text: Potentially truncated JSON text
- Returns:
- str: Repaired JSON string or empty if repair failed
- """
- try:
- # Remove leading/trailing whitespace
- text = json_text.strip()
- # Must start with opening brace
- if not text.startswith('{'):
- return ""
- # Find the last complete field by looking for patterns like:
- # "field": value,
- # "field": value
- # "field": [...]
- # "field": {...}
- # Look for the last complete field ending
- patterns = [
- r'"[^"]+"\s*:\s*"[^"]*"(?:\s*,)?', # String values
- r'"[^"]+"\s*:\s*[\d.]+(?:\s*,)?', # Numeric values
- r'"[^"]+"\s*:\s*(?:true|false)(?:\s*,)?', # Boolean values
- r'"[^"]+"\s*:\s*\[\s*(?:"[^"]*"(?:\s*,\s*"[^"]*")*\s*)?\](?:\s*,)?', # Arrays
- ]
- last_match_end = 1 # Start after opening brace
- for pattern in patterns:
- matches = list(re.finditer(pattern, text, re.IGNORECASE))
- for match in matches:
- if match.end() > last_match_end:
- last_match_end = match.end()
- if last_match_end > 1:
- # Take content up to last complete field
- partial_json = text[:last_match_end]
- # Remove trailing comma if present
- partial_json = re.sub(r',\s*$', '', partial_json)
- # Add closing brace
- repaired = partial_json + '}'
- # Test if it's valid JSON
- json.loads(repaired)
- return repaired
- except (json.JSONDecodeError, re.error):
- pass
- return ""
- def _strip_fences(self, text: str) -> str:
- """Remove markdown code fences."""
- return re.sub(r"```(?:json)?\s*([\s\S]*?)```", r"\1", text, flags=re.IGNORECASE).strip()
response_parser.py at commit f3449ff, no license · at the source
Overview
Abstract
The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.
Repository
Its files are read in the Code ↔ Paper reader above, with 3 matches between paragraphs and lines of code.
mzahana/vlm-bench
f3449ff370c1699fe9a01b6c5312670b0de5ca26, 5 June 2026Availability: 1 check, the latest on 28 September 2026: the link answers
- 28 September 2026: the link answers
53 files
- main.py, Python, 668 lines
- reproduce_plots.py, Python, 656 lines
- src/
__init__.py , Python, 4 lines - src/
core/ , Python, 7 lines__init__.py - src/
core/ , Python, 361 linescompatibility.py - src/
core/ , Python, 165 linesconfig.py - src/
core/ , Python, 385 linesconfig_manager.py - src/
core/ , Python, 174 linesdata_structures.py - src/
core/ , Python, 149 linesinterfaces.py - src/
core/ , Python, 172 lines, 1 matchprompt_engine.py - src/
core/ , Python, 516 lines, 1 matchresponse_parser.py - src/
dataset/ , Python, 6 lines__init__.py - src/
dataset/ , Python, 442 linesanalyzer.py - src/
dataset/ , Python, 412 linesbase_loader.py - src/
dataset/ , Python, 356 linesclass_mapper.py - src/
dataset/ , Python, 828 linesloader.py - src/
dataset/ , Python, 425 linespreprocessor.py - src/
evaluators/ , Python, 15 lines__init__.py - src/
evaluators/ , Python, 195 linesbase.py - src/
evaluators/ , Python, 118 linesclaude.py - src/
evaluators/ , Python, 183 linesdeepseek.py - src/
evaluators/ , Python, 227 lines, 1 matchgemini.py - src/
evaluators/ , Python, 212 linesollama.py - src/
metrics/ , Python, 6 lines__init__.py - src/
metrics/ , Python, 736 linesanalyzer.py - src/
metrics/ , Python, 386 linescalculator.py - src/
visualization/ , Python, 6 lines__init__.py - src/
visualization/ , Python, 268 linesmistake_viz.py - test_gemini_integration.
sh , Shell, 5 lines - test_parsing_end_to_end.
py , Python, 132 lines - test_prompt_system.py, Python, 80 lines
- tests/
__init__.py , Python, 1 line - tests/
test_base_evaluator.py , Python, 293 lines - tests/
test_class_mapper.py , Python, 392 lines - tests/
test_classification_data , Python, 425 linesset_loader.py - tests/
test_claude_evaluator.py , Python, 214 lines - tests/
test_compatibility.py , Python, 409 lines - tests/
test_config.py , Python, 189 lines - tests/
test_config_manager.py , Python, 455 lines - tests/
test_context_file.py , Python, 203 lines - tests/
test_data_structures.py , Python, 248 lines - tests/
test_dataset_analyzer.py , Python, 410 lines - tests/
test_dataset_loader.py , Python, 283 lines - tests/
test_gemini_evaluator.py , Python, 264 lines - tests/
test_generic_loader.py , Python, 502 lines - tests/
test_integration.py , Python, 493 lines - tests/
test_integration_compreh , Python, 588 linesensive.py - tests/
test_metrics_calculator. , Python, 316 linespy - tests/
test_object_highlighting , Python, 356 lines.py - tests/
test_parsing_fixes.py , Python, 199 lines - tests/
test_parsing_integration , Python, 226 lines.py - tests/
test_universal_parser.py , Python, 225 lines - README.md, Text, 602 lines
Code availability statement
The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- it points to the authors' code: mzahana/
vlm-bench
Read it in the paper: doi.org/10.1038/s41598-026-55179-4.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 52 scripts, each with its path and the digest of its content;
- 3 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
Datasets cited
- doi:10.7910/
dvn/ , at the source; found in “Data availability”dbw86t - huggingface.co/
datasets/ , at Hugging Face; found in “Data availability”ultralytics/ brain-tumor
Code and data availability statement
The paper has a code and data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- it points to 2 datasets: DOI 10.7910/
dvn/ , huggingface.co/dbw86t datasets/ ultralytics/ brain-tumor - it points to the authors' code: mzahana/
vlm-bench
Read it in the paper: doi.org/10.1038/s41598-026-55179-4.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 2, 28 September 2026
- Funding: added Prince Sultan University
Version 1, 28 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 1 author, 12 keywords, 7 MeSH terms, 21 references.
Cite
This paper
Abdelkader, M. (2026). Vision-Language Models for automated quality control: a benchmarking framework and comprehensive study. Scientific reports, 16(1), 24047. https://
BibTeX
@article{abdelkader2026v
author = {Abdelkader, Mohamed},
title = {{Vision-Language Models for automated quality control: a benchmarking framework and comprehensive study}},
journal = {Scientific reports},
year = {2026},
month = may,
volume = {16},
number = {1},
pages = {24047},
publisher = {Nature Publishing Group},
issn = {2045-2322},
doi = {10.1038/
url = {https://
pmid = {42191872},
pmcid = {PMC13439064}
}
RIS
TY - JOUR
AU - Abdelkader, Mohamed
TI - Vision-Language Models for automated quality control: a benchmarking framework and comprehensive study
T2 - Scientific reports
J2 - Sci Rep
PY - 2026
DA - 2026/
VL - 16
IS - 1
SP - 24047
SN - 2045-2322
PB - Nature Publishing Group
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Vision-Language Models for automated quality control: a benchmarking framework and comprehensive study",
"container-title": "Scientific reports",
"author": [
{
"family": "Abdelkader",
"given": "Mohamed"
}
],
"container-title-short":
"volume": "16",
"issue": "1",
"page": "24047",
"DOI": "10.1038/
"PMID": "42191872",
"PMCID": "PMC13439064",
"ISSN": "2045-2322",
"publisher": "Nature Publishing Group",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
5,
26
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.3389/frai.2026.1849571
- NeuroPlast: a learnable activation function evaluated under knowledge distillation for medical image classification.Journal: Frontiers in artificial intelligenceIn common: DOI 10.7910/dvn/dbw86t, methods / tools, other condition, 1 reference
- [2] doi:10.1371/journal.pcbi.1014263 [code]
- MIRAGE: Robust multi-modal architectures translate fMRI-to-image models from vision to mental imagery.Journal: PLoS computational biologyIn common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools, 1 reference
- [3] doi:10.7554/elife.107933 [code]
- Modality-agnostic decoding of vision and language from fMRI.Journal: eLifeIn common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools, 1 reference
- [4] doi:10.1002/hbm.70469 [code]
- VarCoNet: A Variability-Aware Self-Supervised Framework for Functional Connectome Extraction From Resting-State fMRI.Journal: Human brain mappingIn common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools, methods / tools
- [5] doi:10.1038/s41467-026-76837-1 [code]
- Drug screen and machine learning predict neuroprotective agents in a preclinical human model of childhood dementia.Journal: Nature communicationsIn common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools, other condition
- [6] doi:10.1162/imag.a.1299 [code]
- A modular semantic-structural pipeline for visual decoding from primate spiking data via selective temporal integration.Journal: Imaging neuroscience (Cambridge, Mass.)In common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools, methods / tools
- [7] doi:10.1111/joa.70203 [code]
- Two-step workflow integrating automatic registration and manual refinement for the accurate alignment of serial histological sections in 3D reconstruction.Journal: Journal of anatomyIn common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools, methods / tools
- [8] doi:10.1038/s41597-026-07248-6 [code]
- A large-scale fMRI dataset for vision-language semantic association.Journal: Scientific dataIn common: Pillow, PyTorch, Matplotlib, 1 other tool, methods / tools, 1 reference
- [9] doi:10.1038/s42003-026-10957-8 [code]
- Brain defence by the extracellular matrix protein Cochlin.Journal: Communications biologyIn common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools
- [10] doi:10.1038/s41467-026-76098-y [code]
- A single computational objective can produce specialization of streams in visual cortex.Journal: Nature communicationsIn common: Hugging Face Transformers, Pillow, PyTorch, 2 other tools
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 52 scripts, and 3 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:230bc38508c9257e…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
