{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "ai-oct-graphgps",
    "title": "GraphGPS modular local–global graph Transformer recipe",
    "summary": "Combines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation.",
    "boundary": "Six source authors; star denotes correspondence, not equal contribution. Linear node/edge cost requires a linear-attention instantiation and excludes encoding precomputation such as Laplacian eigendecomposition; full attention remains quadratic. Universality argument needs sufficiently rich/full eigenvectors and suitable modules, not every practical instantiation. Non-biological graph methods only.",
    "area": "Graph and geometric machine learning",
    "topic": "Artificial intelligence",
    "year": 2022,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "ai-oct-graphgps",
    "target": {
      "record_id": "urn:uuid:029e84a3-1336-4517-a419-d95f4f7d0b81",
      "version": 1,
      "content_hash": "sha256:31b9d0a615131126e83e4ff802af728f260df892e873e9f01993d13b071d9e74"
    },
    "humans": [
      "Ladislav Rampášek",
      "Mikhail Galkin",
      "Vijay Prakash Dwivedi",
      "Anh Tuan Luu",
      "Guy Wolf",
      "Dominique Beaini"
    ],
    "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": "src-ai-oct-2205-12454v1-primary",
        "title": "Recipe for a General, Powerful, Scalable Graph Transformer",
        "url": "https://arxiv.org/pdf/2205.12454v1"
      }
    ],
    "points": "130000",
    "published_grade": {
      "id": "ai-oct-graphgps",
      "entry_id": "ai-oct-graphgps",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:029e84a3-1336-4517-a419-d95f4f7d0b81",
        "version": 1,
        "content_hash": "sha256:31b9d0a615131126e83e4ff802af728f260df892e873e9f01993d13b071d9e74"
      },
      "what_changed": "Combines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation.",
      "scope": "Combines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation. Six source authors; star denotes correspondence, not equal contribution. Linear node/edge cost requires a linear-attention instantiation and excludes encoding precomputation such as Laplacian eigendecomposition; full attention remains quadratic. Universality argument needs sufficiently rich/full eigenvectors and suitable modules, not every practical instantiation. Non-biological graph methods only.",
      "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:029e84a3-1336-4517-a419-d95f4f7d0b81",
        "version": 1,
        "content_hash": "sha256:31b9d0a615131126e83e4ff802af728f260df892e873e9f01993d13b071d9e74"
      },
      "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": "Ladislav Rampášek",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
            "url": "https://arxiv.org/pdf/2205.12454v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Mikhail Galkin",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
            "url": "https://arxiv.org/pdf/2205.12454v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Vijay Prakash Dwivedi",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
            "url": "https://arxiv.org/pdf/2205.12454v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Anh Tuan Luu",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
            "url": "https://arxiv.org/pdf/2205.12454v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Guy Wolf",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
            "url": "https://arxiv.org/pdf/2205.12454v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Dominique Beaini",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
            "url": "https://arxiv.org/pdf/2205.12454v1"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
            "url": "https://arxiv.org/pdf/2205.12454v1"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Six source authors; star denotes correspondence, not equal contribution. Linear node/edge cost requires a linear-attention instantiation and excludes encoding precomputation such as Laplacian eigendecomposition; full attention remains quadratic. Universality argument needs sufficiently rich/full eigenvectors and suitable modules, not every practical instantiation. Non-biological graph methods only.",
        "domain": "Graph and geometric machine learning"
      },
      "sources": [
        {
          "citation": "Recipe for a General, Powerful, Scalable Graph Transformer",
          "url": "https://arxiv.org/pdf/2205.12454v1"
        }
      ],
      "statement": "# GraphGPS modular local–global graph Transformer recipe\n\nCombines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation.\n\n## Scientific scope\n\nSix source authors; star denotes correspondence, not equal contribution. Linear node/edge cost requires a linear-attention instantiation and excludes encoding precomputation such as Laplacian eigendecomposition; full attention remains quadratic. Universality argument needs sufficiently rich/full eigenvectors and suitable modules, not every practical instantiation. Non-biological graph methods only.\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\nLadislav Rampášek; Mikhail Galkin; Vijay Prakash Dwivedi; Anh Tuan Luu; Guy Wolf; Dominique Beaini\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- [Recipe for a General, Powerful, Scalable Graph Transformer](https://arxiv.org/pdf/2205.12454v1)\n",
      "summary": "Combines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation.",
      "title": "GraphGPS modular local–global graph Transformer recipe"
    },
    "record_id": "urn:uuid:029e84a3-1336-4517-a419-d95f4f7d0b81",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:029e84a3-1336-4517-a419-d95f4f7d0b81",
      "version": 1,
      "content_hash": "sha256:31b9d0a615131126e83e4ff802af728f260df892e873e9f01993d13b071d9e74"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:19ff8166299fc700e31b86b2504b370d68c9fc618ce76880c2fe647ef673012f"
  },
  "target": {
    "record_id": "urn:uuid:029e84a3-1336-4517-a419-d95f4f7d0b81",
    "version": 1,
    "content_hash": "sha256:31b9d0a615131126e83e4ff802af728f260df892e873e9f01993d13b071d9e74"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "ai-oct-graphgps",
    "entry_id": "ai-oct-graphgps",
    "revision": 1,
    "title": "GraphGPS modular local–global graph Transformer recipe",
    "context": "Graph and geometric machine learning",
    "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": "Combines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation.",
    "scope": "Combines positional/structural encodings, local edge-aware message passing and global attention in a modular graph-learning architecture and implementation. Six source authors; star denotes correspondence, not equal contribution. Linear node/edge cost requires a linear-attention instantiation and excludes encoding precomputation such as Laplacian eigendecomposition; full attention remains quadratic. Universality argument needs sufficiently rich/full eigenvectors and suitable modules, not every practical instantiation. Non-biological graph methods only.",
    "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. Six source authors; star denotes correspondence, not equal contribution. Linear node/edge cost requires a linear-attention instantiation and excludes encoding precomputation such as Laplacian eigendecomposition; full attention remains quadratic. Universality argument needs sufficiently rich/full eigenvectors and suitable modules, not every practical instantiation. Non-biological graph methods only.",
    "references": [
      {
        "title": "Recipe for a General, Powerful, Scalable Graph Transformer",
        "url": "https://arxiv.org/pdf/2205.12454v1",
        "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:029e84a3-1336-4517-a419-d95f4f7d0b81",
      "version": 1,
      "content_hash": "sha256:31b9d0a615131126e83e4ff802af728f260df892e873e9f01993d13b071d9e74"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "130000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}