{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DDPH67ZLMUI25IAZRYDALDITJN","short_pith_number":"pith:DDPH67ZL","schema_version":"1.0","canonical_sha256":"18de7f7f2b6511aea0198e06058d134b729ec7a39f0a9c9bbbec95f27816cb91","source":{"kind":"arxiv","id":"1808.07042","version":2},"attestation_state":"computed","paper":{"title":"CoQA: A Conversational Question Answering Challenge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Christopher D. Manning, Danqi Chen, Siva Reddy","submitted_at":"2018-08-21T17:52:02Z","abstract_excerpt":"Humans gather information by engaging in conversations involving a series of interconnected questions and answers. For machines to assist in information gathering, it is therefore essential to enable them to answer conversational questions. We introduce CoQA, a novel dataset for building Conversational Question Answering systems. Our dataset contains 127k questions with answers, obtained from 8k conversations about text passages from seven diverse domains. The questions are conversational, and the answers are free-form text with their corresponding evidence highlighted in the passage. We analy"},"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":"1808.07042","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-08-21T17:52:02Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"a0ec59a29932035658362c7f99924ab775d0f15e4bba183ff1e20ed5f671bb63","abstract_canon_sha256":"49938313be99c91647186bdb5f8c5f4b3ca239a99f7562b5ea24189f2e839309"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:52.606036Z","signature_b64":"zRvDddQQRN4T4ETsxIaLGXI1eNPxz7mHiV0rL0Mx/TDnW76wE1G8PH3KXTI8QK2XaB7VqDdojdbVV6iE47NUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18de7f7f2b6511aea0198e06058d134b729ec7a39f0a9c9bbbec95f27816cb91","last_reissued_at":"2026-05-17T23:49:52.605665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:52.605665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoQA: A Conversational Question Answering Challenge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Christopher D. Manning, Danqi Chen, Siva Reddy","submitted_at":"2018-08-21T17:52:02Z","abstract_excerpt":"Humans gather information by engaging in conversations involving a series of interconnected questions and answers. For machines to assist in information gathering, it is therefore essential to enable them to answer conversational questions. We introduce CoQA, a novel dataset for building Conversational Question Answering systems. Our dataset contains 127k questions with answers, obtained from 8k conversations about text passages from seven diverse domains. The questions are conversational, and the answers are free-form text with their corresponding evidence highlighted in the passage. We analy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07042","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":"1808.07042","created_at":"2026-05-17T23:49:52.605728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07042v2","created_at":"2026-05-17T23:49:52.605728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07042","created_at":"2026-05-17T23:49:52.605728+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDPH67ZLMUI2","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDPH67ZLMUI25IAZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDPH67ZL","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"1907.01686","citing_title":"Machine Reading Comprehension: a Literature Review","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05338","citing_title":"To Tune or Not To Tune? How About the Best of Both Worlds?","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06554","citing_title":"Asking Clarifying Questions in Open-Domain Information-Seeking Conversations","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2504.16155","citing_title":"PRIMETIME : Limits of LLMs in Temporal Primitives","ref_index":62,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14057","citing_title":"Dual Hierarchical Dialogue Policy Learning for Legal Inquisitive Conversational Agents","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"1909.01066","citing_title":"Language Models as Knowledge Bases?","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14057","citing_title":"Dual Hierarchical Dialogue Policy Learning for Legal Inquisitive Conversational Agents","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05953","citing_title":"Hallucination as an Anomaly: Dynamic Intervention via Probabilistic Circuits","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12946","citing_title":"Parcae: Scaling Laws For Stable Looped Language Models","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2204.02311","citing_title":"PaLM: Scaling Language Modeling with Pathways","ref_index":124,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN","json":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN.json","graph_json":"https://pith.science/api/pith-number/DDPH67ZLMUI25IAZRYDALDITJN/graph.json","events_json":"https://pith.science/api/pith-number/DDPH67ZLMUI25IAZRYDALDITJN/events.json","paper":"https://pith.science/paper/DDPH67ZL"},"agent_actions":{"view_html":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN","download_json":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN.json","view_paper":"https://pith.science/paper/DDPH67ZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07042&json=true","fetch_graph":"https://pith.science/api/pith-number/DDPH67ZLMUI25IAZRYDALDITJN/graph.json","fetch_events":"https://pith.science/api/pith-number/DDPH67ZLMUI25IAZRYDALDITJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN/action/storage_attestation","attest_author":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN/action/author_attestation","sign_citation":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN/action/citation_signature","submit_replication":"https://pith.science/pith/DDPH67ZLMUI25IAZRYDALDITJN/action/replication_record"}},"created_at":"2026-05-17T23:49:52.605728+00:00","updated_at":"2026-05-17T23:49:52.605728+00:00"}