{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GVEZOSXTFIGOVQOSBNIYKUXSQY","short_pith_number":"pith:GVEZOSXT","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"},"canonical_sha256":"3549974af32a0ceac1d20b518552f2862555fa856b02e8e9e931a8e7da1ef06b","source":{"kind":"arxiv","id":"1609.09188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09188","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09188v1","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09188","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"GVEZOSXTFIGO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GVEZOSXTFIGOVQOS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GVEZOSXT","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GVEZOSXTFIGOVQOSBNIYKUXSQY","target":"record","payload":{"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"},"canonical_sha256":"3549974af32a0ceac1d20b518552f2862555fa856b02e8e9e931a8e7da1ef06b","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"},"source_kind":"arxiv","source_id":"1609.09188","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-18T01:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGbIIr8XiWAml3JGh8JqTGyUvvObBFvYLT9eFZU6VIw5HQLOgGV34i4FfTUW58OltDOXC35OwKIpcFVGPKSsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:16.996457Z"},"content_sha256":"8e8806547afbfc1d29f9ddc9b5df482d38271474527fe88ee15917c55151fef3","schema_version":"1.0","event_id":"sha256:8e8806547afbfc1d29f9ddc9b5df482d38271474527fe88ee15917c55151fef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GVEZOSXTFIGOVQOSBNIYKUXSQY","target":"graph","payload":{"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"},"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-18T01:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiX1puX2A9QpTIfg9adplNfcLNijkWUm4PkACVBCkLJc3/FAg8rw8dVKzO/hYl5o/xCtiCQjcWsHWWNva+fyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:16.997083Z"},"content_sha256":"a8cf2c92bbab7c6e2d79771130604e27771a1c8544fdebe6087381998b9bbe1a","schema_version":"1.0","event_id":"sha256:a8cf2c92bbab7c6e2d79771130604e27771a1c8544fdebe6087381998b9bbe1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/bundle.json","state_url":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/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-08T15:38:16Z","links":{"resolver":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY","bundle":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/bundle.json","state":"https://pith.science/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVEZOSXTFIGOVQOSBNIYKUXSQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GVEZOSXTFIGOVQOSBNIYKUXSQY","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":"e11ba61fa972a320378f54e99d6e0dc74a8d28d484ccdf44d6fcbc07e2c46f0b","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-29T03:22:01Z","title_canon_sha256":"b20362c213072038199ead345d0d2fcd7b5ab1773a1861cca13475586d6877dc"},"schema_version":"1.0","source":{"id":"1609.09188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09188","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09188v1","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09188","created_at":"2026-05-18T01:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"GVEZOSXTFIGO","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GVEZOSXTFIGOVQOS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GVEZOSXT","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:a8cf2c92bbab7c6e2d79771130604e27771a1c8544fdebe6087381998b9bbe1a","target":"graph","created_at":"2026-05-18T01:03:38Z","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":"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","authors_text":"Leonard K.M. Poon, Nevin L. Zhang","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-29T03:22:01Z","title":"Topic Browsing for Research Papers with Hierarchical Latent Tree Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09188","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:8e8806547afbfc1d29f9ddc9b5df482d38271474527fe88ee15917c55151fef3","target":"record","created_at":"2026-05-18T01:03:38Z","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":"e11ba61fa972a320378f54e99d6e0dc74a8d28d484ccdf44d6fcbc07e2c46f0b","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-09-29T03:22:01Z","title_canon_sha256":"b20362c213072038199ead345d0d2fcd7b5ab1773a1861cca13475586d6877dc"},"schema_version":"1.0","source":{"id":"1609.09188","kind":"arxiv","version":1}},"canonical_sha256":"3549974af32a0ceac1d20b518552f2862555fa856b02e8e9e931a8e7da1ef06b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3549974af32a0ceac1d20b518552f2862555fa856b02e8e9e931a8e7da1ef06b","first_computed_at":"2026-05-18T01:03:38.545360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:38.545360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfTR0IzEoaI2/bhZpfOyQFB7eFYcq5tzrEswPUPH2hINr+G9Oj9NMx/+IFUHsU64RMcRdWnUXB4iSANm/IFDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:38.545898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e8806547afbfc1d29f9ddc9b5df482d38271474527fe88ee15917c55151fef3","sha256:a8cf2c92bbab7c6e2d79771130604e27771a1c8544fdebe6087381998b9bbe1a"],"state_sha256":"7673d98cd497cd0add743ea886608df74c9c6207a1efd34af3683fa05db58e0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVwLRBgRTxhpwgzUtu3XIp/yz42ol5YiittCIvWdS81LvzwMfvugyfkdiBuyRATSBn5R3BpdRzUaXvYxCxsuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:38:17.000465Z","bundle_sha256":"6c4783029fe9ee336ba66c9ab1395a1662050ff28dea920a9fac098df8943157"}}