{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ANILIWYXKZ46T2M5LNRVT3IOII","short_pith_number":"pith:ANILIWYX","schema_version":"1.0","canonical_sha256":"0350b45b175679e9e99d5b6359ed0e421d138f9df464dd3044dbcc36f49feb8a","source":{"kind":"arxiv","id":"2605.24068","version":1},"attestation_state":"computed","paper":{"title":"Efficient Uniform Sampling of Surjections via their Profiles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Arnaud Carayol, Pablo Rotondo","submitted_at":"2026-05-22T08:20:44Z","abstract_excerpt":"In this article, we develop efficient sampling algorithms for random surjections from $[n]$ to $[k]$ for all $n \\geq k$. We make no assumption about $n$ and $k$. In particular, we do not make the common assumption that the ratio $\\frac{n}{k}$ is constant. All our guarantees are uniform in $n$ and $k$.\n  Our first insight is that all the complexity in sampling random surjections is captured by sampling a smaller structure which we call the \\emph{profile} of the surjection. More precisely, the profile associates to each occurring preimage size $s$ the number of preimages of size $s$. Using stand"},"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":"2605.24068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T08:20:44Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"dbf5ad959c890a045504f66cb1b1e961ae11c0f063bb77b10c9d37c1f60c706e","abstract_canon_sha256":"ca140733f54482d70d62b38d444c3886ff3c3aaf205c34183eebc41d043a91f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:02:43.746694Z","signature_b64":"nKSLmDse67nKXcvKJ+RDH+a8sXL8AIkzpYNBMAqh+00Wr2kr/0fq30thwXoarYDIhucfkHPKv3Doh7ipec0qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0350b45b175679e9e99d5b6359ed0e421d138f9df464dd3044dbcc36f49feb8a","last_reissued_at":"2026-05-26T01:02:43.745473Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:02:43.745473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Uniform Sampling of Surjections via their Profiles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Arnaud Carayol, Pablo Rotondo","submitted_at":"2026-05-22T08:20:44Z","abstract_excerpt":"In this article, we develop efficient sampling algorithms for random surjections from $[n]$ to $[k]$ for all $n \\geq k$. We make no assumption about $n$ and $k$. In particular, we do not make the common assumption that the ratio $\\frac{n}{k}$ is constant. All our guarantees are uniform in $n$ and $k$.\n  Our first insight is that all the complexity in sampling random surjections is captured by sampling a smaller structure which we call the \\emph{profile} of the surjection. More precisely, the profile associates to each occurring preimage size $s$ the number of preimages of size $s$. Using stand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24068","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/2605.24068/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":"2605.24068","created_at":"2026-05-26T01:02:43.745587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24068v1","created_at":"2026-05-26T01:02:43.745587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24068","created_at":"2026-05-26T01:02:43.745587+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANILIWYXKZ46","created_at":"2026-05-26T01:02:43.745587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANILIWYXKZ46T2M5","created_at":"2026-05-26T01:02:43.745587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANILIWYX","created_at":"2026-05-26T01:02:43.745587+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/ANILIWYXKZ46T2M5LNRVT3IOII","json":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII.json","graph_json":"https://pith.science/api/pith-number/ANILIWYXKZ46T2M5LNRVT3IOII/graph.json","events_json":"https://pith.science/api/pith-number/ANILIWYXKZ46T2M5LNRVT3IOII/events.json","paper":"https://pith.science/paper/ANILIWYX"},"agent_actions":{"view_html":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII","download_json":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII.json","view_paper":"https://pith.science/paper/ANILIWYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24068&json=true","fetch_graph":"https://pith.science/api/pith-number/ANILIWYXKZ46T2M5LNRVT3IOII/graph.json","fetch_events":"https://pith.science/api/pith-number/ANILIWYXKZ46T2M5LNRVT3IOII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII/action/storage_attestation","attest_author":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII/action/author_attestation","sign_citation":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII/action/citation_signature","submit_replication":"https://pith.science/pith/ANILIWYXKZ46T2M5LNRVT3IOII/action/replication_record"}},"created_at":"2026-05-26T01:02:43.745587+00:00","updated_at":"2026-05-26T01:02:43.745587+00:00"}