{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:67TSUXAFKLWGLXBLEJOJ7B7FKW","short_pith_number":"pith:67TSUXAF","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"},"canonical_sha256":"f7e72a5c0552ec65dc2b225c9f87e5559ecc45cb30ee9c4957f6166451f3ccb4","source":{"kind":"arxiv","id":"1906.11700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11700","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11700v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11700","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"67TSUXAFKLWG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"67TSUXAFKLWGLXBL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"67TSUXAF","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:67TSUXAFKLWGLXBLEJOJ7B7FKW","target":"record","payload":{"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"},"canonical_sha256":"f7e72a5c0552ec65dc2b225c9f87e5559ecc45cb30ee9c4957f6166451f3ccb4","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"},"source_kind":"arxiv","source_id":"1906.11700","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klLTw7LDiVqprmeWYWHycmC0Fgxotn8Jkh2pRP+gfh/dDQmC9lkNYvyU6Oulob6JVXKmwljmZuuiEDrScbJ7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:25:16.205687Z"},"content_sha256":"be3ce4a268f89b4c5e86b92d59273fde3c03c586a1ce61f7a3140a2e3a1224a3","schema_version":"1.0","event_id":"sha256:be3ce4a268f89b4c5e86b92d59273fde3c03c586a1ce61f7a3140a2e3a1224a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:67TSUXAFKLWGLXBLEJOJ7B7FKW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nH4sankep5zzkjxREljh0zfIS6MxR89a3PQaT2reIXsLy+cDysdOtDykkijJc6s4FUDmm7BS97inZh71nkQBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:25:16.206037Z"},"content_sha256":"619c1b5b4107c52aa6727550b9118cac4142a8fc731754f058bf419be7508b62","schema_version":"1.0","event_id":"sha256:619c1b5b4107c52aa6727550b9118cac4142a8fc731754f058bf419be7508b62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/bundle.json","state_url":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T09:25:16Z","links":{"resolver":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW","bundle":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/bundle.json","state":"https://pith.science/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67TSUXAFKLWGLXBLEJOJ7B7FKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:67TSUXAFKLWGLXBLEJOJ7B7FKW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cd4fee732719c638eb5c3ab83a8012f45fcd53ef43102347c1446a445be02997","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-06-27T14:48:40Z","title_canon_sha256":"4e45bb3cf21f74c77b71d62a6527d622856f7ce98cdf5dedae480f69a7414196"},"schema_version":"1.0","source":{"id":"1906.11700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11700","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11700v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11700","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"67TSUXAFKLWG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"67TSUXAFKLWGLXBL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"67TSUXAF","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:619c1b5b4107c52aa6727550b9118cac4142a8fc731754f058bf419be7508b62","target":"graph","created_at":"2026-05-17T23:42:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Daniel Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-06-27T14:48:40Z","title":"Efficient algorithms for modifying and sampling from a categorical distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11700","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:be3ce4a268f89b4c5e86b92d59273fde3c03c586a1ce61f7a3140a2e3a1224a3","target":"record","created_at":"2026-05-17T23:42:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cd4fee732719c638eb5c3ab83a8012f45fcd53ef43102347c1446a445be02997","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-06-27T14:48:40Z","title_canon_sha256":"4e45bb3cf21f74c77b71d62a6527d622856f7ce98cdf5dedae480f69a7414196"},"schema_version":"1.0","source":{"id":"1906.11700","kind":"arxiv","version":1}},"canonical_sha256":"f7e72a5c0552ec65dc2b225c9f87e5559ecc45cb30ee9c4957f6166451f3ccb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7e72a5c0552ec65dc2b225c9f87e5559ecc45cb30ee9c4957f6166451f3ccb4","first_computed_at":"2026-05-17T23:42:04.058002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:04.058002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TM5oDvDMnDnooXHezIEUfIot3RM96/UG1+uLID/hV8Z/Sok1e4pP8X+TtXy9keYFS+fG6E1TK8SkSalhWJPoDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:04.058672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be3ce4a268f89b4c5e86b92d59273fde3c03c586a1ce61f7a3140a2e3a1224a3","sha256:619c1b5b4107c52aa6727550b9118cac4142a8fc731754f058bf419be7508b62"],"state_sha256":"6953736afa155b324f69b0c74558d50ad85b1a30ff57d4d517161f185f836e90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3an8IslRqp/r2NO8Mw0szYxoX7FYxJfKPlmA+cWXmm9bjzE6bM90PmzuklWwQ+X2c8SoSnZ2/6UjECKxkyxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:25:16.208070Z","bundle_sha256":"d782a2f4a079df60ac8bf66be443d4679918f850170d11783ac01c698108ad8c"}}