{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T3LNVM54DNDXCG5B5FYAXQFYDL","short_pith_number":"pith:T3LNVM54","schema_version":"1.0","canonical_sha256":"9ed6dab3bc1b47711ba1e9700bc0b81af8e196679cded04dcd53f30206c5b48f","source":{"kind":"arxiv","id":"2502.07503","version":4},"attestation_state":"computed","paper":{"title":"Recursive Inference Scaling: A Winning Path to Scalable Inference in Language and Multimodal Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ibrahim Alabdulmohsin, Xiaohua Zhai","submitted_at":"2025-02-11T12:11:40Z","abstract_excerpt":"Inspired by recent findings on the fractal geometry of language, we introduce Recursive INference Scaling (RINS) as a complementary, plug-in recipe for scaling inference time in language and multimodal systems. RINS is a particular form of recursive depth that significantly outperforms +55 other variants, including the recent \"repeat-all-over\" (RAO) strategy in Mobile LLM (Liu et al., 2024) and latent recurrent thinking (Geiping et al., 2025). Unlike prior works, we carry out our comparisons on a compute-matched regime, and demonstrate that for a fixed model size and training compute budget, R"},"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":"2502.07503","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-02-11T12:11:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6f9831bea663b13dd0abb7e741c5606a846a48c6d8a7e66206d24277aa6e5663","abstract_canon_sha256":"e803a896156884aa672da5a5745045cd96fb88285c4053bf89d1b300e18ca01d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:04.511837Z","signature_b64":"ReHq1q7yObp5Gh7GkQvHZG8H80iksPaD58Cv2bNtFVyAecukHSO0btpm31QG7vIZPYize27bWcZwc9UNX9YaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed6dab3bc1b47711ba1e9700bc0b81af8e196679cded04dcd53f30206c5b48f","last_reissued_at":"2026-07-05T11:00:04.511329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:04.511329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Inference Scaling: A Winning Path to Scalable Inference in Language and Multimodal Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ibrahim Alabdulmohsin, Xiaohua Zhai","submitted_at":"2025-02-11T12:11:40Z","abstract_excerpt":"Inspired by recent findings on the fractal geometry of language, we introduce Recursive INference Scaling (RINS) as a complementary, plug-in recipe for scaling inference time in language and multimodal systems. RINS is a particular form of recursive depth that significantly outperforms +55 other variants, including the recent \"repeat-all-over\" (RAO) strategy in Mobile LLM (Liu et al., 2024) and latent recurrent thinking (Geiping et al., 2025). Unlike prior works, we carry out our comparisons on a compute-matched regime, and demonstrate that for a fixed model size and training compute budget, R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07503","kind":"arxiv","version":4},"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/2502.07503/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":"2502.07503","created_at":"2026-07-05T11:00:04.511393+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07503v4","created_at":"2026-07-05T11:00:04.511393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07503","created_at":"2026-07-05T11:00:04.511393+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3LNVM54DNDX","created_at":"2026-07-05T11:00:04.511393+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3LNVM54DNDXCG5B","created_at":"2026-07-05T11:00:04.511393+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3LNVM54","created_at":"2026-07-05T11:00:04.511393+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12946","citing_title":"Parcae: Scaling Laws For Stable Looped Language Models","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL","json":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL.json","graph_json":"https://pith.science/api/pith-number/T3LNVM54DNDXCG5B5FYAXQFYDL/graph.json","events_json":"https://pith.science/api/pith-number/T3LNVM54DNDXCG5B5FYAXQFYDL/events.json","paper":"https://pith.science/paper/T3LNVM54"},"agent_actions":{"view_html":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL","download_json":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL.json","view_paper":"https://pith.science/paper/T3LNVM54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07503&json=true","fetch_graph":"https://pith.science/api/pith-number/T3LNVM54DNDXCG5B5FYAXQFYDL/graph.json","fetch_events":"https://pith.science/api/pith-number/T3LNVM54DNDXCG5B5FYAXQFYDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL/action/storage_attestation","attest_author":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL/action/author_attestation","sign_citation":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL/action/citation_signature","submit_replication":"https://pith.science/pith/T3LNVM54DNDXCG5B5FYAXQFYDL/action/replication_record"}},"created_at":"2026-07-05T11:00:04.511393+00:00","updated_at":"2026-07-05T11:00:04.511393+00:00"}