Inverse NP-Completeness Structure Theory: Inverse Reduction Complexity and a Dual Framework for Decompositional Computability

Zhang, Jincheng

DOI: 10.5281/zenodo.21033120
Published: 2026
Container: Not recorded
Publisher: Zenodo
Open access: yes

Credibility signals

limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

cautionDOI registered: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingPublication license: A publication license was supplied: https://creativecommons.org/licenses/by/4.0/legalcode. Presence improves reuse transparency, not research validity. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
cautionPublication version: Identified as a preprint; peer review and later versions may change the record. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.5281/zenodo.21033120,
  title = {Inverse NP-Completeness Structure Theory: Inverse Reduction Complexity and a Dual Framework for Decompositional Computability},
  author = {Zhang, Jincheng},
  year = {2026},
  doi = {10.5281/zenodo.21033120},
  url = {https://doi.org/10.5281/zenodo.21033120}
}

RIS

TY  - JOUR
TI  - Inverse NP-Completeness Structure Theory: Inverse Reduction Complexity and a Dual Framework for Decompositional Computability
AU  - Zhang, Jincheng
PY  - 2026
DO  - 10.5281/zenodo.21033120
UR  - https://doi.org/10.5281/zenodo.21033120
ER  -

APA

Jincheng, Z. (2026). Inverse NP-Completeness Structure Theory: Inverse Reduction Complexity and a Dual Framework for Decompositional Computability. https://doi.org/10.5281/zenodo.21033120

Source records

datacite · retrieved 2026-09-25T13:04:30.154Z