{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RLN3KIJLMSYEIH2SISILU77WXZ","short_pith_number":"pith:RLN3KIJL","schema_version":"1.0","canonical_sha256":"8adbb5212b64b0441f524490ba7ff6be5b9574b654baae3741c11200381b7c0c","source":{"kind":"arxiv","id":"1311.7385","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic Identification of Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nick Chater (University of Warwick, NL), Paul M.B. Vitanyi (CWI, UK), University of Amsterdam","submitted_at":"2013-11-28T17:44:45Z","abstract_excerpt":"TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target) belongs to a computably enumerable (c.e.) or co-computably enumerable (co-c.e.) set of computable probability mass functions, then there is an algorithm to almost surely identify the target in the limit. The technical tool is the strong law of large numbers. If the set is finite and the elements of the sequence are dependent while the sequence is typical in the "},"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":"1311.7385","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-28T17:44:45Z","cross_cats_sorted":[],"title_canon_sha256":"978805c84915d9c5ae9077c1ce78527dc7dedde5884f5ae1ee3f7d97069d493c","abstract_canon_sha256":"533434283501545e9d7ebc1a8bdb8098a28062b3d1db512128656f558df3bb29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:52.864549Z","signature_b64":"ElQQ5RbVEeZNmkuI3VwEqeP/H/mJ1gfTTtblFFx03fcmrdZLiQTjceMLBWGlXVA21K2hFhnnFpyAcXWkHk9uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8adbb5212b64b0441f524490ba7ff6be5b9574b654baae3741c11200381b7c0c","last_reissued_at":"2026-05-18T02:47:52.864104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:52.864104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Identification of Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nick Chater (University of Warwick, NL), Paul M.B. Vitanyi (CWI, UK), University of Amsterdam","submitted_at":"2013-11-28T17:44:45Z","abstract_excerpt":"TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target) belongs to a computably enumerable (c.e.) or co-computably enumerable (co-c.e.) set of computable probability mass functions, then there is an algorithm to almost surely identify the target in the limit. The technical tool is the strong law of large numbers. If the set is finite and the elements of the sequence are dependent while the sequence is typical in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7385","kind":"arxiv","version":3},"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":"1311.7385","created_at":"2026-05-18T02:47:52.864169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7385v3","created_at":"2026-05-18T02:47:52.864169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7385","created_at":"2026-05-18T02:47:52.864169+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLN3KIJLMSYE","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLN3KIJLMSYEIH2S","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLN3KIJL","created_at":"2026-05-18T12:27:59.945178+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/RLN3KIJLMSYEIH2SISILU77WXZ","json":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ.json","graph_json":"https://pith.science/api/pith-number/RLN3KIJLMSYEIH2SISILU77WXZ/graph.json","events_json":"https://pith.science/api/pith-number/RLN3KIJLMSYEIH2SISILU77WXZ/events.json","paper":"https://pith.science/paper/RLN3KIJL"},"agent_actions":{"view_html":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ","download_json":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ.json","view_paper":"https://pith.science/paper/RLN3KIJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7385&json=true","fetch_graph":"https://pith.science/api/pith-number/RLN3KIJLMSYEIH2SISILU77WXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RLN3KIJLMSYEIH2SISILU77WXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ/action/storage_attestation","attest_author":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ/action/author_attestation","sign_citation":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ/action/citation_signature","submit_replication":"https://pith.science/pith/RLN3KIJLMSYEIH2SISILU77WXZ/action/replication_record"}},"created_at":"2026-05-18T02:47:52.864169+00:00","updated_at":"2026-05-18T02:47:52.864169+00:00"}