{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RMFBT6KBBKWXQ2JXF6THVG3V7K","short_pith_number":"pith:RMFBT6KB","schema_version":"1.0","canonical_sha256":"8b0a19f9410aad7869372fa67a9b75fabe3998ef088e822dabb03137245ef86f","source":{"kind":"arxiv","id":"2104.06378","version":5},"attestation_state":"computed","paper":{"title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Antoine Bosselut, Hongyu Ren, Jure Leskovec, Michihiro Yasunaga, Percy Liang","submitted_at":"2021-04-13T17:32:51Z","abstract_excerpt":"The problem of answering questions using knowledge from pre-trained language models (LMs) and knowledge graphs (KGs) presents two challenges: given a QA context (question and answer choice), methods need to (i) identify relevant knowledge from large KGs, and (ii) perform joint reasoning over the QA context and KG. In this work, we propose a new model, QA-GNN, which addresses the above challenges through two key innovations: (i) relevance scoring, where we use LMs to estimate the importance of KG nodes relative to the given QA context, and (ii) joint reasoning, where we connect the QA context a"},"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":"2104.06378","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-13T17:32:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f2c7799c02967e459a9b87ab94eaa9b902aa159001ecf29174063d7685bbb0f8","abstract_canon_sha256":"ae169d89ef9f9e2718e82b4ac41778b8da6b56280d3ee805c4f9495e9f6152ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:24:24.267741Z","signature_b64":"x38T3YIVc6KfYUyt3CGv5Lr4DozZLGXtM4SpxdlkFV6+cEqwVAyABuSpTqZENo6LBhqqYuBdiWxSmMXucLuSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b0a19f9410aad7869372fa67a9b75fabe3998ef088e822dabb03137245ef86f","last_reissued_at":"2026-07-05T05:24:24.267392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:24:24.267392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Antoine Bosselut, Hongyu Ren, Jure Leskovec, Michihiro Yasunaga, Percy Liang","submitted_at":"2021-04-13T17:32:51Z","abstract_excerpt":"The problem of answering questions using knowledge from pre-trained language models (LMs) and knowledge graphs (KGs) presents two challenges: given a QA context (question and answer choice), methods need to (i) identify relevant knowledge from large KGs, and (ii) perform joint reasoning over the QA context and KG. In this work, we propose a new model, QA-GNN, which addresses the above challenges through two key innovations: (i) relevance scoring, where we use LMs to estimate the importance of KG nodes relative to the given QA context, and (ii) joint reasoning, where we connect the QA context a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.06378","kind":"arxiv","version":5},"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/2104.06378/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":"2104.06378","created_at":"2026-07-05T05:24:24.267453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.06378v5","created_at":"2026-07-05T05:24:24.267453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.06378","created_at":"2026-07-05T05:24:24.267453+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMFBT6KBBKWX","created_at":"2026-07-05T05:24:24.267453+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMFBT6KBBKWXQ2JX","created_at":"2026-07-05T05:24:24.267453+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMFBT6KB","created_at":"2026-07-05T05:24:24.267453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.17549","citing_title":"Query-Aware Learnable Graph Pooling Tokens as Prompt for Large Language Models","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2510.11541","citing_title":"Question-Adaptive Graph Learning for Multi-hop Retrieval Augmented Generation","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18344","citing_title":"One Pass for All: A Discrete Diffusion Model for Knowledge Graph Triple Set Prediction","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K","json":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K.json","graph_json":"https://pith.science/api/pith-number/RMFBT6KBBKWXQ2JXF6THVG3V7K/graph.json","events_json":"https://pith.science/api/pith-number/RMFBT6KBBKWXQ2JXF6THVG3V7K/events.json","paper":"https://pith.science/paper/RMFBT6KB"},"agent_actions":{"view_html":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K","download_json":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K.json","view_paper":"https://pith.science/paper/RMFBT6KB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.06378&json=true","fetch_graph":"https://pith.science/api/pith-number/RMFBT6KBBKWXQ2JXF6THVG3V7K/graph.json","fetch_events":"https://pith.science/api/pith-number/RMFBT6KBBKWXQ2JXF6THVG3V7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K/action/storage_attestation","attest_author":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K/action/author_attestation","sign_citation":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K/action/citation_signature","submit_replication":"https://pith.science/pith/RMFBT6KBBKWXQ2JXF6THVG3V7K/action/replication_record"}},"created_at":"2026-07-05T05:24:24.267453+00:00","updated_at":"2026-07-05T05:24:24.267453+00:00"}