{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DMOETZ3UGF3AOZKYQJN6QZ5L7P","short_pith_number":"pith:DMOETZ3U","schema_version":"1.0","canonical_sha256":"1b1c49e7743176076558825be867abfbcbb71890c3059a5be2e6abbca1db727a","source":{"kind":"arxiv","id":"2409.07900","version":1},"attestation_state":"computed","paper":{"title":"Limit Profile for the Bernoulli--Laplace Urn","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Dominik Schmid, Sam Olesker-Taylor","submitted_at":"2024-09-12T10:09:47Z","abstract_excerpt":"We analyse the convergence to equilibrium of the Bernoulli--Laplace urn model: initially, one urn contains $k$ red balls and a second $n-k$ blue balls; in each step, a pair of balls is chosen uniform and their locations are switched. Cutoff is known to occur at $\\tfrac12 n \\log \\min\\{k, \\sqrt n\\}$ with window order $n$ whenever $1 \\ll k \\le \\tfrac12 n$. We refine this by determining the limit profile: a function $\\Phi$ such that \\[\n  d_\\mathsf{TV}\\bigl( \\tfrac12 n \\log \\min\\{k, \\sqrt n\\} + \\theta n \\bigr) \\to\n  \\Phi(\\theta) \\quad\\text{as}\\quad\n  n \\to \\infty \\quad\\text{for all}\\quad\n  \\theta \\"},"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":"2409.07900","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.PR","submitted_at":"2024-09-12T10:09:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"73464d71d393b77f64b3144362156a78a221d971091808661d525f7d1822bc18","abstract_canon_sha256":"9f47835208c581b336a5b8d1ec0e50a083c7ea4574ec4f8d5446568582f5bb3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:17.004199Z","signature_b64":"Yh5tztzVJ3nZ5tTnIqJKZOPyqGeRcsAkoKOh5MEIvFCVOmqHOHZKCJeBCDFMrwC5lESoCfJzaf8b+WgQ87+SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b1c49e7743176076558825be867abfbcbb71890c3059a5be2e6abbca1db727a","last_reissued_at":"2026-07-05T09:06:17.003754Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:17.003754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limit Profile for the Bernoulli--Laplace Urn","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Dominik Schmid, Sam Olesker-Taylor","submitted_at":"2024-09-12T10:09:47Z","abstract_excerpt":"We analyse the convergence to equilibrium of the Bernoulli--Laplace urn model: initially, one urn contains $k$ red balls and a second $n-k$ blue balls; in each step, a pair of balls is chosen uniform and their locations are switched. Cutoff is known to occur at $\\tfrac12 n \\log \\min\\{k, \\sqrt n\\}$ with window order $n$ whenever $1 \\ll k \\le \\tfrac12 n$. We refine this by determining the limit profile: a function $\\Phi$ such that \\[\n  d_\\mathsf{TV}\\bigl( \\tfrac12 n \\log \\min\\{k, \\sqrt n\\} + \\theta n \\bigr) \\to\n  \\Phi(\\theta) \\quad\\text{as}\\quad\n  n \\to \\infty \\quad\\text{for all}\\quad\n  \\theta \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07900","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/2409.07900/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.07900","created_at":"2026-07-05T09:06:17.003808+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.07900v1","created_at":"2026-07-05T09:06:17.003808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07900","created_at":"2026-07-05T09:06:17.003808+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMOETZ3UGF3A","created_at":"2026-07-05T09:06:17.003808+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMOETZ3UGF3AOZKY","created_at":"2026-07-05T09:06:17.003808+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMOETZ3U","created_at":"2026-07-05T09:06:17.003808+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19084","citing_title":"Limit Profiles for Separation Distance","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23890","citing_title":"The Cutoff Profile for Random Transpositions on Repeated Cards in the Full Range of Parameters","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P","json":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P.json","graph_json":"https://pith.science/api/pith-number/DMOETZ3UGF3AOZKYQJN6QZ5L7P/graph.json","events_json":"https://pith.science/api/pith-number/DMOETZ3UGF3AOZKYQJN6QZ5L7P/events.json","paper":"https://pith.science/paper/DMOETZ3U"},"agent_actions":{"view_html":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P","download_json":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P.json","view_paper":"https://pith.science/paper/DMOETZ3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.07900&json=true","fetch_graph":"https://pith.science/api/pith-number/DMOETZ3UGF3AOZKYQJN6QZ5L7P/graph.json","fetch_events":"https://pith.science/api/pith-number/DMOETZ3UGF3AOZKYQJN6QZ5L7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P/action/storage_attestation","attest_author":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P/action/author_attestation","sign_citation":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P/action/citation_signature","submit_replication":"https://pith.science/pith/DMOETZ3UGF3AOZKYQJN6QZ5L7P/action/replication_record"}},"created_at":"2026-07-05T09:06:17.003808+00:00","updated_at":"2026-07-05T09:06:17.003808+00:00"}