{"paper":{"title":"Anonymity in Predicting the Future","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Daniel J. Velleman, Dvij Bajpai","submitted_at":"2015-08-27T14:10:29Z","abstract_excerpt":"Consider an arbitrary set $S$ and an arbitrary function $f : \\mathbb{R} \\to S$. We think of the domain of $f$ as representing time, and for each $x \\in \\mathbb{R}$, we think of $f(x)$ as the state of some system at time $x$. Imagine that, at each time $x$, there is an agent who can see $f \\upharpoonright (-\\infty, x)$ and is trying to guess $f(x)$--in other words, the agent is trying to guess the present state of the system from its past history. In a 2008 paper, Christopher Hardin and Alan Taylor use the axiom of choice to construct a strategy that the agents can use to guarantee that, for ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06865","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}