Update logbook: Repro - Asymptotically Optimal Sequential Testing with Markovian Data
8b31ae9 verified | { | |
| "schema_version": 1, | |
| "title": "Repro - Asymptotically Optimal Sequential Testing with Markovian Data", | |
| "emoji": "๐", | |
| "space_id": "kshitijthakkar/repro-sequential-testing-markov", | |
| "paper": { | |
| "arxiv_id": "2602.17587" | |
| }, | |
| "tags": [ | |
| "icml2026-repro", | |
| "paper-YEckWPoS09" | |
| ], | |
| "updated_at": "2026-07-17T01:03:38+00:00", | |
| "root": { | |
| "slug": "index", | |
| "title": "Repro - Asymptotically Optimal Sequential Testing with Markovian Data", | |
| "file": "pages/index.md", | |
| "children": [ | |
| { | |
| "slug": "overview", | |
| "title": "Overview", | |
| "file": "pages/overview/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-3-the-bound-uses-both-stationary-law-and-transition-structure", | |
| "title": "Claim 3: The bound uses both stationary law and transition structure", | |
| "file": "pages/claim-3-the-bound-uses-both-stationary-law-and-transition-structure/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-1-tight-non-asymptotic-lower-bound-on-stopping-time", | |
| "title": "Claim 1: Tight non-asymptotic lower bound on stopping time", | |
| "file": "pages/claim-1-tight-non-asymptotic-lower-bound-on-stopping-time/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-2-an-asymptotically-optimal-test", | |
| "title": "Claim 2: An asymptotically optimal test", | |
| "file": "pages/claim-2-an-asymptotically-optimal-test/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "conclusion", | |
| "title": "Conclusion", | |
| "file": "pages/conclusion/page.md", | |
| "children": [] | |
| } | |
| ] | |
| }, | |
| "agent_view_tokens": 9290, | |
| "revision": "1784250218988522900" | |
| } |