{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZACK35QA5JTHMUMX2XM7GMQUEY","short_pith_number":"pith:ZACK35QA","schema_version":"1.0","canonical_sha256":"c804adf600ea66765197d5d9f33214262c9a509cc3aa8bd9b91c1c9d6aefd8a3","source":{"kind":"arxiv","id":"1706.04115","version":1},"attestation_state":"computed","paper":{"title":"Zero-Shot Relation Extraction via Reading Comprehension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Eunsol Choi, Luke Zettlemoyer, Minjoon Seo, Omer Levy","submitted_at":"2017-06-13T15:17:42Z","abstract_excerpt":"We show that relation extraction can be reduced to answering simple reading comprehension questions, by associating one or more natural-language questions with each relation slot. This reduction has several advantages: we can (1) learn relation-extraction models by extending recent neural reading-comprehension techniques, (2) build very large training sets for those models by combining relation-specific crowd-sourced questions with distant supervision, and even (3) do zero-shot learning by extracting new relation types that are only specified at test-time, for which we have no labeled training"},"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":"1706.04115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-13T15:17:42Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dc8869333c3de9168edbb6471d17ba9ff0d20409af8008cec58a2956b2e1e9f1","abstract_canon_sha256":"c2da25491e327a38622909eea0fd4829767cd5142e318eba61d52582fa2f6fa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:24.470206Z","signature_b64":"zoakfDMubo2a/mDLIVTGbNEcJdgXsoVlPn61szVB3wKUj76sEmemBxlMWZr+NC/2KxsOY6e9l5plHiKQACtGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c804adf600ea66765197d5d9f33214262c9a509cc3aa8bd9b91c1c9d6aefd8a3","last_reissued_at":"2026-05-18T00:42:24.469762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:24.469762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-Shot Relation Extraction via Reading Comprehension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Eunsol Choi, Luke Zettlemoyer, Minjoon Seo, Omer Levy","submitted_at":"2017-06-13T15:17:42Z","abstract_excerpt":"We show that relation extraction can be reduced to answering simple reading comprehension questions, by associating one or more natural-language questions with each relation slot. This reduction has several advantages: we can (1) learn relation-extraction models by extending recent neural reading-comprehension techniques, (2) build very large training sets for those models by combining relation-specific crowd-sourced questions with distant supervision, and even (3) do zero-shot learning by extracting new relation types that are only specified at test-time, for which we have no labeled training"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04115","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":"1706.04115","created_at":"2026-05-18T00:42:24.469826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04115v1","created_at":"2026-05-18T00:42:24.469826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04115","created_at":"2026-05-18T00:42:24.469826+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZACK35QA5JTH","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZACK35QA5JTHMUMX","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZACK35QA","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"1907.00708","citing_title":"EQuANt (Enhanced Question Answer Network)","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"1907.01686","citing_title":"Machine Reading Comprehension: a Literature Review","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2312.10997","citing_title":"Retrieval-Augmented Generation for Large Language Models: A Survey","ref_index":142,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18879","citing_title":"ZeroUnlearn: Few-Shot Knowledge Unlearning in Large Language Models","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18879","citing_title":"ZeroUnlearn: Few-Shot Knowledge Unlearning in Large Language Models","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08143","citing_title":"HoReN: Normalized Hopfield Retrieval for Large-Scale Sequential Model Editing","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19089","citing_title":"Towards Scalable Lifelong Knowledge Editing with Selective Knowledge Suppression","ref_index":115,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY","json":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY.json","graph_json":"https://pith.science/api/pith-number/ZACK35QA5JTHMUMX2XM7GMQUEY/graph.json","events_json":"https://pith.science/api/pith-number/ZACK35QA5JTHMUMX2XM7GMQUEY/events.json","paper":"https://pith.science/paper/ZACK35QA"},"agent_actions":{"view_html":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY","download_json":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY.json","view_paper":"https://pith.science/paper/ZACK35QA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04115&json=true","fetch_graph":"https://pith.science/api/pith-number/ZACK35QA5JTHMUMX2XM7GMQUEY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZACK35QA5JTHMUMX2XM7GMQUEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY/action/storage_attestation","attest_author":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY/action/author_attestation","sign_citation":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY/action/citation_signature","submit_replication":"https://pith.science/pith/ZACK35QA5JTHMUMX2XM7GMQUEY/action/replication_record"}},"created_at":"2026-05-18T00:42:24.469826+00:00","updated_at":"2026-05-18T00:42:24.469826+00:00"}