{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AQ36EEE7UXP2GR4KYSZOMBIMBQ","short_pith_number":"pith:AQ36EEE7","canonical_record":{"source":{"id":"1605.06650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-21T14:36:33Z","cross_cats_sorted":["cs.IR","cs.LG","stat.ML"],"title_canon_sha256":"7dcc878f001fed5fdd867b0138431cea1b8947572bdd58ed090e48bf5235074c","abstract_canon_sha256":"f9428f0191ad6abbb0583676041a86770093745832a7876c73303dfb355c85d9"},"schema_version":"1.0"},"canonical_sha256":"0437e2109fa5dfa3478ac4b2e6050c0c3dbecc9dea2ac4dfbf5514f773e58cba","source":{"kind":"arxiv","id":"1605.06650","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06650","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06650v2","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06650","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"AQ36EEE7UXP2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AQ36EEE7UXP2GR4K","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AQ36EEE7","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AQ36EEE7UXP2GR4KYSZOMBIMBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-21T14:36:33Z","cross_cats_sorted":["cs.IR","cs.LG","stat.ML"],"title_canon_sha256":"7dcc878f001fed5fdd867b0138431cea1b8947572bdd58ed090e48bf5235074c","abstract_canon_sha256":"f9428f0191ad6abbb0583676041a86770093745832a7876c73303dfb355c85d9"},"schema_version":"1.0"},"canonical_sha256":"0437e2109fa5dfa3478ac4b2e6050c0c3dbecc9dea2ac4dfbf5514f773e58cba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.617431Z","signature_b64":"8AIML2n4mdmOW1Kov8yJzUW2ZhqSSw6h/fk/2KrzM8HrQf/AM3c+o0JdnxNaWPIk2zaxr0MO4YJgRHrBQU2GAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0437e2109fa5dfa3478ac4b2e6050c0c3dbecc9dea2ac4dfbf5514f773e58cba","last_reissued_at":"2026-05-18T00:54:15.617049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.617049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06650","source_version":2,"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-18T00:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Udc54kQNamLsIaGQOeXn9M8AAciJ/ShUXWGK6tO+GeTK38Bx5WNGX34srRhByU8dOGbBao8A5gsJRokjr703Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:04:53.771818Z"},"content_sha256":"0b07fdfc3af7a898948f0967ccd716a3f65d13bd92cafbb1e91a242bf66be2f2","schema_version":"1.0","event_id":"sha256:0b07fdfc3af7a898948f0967ccd716a3f65d13bd92cafbb1e91a242bf66be2f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AQ36EEE7UXP2GR4KYSZOMBIMBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Latent Tree Models for Hierarchical Topic Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Farhan Khawar, Leonard K.M. Poon, Nevin L. Zhang, Peixian Chen, Tengfei Liu, Zhourong Chen","submitted_at":"2016-05-21T14:36:33Z","abstract_excerpt":"We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary variables that represent the presence/absence of words in a document. The variables at other levels are binary latent variables, with those at the lowest latent level representing word co-occurrence patterns and those at higher levels representing co-occurrence of patterns at the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06650","kind":"arxiv","version":2},"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-18T00:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6z19rPaODtWwWZHLKeX1cw9Pyii115BGVkOmqzF7VqkunB7T6ay1G31WZ/ZcLIp3faqQ0fDq8s+15Pb4/LqWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:04:53.772567Z"},"content_sha256":"104fb774747d5101e48146f61345ec79790aef2dcb07ac4448f29c879f35b51a","schema_version":"1.0","event_id":"sha256:104fb774747d5101e48146f61345ec79790aef2dcb07ac4448f29c879f35b51a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQ36EEE7UXP2GR4KYSZOMBIMBQ/bundle.json","state_url":"https://pith.science/pith/AQ36EEE7UXP2GR4KYSZOMBIMBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQ36EEE7UXP2GR4KYSZOMBIMBQ/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-08T19:04:53Z","links":{"resolver":"https://pith.science/pith/AQ36EEE7UXP2GR4KYSZOMBIMBQ","bundle":"https://pith.science/pith/AQ36EEE7UXP2GR4KYSZOMBIMBQ/bundle.json","state":"https://pith.science/pith/AQ36EEE7UXP2GR4KYSZOMBIMBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQ36EEE7UXP2GR4KYSZOMBIMBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AQ36EEE7UXP2GR4KYSZOMBIMBQ","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":"f9428f0191ad6abbb0583676041a86770093745832a7876c73303dfb355c85d9","cross_cats_sorted":["cs.IR","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-21T14:36:33Z","title_canon_sha256":"7dcc878f001fed5fdd867b0138431cea1b8947572bdd58ed090e48bf5235074c"},"schema_version":"1.0","source":{"id":"1605.06650","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06650","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06650v2","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06650","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"AQ36EEE7UXP2","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AQ36EEE7UXP2GR4K","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AQ36EEE7","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:104fb774747d5101e48146f61345ec79790aef2dcb07ac4448f29c879f35b51a","target":"graph","created_at":"2026-05-18T00:54:15Z","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":"We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary variables that represent the presence/absence of words in a document. The variables at other levels are binary latent variables, with those at the lowest latent level representing word co-occurrence patterns and those at higher levels representing co-occurrence of patterns at the l","authors_text":"Farhan Khawar, Leonard K.M. Poon, Nevin L. Zhang, Peixian Chen, Tengfei Liu, Zhourong Chen","cross_cats":["cs.IR","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-21T14:36:33Z","title":"Latent Tree Models for Hierarchical Topic Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06650","kind":"arxiv","version":2},"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:0b07fdfc3af7a898948f0967ccd716a3f65d13bd92cafbb1e91a242bf66be2f2","target":"record","created_at":"2026-05-18T00:54:15Z","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":"f9428f0191ad6abbb0583676041a86770093745832a7876c73303dfb355c85d9","cross_cats_sorted":["cs.IR","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-21T14:36:33Z","title_canon_sha256":"7dcc878f001fed5fdd867b0138431cea1b8947572bdd58ed090e48bf5235074c"},"schema_version":"1.0","source":{"id":"1605.06650","kind":"arxiv","version":2}},"canonical_sha256":"0437e2109fa5dfa3478ac4b2e6050c0c3dbecc9dea2ac4dfbf5514f773e58cba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0437e2109fa5dfa3478ac4b2e6050c0c3dbecc9dea2ac4dfbf5514f773e58cba","first_computed_at":"2026-05-18T00:54:15.617049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:15.617049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8AIML2n4mdmOW1Kov8yJzUW2ZhqSSw6h/fk/2KrzM8HrQf/AM3c+o0JdnxNaWPIk2zaxr0MO4YJgRHrBQU2GAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:15.617431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06650","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b07fdfc3af7a898948f0967ccd716a3f65d13bd92cafbb1e91a242bf66be2f2","sha256:104fb774747d5101e48146f61345ec79790aef2dcb07ac4448f29c879f35b51a"],"state_sha256":"0465263108cdfded1c8c59e89d9cd4beee5609844325a1ae51ec9ca235671a4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZMtKlpAgZWG+9GrBRNBQc5I4d/B1aAcYLnAdw4d41TVTIO/qHcRM9kXJ+W66m0+CQ8RYP1bRbRJ3t69cBNPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:04:53.776265Z","bundle_sha256":"88d535a40b7a422ca384b20b22504371534cfd0f2731884f316ac3dbf4a14901"}}