{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GVEZOSXTFIGOVQOSBNIYKUXSQY","short_pith_number":"pith:GVEZOSXT","schema_version":"1.0","canonical_sha256":"3549974af32a0ceac1d20b518552f2862555fa856b02e8e9e931a8e7da1ef06b","source":{"kind":"arxiv","id":"1609.09188","version":1},"attestation_state":"computed","paper":{"title":"Topic Browsing for Research Papers with Hierarchical Latent Tree Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CL","authors_text":"Leonard K.M. Poon, Nevin L. Zhang","submitted_at":"2016-09-29T03:22:01Z","abstract_excerpt":"Academic researchers often need to face with a large collection of research papers in the literature. This problem may be even worse for postgraduate students who are new to a field and may not know where to start. To address this problem, we have developed an online catalog of research papers where the papers have been automatically categorized by a topic model. The catalog contains 7719 papers from the proceedings of two artificial intelligence conferences from 2000 to 2015. Rather than the commonly used Latent Dirichlet Allocation, we use a recently proposed method called hierarchical laten"},"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":"1609.09188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-29T03:22:01Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"b20362c213072038199ead345d0d2fcd7b5ab1773a1861cca13475586d6877dc","abstract_canon_sha256":"e11ba61fa972a320378f54e99d6e0dc74a8d28d484ccdf44d6fcbc07e2c46f0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:38.545898Z","signature_b64":"jfTR0IzEoaI2/bhZpfOyQFB7eFYcq5tzrEswPUPH2hINr+G9Oj9NMx/+IFUHsU64RMcRdWnUXB4iSANm/IFDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3549974af32a0ceac1d20b518552f2862555fa856b02e8e9e931a8e7da1ef06b","last_reissued_at":"2026-05-18T01:03:38.545360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:38.545360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topic Browsing for Research Papers with Hierarchical Latent Tree Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.CL","authors_text":"Leonard K.M. Poon, Nevin L. Zhang","submitted_at":"2016-09-29T03:22:01Z","abstract_excerpt":"Academic researchers often need to face with a large collection of research papers in the literature. This problem may be even worse for postgraduate students who are new to a field and may not know where to start. To address this problem, we have developed an online catalog of research papers where the papers have been automatically categorized by a topic model. The catalog contains 7719 papers from the proceedings of two artificial intelligence conferences from 2000 to 2015. Rather than the commonly used Latent Dirichlet Allocation, we use a recently proposed method called hierarchical laten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09188","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":"1609.09188","created_at":"2026-05-18T01:03:38.545436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09188v1","created_at":"2026-05-18T01:03:38.545436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09188","created_at":"2026-05-18T01:03:38.545436+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVEZOSXTFIGO","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVEZOSXTFIGOVQOS","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVEZOSXT","created_at":"2026-05-18T12:30:19.053100+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/GVEZOSXTFIGOVQOSBNIYKUXSQY","json":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY.json","graph_json":"https://pith.science/api/pith-number/GVEZOSXTFIGOVQOSBNIYKUXSQY/graph.json","events_json":"https://pith.science/api/pith-number/GVEZOSXTFIGOVQOSBNIYKUXSQY/events.json","paper":"https://pith.science/paper/GVEZOSXT"},"agent_actions":{"view_html":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY","download_json":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY.json","view_paper":"https://pith.science/paper/GVEZOSXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09188&json=true","fetch_graph":"https://pith.science/api/pith-number/GVEZOSXTFIGOVQOSBNIYKUXSQY/graph.json","fetch_events":"https://pith.science/api/pith-number/GVEZOSXTFIGOVQOSBNIYKUXSQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/action/storage_attestation","attest_author":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/action/author_attestation","sign_citation":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/action/citation_signature","submit_replication":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/action/replication_record"}},"created_at":"2026-05-18T01:03:38.545436+00:00","updated_at":"2026-05-18T01:03:38.545436+00:00"}