{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:O7TMHDOCBJE52O7ZYNJ2QCCVKC","short_pith_number":"pith:O7TMHDOC","schema_version":"1.0","canonical_sha256":"77e6c38dc20a49dd3bf9c353a80855509123b52c21382a3a54980e56afffa6dc","source":{"kind":"arxiv","id":"2505.13508","version":2},"attestation_state":"computed","paper":{"title":"Time-R1: Towards Comprehensive Temporal Reasoning in LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Haofei Yu, Haoru Li, Jiaxuan You, Peixuan Han, Zijia Liu","submitted_at":"2025-05-16T13:46:28Z","abstract_excerpt":"Large Language Models (LLMs) demonstrate impressive capabilities but lack robust temporal intelligence, struggling to integrate reasoning about the past with predictions and plausible generations of the future. Meanwhile, existing methods typically target isolated temporal skills, such as question answering about past events or basic forecasting, and exhibit poor generalization, particularly when dealing with events beyond their knowledge cutoff or requiring creative foresight. To address these limitations, we introduce \\textit{Time-R1}, the first framework to endow a moderate-sized (3B-parame"},"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":"2505.13508","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-16T13:46:28Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9392871d0e1b79c6d36ba3c6487557e534b15499c2ab8e0c3b5070893077dddd","abstract_canon_sha256":"26ad89e96114c8e059e71230ead04e569fb550435a180fd61aece3e8e6b875bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:59.733530Z","signature_b64":"6z9bNh8PXv2bqdZ20Fu8yafVIhPW7ZcgMXMEcnWGv5b3a/1U3qDJek5FaVc6Si15AVOsBdF5jdF5hxr2zZXrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77e6c38dc20a49dd3bf9c353a80855509123b52c21382a3a54980e56afffa6dc","last_reissued_at":"2026-07-05T11:14:59.733037Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:59.733037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-R1: Towards Comprehensive Temporal Reasoning in LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Haofei Yu, Haoru Li, Jiaxuan You, Peixuan Han, Zijia Liu","submitted_at":"2025-05-16T13:46:28Z","abstract_excerpt":"Large Language Models (LLMs) demonstrate impressive capabilities but lack robust temporal intelligence, struggling to integrate reasoning about the past with predictions and plausible generations of the future. Meanwhile, existing methods typically target isolated temporal skills, such as question answering about past events or basic forecasting, and exhibit poor generalization, particularly when dealing with events beyond their knowledge cutoff or requiring creative foresight. To address these limitations, we introduce \\textit{Time-R1}, the first framework to endow a moderate-sized (3B-parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13508","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/2505.13508/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":"2505.13508","created_at":"2026-07-05T11:14:59.733094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13508v2","created_at":"2026-07-05T11:14:59.733094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13508","created_at":"2026-07-05T11:14:59.733094+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7TMHDOCBJE5","created_at":"2026-07-05T11:14:59.733094+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7TMHDOCBJE52O7Z","created_at":"2026-07-05T11:14:59.733094+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7TMHDOC","created_at":"2026-07-05T11:14:59.733094+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27066","citing_title":"Large Language Model-Powered Query-Driven Event Timeline Summarization in Industrial Search","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2509.05489","citing_title":"Self-Aligned Reward: Towards Effective and Efficient Reasoners","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03762","citing_title":"OracleProto: A Reproducible Framework for Benchmarking LLM Native Forecasting via Knowledge Cutoff and Temporal Masking","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23051","citing_title":"Evaluating Temporal Consistency in Multi-Turn Language Models","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18576","citing_title":"Agentic Forecasting using Sequential Bayesian Updating of Linguistic Beliefs","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC","json":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC.json","graph_json":"https://pith.science/api/pith-number/O7TMHDOCBJE52O7ZYNJ2QCCVKC/graph.json","events_json":"https://pith.science/api/pith-number/O7TMHDOCBJE52O7ZYNJ2QCCVKC/events.json","paper":"https://pith.science/paper/O7TMHDOC"},"agent_actions":{"view_html":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC","download_json":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC.json","view_paper":"https://pith.science/paper/O7TMHDOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13508&json=true","fetch_graph":"https://pith.science/api/pith-number/O7TMHDOCBJE52O7ZYNJ2QCCVKC/graph.json","fetch_events":"https://pith.science/api/pith-number/O7TMHDOCBJE52O7ZYNJ2QCCVKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC/action/storage_attestation","attest_author":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC/action/author_attestation","sign_citation":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC/action/citation_signature","submit_replication":"https://pith.science/pith/O7TMHDOCBJE52O7ZYNJ2QCCVKC/action/replication_record"}},"created_at":"2026-07-05T11:14:59.733094+00:00","updated_at":"2026-07-05T11:14:59.733094+00:00"}