{
  "schema_version": 2,
  "title": "Reproduction: Adaptively Robust Resettable Streaming",
  "emoji": "🎯",
  "space_id": "RyeCatcher/repro-adaptively-robust-resettable-streaming",
  "paper": {
    "arxiv_id": "2601.21989"
  },
  "tags": [
    "icml2026-repro",
    "paper-5SMn6N9SXq"
  ],
  "updated_at": "2026-08-01T15:46:40+00:00",
  "root": {
    "slug": "index",
    "title": "Reproduction: Adaptively Robust Resettable Streaming",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "executive-summary",
        "title": "Executive summary",
        "file": "pages/executive-summary/page.md",
        "children": []
      },
      {
        "slug": "claim-1-c1-for-resettable-streams-with-inc-x-and-reset-p-operations-the-pape",
        "title": "Claim 1: C1: For resettable streams with Inc(x,Δ) and Reset(P) operations, the pape...",
        "file": "pages/claim-1-c1-for-resettable-streams-with-inc-x-and-reset-p-operations-the-pape/page.md",
        "children": []
      },
      {
        "slug": "claim-2-c2-the-robust-cardinality-sketch-uses-o-log-3-2-t-log-t-bits",
        "title": "Claim 2: C2: The robust cardinality sketch uses O(ε⁻² log^{3/2}(T) · log(T/δ)) bits...",
        "file": "pages/claim-2-c2-the-robust-cardinality-sketch-uses-o-log-3-2-t-log-t-bits/page.md",
        "children": []
      },
      {
        "slug": "claim-3-c3-the-robust-sum-sketch-achieves-o-log-11-2-t-log-1-bits-o",
        "title": "Claim 3: C3: The robust sum sketch achieves O(ε⁻² log^{11/2}(T) · log²(1/δ)) bits o...",
        "file": "pages/claim-3-c3-the-robust-sum-sketch-achieves-o-log-11-2-t-log-1-bits-o/page.md",
        "children": []
      },
      {
        "slug": "claim-4-c4-robustness-for-bernstein-statistics-is-achieved-with-poly-log-t",
        "title": "Claim 4: C4: Robustness for Bernstein statistics is achieved with poly(ε⁻¹, log(T/δ...",
        "file": "pages/claim-4-c4-robustness-for-bernstein-statistics-is-achieved-with-poly-log-t/page.md",
        "children": []
      },
      {
        "slug": "claim-5-c5-the-robustification-technique-adapts-the-binary-tree-mechanism-from-di",
        "title": "Claim 5: C5: The robustification technique adapts the Binary Tree Mechanism from di...",
        "file": "pages/claim-5-c5-the-robustification-technique-adapts-the-binary-tree-mechanism-from-di/page.md",
        "children": []
      },
      {
        "slug": "claim-6-c6-two-concrete-adaptive-attacks-are-demonstrated-against-standard-non-r",
        "title": "Claim 6: C6: Two concrete adaptive attacks are demonstrated against standard (non-r...",
        "file": "pages/claim-6-c6-two-concrete-adaptive-attacks-are-demonstrated-against-standard-non-r/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": 4939,
  "trace_view_tokens": 10,
  "workspace_view_tokens": 8,
  "revision": "ea9382400c3fefc00a00"
}