{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3XLPQH6DANWELAHDD75VOIKQHE","short_pith_number":"pith:3XLPQH6D","schema_version":"1.0","canonical_sha256":"ddd6f81fc3036c4580e31ffb572150393f53981de648d65823f654d92845b26f","source":{"kind":"arxiv","id":"1002.0046","version":3},"attestation_state":"computed","paper":{"title":"Multi-dimensional Boltzmann Sampling of Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Olivier Bodini (LIP6), Yann Ponty (LIX)","submitted_at":"2010-01-30T06:24:13Z","abstract_excerpt":"This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size $k$), while constraining every letter to a targeted frequency of occurrence. Our approach consists in a multidimensional extension of Boltzmann samplers \\cite{Duchon2004}. We show that, under mostly \\emph{strong-connectivity} hypotheses, our samplers return a word of size in $[(1-\\varepsilon)n, (1+\\varepsilon)n]$ and exact frequency in $\\mathcal{O}(n^{1+k/2})$ expected time. Moreover, if we accept tolerance intervals of width in $\\Omega(\\sqrt{n})$ for the number of occurrences of "},"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":"1002.0046","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-30T06:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"3fda8cc2577287d4bb3fbaa16dbaaf5b2f84e23460f36f8d5929af9c4975fae0","abstract_canon_sha256":"2e25df3078c647e4775942eae989d6d6cefd40d014b8c4ec5f7f173a96ffd1c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:55.918166Z","signature_b64":"spxI0Y0xV9ILfLyV+fMLRVBmi7vJncbe20QHf61corH6h8Ue0RWDVVHMKudiJZK0AAueC9jMYnZwkxc4XqohDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddd6f81fc3036c4580e31ffb572150393f53981de648d65823f654d92845b26f","last_reissued_at":"2026-05-18T04:32:55.917499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:55.917499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-dimensional Boltzmann Sampling of Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Olivier Bodini (LIP6), Yann Ponty (LIX)","submitted_at":"2010-01-30T06:24:13Z","abstract_excerpt":"This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size $k$), while constraining every letter to a targeted frequency of occurrence. Our approach consists in a multidimensional extension of Boltzmann samplers \\cite{Duchon2004}. We show that, under mostly \\emph{strong-connectivity} hypotheses, our samplers return a word of size in $[(1-\\varepsilon)n, (1+\\varepsilon)n]$ and exact frequency in $\\mathcal{O}(n^{1+k/2})$ expected time. Moreover, if we accept tolerance intervals of width in $\\Omega(\\sqrt{n})$ for the number of occurrences of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0046","kind":"arxiv","version":3},"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":"1002.0046","created_at":"2026-05-18T04:32:55.917603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0046v3","created_at":"2026-05-18T04:32:55.917603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0046","created_at":"2026-05-18T04:32:55.917603+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XLPQH6DANWE","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XLPQH6DANWELAHD","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XLPQH6D","created_at":"2026-05-18T12:26:03.138858+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/3XLPQH6DANWELAHDD75VOIKQHE","json":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE.json","graph_json":"https://pith.science/api/pith-number/3XLPQH6DANWELAHDD75VOIKQHE/graph.json","events_json":"https://pith.science/api/pith-number/3XLPQH6DANWELAHDD75VOIKQHE/events.json","paper":"https://pith.science/paper/3XLPQH6D"},"agent_actions":{"view_html":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE","download_json":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE.json","view_paper":"https://pith.science/paper/3XLPQH6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0046&json=true","fetch_graph":"https://pith.science/api/pith-number/3XLPQH6DANWELAHDD75VOIKQHE/graph.json","fetch_events":"https://pith.science/api/pith-number/3XLPQH6DANWELAHDD75VOIKQHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE/action/storage_attestation","attest_author":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE/action/author_attestation","sign_citation":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE/action/citation_signature","submit_replication":"https://pith.science/pith/3XLPQH6DANWELAHDD75VOIKQHE/action/replication_record"}},"created_at":"2026-05-18T04:32:55.917603+00:00","updated_at":"2026-05-18T04:32:55.917603+00:00"}