{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PAVHK24G27BWPPQZFKXX624PIW","short_pith_number":"pith:PAVHK24G","canonical_record":{"source":{"id":"1601.04455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-18T10:29:16Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8982b1492b95492ba1d990a490f12c21ea5f56fa25b0683376f91c6c3efc003f","abstract_canon_sha256":"0d444d78ba871d6bc3eb57348987d98d6316d5d724ec617bdcfa4f8737054e2e"},"schema_version":"1.0"},"canonical_sha256":"782a756b86d7c367be192aaf7f6b8f4585ef65530288554f240c2de92769e2d9","source":{"kind":"arxiv","id":"1601.04455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04455","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04455v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04455","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"PAVHK24G27BW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PAVHK24G27BWPPQZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PAVHK24G","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PAVHK24G27BWPPQZFKXX624PIW","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-18T10:29:16Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8982b1492b95492ba1d990a490f12c21ea5f56fa25b0683376f91c6c3efc003f","abstract_canon_sha256":"0d444d78ba871d6bc3eb57348987d98d6316d5d724ec617bdcfa4f8737054e2e"},"schema_version":"1.0"},"canonical_sha256":"782a756b86d7c367be192aaf7f6b8f4585ef65530288554f240c2de92769e2d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.993774Z","signature_b64":"XiB+LYAlzO8NSNb/AueOtq1tUGW8PxYcK0Nbfv4oN5DO/Bb27H29USYIjNveAnSgas534+N1okJs7w+biPMSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"782a756b86d7c367be192aaf7f6b8f4585ef65530288554f240c2de92769e2d9","last_reissued_at":"2026-05-18T01:22:44.993354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.993354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04455","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-05-18T01:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsPFIRkx8AUDRTU9HPRgP1BntUYtFhz+gyuTuqE1A6ninvM71YIEayu6P3KIizamPehl2LZemowj3KmCA1WnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:03:19.181089Z"},"content_sha256":"df74e5f40c2dd9ee3a9656240bb2af974a15f0f790b3820509a4e63aeee38c60","schema_version":"1.0","event_id":"sha256:df74e5f40c2dd9ee3a9656240bb2af974a15f0f790b3820509a4e63aeee38c60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PAVHK24G27BWPPQZFKXX624PIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speed and concentration of the covering time for structured coupon collectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Joel Larsson, Klas Markstr\\\"om, Victor Falgas-Ravry","submitted_at":"2016-01-18T10:29:16Z","abstract_excerpt":"Let $V$ be an $n$-set, and let $X$ be a random variable taking values in the powerset of $V$. Suppose we are given a sequence of random coupons $X_1, X_2, \\ldots $, where the $X_i$ are independent random variables with distribution given by $X$. The covering time $T$ is the smallest integer $t\\geq 0$ such that $\\bigcup_{i=1}^tX_i=V$. The distribution of $T$ is important in many applications in combinatorial probability, and has been extensively studied. However the literature has focussed almost exclusively on the case where $X$ is assumed to be symmetric and/or uniform in some way.\n  In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04455","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"},"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-18T01:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkB8g6x43c7RDHl1XhQsJ01vWtGQeujbC20Un22o4AiUXhuBtaNvPJongYHYVUULKZkAYio0AkzFxfiT84hoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:03:19.181447Z"},"content_sha256":"d4a9a28aeb073e15b894719fceebf002dbaae3607cc99776fb4633e60464aeb6","schema_version":"1.0","event_id":"sha256:d4a9a28aeb073e15b894719fceebf002dbaae3607cc99776fb4633e60464aeb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAVHK24G27BWPPQZFKXX624PIW/bundle.json","state_url":"https://pith.science/pith/PAVHK24G27BWPPQZFKXX624PIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAVHK24G27BWPPQZFKXX624PIW/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-06-03T05:03:19Z","links":{"resolver":"https://pith.science/pith/PAVHK24G27BWPPQZFKXX624PIW","bundle":"https://pith.science/pith/PAVHK24G27BWPPQZFKXX624PIW/bundle.json","state":"https://pith.science/pith/PAVHK24G27BWPPQZFKXX624PIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAVHK24G27BWPPQZFKXX624PIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PAVHK24G27BWPPQZFKXX624PIW","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":"0d444d78ba871d6bc3eb57348987d98d6316d5d724ec617bdcfa4f8737054e2e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-18T10:29:16Z","title_canon_sha256":"8982b1492b95492ba1d990a490f12c21ea5f56fa25b0683376f91c6c3efc003f"},"schema_version":"1.0","source":{"id":"1601.04455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04455","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04455v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04455","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"PAVHK24G27BW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PAVHK24G27BWPPQZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PAVHK24G","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:d4a9a28aeb073e15b894719fceebf002dbaae3607cc99776fb4633e60464aeb6","target":"graph","created_at":"2026-05-18T01:22:44Z","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":"Let $V$ be an $n$-set, and let $X$ be a random variable taking values in the powerset of $V$. Suppose we are given a sequence of random coupons $X_1, X_2, \\ldots $, where the $X_i$ are independent random variables with distribution given by $X$. The covering time $T$ is the smallest integer $t\\geq 0$ such that $\\bigcup_{i=1}^tX_i=V$. The distribution of $T$ is important in many applications in combinatorial probability, and has been extensively studied. However the literature has focussed almost exclusively on the case where $X$ is assumed to be symmetric and/or uniform in some way.\n  In this ","authors_text":"Joel Larsson, Klas Markstr\\\"om, Victor Falgas-Ravry","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-18T10:29:16Z","title":"Speed and concentration of the covering time for structured coupon collectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04455","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:df74e5f40c2dd9ee3a9656240bb2af974a15f0f790b3820509a4e63aeee38c60","target":"record","created_at":"2026-05-18T01:22:44Z","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":"0d444d78ba871d6bc3eb57348987d98d6316d5d724ec617bdcfa4f8737054e2e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-01-18T10:29:16Z","title_canon_sha256":"8982b1492b95492ba1d990a490f12c21ea5f56fa25b0683376f91c6c3efc003f"},"schema_version":"1.0","source":{"id":"1601.04455","kind":"arxiv","version":1}},"canonical_sha256":"782a756b86d7c367be192aaf7f6b8f4585ef65530288554f240c2de92769e2d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"782a756b86d7c367be192aaf7f6b8f4585ef65530288554f240c2de92769e2d9","first_computed_at":"2026-05-18T01:22:44.993354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:44.993354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XiB+LYAlzO8NSNb/AueOtq1tUGW8PxYcK0Nbfv4oN5DO/Bb27H29USYIjNveAnSgas534+N1okJs7w+biPMSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:44.993774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df74e5f40c2dd9ee3a9656240bb2af974a15f0f790b3820509a4e63aeee38c60","sha256:d4a9a28aeb073e15b894719fceebf002dbaae3607cc99776fb4633e60464aeb6"],"state_sha256":"51f916d786e1cba80b397adfed301c889252a8f9ca9a0cef839f024169d485f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vyPYZXDPvaR4B2e38/X9Kl1sis2RzbNnDJTyhYNursyxwJwPdbzLye+RW+lnnDG7kzw4mgQZM8g2qqhHxzJOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:03:19.183372Z","bundle_sha256":"a561310358fb51d2d9ee77c7f664163fc23ab6f2412c351257a21428d801ddc5"}}