{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:53FOKXZZSUJ3ZGMYC4IOVEVGZF","short_pith_number":"pith:53FOKXZZ","schema_version":"1.0","canonical_sha256":"eecae55f399513bc99981710ea92a6c951d32e98f7b08cc5ede3209a27d8229a","source":{"kind":"arxiv","id":"1710.03430","version":3},"attestation_state":"computed","paper":{"title":"Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Joongbo Shin, Kyomin Jung, Seunghyun Yoon","submitted_at":"2017-10-10T07:26:50Z","abstract_excerpt":"In this paper, we propose a novel end-to-end neural architecture for ranking candidate answers, that adapts a hierarchical recurrent neural network and a latent topic clustering module. With our proposed model, a text is encoded to a vector representation from an word-level to a chunk-level to effectively capture the entire meaning. In particular, by adapting the hierarchical structure, our model shows very small performance degradations in longer text comprehension while other state-of-the-art recurrent neural network models suffer from it. Additionally, the latent topic clustering module ext"},"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":"1710.03430","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-10-10T07:26:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8efb6efd89b6d2bf6d55ae71350f5d47c7ca5fba3aa4cae3bc815159fd1a23b1","abstract_canon_sha256":"edfa030b70447ba01936126a01928d10a3db85682932f7324b13465639a1f105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:03.344744Z","signature_b64":"2n5CfBXm7kcfIV+Ez7jXA9WjpwsqXG80ASeOuN0MfQHd37qqhGfBB5jzZD9rlRr9uz/5kh05Za6IsVJB0E27Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eecae55f399513bc99981710ea92a6c951d32e98f7b08cc5ede3209a27d8229a","last_reissued_at":"2026-05-18T00:19:03.343984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:03.343984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Joongbo Shin, Kyomin Jung, Seunghyun Yoon","submitted_at":"2017-10-10T07:26:50Z","abstract_excerpt":"In this paper, we propose a novel end-to-end neural architecture for ranking candidate answers, that adapts a hierarchical recurrent neural network and a latent topic clustering module. With our proposed model, a text is encoded to a vector representation from an word-level to a chunk-level to effectively capture the entire meaning. In particular, by adapting the hierarchical structure, our model shows very small performance degradations in longer text comprehension while other state-of-the-art recurrent neural network models suffer from it. Additionally, the latent topic clustering module ext"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03430","kind":"arxiv","version":3},"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":"1710.03430","created_at":"2026-05-18T00:19:03.344110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03430v3","created_at":"2026-05-18T00:19:03.344110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03430","created_at":"2026-05-18T00:19:03.344110+00:00"},{"alias_kind":"pith_short_12","alias_value":"53FOKXZZSUJ3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"53FOKXZZSUJ3ZGMY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"53FOKXZZ","created_at":"2026-05-18T12:31:00.734936+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/53FOKXZZSUJ3ZGMYC4IOVEVGZF","json":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF.json","graph_json":"https://pith.science/api/pith-number/53FOKXZZSUJ3ZGMYC4IOVEVGZF/graph.json","events_json":"https://pith.science/api/pith-number/53FOKXZZSUJ3ZGMYC4IOVEVGZF/events.json","paper":"https://pith.science/paper/53FOKXZZ"},"agent_actions":{"view_html":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF","download_json":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF.json","view_paper":"https://pith.science/paper/53FOKXZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03430&json=true","fetch_graph":"https://pith.science/api/pith-number/53FOKXZZSUJ3ZGMYC4IOVEVGZF/graph.json","fetch_events":"https://pith.science/api/pith-number/53FOKXZZSUJ3ZGMYC4IOVEVGZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/action/storage_attestation","attest_author":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/action/author_attestation","sign_citation":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/action/citation_signature","submit_replication":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/action/replication_record"}},"created_at":"2026-05-18T00:19:03.344110+00:00","updated_at":"2026-05-18T00:19:03.344110+00:00"}