{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:67TSUXAFKLWGLXBLEJOJ7B7FKW","short_pith_number":"pith:67TSUXAF","schema_version":"1.0","canonical_sha256":"f7e72a5c0552ec65dc2b225c9f87e5559ecc45cb30ee9c4957f6166451f3ccb4","source":{"kind":"arxiv","id":"1906.11700","version":1},"attestation_state":"computed","paper":{"title":"Efficient algorithms for modifying and sampling from a categorical distribution","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Tang","submitted_at":"2019-06-27T14:48:40Z","abstract_excerpt":"Probabilistic programming languages and other machine learning applications often require samples to be generated from a categorical distribution where the probability of each one of $n$ categories is specified as a parameter. If the parameters are hyper-parameters then they need to be modified, however, current implementations of categorical distributions take $\\mathcal{O}(n)$ time to modify a parameter. If $n$ is large and the parameters are being frequently modified, this can become prohibitive. Here we present the insight that a Huffman tree is an efficient data structure for representing "},"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":"1906.11700","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-06-27T14:48:40Z","cross_cats_sorted":[],"title_canon_sha256":"4e45bb3cf21f74c77b71d62a6527d622856f7ce98cdf5dedae480f69a7414196","abstract_canon_sha256":"cd4fee732719c638eb5c3ab83a8012f45fcd53ef43102347c1446a445be02997"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.058672Z","signature_b64":"TM5oDvDMnDnooXHezIEUfIot3RM96/UG1+uLID/hV8Z/Sok1e4pP8X+TtXy9keYFS+fG6E1TK8SkSalhWJPoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7e72a5c0552ec65dc2b225c9f87e5559ecc45cb30ee9c4957f6166451f3ccb4","last_reissued_at":"2026-05-17T23:42:04.058002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.058002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithms for modifying and sampling from a categorical distribution","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Tang","submitted_at":"2019-06-27T14:48:40Z","abstract_excerpt":"Probabilistic programming languages and other machine learning applications often require samples to be generated from a categorical distribution where the probability of each one of $n$ categories is specified as a parameter. If the parameters are hyper-parameters then they need to be modified, however, current implementations of categorical distributions take $\\mathcal{O}(n)$ time to modify a parameter. If $n$ is large and the parameters are being frequently modified, this can become prohibitive. Here we present the insight that a Huffman tree is an efficient data structure for representing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11700","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":"1906.11700","created_at":"2026-05-17T23:42:04.058123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11700v1","created_at":"2026-05-17T23:42:04.058123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11700","created_at":"2026-05-17T23:42:04.058123+00:00"},{"alias_kind":"pith_short_12","alias_value":"67TSUXAFKLWG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"67TSUXAFKLWGLXBL","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"67TSUXAF","created_at":"2026-05-18T12:33:10.108867+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/67TSUXAFKLWGLXBLEJOJ7B7FKW","json":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW.json","graph_json":"https://pith.science/api/pith-number/67TSUXAFKLWGLXBLEJOJ7B7FKW/graph.json","events_json":"https://pith.science/api/pith-number/67TSUXAFKLWGLXBLEJOJ7B7FKW/events.json","paper":"https://pith.science/paper/67TSUXAF"},"agent_actions":{"view_html":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW","download_json":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW.json","view_paper":"https://pith.science/paper/67TSUXAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11700&json=true","fetch_graph":"https://pith.science/api/pith-number/67TSUXAFKLWGLXBLEJOJ7B7FKW/graph.json","fetch_events":"https://pith.science/api/pith-number/67TSUXAFKLWGLXBLEJOJ7B7FKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/action/storage_attestation","attest_author":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/action/author_attestation","sign_citation":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/action/citation_signature","submit_replication":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/action/replication_record"}},"created_at":"2026-05-17T23:42:04.058123+00:00","updated_at":"2026-05-17T23:42:04.058123+00:00"}