{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U5C2QETCWSMU4YRHLNI7S4SX2D","short_pith_number":"pith:U5C2QETC","canonical_record":{"source":{"id":"1809.03664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-11T03:03:37Z","cross_cats_sorted":[],"title_canon_sha256":"f94ba7c5470069cacf8bf3417603652073671c009f8736b70c7b2feceda73775","abstract_canon_sha256":"e88267c32d184244310fb7a4f68076f589b2b3b6bf0b1143b4b0e1105d530da1"},"schema_version":"1.0"},"canonical_sha256":"a745a81262b4994e62275b51f97257d0de4e206aeeaead9cb00181cdb07c7920","source":{"kind":"arxiv","id":"1809.03664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03664","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03664v1","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03664","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"U5C2QETCWSMU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U5C2QETCWSMU4YRH","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U5C2QETC","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U5C2QETCWSMU4YRHLNI7S4SX2D","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-11T03:03:37Z","cross_cats_sorted":[],"title_canon_sha256":"f94ba7c5470069cacf8bf3417603652073671c009f8736b70c7b2feceda73775","abstract_canon_sha256":"e88267c32d184244310fb7a4f68076f589b2b3b6bf0b1143b4b0e1105d530da1"},"schema_version":"1.0"},"canonical_sha256":"a745a81262b4994e62275b51f97257d0de4e206aeeaead9cb00181cdb07c7920","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:00.159595Z","signature_b64":"BtI2nLuBpmaDSOZzzBVvfeuD89NgyOR6b2Lw4IfqhUqYo3Ittj8u8GBUs09JbMyWY5s1f/9hFrJGlBhX0731CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a745a81262b4994e62275b51f97257d0de4e206aeeaead9cb00181cdb07c7920","last_reissued_at":"2026-05-18T00:06:00.158996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:00.158996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03664","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-18T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcTGCIyM+1vpEEDdYPR3zEwJMsfeVRK+qdB/aeHh6Fun688oF6FB8MqhbkaohnKK7/MxCaLUYIFk7s3UcAMoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:37:44.014235Z"},"content_sha256":"c11cfe91923f7b08768699144dd5cf6bc60421697a93c624a9dd041a0085de41","schema_version":"1.0","event_id":"sha256:c11cfe91923f7b08768699144dd5cf6bc60421697a93c624a9dd041a0085de41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U5C2QETCWSMU4YRHLNI7S4SX2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topic Memory Networks for Short Text Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cuiyun Gao, Irwin King, Jichuan Zeng, Jing Li, Michael R. Lyu, Yan Song","submitted_at":"2018-09-11T03:03:37Z","abstract_excerpt":"Many classification models work poorly on short texts due to data sparsity. To address this issue, we propose topic memory networks for short text classification with a novel topic memory mechanism to encode latent topic representations indicative of class labels. Different from most prior work that focuses on extending features with external knowledge or pre-trained topics, our model jointly explores topic inference and text classification with memory networks in an end-to-end manner. Experimental results on four benchmark datasets show that our model outperforms state-of-the-art models on sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03664","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-18T00:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlnladRDsWHjbhfNlVzpqN71QxJ9ETduUF6lUr63k5egtvEJCAabhgTGZwY8L5b77gjjXoioBdVdy7/qUWInBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:37:44.014899Z"},"content_sha256":"890bf0afdcc6400dd9150503ef1a0890442cc8c45920758ef2a40eb0980589f3","schema_version":"1.0","event_id":"sha256:890bf0afdcc6400dd9150503ef1a0890442cc8c45920758ef2a40eb0980589f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5C2QETCWSMU4YRHLNI7S4SX2D/bundle.json","state_url":"https://pith.science/pith/U5C2QETCWSMU4YRHLNI7S4SX2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5C2QETCWSMU4YRHLNI7S4SX2D/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-05-25T03:37:44Z","links":{"resolver":"https://pith.science/pith/U5C2QETCWSMU4YRHLNI7S4SX2D","bundle":"https://pith.science/pith/U5C2QETCWSMU4YRHLNI7S4SX2D/bundle.json","state":"https://pith.science/pith/U5C2QETCWSMU4YRHLNI7S4SX2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5C2QETCWSMU4YRHLNI7S4SX2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U5C2QETCWSMU4YRHLNI7S4SX2D","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":"e88267c32d184244310fb7a4f68076f589b2b3b6bf0b1143b4b0e1105d530da1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-11T03:03:37Z","title_canon_sha256":"f94ba7c5470069cacf8bf3417603652073671c009f8736b70c7b2feceda73775"},"schema_version":"1.0","source":{"id":"1809.03664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03664","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03664v1","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03664","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"U5C2QETCWSMU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U5C2QETCWSMU4YRH","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U5C2QETC","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:890bf0afdcc6400dd9150503ef1a0890442cc8c45920758ef2a40eb0980589f3","target":"graph","created_at":"2026-05-18T00:06:00Z","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":"Many classification models work poorly on short texts due to data sparsity. To address this issue, we propose topic memory networks for short text classification with a novel topic memory mechanism to encode latent topic representations indicative of class labels. Different from most prior work that focuses on extending features with external knowledge or pre-trained topics, our model jointly explores topic inference and text classification with memory networks in an end-to-end manner. Experimental results on four benchmark datasets show that our model outperforms state-of-the-art models on sh","authors_text":"Cuiyun Gao, Irwin King, Jichuan Zeng, Jing Li, Michael R. Lyu, Yan Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-11T03:03:37Z","title":"Topic Memory Networks for Short Text Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03664","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:c11cfe91923f7b08768699144dd5cf6bc60421697a93c624a9dd041a0085de41","target":"record","created_at":"2026-05-18T00:06:00Z","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":"e88267c32d184244310fb7a4f68076f589b2b3b6bf0b1143b4b0e1105d530da1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-11T03:03:37Z","title_canon_sha256":"f94ba7c5470069cacf8bf3417603652073671c009f8736b70c7b2feceda73775"},"schema_version":"1.0","source":{"id":"1809.03664","kind":"arxiv","version":1}},"canonical_sha256":"a745a81262b4994e62275b51f97257d0de4e206aeeaead9cb00181cdb07c7920","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a745a81262b4994e62275b51f97257d0de4e206aeeaead9cb00181cdb07c7920","first_computed_at":"2026-05-18T00:06:00.158996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:00.158996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtI2nLuBpmaDSOZzzBVvfeuD89NgyOR6b2Lw4IfqhUqYo3Ittj8u8GBUs09JbMyWY5s1f/9hFrJGlBhX0731CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:00.159595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c11cfe91923f7b08768699144dd5cf6bc60421697a93c624a9dd041a0085de41","sha256:890bf0afdcc6400dd9150503ef1a0890442cc8c45920758ef2a40eb0980589f3"],"state_sha256":"7e3aae1e824e7ce64b9239faadcb346b90d6da0a968c0b1d34bd4a92b7a08c71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEoE9+Dn9+qSodcBQffHWVoeP9y2NZG8Bm/p5lWo+7swYSl5AoTAJmD+6+QHsKQsU9/m+vYPEOJqVz4ZhFFmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:37:44.018054Z","bundle_sha256":"3dad29dfd6fad96493f2ed4e3a3686849b63e4997fd3c556211a261b81ee2b15"}}