{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MNZ4SWHIGEWKFDONZFO46IEYBQ","short_pith_number":"pith:MNZ4SWHI","schema_version":"1.0","canonical_sha256":"6373c958e8312ca28dcdc95dcf20980c175edd53420ab2d79ad02154d1116765","source":{"kind":"arxiv","id":"1911.03868","version":2},"attestation_state":"computed","paper":{"title":"Knowledge Guided Text Retrieval and Reading for Open Domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Danqi Chen, Hannaneh Hajishirzi, Luke Zettlemoyer, Sewon Min","submitted_at":"2019-11-10T06:58:44Z","abstract_excerpt":"We introduce an approach for open-domain question answering (QA) that retrieves and reads a passage graph, where vertices are passages of text and edges represent relationships that are derived from an external knowledge base or co-occurrence in the same article. Our goals are to boost coverage by using knowledge-guided retrieval to find more relevant passages than text-matching methods, and to improve accuracy by allowing for better knowledge-guided fusion of information across related passages. Our graph retrieval method expands a set of seed keyword-retrieved passages by traversing the grap"},"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":"1911.03868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-11-10T06:58:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"66d6ad4fb7d42485a1dcf41ad37da87b0d95454a2fcd9fecf80e039026b1a353","abstract_canon_sha256":"ef83a0fa55153e04c4d95a040ca65e217b8a41717e3122e2b9272ddae31ef59f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:31.237604Z","signature_b64":"d+BbvQdWzi5fE24243ORHIjxz64+VnBBRAU+S+MOgZotyMS74e6x0Dzj6ZOVSsqI5rseTQrTSJ0G5WfzuKpoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6373c958e8312ca28dcdc95dcf20980c175edd53420ab2d79ad02154d1116765","last_reissued_at":"2026-07-05T00:54:31.237116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:31.237116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge Guided Text Retrieval and Reading for Open Domain Question Answering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Danqi Chen, Hannaneh Hajishirzi, Luke Zettlemoyer, Sewon Min","submitted_at":"2019-11-10T06:58:44Z","abstract_excerpt":"We introduce an approach for open-domain question answering (QA) that retrieves and reads a passage graph, where vertices are passages of text and edges represent relationships that are derived from an external knowledge base or co-occurrence in the same article. Our goals are to boost coverage by using knowledge-guided retrieval to find more relevant passages than text-matching methods, and to improve accuracy by allowing for better knowledge-guided fusion of information across related passages. Our graph retrieval method expands a set of seed keyword-retrieved passages by traversing the grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03868","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/1911.03868/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":"1911.03868","created_at":"2026-07-05T00:54:31.237175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.03868v2","created_at":"2026-07-05T00:54:31.237175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03868","created_at":"2026-07-05T00:54:31.237175+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNZ4SWHIGEWK","created_at":"2026-07-05T00:54:31.237175+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNZ4SWHIGEWKFDON","created_at":"2026-07-05T00:54:31.237175+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNZ4SWHI","created_at":"2026-07-05T00:54:31.237175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24734","citing_title":"Task Decomposition for Efficient Annotation","ref_index":149,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":297,"is_internal_anchor":false},{"citing_arxiv_id":"2208.03299","citing_title":"Atlas: Few-shot Learning with Retrieval Augmented Language Models","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2004.04906","citing_title":"Dense Passage Retrieval for Open-Domain Question Answering","ref_index":93,"is_internal_anchor":false},{"citing_arxiv_id":"2002.08910","citing_title":"How Much Knowledge Can You Pack Into the Parameters of a Language Model?","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2112.09118","citing_title":"Unsupervised Dense Information Retrieval with Contrastive Learning","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":87,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ","json":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ.json","graph_json":"https://pith.science/api/pith-number/MNZ4SWHIGEWKFDONZFO46IEYBQ/graph.json","events_json":"https://pith.science/api/pith-number/MNZ4SWHIGEWKFDONZFO46IEYBQ/events.json","paper":"https://pith.science/paper/MNZ4SWHI"},"agent_actions":{"view_html":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ","download_json":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ.json","view_paper":"https://pith.science/paper/MNZ4SWHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.03868&json=true","fetch_graph":"https://pith.science/api/pith-number/MNZ4SWHIGEWKFDONZFO46IEYBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MNZ4SWHIGEWKFDONZFO46IEYBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ/action/storage_attestation","attest_author":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ/action/author_attestation","sign_citation":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ/action/citation_signature","submit_replication":"https://pith.science/pith/MNZ4SWHIGEWKFDONZFO46IEYBQ/action/replication_record"}},"created_at":"2026-07-05T00:54:31.237175+00:00","updated_at":"2026-07-05T00:54:31.237175+00:00"}