{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:VLCWSKXAB6HUSZIFWWYSPQP5X3","short_pith_number":"pith:VLCWSKXA","schema_version":"1.0","canonical_sha256":"aac5692ae00f8f496505b5b127c1fdbec8a18d49026e83b9be9f2bbb414b602a","source":{"kind":"arxiv","id":"0806.1007","version":1},"attestation_state":"computed","paper":{"title":"Competition between Discrete Random Variables, with Applications to Occupancy Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anant Godbole, Betsy Sinclair, Julia Eaton","submitted_at":"2008-06-05T16:32:48Z","abstract_excerpt":"Consider $n$ players whose \"scores\" are independent and identically distributed values $\\{X_i\\}_{i=1}^n$ from some discrete distribution $F$. We pay special attention to the cases where (i) $F$ is geometric with parameter $p\\to0$ and (ii) $F$ is uniform on $\\{1,2,...,N\\}$; the latter case clearly corresponds to the classical occupancy problem. The quantities of interest to us are, first, the $U$-statistic $W$ which counts the number of \"ties\" between pairs $i,j$; second, the univariate statistic $Y_r$, which counts the number of strict $r$-way ties between contestants, i.e., episodes of the fo"},"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":"0806.1007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-06-05T16:32:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"838d497d4c716fd588e22db2b8ca9a89697f94d387a4430460cf649203b3e407","abstract_canon_sha256":"e4b0dd47b693c8dd7d182aa9c8886829c8f8ef31d474c0957b2ee4ca5be8bd4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:05.197003Z","signature_b64":"08E0gWcB2u5acVu1E78u1WmdAzBMsCgDWviPvgDH3stzMmJA/8opHBH5HlUxOdcTyZioSeYSWq3PiBmzvdwzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac5692ae00f8f496505b5b127c1fdbec8a18d49026e83b9be9f2bbb414b602a","last_reissued_at":"2026-05-18T03:58:05.196478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:05.196478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competition between Discrete Random Variables, with Applications to Occupancy Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anant Godbole, Betsy Sinclair, Julia Eaton","submitted_at":"2008-06-05T16:32:48Z","abstract_excerpt":"Consider $n$ players whose \"scores\" are independent and identically distributed values $\\{X_i\\}_{i=1}^n$ from some discrete distribution $F$. We pay special attention to the cases where (i) $F$ is geometric with parameter $p\\to0$ and (ii) $F$ is uniform on $\\{1,2,...,N\\}$; the latter case clearly corresponds to the classical occupancy problem. The quantities of interest to us are, first, the $U$-statistic $W$ which counts the number of \"ties\" between pairs $i,j$; second, the univariate statistic $Y_r$, which counts the number of strict $r$-way ties between contestants, i.e., episodes of the fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.1007","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":"0806.1007","created_at":"2026-05-18T03:58:05.196563+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.1007v1","created_at":"2026-05-18T03:58:05.196563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.1007","created_at":"2026-05-18T03:58:05.196563+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLCWSKXAB6HU","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLCWSKXAB6HUSZIF","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLCWSKXA","created_at":"2026-05-18T12:25:58.018023+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/VLCWSKXAB6HUSZIFWWYSPQP5X3","json":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3.json","graph_json":"https://pith.science/api/pith-number/VLCWSKXAB6HUSZIFWWYSPQP5X3/graph.json","events_json":"https://pith.science/api/pith-number/VLCWSKXAB6HUSZIFWWYSPQP5X3/events.json","paper":"https://pith.science/paper/VLCWSKXA"},"agent_actions":{"view_html":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3","download_json":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3.json","view_paper":"https://pith.science/paper/VLCWSKXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.1007&json=true","fetch_graph":"https://pith.science/api/pith-number/VLCWSKXAB6HUSZIFWWYSPQP5X3/graph.json","fetch_events":"https://pith.science/api/pith-number/VLCWSKXAB6HUSZIFWWYSPQP5X3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3/action/storage_attestation","attest_author":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3/action/author_attestation","sign_citation":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3/action/citation_signature","submit_replication":"https://pith.science/pith/VLCWSKXAB6HUSZIFWWYSPQP5X3/action/replication_record"}},"created_at":"2026-05-18T03:58:05.196563+00:00","updated_at":"2026-05-18T03:58:05.196563+00:00"}