{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F6JG4JIGDFYD463EAQ66463QJM","short_pith_number":"pith:F6JG4JIG","schema_version":"1.0","canonical_sha256":"2f926e250619703e7b64043dee7b704b0cd1117c66280a564b42873b17db040d","source":{"kind":"arxiv","id":"2603.02112","version":2},"attestation_state":"computed","paper":{"title":"Recursive Models for Long-Horizon Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Chenxiao Yang, Nathan Srebro, Zhiyuan Li","submitted_at":"2026-03-02T17:37:10Z","abstract_excerpt":"Modern language models reason within bounded context, an inherent constraint that poses a fundamental barrier to long-horizon reasoning. We identify recursion as a core principle for overcoming this barrier, and propose recursive models as a minimal realization, where the model can recursively invoke itself to solve subtasks in isolated contexts. We prove that any computable problem admits a recursive decomposition of reasoning in which each subtask requires only exponentially smaller active context than standard autoregressive models; this strictly surpasses any context management approach co"},"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":"2603.02112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-03-02T17:37:10Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"d82e87cabe9b23ed1c2b2daf906f5776d905bece7e5a383b324b255e946d4a33","abstract_canon_sha256":"8f9b9397fbbb6c66286f52c2cc7f80c5f3eec9109888484de33cd7518ef05d84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:18.169179Z","signature_b64":"rMWNHIulW5ohEfibNKsGQKI4hBQOShaTDlzdltWO7ZdZ3ZrsUX74kGlymbRY2+uAjelZPitsNukNl1Zkk61lDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f926e250619703e7b64043dee7b704b0cd1117c66280a564b42873b17db040d","last_reissued_at":"2026-07-03T01:17:18.168737Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:18.168737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Models for Long-Horizon Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Chenxiao Yang, Nathan Srebro, Zhiyuan Li","submitted_at":"2026-03-02T17:37:10Z","abstract_excerpt":"Modern language models reason within bounded context, an inherent constraint that poses a fundamental barrier to long-horizon reasoning. We identify recursion as a core principle for overcoming this barrier, and propose recursive models as a minimal realization, where the model can recursively invoke itself to solve subtasks in isolated contexts. We prove that any computable problem admits a recursive decomposition of reasoning in which each subtask requires only exponentially smaller active context than standard autoregressive models; this strictly surpasses any context management approach co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.02112","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/2603.02112/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":"2603.02112","created_at":"2026-07-03T01:17:18.168793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.02112v2","created_at":"2026-07-03T01:17:18.168793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.02112","created_at":"2026-07-03T01:17:18.168793+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6JG4JIGDFYD","created_at":"2026-07-03T01:17:18.168793+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6JG4JIGDFYD463E","created_at":"2026-07-03T01:17:18.168793+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6JG4JIG","created_at":"2026-07-03T01:17:18.168793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.20531","citing_title":"Pseudo-Formalization for Automatic Proof Verification","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29278","citing_title":"The Complexity Ceiling Benchmark: A Multi-Domain Evaluation of Sequential Reasoning Under Depth Scaling","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20531","citing_title":"Pseudo-Formalization for Automatic Proof Verification","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM","json":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM.json","graph_json":"https://pith.science/api/pith-number/F6JG4JIGDFYD463EAQ66463QJM/graph.json","events_json":"https://pith.science/api/pith-number/F6JG4JIGDFYD463EAQ66463QJM/events.json","paper":"https://pith.science/paper/F6JG4JIG"},"agent_actions":{"view_html":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM","download_json":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM.json","view_paper":"https://pith.science/paper/F6JG4JIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.02112&json=true","fetch_graph":"https://pith.science/api/pith-number/F6JG4JIGDFYD463EAQ66463QJM/graph.json","fetch_events":"https://pith.science/api/pith-number/F6JG4JIGDFYD463EAQ66463QJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM/action/storage_attestation","attest_author":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM/action/author_attestation","sign_citation":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM/action/citation_signature","submit_replication":"https://pith.science/pith/F6JG4JIGDFYD463EAQ66463QJM/action/replication_record"}},"created_at":"2026-07-03T01:17:18.168793+00:00","updated_at":"2026-07-03T01:17:18.168793+00:00"}