{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A6JTIRD3XXC4O37OYMTHG6EQH4","short_pith_number":"pith:A6JTIRD3","schema_version":"1.0","canonical_sha256":"079334447bbdc5c76feec3267378903f1904c3883bf83acc8ac2228e59871924","source":{"kind":"arxiv","id":"1405.5139","version":4},"attestation_state":"computed","paper":{"title":"Algorithmic identification of probabilities is hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alexander Shen, Benoit Monin, Laurent Bienvenu, Santiago Figueira","submitted_at":"2014-05-20T16:10:19Z","abstract_excerpt":"Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better approximations of $p$ as we read the sequence. We study in this paper a similar question, but from the viewpoint of inductive inference. We suppose now that $p$ is a computable real, but one asks for more: as we are reading more and more bits of our random sequence, we have to eventually guess the exact parameter $p$ (in the form of a Turing code). Can one do such a"},"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":"1405.5139","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-20T16:10:19Z","cross_cats_sorted":[],"title_canon_sha256":"c7ab9ef9a18befe36b8d67ec3f667dd5ff16535d9bfc7709120a396802f2464e","abstract_canon_sha256":"8e1e46579fb1de6e2627bab1a8b275cb794993030fc7fd05d1e4e313dfd7d323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:00.707027Z","signature_b64":"l2N8eYcHYwOtn1xDWZWNfBuRJoZCKqWGvJMepyCUhp1rBHJ8ONOO3sCoh+9OwTe7fD/r5hVuWZQBHGesIxj2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079334447bbdc5c76feec3267378903f1904c3883bf83acc8ac2228e59871924","last_reissued_at":"2026-05-18T00:03:00.706498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:00.706498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic identification of probabilities is hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alexander Shen, Benoit Monin, Laurent Bienvenu, Santiago Figueira","submitted_at":"2014-05-20T16:10:19Z","abstract_excerpt":"Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better approximations of $p$ as we read the sequence. We study in this paper a similar question, but from the viewpoint of inductive inference. We suppose now that $p$ is a computable real, but one asks for more: as we are reading more and more bits of our random sequence, we have to eventually guess the exact parameter $p$ (in the form of a Turing code). Can one do such a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5139","kind":"arxiv","version":4},"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":"1405.5139","created_at":"2026-05-18T00:03:00.706581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5139v4","created_at":"2026-05-18T00:03:00.706581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5139","created_at":"2026-05-18T00:03:00.706581+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6JTIRD3XXC4","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6JTIRD3XXC4O37O","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6JTIRD3","created_at":"2026-05-18T12:28:19.803747+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/A6JTIRD3XXC4O37OYMTHG6EQH4","json":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4.json","graph_json":"https://pith.science/api/pith-number/A6JTIRD3XXC4O37OYMTHG6EQH4/graph.json","events_json":"https://pith.science/api/pith-number/A6JTIRD3XXC4O37OYMTHG6EQH4/events.json","paper":"https://pith.science/paper/A6JTIRD3"},"agent_actions":{"view_html":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4","download_json":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4.json","view_paper":"https://pith.science/paper/A6JTIRD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5139&json=true","fetch_graph":"https://pith.science/api/pith-number/A6JTIRD3XXC4O37OYMTHG6EQH4/graph.json","fetch_events":"https://pith.science/api/pith-number/A6JTIRD3XXC4O37OYMTHG6EQH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/action/storage_attestation","attest_author":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/action/author_attestation","sign_citation":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/action/citation_signature","submit_replication":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/action/replication_record"}},"created_at":"2026-05-18T00:03:00.706581+00:00","updated_at":"2026-05-18T00:03:00.706581+00:00"}