{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "marcus-spielman-srivastava-kadison-singer-2013",
    "title": "Marcus, Spielman and Srivastava: interlacing-polynomial solution of the Kadison–Singer problem",
    "summary": "Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences.",
    "boundary": "The main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.",
    "area": "Operator algebras and spectral discrepancy",
    "topic": "Mathematics",
    "year": 2013,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "marcus-spielman-srivastava-kadison-singer-2013",
    "target": {
      "record_id": "urn:uuid:2ed6790e-bbc5-4066-adf5-a0eac477a654",
      "version": 1,
      "content_hash": "sha256:e36c010fc03d188c23c650f1d0883490f61debfb9c89d7271a5ec720b8233c22"
    },
    "humans": [
      "Adam Marcus",
      "Daniel A. Spielman",
      "Nikhil Srivastava"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261020-arxiv-1306-3969v1",
        "title": "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem",
        "url": "https://arxiv.org/abs/1306.3969v1",
        "date": "2013-06-17"
      }
    ],
    "points": "350000",
    "published_grade": {
      "id": "marcus-spielman-srivastava-kadison-singer-2013",
      "entry_id": "marcus-spielman-srivastava-kadison-singer-2013",
      "band": "S",
      "modifier": "-",
      "target": {
        "record_id": "urn:uuid:2ed6790e-bbc5-4066-adf5-a0eac477a654",
        "version": 1,
        "content_hash": "sha256:e36c010fc03d188c23c650f1d0883490f61debfb9c89d7271a5ec720b8233c22"
      },
      "what_changed": "Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences.",
      "scope": "Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences. The main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.",
      "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:2ed6790e-bbc5-4066-adf5-a0eac477a654",
        "version": 1,
        "content_hash": "sha256:e36c010fc03d188c23c650f1d0883490f61debfb9c89d7271a5ec720b8233c22"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-23T00: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": "Adam Marcus",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem",
            "url": "https://arxiv.org/abs/1306.3969v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Daniel A. Spielman",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem",
            "url": "https://arxiv.org/abs/1306.3969v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Nikhil Srivastava",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem",
            "url": "https://arxiv.org/abs/1306.3969v1"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem",
            "url": "https://arxiv.org/abs/1306.3969v1"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.",
        "domain": "Operator algebras and spectral discrepancy"
      },
      "sources": [
        {
          "citation": "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem",
          "url": "https://arxiv.org/abs/1306.3969v1"
        }
      ],
      "statement": "# Marcus, Spielman and Srivastava: interlacing-polynomial solution of the Kadison–Singer problem\n\nMixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences.\n\n## Scientific scope\n\nThe main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.\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\nAdam Marcus; Daniel A. Spielman; Nikhil Srivastava\n\nSource-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.\n\n\n\n## Original sources\n\n- [Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem](https://arxiv.org/abs/1306.3969v1)\n",
      "summary": "Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences.",
      "title": "Marcus, Spielman and Srivastava: interlacing-polynomial solution of the Kadison–Singer problem"
    },
    "record_id": "urn:uuid:2ed6790e-bbc5-4066-adf5-a0eac477a654",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:2ed6790e-bbc5-4066-adf5-a0eac477a654",
      "version": 1,
      "content_hash": "sha256:e36c010fc03d188c23c650f1d0883490f61debfb9c89d7271a5ec720b8233c22"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:0bc8968ead31919f9f46c22796470b9672667e48c8307d165751fa36cd3cdb5f"
  },
  "target": {
    "record_id": "urn:uuid:2ed6790e-bbc5-4066-adf5-a0eac477a654",
    "version": 1,
    "content_hash": "sha256:e36c010fc03d188c23c650f1d0883490f61debfb9c89d7271a5ec720b8233c22"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "marcus-spielman-srivastava-kadison-singer-2013",
    "entry_id": "marcus-spielman-srivastava-kadison-singer-2013",
    "revision": 1,
    "title": "Marcus, Spielman and Srivastava: interlacing-polynomial solution of the Kadison–Singer problem",
    "context": "Operator algebras and spectral discrepancy",
    "track": "Exact theorem and reusable mathematical method",
    "band": "S",
    "modifier": "-",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-23",
    "evidence_cutoff": "2026-10-23",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences.",
    "scope": "Mixed characteristic polynomials and interlacing families yield a finite-dimensional random-vector norm bound. A two-part vector partition consequence establishes Weaver's KS2 conjecture and hence the Kadison–Singer problem through the previously known equivalences. The main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.",
    "evidence_summary": "The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. The main random vectors are independent and finitely supported, with an identity covariance sum and bounded expected squared norms. The paper proves existence; its conclusion asks separately for efficient partition-finding algorithms.",
    "references": [
      {
        "title": "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem",
        "url": "https://arxiv.org/abs/1306.3969v1",
        "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained."
      }
    ],
    "roles": [
      {
        "who": "The named authors in the research record",
        "credit": "SCIENCE",
        "did": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred."
      }
    ],
    "target": {
      "record_id": "urn:uuid:2ed6790e-bbc5-4066-adf5-a0eac477a654",
      "version": 1,
      "content_hash": "sha256:e36c010fc03d188c23c650f1d0883490f61debfb9c89d7271a5ec720b8233c22"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "350000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}