{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HKIADQGSPH6XTROREAA3GIMLXX","short_pith_number":"pith:HKIADQGS","schema_version":"1.0","canonical_sha256":"3a9001c0d279fd79c5d12001b3218bbdfecccaab87f80480c3401c3f875e5a9c","source":{"kind":"arxiv","id":"2311.09821","version":2},"attestation_state":"computed","paper":{"title":"Towards Robust Temporal Reasoning of Large Language Models via a Multi-Hop QA Dataset and Pseudo-Instruction Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hwee Tou Ng, Lidong Bing, Qingyu Tan","submitted_at":"2023-11-16T11:49:29Z","abstract_excerpt":"Knowledge in the real world is being updated constantly. However, it is costly to frequently update large language models (LLMs). Therefore, it is crucial for LLMs to understand the concept of temporal knowledge. However, prior works on temporal question answering (TQA) did not emphasize multi-answer and multi-hop types of temporal reasoning. In this paper, we propose a complex temporal question-answering dataset Complex-TR that focuses on multi-answer and multi-hop temporal reasoning. Besides, we also propose a novel data augmentation strategy to improve the complex temporal reasoning capabil"},"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":"2311.09821","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-11-16T11:49:29Z","cross_cats_sorted":[],"title_canon_sha256":"3bed8464fa65901023eb986f307b1c91f571276e0d4b36610b716d560b4e5aed","abstract_canon_sha256":"0695cc00fcea25cb3760c8ef82a4884c25ea5f98321df5568224b82103e8f35c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:07.668075Z","signature_b64":"c8QXj2wVe8MEv+P1WsEOgXS0qtkEcu45q2UDQtOnMSstEVdo/upKwwGvxccMjpQSLJJg8PVxGl7aK3IdMi2RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9001c0d279fd79c5d12001b3218bbdfecccaab87f80480c3401c3f875e5a9c","last_reissued_at":"2026-07-05T08:43:07.667614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:07.667614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Robust Temporal Reasoning of Large Language Models via a Multi-Hop QA Dataset and Pseudo-Instruction Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hwee Tou Ng, Lidong Bing, Qingyu Tan","submitted_at":"2023-11-16T11:49:29Z","abstract_excerpt":"Knowledge in the real world is being updated constantly. However, it is costly to frequently update large language models (LLMs). Therefore, it is crucial for LLMs to understand the concept of temporal knowledge. However, prior works on temporal question answering (TQA) did not emphasize multi-answer and multi-hop types of temporal reasoning. In this paper, we propose a complex temporal question-answering dataset Complex-TR that focuses on multi-answer and multi-hop temporal reasoning. Besides, we also propose a novel data augmentation strategy to improve the complex temporal reasoning capabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09821","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/2311.09821/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":"2311.09821","created_at":"2026-07-05T08:43:07.667679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09821v2","created_at":"2026-07-05T08:43:07.667679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09821","created_at":"2026-07-05T08:43:07.667679+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKIADQGSPH6X","created_at":"2026-07-05T08:43:07.667679+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKIADQGSPH6XTROR","created_at":"2026-07-05T08:43:07.667679+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKIADQGS","created_at":"2026-07-05T08:43:07.667679+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13396","citing_title":"DyG-RAG: Dynamic Graph Retrieval-Augmented Generation with Event-Centric Reasoning","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX","json":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX.json","graph_json":"https://pith.science/api/pith-number/HKIADQGSPH6XTROREAA3GIMLXX/graph.json","events_json":"https://pith.science/api/pith-number/HKIADQGSPH6XTROREAA3GIMLXX/events.json","paper":"https://pith.science/paper/HKIADQGS"},"agent_actions":{"view_html":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX","download_json":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX.json","view_paper":"https://pith.science/paper/HKIADQGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09821&json=true","fetch_graph":"https://pith.science/api/pith-number/HKIADQGSPH6XTROREAA3GIMLXX/graph.json","fetch_events":"https://pith.science/api/pith-number/HKIADQGSPH6XTROREAA3GIMLXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX/action/storage_attestation","attest_author":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX/action/author_attestation","sign_citation":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX/action/citation_signature","submit_replication":"https://pith.science/pith/HKIADQGSPH6XTROREAA3GIMLXX/action/replication_record"}},"created_at":"2026-07-05T08:43:07.667679+00:00","updated_at":"2026-07-05T08:43:07.667679+00:00"}