{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HTTRPCOZQ6VRSNQBBRABKPM247","short_pith_number":"pith:HTTRPCOZ","schema_version":"1.0","canonical_sha256":"3ce71789d987ab1936010c40153d9ae7f0a86b6a5f245dace34a954137eaaca1","source":{"kind":"arxiv","id":"2608.01534","version":1},"attestation_state":"computed","paper":{"title":"Recursive Vision Language Models for General Symbolic Reasoning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guillaume Lajoie, Hassan Rivaz, Omid Nejati Manzari","submitted_at":"2026-08-02T23:01:10Z","abstract_excerpt":"Hard symbolic-reasoning tasks such as Sudoku, maze pathfinding, and ARC remain challenging for LLMs due to their fixed-depth autoregressive reasoning, which limits systematic search, refinement, and backtracking. While recursive models such as Hierarchical Reasoning Model (HRM) and Tiny Recursive Model (TRM) address this limitation through iterative latent-state refinement, they are typically task-specific and do not leverage pretrained language priors. We propose R-Qwen, a recursive reasoning framework built upon a pretrained Qwen backbone. R-Qwen repeatedly refines a candidate solution throu"},"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":"2608.01534","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-08-02T23:01:10Z","cross_cats_sorted":[],"title_canon_sha256":"d1d8293930a1d5232615969a41e6310b6e4460cf6d2807fdeb7dfcb809ee4b24","abstract_canon_sha256":"d325da5bc8d49d2412ec5d249251e7e2373d9ae72ea3599db8a9b8570de63061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:05:49.618126Z","signature_b64":"nIKqEXz1mz76Q1L+494rtK75wn/qhFMWlnYupaVd9xzrf8iZ84suhJWO/jgD2S2ysX8czUAc1mrpw7VnncErCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ce71789d987ab1936010c40153d9ae7f0a86b6a5f245dace34a954137eaaca1","last_reissued_at":"2026-08-04T02:05:49.616579Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:05:49.616579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Vision Language Models for General Symbolic Reasoning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guillaume Lajoie, Hassan Rivaz, Omid Nejati Manzari","submitted_at":"2026-08-02T23:01:10Z","abstract_excerpt":"Hard symbolic-reasoning tasks such as Sudoku, maze pathfinding, and ARC remain challenging for LLMs due to their fixed-depth autoregressive reasoning, which limits systematic search, refinement, and backtracking. While recursive models such as Hierarchical Reasoning Model (HRM) and Tiny Recursive Model (TRM) address this limitation through iterative latent-state refinement, they are typically task-specific and do not leverage pretrained language priors. We propose R-Qwen, a recursive reasoning framework built upon a pretrained Qwen backbone. R-Qwen repeatedly refines a candidate solution throu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01534","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/2608.01534/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":"2608.01534","created_at":"2026-08-04T02:05:49.617969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01534v1","created_at":"2026-08-04T02:05:49.617969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01534","created_at":"2026-08-04T02:05:49.617969+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTTRPCOZQ6VR","created_at":"2026-08-04T02:05:49.617969+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTTRPCOZQ6VRSNQB","created_at":"2026-08-04T02:05:49.617969+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTTRPCOZ","created_at":"2026-08-04T02:05:49.617969+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247","json":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247.json","graph_json":"https://pith.science/api/pith-number/HTTRPCOZQ6VRSNQBBRABKPM247/graph.json","events_json":"https://pith.science/api/pith-number/HTTRPCOZQ6VRSNQBBRABKPM247/events.json","paper":"https://pith.science/paper/HTTRPCOZ"},"agent_actions":{"view_html":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247","download_json":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247.json","view_paper":"https://pith.science/paper/HTTRPCOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01534&json=true","fetch_graph":"https://pith.science/api/pith-number/HTTRPCOZQ6VRSNQBBRABKPM247/graph.json","fetch_events":"https://pith.science/api/pith-number/HTTRPCOZQ6VRSNQBBRABKPM247/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/action/storage_attestation","attest_author":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/action/author_attestation","sign_citation":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/action/citation_signature","submit_replication":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/action/replication_record"}},"created_at":"2026-08-04T02:05:49.617969+00:00","updated_at":"2026-08-04T02:05:49.617969+00:00"}