{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JSA2HPOM4SFRNHQXHQHHCZCSER","short_pith_number":"pith:JSA2HPOM","schema_version":"1.0","canonical_sha256":"4c81a3bdcce48b169e173c0e7164522458583c2b3a6384db51cee285e400d7af","source":{"kind":"arxiv","id":"1901.04069","version":1},"attestation_state":"computed","paper":{"title":"The \"Monkey Typing Shakespeare\" Problem for Compositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Shalosh B. Ekhad","submitted_at":"2019-01-13T21:43:01Z","abstract_excerpt":"Suppose that your mother gave you n candies. You have to eat at least one candy each day. One possibility is to eat all n of them the first day. The other extreme is to make them last n days, and only eat one candy a day. Altogether, you have, famously, 2 to the power n-1 choices. If each such choice is equally likely, what is the probability that you never have three consecutive days, where in the first day you ate at least 2 candies, in the second day you ate at least 5 candies, and in the third day you ate at least 3 candies? This article describes algorithms, fully implemented in two Maple"},"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":"1901.04069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-13T21:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"b1816d591ec0d6bed546c816f13dd922f653b757156392b198b1815f3881aafd","abstract_canon_sha256":"ac3d20b63494eb7e44dcbeb2f1d0aefc5372f1826b8d52946c8c9f91662f6075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:26.343639Z","signature_b64":"WhiMPR/DO9o9yVZ9RS1S8Z0rW68iLTYQ7ZLvo4Y1dLVbUSNdewhMqon9Kw0k3YhzIQAnTrxcUGCBEiGVtygCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c81a3bdcce48b169e173c0e7164522458583c2b3a6384db51cee285e400d7af","last_reissued_at":"2026-05-17T23:56:26.343165Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:26.343165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The \"Monkey Typing Shakespeare\" Problem for Compositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Shalosh B. Ekhad","submitted_at":"2019-01-13T21:43:01Z","abstract_excerpt":"Suppose that your mother gave you n candies. You have to eat at least one candy each day. One possibility is to eat all n of them the first day. The other extreme is to make them last n days, and only eat one candy a day. Altogether, you have, famously, 2 to the power n-1 choices. If each such choice is equally likely, what is the probability that you never have three consecutive days, where in the first day you ate at least 2 candies, in the second day you ate at least 5 candies, and in the third day you ate at least 3 candies? This article describes algorithms, fully implemented in two Maple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04069","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":"1901.04069","created_at":"2026-05-17T23:56:26.343255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04069v1","created_at":"2026-05-17T23:56:26.343255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04069","created_at":"2026-05-17T23:56:26.343255+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSA2HPOM4SFR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSA2HPOM4SFRNHQX","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSA2HPOM","created_at":"2026-05-18T12:33:21.387695+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/JSA2HPOM4SFRNHQXHQHHCZCSER","json":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER.json","graph_json":"https://pith.science/api/pith-number/JSA2HPOM4SFRNHQXHQHHCZCSER/graph.json","events_json":"https://pith.science/api/pith-number/JSA2HPOM4SFRNHQXHQHHCZCSER/events.json","paper":"https://pith.science/paper/JSA2HPOM"},"agent_actions":{"view_html":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER","download_json":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER.json","view_paper":"https://pith.science/paper/JSA2HPOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04069&json=true","fetch_graph":"https://pith.science/api/pith-number/JSA2HPOM4SFRNHQXHQHHCZCSER/graph.json","fetch_events":"https://pith.science/api/pith-number/JSA2HPOM4SFRNHQXHQHHCZCSER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER/action/storage_attestation","attest_author":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER/action/author_attestation","sign_citation":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER/action/citation_signature","submit_replication":"https://pith.science/pith/JSA2HPOM4SFRNHQXHQHHCZCSER/action/replication_record"}},"created_at":"2026-05-17T23:56:26.343255+00:00","updated_at":"2026-05-17T23:56:26.343255+00:00"}