{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:URAHTZFKLIV7FHIYULKORCULGM","short_pith_number":"pith:URAHTZFK","canonical_record":{"source":{"id":"math/0304229","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-04-16T20:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"f1c3305a61b67bb55bfd8ebc05438cbf8ad014409e0e2cffe5c5c4b301e25ed5","abstract_canon_sha256":"2a98fbfdbf42637efae40f516f81e14edc4bf95c1890ccffa57f61753d439d7d"},"schema_version":"1.0"},"canonical_sha256":"a44079e4aa5a2bf29d18a2d4e88a8b3337aa704fd9d8bda51f65bf5668f127fe","source":{"kind":"arxiv","id":"math/0304229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0304229","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"arxiv_version","alias_value":"math/0304229v1","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0304229","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"pith_short_12","alias_value":"URAHTZFKLIV7","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"pith_short_16","alias_value":"URAHTZFKLIV7FHIY","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"pith_short_8","alias_value":"URAHTZFK","created_at":"2026-07-04T14:37:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:URAHTZFKLIV7FHIYULKORCULGM","target":"record","payload":{"canonical_record":{"source":{"id":"math/0304229","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-04-16T20:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"f1c3305a61b67bb55bfd8ebc05438cbf8ad014409e0e2cffe5c5c4b301e25ed5","abstract_canon_sha256":"2a98fbfdbf42637efae40f516f81e14edc4bf95c1890ccffa57f61753d439d7d"},"schema_version":"1.0"},"canonical_sha256":"a44079e4aa5a2bf29d18a2d4e88a8b3337aa704fd9d8bda51f65bf5668f127fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:37:13.564339Z","signature_b64":"CycbmYvQoK73rixd+Sw1AzJIwsbgWXySv95NyVfccmegEtFcYB48tQCm61VwXsrjiCC6g5iI7ruvc5alPs4+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a44079e4aa5a2bf29d18a2d4e88a8b3337aa704fd9d8bda51f65bf5668f127fe","last_reissued_at":"2026-07-04T14:37:13.563925Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:37:13.563925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0304229","source_version":1,"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-07-04T14:37:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rSzJCFLlHbTQVBItRS3ZF+AM5Wr793ESO7lib9bd57fAjGWU8anG182l28ur97brA+ho51TQIZXD7RAF6jWmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:42:13.489704Z"},"content_sha256":"881a529a9bd7659d7042f746e79a89fe499bfa3ec212569e41e637b947a8e21d","schema_version":"1.0","event_id":"sha256:881a529a9bd7659d7042f746e79a89fe499bfa3ec212569e41e637b947a8e21d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:URAHTZFKLIV7FHIYULKORCULGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some new aspects of the coupon-collector's problem","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amy N. Myers, Herbert S. Wilf","submitted_at":"2003-04-16T20:28:31Z","abstract_excerpt":"We extend the classical coupon collector's problem to one in which two collectors are simultaneously and independently seeking collections of $d$ coupons. We find, in finite terms, the probability that the two collectors finish at the same trial, and we find, using the methods of Gessel-Viennot, the probability that the game has the following ``ballot-like'' character: the two collectors are tied with each other for some initial number of steps, and after that the player who first gains the lead remains ahead throughout the game. As a by-product we obtain the evaluation in finite terms of cert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0304229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0304229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:37:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPIuoqjzjfZQWIAlwqGLquWaO5o+ErK1NyP6dYTg9lDv+jcA6wj9OhZylnKKaM9LyWDakrrgzMilbUJDCJ98Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:42:13.490072Z"},"content_sha256":"1999478c91f789cd8d05b2e1b244f6ff95185226aa610f0b9cce5985a6ec4353","schema_version":"1.0","event_id":"sha256:1999478c91f789cd8d05b2e1b244f6ff95185226aa610f0b9cce5985a6ec4353"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URAHTZFKLIV7FHIYULKORCULGM/bundle.json","state_url":"https://pith.science/pith/URAHTZFKLIV7FHIYULKORCULGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URAHTZFKLIV7FHIYULKORCULGM/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-07-05T07:42:13Z","links":{"resolver":"https://pith.science/pith/URAHTZFKLIV7FHIYULKORCULGM","bundle":"https://pith.science/pith/URAHTZFKLIV7FHIYULKORCULGM/bundle.json","state":"https://pith.science/pith/URAHTZFKLIV7FHIYULKORCULGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URAHTZFKLIV7FHIYULKORCULGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:URAHTZFKLIV7FHIYULKORCULGM","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":"2a98fbfdbf42637efae40f516f81e14edc4bf95c1890ccffa57f61753d439d7d","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2003-04-16T20:28:31Z","title_canon_sha256":"f1c3305a61b67bb55bfd8ebc05438cbf8ad014409e0e2cffe5c5c4b301e25ed5"},"schema_version":"1.0","source":{"id":"math/0304229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0304229","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"arxiv_version","alias_value":"math/0304229v1","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0304229","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"pith_short_12","alias_value":"URAHTZFKLIV7","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"pith_short_16","alias_value":"URAHTZFKLIV7FHIY","created_at":"2026-07-04T14:37:13Z"},{"alias_kind":"pith_short_8","alias_value":"URAHTZFK","created_at":"2026-07-04T14:37:13Z"}],"graph_snapshots":[{"event_id":"sha256:1999478c91f789cd8d05b2e1b244f6ff95185226aa610f0b9cce5985a6ec4353","target":"graph","created_at":"2026-07-04T14:37:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0304229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We extend the classical coupon collector's problem to one in which two collectors are simultaneously and independently seeking collections of $d$ coupons. We find, in finite terms, the probability that the two collectors finish at the same trial, and we find, using the methods of Gessel-Viennot, the probability that the game has the following ``ballot-like'' character: the two collectors are tied with each other for some initial number of steps, and after that the player who first gains the lead remains ahead throughout the game. As a by-product we obtain the evaluation in finite terms of cert","authors_text":"Amy N. Myers, Herbert S. Wilf","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2003-04-16T20:28:31Z","title":"Some new aspects of the coupon-collector's problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0304229","kind":"arxiv","version":1},"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:881a529a9bd7659d7042f746e79a89fe499bfa3ec212569e41e637b947a8e21d","target":"record","created_at":"2026-07-04T14:37:13Z","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":"2a98fbfdbf42637efae40f516f81e14edc4bf95c1890ccffa57f61753d439d7d","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2003-04-16T20:28:31Z","title_canon_sha256":"f1c3305a61b67bb55bfd8ebc05438cbf8ad014409e0e2cffe5c5c4b301e25ed5"},"schema_version":"1.0","source":{"id":"math/0304229","kind":"arxiv","version":1}},"canonical_sha256":"a44079e4aa5a2bf29d18a2d4e88a8b3337aa704fd9d8bda51f65bf5668f127fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a44079e4aa5a2bf29d18a2d4e88a8b3337aa704fd9d8bda51f65bf5668f127fe","first_computed_at":"2026-07-04T14:37:13.563925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:37:13.563925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CycbmYvQoK73rixd+Sw1AzJIwsbgWXySv95NyVfccmegEtFcYB48tQCm61VwXsrjiCC6g5iI7ruvc5alPs4+Bw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:37:13.564339Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0304229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:881a529a9bd7659d7042f746e79a89fe499bfa3ec212569e41e637b947a8e21d","sha256:1999478c91f789cd8d05b2e1b244f6ff95185226aa610f0b9cce5985a6ec4353"],"state_sha256":"0e62868d62783a8731924189e8cce6601d782a3831be1e57a02be79dd3fcf15b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r5haPZYN/OGZ6nsBKfzSD2wY7ICHu5SRJLVqgk+HjMUV6/6NcjkepnyIOa7KCfnHI9dH5/syIuWuikOhTR4/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:42:13.492140Z","bundle_sha256":"67724a99bf1bc636977aaf9c47a0afb4f191bfc590e15333a9638bc75ef1ea76"}}