{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HTTRPCOZQ6VRSNQBBRABKPM247","short_pith_number":"pith:HTTRPCOZ","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"},"canonical_sha256":"3ce71789d987ab1936010c40153d9ae7f0a86b6a5f245dace34a954137eaaca1","source":{"kind":"arxiv","id":"2608.01534","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.01534","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"2608.01534v1","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01534","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"HTTRPCOZQ6VR","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"pith_short_16","alias_value":"HTTRPCOZQ6VRSNQB","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"pith_short_8","alias_value":"HTTRPCOZ","created_at":"2026-08-04T02:05:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HTTRPCOZQ6VRSNQBBRABKPM247","target":"record","payload":{"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"},"canonical_sha256":"3ce71789d987ab1936010c40153d9ae7f0a86b6a5f245dace34a954137eaaca1","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"},"source_kind":"arxiv","source_id":"2608.01534","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-04T02:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/PfpKmXjpI0l7q08W2MiZ6IDEXB4CSepl3Qw6l6y8J96i7mkWFFoeY1Yj3dZmuPktQdK9IRk+Vn3BYyF0nABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:04:29.433524Z"},"content_sha256":"74cc42a34caaa628731b791cd2d144e6819b42fe1e20a9c623d2a2d8311c0b44","schema_version":"1.0","event_id":"sha256:74cc42a34caaa628731b791cd2d144e6819b42fe1e20a9c623d2a2d8311c0b44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HTTRPCOZQ6VRSNQBBRABKPM247","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-04T02:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Xmr+D8fzMh8uCn7rQTJWcyQTEYZsraQFPkdfKcF8QIdYbGFC/JyzyiZ/ArY1R8R9U+KPwGJvOrYT7o55ewkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:04:29.434382Z"},"content_sha256":"26b3fd13b73309b07bfe2c5b6978b0b48481bcd748b52e3b935feec5cee480ac","schema_version":"1.0","event_id":"sha256:26b3fd13b73309b07bfe2c5b6978b0b48481bcd748b52e3b935feec5cee480ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/bundle.json","state_url":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTTRPCOZQ6VRSNQBBRABKPM247/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T09:04:29Z","links":{"resolver":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247","bundle":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/bundle.json","state":"https://pith.science/pith/HTTRPCOZQ6VRSNQBBRABKPM247/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTTRPCOZQ6VRSNQBBRABKPM247/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HTTRPCOZQ6VRSNQBBRABKPM247","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d325da5bc8d49d2412ec5d249251e7e2373d9ae72ea3599db8a9b8570de63061","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-08-02T23:01:10Z","title_canon_sha256":"d1d8293930a1d5232615969a41e6310b6e4460cf6d2807fdeb7dfcb809ee4b24"},"schema_version":"1.0","source":{"id":"2608.01534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.01534","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"2608.01534v1","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01534","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"HTTRPCOZQ6VR","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"pith_short_16","alias_value":"HTTRPCOZQ6VRSNQB","created_at":"2026-08-04T02:05:49Z"},{"alias_kind":"pith_short_8","alias_value":"HTTRPCOZ","created_at":"2026-08-04T02:05:49Z"}],"graph_snapshots":[{"event_id":"sha256:26b3fd13b73309b07bfe2c5b6978b0b48481bcd748b52e3b935feec5cee480ac","target":"graph","created_at":"2026-08-04T02:05:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.01534/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guillaume Lajoie, Hassan Rivaz, Omid Nejati Manzari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-08-02T23:01:10Z","title":"Recursive Vision Language Models for General Symbolic Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01534","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:74cc42a34caaa628731b791cd2d144e6819b42fe1e20a9c623d2a2d8311c0b44","target":"record","created_at":"2026-08-04T02:05:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d325da5bc8d49d2412ec5d249251e7e2373d9ae72ea3599db8a9b8570de63061","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2026-08-02T23:01:10Z","title_canon_sha256":"d1d8293930a1d5232615969a41e6310b6e4460cf6d2807fdeb7dfcb809ee4b24"},"schema_version":"1.0","source":{"id":"2608.01534","kind":"arxiv","version":1}},"canonical_sha256":"3ce71789d987ab1936010c40153d9ae7f0a86b6a5f245dace34a954137eaaca1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ce71789d987ab1936010c40153d9ae7f0a86b6a5f245dace34a954137eaaca1","first_computed_at":"2026-08-04T02:05:49.616579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T02:05:49.616579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nIKqEXz1mz76Q1L+494rtK75wn/qhFMWlnYupaVd9xzrf8iZ84suhJWO/jgD2S2ysX8czUAc1mrpw7VnncErCw==","signature_status":"signed_v1","signed_at":"2026-08-04T02:05:49.618126Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.01534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74cc42a34caaa628731b791cd2d144e6819b42fe1e20a9c623d2a2d8311c0b44","sha256:26b3fd13b73309b07bfe2c5b6978b0b48481bcd748b52e3b935feec5cee480ac"],"state_sha256":"f5bb231ff52f15b4dee697251676d2f8fa04f4fa7f7a454d6114698d2691d4ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+svUSq1K00RgROGSpGpWxmYoxtjv22nOLuH5jnpedZG3UXOwsSkYFAIvyMhx0/zPdq2C5kRWnrt/KLqKrtYIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T09:04:29.439851Z","bundle_sha256":"3e85b59abf8c5b52cd59159afbc145e06413a29ae8727ae8d5feeef6be29d94c"}}