{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "defferrard-bresson-vandergheynst-chebnet-2016",
    "title": "ChebNet: localized polynomial graph filtering without eigendecomposition",
    "summary": "Parameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling.",
    "boundary": "Inherits polynomial graph signal processing and spectral CNNs. Filtering costs scale with polynomial order and graph edges, not constant cost on arbitrary dense graphs; full layer costs include feature channels.",
    "area": "Efficient spectral graph neural networks",
    "topic": "Artificial intelligence",
    "year": 2016,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "defferrard-bresson-vandergheynst-chebnet-2016",
    "target": {
      "record_id": "urn:uuid:7225ceff-d11a-46b3-a0cb-e46cb87a78ec",
      "version": 1,
      "content_hash": "sha256:e433ef1788ef1c549d8e1dc5a5ba87c3707dea4f47e3d07e6dfc9cdba56bdc0e"
    },
    "humans": [
      "Michaël Defferrard",
      "Xavier Bresson",
      "Pierre Vandergheynst"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261015-arxiv-1606-09375v1",
        "title": "Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering",
        "url": "https://arxiv.org/abs/1606.09375v1"
      }
    ],
    "points": "150000",
    "published_grade": {
      "id": "defferrard-bresson-vandergheynst-chebnet-2016",
      "entry_id": "defferrard-bresson-vandergheynst-chebnet-2016",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:7225ceff-d11a-46b3-a0cb-e46cb87a78ec",
        "version": 1,
        "content_hash": "sha256:e433ef1788ef1c549d8e1dc5a5ba87c3707dea4f47e3d07e6dfc9cdba56bdc0e"
      },
      "what_changed": "Parameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling.",
      "scope": "Parameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling. Inherits polynomial graph signal processing and spectral CNNs. Filtering costs scale with polynomial order and graph edges, not constant cost on arbitrary dense graphs; full layer costs include feature channels.",
      "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:7225ceff-d11a-46b3-a0cb-e46cb87a78ec",
        "version": 1,
        "content_hash": "sha256:e433ef1788ef1c549d8e1dc5a5ba87c3707dea4f47e3d07e6dfc9cdba56bdc0e"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-16T00: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": "Michaël Defferrard",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering",
            "url": "https://arxiv.org/abs/1606.09375v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Xavier Bresson",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering",
            "url": "https://arxiv.org/abs/1606.09375v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Pierre Vandergheynst",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering",
            "url": "https://arxiv.org/abs/1606.09375v1"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering",
            "url": "https://arxiv.org/abs/1606.09375v1"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Inherits polynomial graph signal processing and spectral CNNs. Filtering costs scale with polynomial order and graph edges, not constant cost on arbitrary dense graphs; full layer costs include feature channels.",
        "domain": "Efficient spectral graph neural networks"
      },
      "sources": [
        {
          "citation": "Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering",
          "url": "https://arxiv.org/abs/1606.09375v1"
        }
      ],
      "statement": "# ChebNet: localized polynomial graph filtering without eigendecomposition\n\nParameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling.\n\n## Scientific scope\n\nInherits polynomial graph signal processing and spectral CNNs. Filtering costs scale with polynomial order and graph edges, not constant cost on arbitrary dense graphs; full layer costs include feature channels.\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\nMichaël Defferrard; Xavier Bresson; Pierre Vandergheynst\n\nSource-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.\n\n\n\n## Original sources\n\n- [Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering](https://arxiv.org/abs/1606.09375v1)\n",
      "summary": "Parameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling.",
      "title": "ChebNet: localized polynomial graph filtering without eigendecomposition"
    },
    "record_id": "urn:uuid:7225ceff-d11a-46b3-a0cb-e46cb87a78ec",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:7225ceff-d11a-46b3-a0cb-e46cb87a78ec",
      "version": 1,
      "content_hash": "sha256:e433ef1788ef1c549d8e1dc5a5ba87c3707dea4f47e3d07e6dfc9cdba56bdc0e"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:f8a6eda0561dafb60acfa2b2e9d8997c642079be4acfb7e185506c0c9bbb456a"
  },
  "target": {
    "record_id": "urn:uuid:7225ceff-d11a-46b3-a0cb-e46cb87a78ec",
    "version": 1,
    "content_hash": "sha256:e433ef1788ef1c549d8e1dc5a5ba87c3707dea4f47e3d07e6dfc9cdba56bdc0e"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "defferrard-bresson-vandergheynst-chebnet-2016",
    "entry_id": "defferrard-bresson-vandergheynst-chebnet-2016",
    "revision": 1,
    "title": "ChebNet: localized polynomial graph filtering without eigendecomposition",
    "context": "Efficient spectral graph neural networks",
    "track": "Human-designed research method or resource",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-16",
    "evidence_cutoff": "2026-10-16",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Parameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling.",
    "scope": "Parameterized graph filters as truncated Chebyshev polynomials of the Laplacian, evaluating them by sparse recurrence and combining graph coarsening with efficient pooling. Inherits polynomial graph signal processing and spectral CNNs. Filtering costs scale with polynomial order and graph edges, not constant cost on arbitrary dense graphs; full layer costs include feature channels.",
    "evidence_summary": "The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. Inherits polynomial graph signal processing and spectral CNNs. Filtering costs scale with polynomial order and graph edges, not constant cost on arbitrary dense graphs; full layer costs include feature channels.",
    "references": [
      {
        "title": "Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering",
        "url": "https://arxiv.org/abs/1606.09375v1",
        "locator": "Original contribution and stated assumptions, evaluation scope and limitations; source-linked assessment, not independent execution or proof certification."
      }
    ],
    "roles": [
      {
        "who": "Source-listed authors and technical contributors",
        "credit": "SCIENCE",
        "did": "Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities."
      }
    ],
    "target": {
      "record_id": "urn:uuid:7225ceff-d11a-46b3-a0cb-e46cb87a78ec",
      "version": 1,
      "content_hash": "sha256:e433ef1788ef1c549d8e1dc5a5ba87c3707dea4f47e3d07e6dfc9cdba56bdc0e"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "150000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}