{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5HJPXPU26DLPTEQ3LI34JOMYPB","short_pith_number":"pith:5HJPXPU2","schema_version":"1.0","canonical_sha256":"e9d2fbbe9af0d6f9921b5a37c4b99878707f1e0a28097ed04a087028d18f78d2","source":{"kind":"arxiv","id":"1810.06638","version":1},"attestation_state":"computed","paper":{"title":"U-Net: Machine Reading Comprehension with Unanswerable Questions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Fu Sun, Linyang Li, Xipeng Qiu, Yang Liu","submitted_at":"2018-10-12T12:48:34Z","abstract_excerpt":"Machine reading comprehension with unanswerable questions is a new challenging task for natural language processing. A key subtask is to reliably predict whether the question is unanswerable. In this paper, we propose a unified model, called U-Net, with three important components: answer pointer, no-answer pointer, and answer verifier. We introduce a universal node and thus process the question and its context passage as a single contiguous sequence of tokens. The universal node encodes the fused information from both the question and passage, and plays an important role to predict whether the"},"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":"1810.06638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-12T12:48:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3133f7d6a275b582caebd4eb19a67e286805e949ccc6e496fdffb4aaaac5a60b","abstract_canon_sha256":"1ed815f39ac83cb3168c3c9eee1ef2a01b8406786b55f1a1bc96646f97f4429a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:12.124756Z","signature_b64":"9K7tZIEZ9gpBZ2H4YrshsNoJMqmi1b3PodePmwQRihKC2mfmnQ3qFByd+jOz7UnMHcXMIhMlTIjMQHSb0jWRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d2fbbe9af0d6f9921b5a37c4b99878707f1e0a28097ed04a087028d18f78d2","last_reissued_at":"2026-05-18T00:03:12.124187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:12.124187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"U-Net: Machine Reading Comprehension with Unanswerable Questions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Fu Sun, Linyang Li, Xipeng Qiu, Yang Liu","submitted_at":"2018-10-12T12:48:34Z","abstract_excerpt":"Machine reading comprehension with unanswerable questions is a new challenging task for natural language processing. A key subtask is to reliably predict whether the question is unanswerable. In this paper, we propose a unified model, called U-Net, with three important components: answer pointer, no-answer pointer, and answer verifier. We introduce a universal node and thus process the question and its context passage as a single contiguous sequence of tokens. The universal node encodes the fused information from both the question and passage, and plays an important role to predict whether the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06638","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.06638","created_at":"2026-05-18T00:03:12.124258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06638v1","created_at":"2026-05-18T00:03:12.124258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06638","created_at":"2026-05-18T00:03:12.124258+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HJPXPU26DLP","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HJPXPU26DLPTEQ3","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HJPXPU2","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00708","citing_title":"EQuANt (Enhanced Question Answer Network)","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB","json":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB.json","graph_json":"https://pith.science/api/pith-number/5HJPXPU26DLPTEQ3LI34JOMYPB/graph.json","events_json":"https://pith.science/api/pith-number/5HJPXPU26DLPTEQ3LI34JOMYPB/events.json","paper":"https://pith.science/paper/5HJPXPU2"},"agent_actions":{"view_html":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB","download_json":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB.json","view_paper":"https://pith.science/paper/5HJPXPU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06638&json=true","fetch_graph":"https://pith.science/api/pith-number/5HJPXPU26DLPTEQ3LI34JOMYPB/graph.json","fetch_events":"https://pith.science/api/pith-number/5HJPXPU26DLPTEQ3LI34JOMYPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB/action/storage_attestation","attest_author":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB/action/author_attestation","sign_citation":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB/action/citation_signature","submit_replication":"https://pith.science/pith/5HJPXPU26DLPTEQ3LI34JOMYPB/action/replication_record"}},"created_at":"2026-05-18T00:03:12.124258+00:00","updated_at":"2026-05-18T00:03:12.124258+00:00"}