{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6CJC73BUGBA4Y6JNWDBYJRV5T4","short_pith_number":"pith:6CJC73BU","schema_version":"1.0","canonical_sha256":"f0922fec343041cc792db0c384c6bd9f1181ba30706addd14a582aca3f409e92","source":{"kind":"arxiv","id":"2401.06853","version":6},"attestation_state":"computed","paper":{"title":"Large Language Models Can Learn Temporal Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ali Payani, Faramarz Fekri, Ramana Kompella, Siheng Xiong","submitted_at":"2024-01-12T19:00:26Z","abstract_excerpt":"While large language models (LLMs) have demonstrated remarkable reasoning capabilities, they are not without their flaws and inaccuracies. Recent studies have introduced various methods to mitigate these limitations. Temporal reasoning (TR), in particular, presents a significant challenge for LLMs due to its reliance on diverse temporal concepts and intricate temporal logic. In this paper, we propose TG-LLM, a novel framework towards language-based TR. Instead of reasoning over the original context, we adopt a latent representation, temporal graph (TG) that enhances the learning of TR. A synth"},"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":"2401.06853","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-01-12T19:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"9eff71ac340d36ac4bcbdc9ef0d64c3c687a10b6c864a225b50840420098a98f","abstract_canon_sha256":"72606638b8da27e3a059035be2f9663264d978224bda0d70d51ca327b7c47a24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:36.585213Z","signature_b64":"fE/P2i3ENyTH8c5/0vOrydiIguTo9ahgJWJitIWR8MKgFIKYClaQty82B3rpSbq0obf3QHIhx2P1tN2VkB26Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0922fec343041cc792db0c384c6bd9f1181ba30706addd14a582aca3f409e92","last_reissued_at":"2026-07-05T09:17:36.584697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:36.584697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Language Models Can Learn Temporal Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ali Payani, Faramarz Fekri, Ramana Kompella, Siheng Xiong","submitted_at":"2024-01-12T19:00:26Z","abstract_excerpt":"While large language models (LLMs) have demonstrated remarkable reasoning capabilities, they are not without their flaws and inaccuracies. Recent studies have introduced various methods to mitigate these limitations. Temporal reasoning (TR), in particular, presents a significant challenge for LLMs due to its reliance on diverse temporal concepts and intricate temporal logic. In this paper, we propose TG-LLM, a novel framework towards language-based TR. Instead of reasoning over the original context, we adopt a latent representation, temporal graph (TG) that enhances the learning of TR. A synth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06853","kind":"arxiv","version":6},"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/2401.06853/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":"2401.06853","created_at":"2026-07-05T09:17:36.584749+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.06853v6","created_at":"2026-07-05T09:17:36.584749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06853","created_at":"2026-07-05T09:17:36.584749+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CJC73BUGBA4","created_at":"2026-07-05T09:17:36.584749+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CJC73BUGBA4Y6JN","created_at":"2026-07-05T09:17:36.584749+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CJC73BU","created_at":"2026-07-05T09:17:36.584749+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11470","citing_title":"The Periodic Table of LLM Reasoning: A Structured Survey of Reasoning Paradigms, Methods, and Failure Modes","ref_index":273,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27066","citing_title":"Large Language Model-Powered Query-Driven Event Timeline Summarization in Industrial Search","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13052","citing_title":"RAG-Enhanced Large Language Models for Dynamic Content Expiration Prediction in Web Search","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24175","citing_title":"AdapTime: Enabling Adaptive Temporal Reasoning in Large Language Models","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4","json":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4.json","graph_json":"https://pith.science/api/pith-number/6CJC73BUGBA4Y6JNWDBYJRV5T4/graph.json","events_json":"https://pith.science/api/pith-number/6CJC73BUGBA4Y6JNWDBYJRV5T4/events.json","paper":"https://pith.science/paper/6CJC73BU"},"agent_actions":{"view_html":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4","download_json":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4.json","view_paper":"https://pith.science/paper/6CJC73BU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.06853&json=true","fetch_graph":"https://pith.science/api/pith-number/6CJC73BUGBA4Y6JNWDBYJRV5T4/graph.json","fetch_events":"https://pith.science/api/pith-number/6CJC73BUGBA4Y6JNWDBYJRV5T4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4/action/storage_attestation","attest_author":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4/action/author_attestation","sign_citation":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4/action/citation_signature","submit_replication":"https://pith.science/pith/6CJC73BUGBA4Y6JNWDBYJRV5T4/action/replication_record"}},"created_at":"2026-07-05T09:17:36.584749+00:00","updated_at":"2026-07-05T09:17:36.584749+00:00"}