{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5PQ36JU5UBNYXEX4MYEEE6MD3T","short_pith_number":"pith:5PQ36JU5","schema_version":"1.0","canonical_sha256":"ebe1bf269da05b8b92fc6608427983dce3e2cba107281e856cd26f880050834d","source":{"kind":"arxiv","id":"1508.06865","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1508.06865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-08-27T14:10:29Z","cross_cats_sorted":[],"title_canon_sha256":"5f0700164699fec2d5a23cd05713381b86ac3aedaaf96b175bf591bd75cb3c5a","abstract_canon_sha256":"724a740d661a7c2ce437af3353acc85a88d6d0720de3b51080fd18fd2f25f99c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:40.685002Z","signature_b64":"yQVN0GyRnyRkRnvfFmbDPqRw+vPipoUQB1I3yr2jGNFENT17soegadsGU0+zXE72z1IG5BQju7px2UyWUMm6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebe1bf269da05b8b92fc6608427983dce3e2cba107281e856cd26f880050834d","last_reissued_at":"2026-05-18T01:34:40.684295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:40.684295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.06865","created_at":"2026-05-18T01:34:40.684463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06865v1","created_at":"2026-05-18T01:34:40.684463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06865","created_at":"2026-05-18T01:34:40.684463+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PQ36JU5UBNY","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PQ36JU5UBNYXEX4","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PQ36JU5","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T","json":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T.json","graph_json":"https://pith.science/api/pith-number/5PQ36JU5UBNYXEX4MYEEE6MD3T/graph.json","events_json":"https://pith.science/api/pith-number/5PQ36JU5UBNYXEX4MYEEE6MD3T/events.json","paper":"https://pith.science/paper/5PQ36JU5"},"agent_actions":{"view_html":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T","download_json":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T.json","view_paper":"https://pith.science/paper/5PQ36JU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06865&json=true","fetch_graph":"https://pith.science/api/pith-number/5PQ36JU5UBNYXEX4MYEEE6MD3T/graph.json","fetch_events":"https://pith.science/api/pith-number/5PQ36JU5UBNYXEX4MYEEE6MD3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T/action/storage_attestation","attest_author":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T/action/author_attestation","sign_citation":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T/action/citation_signature","submit_replication":"https://pith.science/pith/5PQ36JU5UBNYXEX4MYEEE6MD3T/action/replication_record"}},"created_at":"2026-05-18T01:34:40.684463+00:00","updated_at":"2026-05-18T01:34:40.684463+00:00"}