{
  "schema_version": 2,
  "title": "Computationally-efficient Graph Modeling with Refined Graph Random Features",
  "emoji": "🎯",
  "space_id": "SabaPivot/repro-computationally-efficient-graph-modeling-with-refined-graph-random-features",
  "paper": {
    "arxiv_id": "2510.07716"
  },
  "tags": [
    "arxiv:2510.07716",
    "icml2026-repro",
    "open-experiment",
    "paper-NvJPE1oiKd",
    "trackio",
    "trackio-logbook"
  ],
  "updated_at": "2026-08-02T16:31:42.914172+00:00",
  "root": {
    "slug": "index",
    "title": "Computationally-efficient Graph Modeling with Refined Graph Random Features",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "executive-summary",
        "title": "Executive summary",
        "file": "pages/executive-summary/page.md",
        "children": []
      },
      {
        "slug": "claim-1-walk-stitching-mechanism",
        "title": "Claim 1: Walk-stitching mechanism",
        "file": "pages/claim-1-walk-stitching-mechanism/page.md",
        "children": []
      },
      {
        "slug": "claim-2-mse-monotonicity",
        "title": "Claim 2: MSE monotonicity",
        "file": "pages/claim-2-mse-monotonicity/page.md",
        "children": []
      },
      {
        "slug": "claim-3-linear-time-jl-variant",
        "title": "Claim 3: Linear-time JL variant",
        "file": "pages/claim-3-linear-time-jl-variant/page.md",
        "children": []
      },
      {
        "slug": "claim-4-node-clustering-benchmarks",
        "title": "Claim 4: Node clustering benchmarks",
        "file": "pages/claim-4-node-clustering-benchmarks/page.md",
        "children": []
      },
      {
        "slug": "claim-5-mesh-normal-prediction",
        "title": "Claim 5: Mesh normal prediction",
        "file": "pages/claim-5-mesh-normal-prediction/page.md",
        "children": []
      },
      {
        "slug": "claim-6-high-diameter-distant-pairs",
        "title": "Claim 6: High-diameter distant pairs",
        "file": "pages/claim-6-high-diameter-distant-pairs/page.md",
        "children": []
      },
      {
        "slug": "claim-99-fresh-independent-cpu-audit",
        "title": "Fresh independent CPU audit",
        "file": "pages/claim-99-fresh-independent-cpu-audit/page.md",
        "children": []
      },
      {
        "slug": "conclusion",
        "title": "Conclusion",
        "file": "pages/conclusion/page.md",
        "children": []
      }
    ]
  },
  "traces": [],
  "workspace": {
    "file": "workspace.json",
    "file_count": 0,
    "total_size": 0,
    "bucket_id": null
  },
  "agent_view_tokens": 985,
  "trace_view_tokens": 44963,
  "workspace_view_tokens": 1143,
  "revision": "fab6f57bec55cf453e04",
  "traces_ref": {
    "repo_id": "Srishti280992/repro-computationally-efficient-graph-modeling-with-refined-graph-random-features-traces",
    "repo_type": "dataset",
    "repo_url": "https://huggingface.co/datasets/Srishti280992/repro-computationally-efficient-graph-modeling-with-refined-graph-random-features-traces",
    "private": true
  },
  "trace_dataset": "https://huggingface.co/datasets/Srishti280992/repro-computationally-efficient-graph-modeling-with-refined-graph-random-features-traces",
  "workspace_ref": {
    "repo_id": "Srishti280992/repro-computationally-efficient-graph-modeling-with-refined-graph-random-features-artifacts",
    "repo_type": "bucket",
    "repo_url": "https://huggingface.co/buckets/Srishti280992/repro-computationally-efficient-graph-modeling-with-refined-graph-random-features-artifacts",
    "private": true
  },
  "workspace_bucket": "https://huggingface.co/buckets/Srishti280992/repro-computationally-efficient-graph-modeling-with-refined-graph-random-features-artifacts"
}