{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KWUQG4OMKTEOW6UXD5EUHMHC5A","short_pith_number":"pith:KWUQG4OM","schema_version":"1.0","canonical_sha256":"55a90371cc54c8eb7a971f4943b0e2e83430b96663262009014f5be59922a1dc","source":{"kind":"arxiv","id":"1801.10314","version":2},"attestation_state":"computed","paper":{"title":"Complex Sequential Question Answering: Towards Learning to Converse Over Linked Question Answer Pairs with a Knowledge Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Amrita Saha, Karthik Sankaranarayanan, Mitesh M. Khapra, Sarath Chandar, Vardaan Pahuja","submitted_at":"2018-01-31T06:40:40Z","abstract_excerpt":"While conversing with chatbots, humans typically tend to ask many questions, a significant portion of which can be answered by referring to large-scale knowledge graphs (KG). While Question Answering (QA) and dialog systems have been studied independently, there is a need to study them closely to evaluate such real-world scenarios faced by bots involving both these tasks. Towards this end, we introduce the task of Complex Sequential QA which combines the two tasks of (i) answering factual questions through complex inferencing over a realistic-sized KG of millions of entities, and (ii) learning"},"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":"1801.10314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-01-31T06:40:40Z","cross_cats_sorted":[],"title_canon_sha256":"afd58d9d3a8b9089768b6a47f70a7b5de51ee62d50e73849ec38a70a24ba0c05","abstract_canon_sha256":"3d533bb199e5dda1dcc1699877d076fe2363153fc6fb36ffb60e12c6db81f1f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:08.000868Z","signature_b64":"D0S3YY8ZX0hoCQ1nkTIBxar0LgDIBE5Ox6ksq22wX1dyNnvIHKlZ45ZJsJ6oGHecIYusf0/GVZ0R48CsUS87Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a90371cc54c8eb7a971f4943b0e2e83430b96663262009014f5be59922a1dc","last_reissued_at":"2026-05-18T00:04:08.000104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:08.000104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complex Sequential Question Answering: Towards Learning to Converse Over Linked Question Answer Pairs with a Knowledge Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Amrita Saha, Karthik Sankaranarayanan, Mitesh M. Khapra, Sarath Chandar, Vardaan Pahuja","submitted_at":"2018-01-31T06:40:40Z","abstract_excerpt":"While conversing with chatbots, humans typically tend to ask many questions, a significant portion of which can be answered by referring to large-scale knowledge graphs (KG). While Question Answering (QA) and dialog systems have been studied independently, there is a need to study them closely to evaluate such real-world scenarios faced by bots involving both these tasks. Towards this end, we introduce the task of Complex Sequential QA which combines the two tasks of (i) answering factual questions through complex inferencing over a realistic-sized KG of millions of entities, and (ii) learning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10314","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":""},"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":"1801.10314","created_at":"2026-05-18T00:04:08.000231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10314v2","created_at":"2026-05-18T00:04:08.000231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10314","created_at":"2026-05-18T00:04:08.000231+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWUQG4OMKTEO","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWUQG4OMKTEOW6UX","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWUQG4OM","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.01066","citing_title":"Language Models as Knowledge Bases?","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A","json":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A.json","graph_json":"https://pith.science/api/pith-number/KWUQG4OMKTEOW6UXD5EUHMHC5A/graph.json","events_json":"https://pith.science/api/pith-number/KWUQG4OMKTEOW6UXD5EUHMHC5A/events.json","paper":"https://pith.science/paper/KWUQG4OM"},"agent_actions":{"view_html":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A","download_json":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A.json","view_paper":"https://pith.science/paper/KWUQG4OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10314&json=true","fetch_graph":"https://pith.science/api/pith-number/KWUQG4OMKTEOW6UXD5EUHMHC5A/graph.json","fetch_events":"https://pith.science/api/pith-number/KWUQG4OMKTEOW6UXD5EUHMHC5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A/action/storage_attestation","attest_author":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A/action/author_attestation","sign_citation":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A/action/citation_signature","submit_replication":"https://pith.science/pith/KWUQG4OMKTEOW6UXD5EUHMHC5A/action/replication_record"}},"created_at":"2026-05-18T00:04:08.000231+00:00","updated_at":"2026-05-18T00:04:08.000231+00:00"}