{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "shor-algorithm",
    "title": "Shor: quantum factoring and discrete logarithms",
    "summary": "Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model.",
    "boundary": "The 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.",
    "area": "Quantum computing",
    "topic": "Mathematics & logic",
    "year": 1994,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "shor-algorithm",
    "target": {
      "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
      "version": 2,
      "content_hash": "sha256:e2d9df059c6fdee5f981f19b4e5cf447f2eebaab0b23d85704abf91243095eb0"
    },
    "humans": [
      "Peter Shor"
    ],
    "authors_complete": true,
    "human_role_note": "Listed source contributors; individual labor shares are not measured",
    "agents": [],
    "related": [
      "turing",
      "p-vs-np"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "shor-paper",
        "title": "Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995 preprint)",
        "url": "https://arxiv.org/abs/quant-ph/9508027"
      }
    ],
    "geography": {
      "country_codes": [
        "US"
      ],
      "location_basis": "Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.",
      "source_url": "https://cc.ee.ntu.edu.tw/~rbwu/rapid_content/course/QC/Shor1994.pdf",
      "target": {
        "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
        "version": 2,
        "content_hash": "sha256:e2d9df059c6fdee5f981f19b4e5cf447f2eebaab0b23d85704abf91243095eb0"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://cc.ee.ntu.edu.tw/~rbwu/rapid_content/course/QC/Shor1994.pdf"
        },
        {
          "title": "Attribution source",
          "url": "https://attachment.victorlampcdn.com/article/content/20220811/Shor1994.pdf"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "160000",
    "published_grade": {
      "id": "shor-algorithm",
      "entry_id": "shor-algorithm",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
        "version": 2,
        "content_hash": "sha256:e2d9df059c6fdee5f981f19b4e5cf447f2eebaab0b23d85704abf91243095eb0"
      },
      "what_changed": "Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model.",
      "scope": "Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model. Scope limitation: The 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
        "version": 2,
        "content_hash": "sha256:e2d9df059c6fdee5f981f19b4e5cf447f2eebaab0b23d85704abf91243095eb0"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": {
      "content_hash": "sha256:ca49d638d8f49d5c0323bbef00b89cebf61d1ef4506bb51bb95c1ca3967a0818",
      "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
      "version": 1
    },
    "published_at": "2026-09-12T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Peter Shor",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995 preprint)",
            "url": "https://arxiv.org/abs/quant-ph/9508027"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995 preprint)",
            "url": "https://arxiv.org/abs/quant-ph/9508027"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.",
        "domain": "量子计算"
      },
      "sources": [
        {
          "citation": "Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995 preprint)",
          "url": "https://arxiv.org/abs/quant-ph/9508027"
        }
      ],
      "statement": "# Shor: quantum factoring and discrete logarithms\n\nGives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model.\n\n## Scientific scope\n\nThe 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\nPeter Shor\n\nListed source contributors; individual labor shares are not measured\n\n\n\n## Original sources\n\n- [Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995 preprint)](https://arxiv.org/abs/quant-ph/9508027)\n",
      "summary": "Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model.",
      "title": "Shor: quantum factoring and discrete logarithms"
    },
    "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
    "version": 2,
    "source_ref": {
      "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
      "version": 2,
      "content_hash": "sha256:e2d9df059c6fdee5f981f19b4e5cf447f2eebaab0b23d85704abf91243095eb0"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:04cebf1a6a62952fd1c76bdb82adee90e78a028836ac7f6665012b87de316488"
  },
  "target": {
    "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
    "version": 2,
    "content_hash": "sha256:e2d9df059c6fdee5f981f19b4e5cf447f2eebaab0b23d85704abf91243095eb0"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "shor-algorithm",
    "entry_id": "shor-algorithm",
    "revision": 1,
    "title": "Shor: quantum factoring and discrete logarithms",
    "context": "Quantum computing",
    "track": "Scoped scientific or research-capability contribution",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-14",
    "evidence_cutoff": "2026-09-14",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model.",
    "scope": "Gives polynomial-time algorithms for integer factorization and discrete logarithms in the quantum computation model. Scope limitation: The 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.",
    "evidence_summary": "Assessment uses the catalogue-linked source evidence for the stated contribution. The 1994 conference work is distinct from the linked 1995 preprint and later journal version. The complexity result assumes quantum computation; it does not establish that current devices can break practical cryptography.",
    "references": [
      {
        "title": "Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1995 preprint)",
        "url": "https://arxiv.org/abs/quant-ph/9508027",
        "locator": "Retained catalogue source evidence; Bibliography and stated scope; not full derivation or experimental replay"
      }
    ],
    "roles": [
      {
        "who": "Peter Shor",
        "credit": "SCIENCE",
        "did": "Named source contributor; exact labor shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:261cbf07-52a2-4efb-a142-bfe590d5fe98",
      "version": 2,
      "content_hash": "sha256:e2d9df059c6fdee5f981f19b4e5cf447f2eebaab0b23d85704abf91243095eb0"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "160000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}