{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GSHW2WEPKUTXZO7YWYVUUSWWF7","short_pith_number":"pith:GSHW2WEP","schema_version":"1.0","canonical_sha256":"348f6d588f55277cbbf8b62b4a4ad62fcb7022088c1fb20ff8120d4da5f0d0b1","source":{"kind":"arxiv","id":"1901.09381","version":2},"attestation_state":"computed","paper":{"title":"Dual Co-Matching Network for Multi-choice Reading Comprehension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hai Zhao, Shuailiang Zhang, Xiang Zhou, Xi Zhou, Yuwei Wu, Zhuosheng Zhang","submitted_at":"2019-01-27T14:15:37Z","abstract_excerpt":"Multi-choice reading comprehension is a challenging task that requires complex reasoning procedure. Given passage and question, a correct answer need to be selected from a set of candidate answers. In this paper, we propose \\textbf{D}ual \\textbf{C}o-\\textbf{M}atching \\textbf{N}etwork (\\textbf{DCMN}) which model the relationship among passage, question and answer bidirectionally. Different from existing approaches which only calculate question-aware or option-aware passage representation, we calculate passage-aware question representation and passage-aware answer representation at the same time"},"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":"1901.09381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-01-27T14:15:37Z","cross_cats_sorted":[],"title_canon_sha256":"4fde6ebc78bf787182717afc33d1509fd5dfb039b4c7dea2f0d2aa1f56548ffd","abstract_canon_sha256":"f46b413bf9d9325cc259b462c3400c60d1d2db7676de55a405c55ffb5715446f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:25.167948Z","signature_b64":"RWfrynrpmMp/zwHVgsGycoIfA0+/Qy9MdkXJnFGoxonFGloHFHTiZf+btqLwS1AsjtxaNP5HGYX+HB17R742Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"348f6d588f55277cbbf8b62b4a4ad62fcb7022088c1fb20ff8120d4da5f0d0b1","last_reissued_at":"2026-07-04T23:58:25.167406Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:25.167406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Co-Matching Network for Multi-choice Reading Comprehension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hai Zhao, Shuailiang Zhang, Xiang Zhou, Xi Zhou, Yuwei Wu, Zhuosheng Zhang","submitted_at":"2019-01-27T14:15:37Z","abstract_excerpt":"Multi-choice reading comprehension is a challenging task that requires complex reasoning procedure. Given passage and question, a correct answer need to be selected from a set of candidate answers. In this paper, we propose \\textbf{D}ual \\textbf{C}o-\\textbf{M}atching \\textbf{N}etwork (\\textbf{DCMN}) which model the relationship among passage, question and answer bidirectionally. Different from existing approaches which only calculate question-aware or option-aware passage representation, we calculate passage-aware question representation and passage-aware answer representation at the same time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09381","kind":"arxiv","version":2},"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/1901.09381/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":"1901.09381","created_at":"2026-07-04T23:58:25.167468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09381v2","created_at":"2026-07-04T23:58:25.167468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09381","created_at":"2026-07-04T23:58:25.167468+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSHW2WEPKUTX","created_at":"2026-07-04T23:58:25.167468+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSHW2WEPKUTXZO7Y","created_at":"2026-07-04T23:58:25.167468+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSHW2WEP","created_at":"2026-07-04T23:58:25.167468+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.08237","citing_title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7","json":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7.json","graph_json":"https://pith.science/api/pith-number/GSHW2WEPKUTXZO7YWYVUUSWWF7/graph.json","events_json":"https://pith.science/api/pith-number/GSHW2WEPKUTXZO7YWYVUUSWWF7/events.json","paper":"https://pith.science/paper/GSHW2WEP"},"agent_actions":{"view_html":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7","download_json":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7.json","view_paper":"https://pith.science/paper/GSHW2WEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09381&json=true","fetch_graph":"https://pith.science/api/pith-number/GSHW2WEPKUTXZO7YWYVUUSWWF7/graph.json","fetch_events":"https://pith.science/api/pith-number/GSHW2WEPKUTXZO7YWYVUUSWWF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7/action/storage_attestation","attest_author":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7/action/author_attestation","sign_citation":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7/action/citation_signature","submit_replication":"https://pith.science/pith/GSHW2WEPKUTXZO7YWYVUUSWWF7/action/replication_record"}},"created_at":"2026-07-04T23:58:25.167468+00:00","updated_at":"2026-07-04T23:58:25.167468+00:00"}