{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A6JTIRD3XXC4O37OYMTHG6EQH4","short_pith_number":"pith:A6JTIRD3","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"},"canonical_sha256":"079334447bbdc5c76feec3267378903f1904c3883bf83acc8ac2228e59871924","source":{"kind":"arxiv","id":"1405.5139","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5139","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5139v4","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5139","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"A6JTIRD3XXC4","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A6JTIRD3XXC4O37O","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A6JTIRD3","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A6JTIRD3XXC4O37OYMTHG6EQH4","target":"record","payload":{"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"},"canonical_sha256":"079334447bbdc5c76feec3267378903f1904c3883bf83acc8ac2228e59871924","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"},"source_kind":"arxiv","source_id":"1405.5139","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKt6vbqWvrbs2U09TMn5G+kdPxRE/0p7BCKQ6+kSswFnBcT4mfw0gA7M0L/RnOrxZSFvEQtVlBYuSVD3HAgfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:11:25.983827Z"},"content_sha256":"09b16e9e0ee7197cb3d4922297941b0a352e3a69a6ed6966749864ad31590299","schema_version":"1.0","event_id":"sha256:09b16e9e0ee7197cb3d4922297941b0a352e3a69a6ed6966749864ad31590299"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A6JTIRD3XXC4O37OYMTHG6EQH4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XjEKW229dAkTgzrQAKY38MpBeC4Q28Wm/HC2tJ6CKidwQjeUE0KKRG/4i+AJaRBDZsgd1vWZktGYKYJzxBzZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:11:25.984539Z"},"content_sha256":"bb7cfbe187afa25d49656a201a94876d4dab95fcda06d4268f9053d36a6b0dbc","schema_version":"1.0","event_id":"sha256:bb7cfbe187afa25d49656a201a94876d4dab95fcda06d4268f9053d36a6b0dbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/bundle.json","state_url":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T04:11:25Z","links":{"resolver":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4","bundle":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/bundle.json","state":"https://pith.science/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6JTIRD3XXC4O37OYMTHG6EQH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A6JTIRD3XXC4O37OYMTHG6EQH4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8e1e46579fb1de6e2627bab1a8b275cb794993030fc7fd05d1e4e313dfd7d323","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-20T16:10:19Z","title_canon_sha256":"c7ab9ef9a18befe36b8d67ec3f667dd5ff16535d9bfc7709120a396802f2464e"},"schema_version":"1.0","source":{"id":"1405.5139","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5139","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5139v4","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5139","created_at":"2026-05-18T00:03:00Z"},{"alias_kind":"pith_short_12","alias_value":"A6JTIRD3XXC4","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A6JTIRD3XXC4O37O","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A6JTIRD3","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:bb7cfbe187afa25d49656a201a94876d4dab95fcda06d4268f9053d36a6b0dbc","target":"graph","created_at":"2026-05-18T00:03:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Shen, Benoit Monin, Laurent Bienvenu, Santiago Figueira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-20T16:10:19Z","title":"Algorithmic identification of probabilities is hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5139","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:09b16e9e0ee7197cb3d4922297941b0a352e3a69a6ed6966749864ad31590299","target":"record","created_at":"2026-05-18T00:03:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8e1e46579fb1de6e2627bab1a8b275cb794993030fc7fd05d1e4e313dfd7d323","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-20T16:10:19Z","title_canon_sha256":"c7ab9ef9a18befe36b8d67ec3f667dd5ff16535d9bfc7709120a396802f2464e"},"schema_version":"1.0","source":{"id":"1405.5139","kind":"arxiv","version":4}},"canonical_sha256":"079334447bbdc5c76feec3267378903f1904c3883bf83acc8ac2228e59871924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"079334447bbdc5c76feec3267378903f1904c3883bf83acc8ac2228e59871924","first_computed_at":"2026-05-18T00:03:00.706498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:00.706498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l2N8eYcHYwOtn1xDWZWNfBuRJoZCKqWGvJMepyCUhp1rBHJ8ONOO3sCoh+9OwTe7fD/r5hVuWZQBHGesIxj2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:00.707027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5139","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09b16e9e0ee7197cb3d4922297941b0a352e3a69a6ed6966749864ad31590299","sha256:bb7cfbe187afa25d49656a201a94876d4dab95fcda06d4268f9053d36a6b0dbc"],"state_sha256":"bfbadab07a47ed2469b2c5e494fd85e674d3c1ca87b5f479a0892d0c8f01d2ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzVu43G6snNCHbe3S5zFE66SMouScU/G3OhWr9+D6rq4Ohyast5WV3xeGVA/rvLYe1ciMA4rEZRLJ4laXuh3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:11:25.988279Z","bundle_sha256":"886667a7c22ee4ea235f5a2e86360b576689317a4cc6db4b5de6cc02a2b5b5f9"}}