{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:A6CFFZLYYADO3DQQ5T7YMWYYRI","short_pith_number":"pith:A6CFFZLY","schema_version":"1.0","canonical_sha256":"078452e578c006ed8e10ecff865b188a0f6fc626bdaade1ab2c2456911a0dc43","source":{"kind":"arxiv","id":"2109.08935","version":1},"attestation_state":"computed","paper":{"title":"Complex Temporal Question Answering on Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Gerhard Weikum, Rishiraj Saha Roy, Soumajit Pramanik, Zhen Jia","submitted_at":"2021-09-18T13:41:43Z","abstract_excerpt":"Question answering over knowledge graphs (KG-QA) is a vital topic in IR. Questions with temporal intent are a special class of practical importance, but have not received much attention in research. This work presents EXAQT, the first end-to-end system for answering complex temporal questions that have multiple entities and predicates, and associated temporal conditions. EXAQT answers natural language questions over KGs in two stages, one geared towards high recall, the other towards precision at top ranks. The first step computes question-relevant compact subgraphs within the KG, and judiciou"},"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":"2109.08935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-09-18T13:41:43Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"1579daa8f6f7344fd3b7e96085cc20fdfdfb540f9a43032d5cac6f42bc5f6b4a","abstract_canon_sha256":"ef0fc989f14b9706f4fc82b793925202fb9ad17130cee990a6779b8d4600056a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:39.812160Z","signature_b64":"ocBm4vvyuvgNOaRPa6MaX6n5LskfLMaVmA4pYf6sgYWl/bpiAzNXOYiRfmwMs8RF9v3aPZoNOPTgsM2x519ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"078452e578c006ed8e10ecff865b188a0f6fc626bdaade1ab2c2456911a0dc43","last_reissued_at":"2026-07-05T03:15:39.811795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:39.811795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complex Temporal Question Answering on Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Gerhard Weikum, Rishiraj Saha Roy, Soumajit Pramanik, Zhen Jia","submitted_at":"2021-09-18T13:41:43Z","abstract_excerpt":"Question answering over knowledge graphs (KG-QA) is a vital topic in IR. Questions with temporal intent are a special class of practical importance, but have not received much attention in research. This work presents EXAQT, the first end-to-end system for answering complex temporal questions that have multiple entities and predicates, and associated temporal conditions. EXAQT answers natural language questions over KGs in two stages, one geared towards high recall, the other towards precision at top ranks. The first step computes question-relevant compact subgraphs within the KG, and judiciou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.08935","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.08935/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":"2109.08935","created_at":"2026-07-05T03:15:39.811850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.08935v1","created_at":"2026-07-05T03:15:39.811850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.08935","created_at":"2026-07-05T03:15:39.811850+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6CFFZLYYADO","created_at":"2026-07-05T03:15:39.811850+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6CFFZLYYADO3DQQ","created_at":"2026-07-05T03:15:39.811850+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6CFFZLY","created_at":"2026-07-05T03:15:39.811850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.01325","citing_title":"TRAVELER: A Benchmark for Evaluating Temporal Reasoning across Vague, Implicit and Explicit References","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI","json":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI.json","graph_json":"https://pith.science/api/pith-number/A6CFFZLYYADO3DQQ5T7YMWYYRI/graph.json","events_json":"https://pith.science/api/pith-number/A6CFFZLYYADO3DQQ5T7YMWYYRI/events.json","paper":"https://pith.science/paper/A6CFFZLY"},"agent_actions":{"view_html":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI","download_json":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI.json","view_paper":"https://pith.science/paper/A6CFFZLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.08935&json=true","fetch_graph":"https://pith.science/api/pith-number/A6CFFZLYYADO3DQQ5T7YMWYYRI/graph.json","fetch_events":"https://pith.science/api/pith-number/A6CFFZLYYADO3DQQ5T7YMWYYRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI/action/storage_attestation","attest_author":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI/action/author_attestation","sign_citation":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI/action/citation_signature","submit_replication":"https://pith.science/pith/A6CFFZLYYADO3DQQ5T7YMWYYRI/action/replication_record"}},"created_at":"2026-07-05T03:15:39.811850+00:00","updated_at":"2026-07-05T03:15:39.811850+00:00"}