{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UDPAEBZ6Y3PTLLUGYCUALIGYYG","short_pith_number":"pith:UDPAEBZ6","schema_version":"1.0","canonical_sha256":"a0de02073ec6df35ae86c0a805a0d8c18d2647ff5ff5589b8380af5410751377","source":{"kind":"arxiv","id":"1908.08326","version":8},"attestation_state":"computed","paper":{"title":"Revisiting Semantic Representation and Tree Search for Similar Question Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Huilin Gao, Tong Guo","submitted_at":"2019-08-22T11:44:12Z","abstract_excerpt":"This paper studies the performances of BERT combined with tree structure in short sentence ranking task. In retrieval-based question answering system, we retrieve the most similar question of the query question by ranking all the questions in datasets. If we want to rank all the sentences by neural rankers, we need to score all the sentence pairs. However it consumes large amount of time. So we design a specific tree for searching and combine deep model to solve this problem. We fine-tune BERT on the training data to get semantic vector or sentence embeddings on the test data. We use all the s"},"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":"1908.08326","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-22T11:44:12Z","cross_cats_sorted":[],"title_canon_sha256":"f9509f550ea82c4d344784dd50fc9c8583f8e26642660cc0b3d2e9a6b98e62fa","abstract_canon_sha256":"8a6d1e72d43f5af867c0b75f861976924c5f4e8399eef6df257ebe4aa07c30d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:40.005909Z","signature_b64":"UDOxMH91swFLtOBy7amOwo0Hbmq9VPtwl69U9jfZsEwSlw148OoPITyM8i0H56++ynwUyn+wUm5bfFFbfDhnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0de02073ec6df35ae86c0a805a0d8c18d2647ff5ff5589b8380af5410751377","last_reissued_at":"2026-07-05T00:02:40.005471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:40.005471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Semantic Representation and Tree Search for Similar Question Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Huilin Gao, Tong Guo","submitted_at":"2019-08-22T11:44:12Z","abstract_excerpt":"This paper studies the performances of BERT combined with tree structure in short sentence ranking task. In retrieval-based question answering system, we retrieve the most similar question of the query question by ranking all the questions in datasets. If we want to rank all the sentences by neural rankers, we need to score all the sentence pairs. However it consumes large amount of time. So we design a specific tree for searching and combine deep model to solve this problem. We fine-tune BERT on the training data to get semantic vector or sentence embeddings on the test data. We use all the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08326","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08326/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.08326","created_at":"2026-07-05T00:02:40.005546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08326v8","created_at":"2026-07-05T00:02:40.005546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08326","created_at":"2026-07-05T00:02:40.005546+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDPAEBZ6Y3PT","created_at":"2026-07-05T00:02:40.005546+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDPAEBZ6Y3PTLLUG","created_at":"2026-07-05T00:02:40.005546+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDPAEBZ6","created_at":"2026-07-05T00:02:40.005546+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/UDPAEBZ6Y3PTLLUGYCUALIGYYG","json":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG.json","graph_json":"https://pith.science/api/pith-number/UDPAEBZ6Y3PTLLUGYCUALIGYYG/graph.json","events_json":"https://pith.science/api/pith-number/UDPAEBZ6Y3PTLLUGYCUALIGYYG/events.json","paper":"https://pith.science/paper/UDPAEBZ6"},"agent_actions":{"view_html":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG","download_json":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG.json","view_paper":"https://pith.science/paper/UDPAEBZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08326&json=true","fetch_graph":"https://pith.science/api/pith-number/UDPAEBZ6Y3PTLLUGYCUALIGYYG/graph.json","fetch_events":"https://pith.science/api/pith-number/UDPAEBZ6Y3PTLLUGYCUALIGYYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG/action/storage_attestation","attest_author":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG/action/author_attestation","sign_citation":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG/action/citation_signature","submit_replication":"https://pith.science/pith/UDPAEBZ6Y3PTLLUGYCUALIGYYG/action/replication_record"}},"created_at":"2026-07-05T00:02:40.005546+00:00","updated_at":"2026-07-05T00:02:40.005546+00:00"}