{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:53FOKXZZSUJ3ZGMYC4IOVEVGZF","short_pith_number":"pith:53FOKXZZ","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"},"canonical_sha256":"eecae55f399513bc99981710ea92a6c951d32e98f7b08cc5ede3209a27d8229a","source":{"kind":"arxiv","id":"1710.03430","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03430","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03430v3","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03430","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"53FOKXZZSUJ3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"53FOKXZZSUJ3ZGMY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"53FOKXZZ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:53FOKXZZSUJ3ZGMYC4IOVEVGZF","target":"record","payload":{"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"},"canonical_sha256":"eecae55f399513bc99981710ea92a6c951d32e98f7b08cc5ede3209a27d8229a","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"},"source_kind":"arxiv","source_id":"1710.03430","source_version":3,"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:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZ9VJiT0dBvOsGPpXKjgqnFi8zFUH68TWCrkVvSZnLdP3XPi9QMsUfiA0Y6Obbgm8S+pzuhB12GSafUUYiYJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:05:03.701063Z"},"content_sha256":"3f080f04435e4834157fe8f406be77d48c4dfc04016a51fe05fe0add1a73ece5","schema_version":"1.0","event_id":"sha256:3f080f04435e4834157fe8f406be77d48c4dfc04016a51fe05fe0add1a73ece5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:53FOKXZZSUJ3ZGMYC4IOVEVGZF","target":"graph","payload":{"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"},"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:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cu7YS63uBFcLYS4v4fO4l0zKaAiWPWJAarDFA0nKzUQv1I5yHipgU77vnN+4wLhiyiRG0iH4vl+zZICVeaDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:05:03.701499Z"},"content_sha256":"13aa84d5e6548b23a270923e8e48bac0fa2a3a90ded7bc9c7a61a05c764a5521","schema_version":"1.0","event_id":"sha256:13aa84d5e6548b23a270923e8e48bac0fa2a3a90ded7bc9c7a61a05c764a5521"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/bundle.json","state_url":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/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-08-15T07:05:03Z","links":{"resolver":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF","bundle":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/bundle.json","state":"https://pith.science/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53FOKXZZSUJ3ZGMYC4IOVEVGZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:53FOKXZZSUJ3ZGMYC4IOVEVGZF","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":"edfa030b70447ba01936126a01928d10a3db85682932f7324b13465639a1f105","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-10-10T07:26:50Z","title_canon_sha256":"8efb6efd89b6d2bf6d55ae71350f5d47c7ca5fba3aa4cae3bc815159fd1a23b1"},"schema_version":"1.0","source":{"id":"1710.03430","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03430","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03430v3","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03430","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"53FOKXZZSUJ3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"53FOKXZZSUJ3ZGMY","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"53FOKXZZ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:13aa84d5e6548b23a270923e8e48bac0fa2a3a90ded7bc9c7a61a05c764a5521","target":"graph","created_at":"2026-05-18T00:19:03Z","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":"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","authors_text":"Joongbo Shin, Kyomin Jung, Seunghyun Yoon","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-10-10T07:26:50Z","title":"Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03430","kind":"arxiv","version":3},"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:3f080f04435e4834157fe8f406be77d48c4dfc04016a51fe05fe0add1a73ece5","target":"record","created_at":"2026-05-18T00:19:03Z","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":"edfa030b70447ba01936126a01928d10a3db85682932f7324b13465639a1f105","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-10-10T07:26:50Z","title_canon_sha256":"8efb6efd89b6d2bf6d55ae71350f5d47c7ca5fba3aa4cae3bc815159fd1a23b1"},"schema_version":"1.0","source":{"id":"1710.03430","kind":"arxiv","version":3}},"canonical_sha256":"eecae55f399513bc99981710ea92a6c951d32e98f7b08cc5ede3209a27d8229a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eecae55f399513bc99981710ea92a6c951d32e98f7b08cc5ede3209a27d8229a","first_computed_at":"2026-05-18T00:19:03.343984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:03.343984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2n5CfBXm7kcfIV+Ez7jXA9WjpwsqXG80ASeOuN0MfQHd37qqhGfBB5jzZD9rlRr9uz/5kh05Za6IsVJB0E27Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:03.344744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03430","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f080f04435e4834157fe8f406be77d48c4dfc04016a51fe05fe0add1a73ece5","sha256:13aa84d5e6548b23a270923e8e48bac0fa2a3a90ded7bc9c7a61a05c764a5521"],"state_sha256":"2bbfa3d85b6e2fec60b0a6795cf620b5632d9c3cdca76a3ac53dac2c2e4be936"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gv6h4F2GjEMGl51/IYswMozZYQ/eXbCCqJC+BL1Y1mfDyn4l0pqs8uP/SVF14s14UU2XTDUvXFAtrL+p9FXtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T07:05:03.704616Z","bundle_sha256":"8740dc06f6e37f172ad6596357ec4d66e0f36140d075cdcbb91ba03c10343ae3"}}