{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GCQFQFXOEY5ZM3T44ATU7ZSPOI","short_pith_number":"pith:GCQFQFXO","schema_version":"1.0","canonical_sha256":"30a05816ee263b966e7ce0274fe64f720c037e88154dd4ee820df493f46de5f5","source":{"kind":"arxiv","id":"2602.17993","version":2},"attestation_state":"computed","paper":{"title":"Turbo Connection: Reasoning as Information Flow from Higher to Lower Layers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mohan Tang, Sidi Lu","submitted_at":"2026-02-20T05:01:32Z","abstract_excerpt":"Complex problems, whether in math, logic, or planning, are solved by humans through a sequence of steps where the result of one step informs the next. In this work, we adopt the perspective that the reasoning power of Transformers is fundamentally limited by a fixed maximum number of steps along any latent path of computation. To address this, we introduce Turbo Connection (TurboConn), a novel architecture that overcomes the fixed-depth constraint by routing multiple residual connections from the higher-layer hidden states of each token $t$ to the lower layers of token $t+1$. Fine-tuning pre-t"},"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":"2602.17993","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-20T05:01:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2ad1438c18c70ac48be1b40382befa004575b4676efe9bb2dfb80eefaecc451d","abstract_canon_sha256":"5c0ead04734e6798c1e7f1b586c3ec981c704bf112b65a5602825a079acb9ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:54.780239Z","signature_b64":"+RdUeY7I9MN+gCNQlQ/3IeVBrrT795QmGqoIfSKvb6nQm4OVchbc7ZM+0fCbD/uC0Edns6Ho9qcLbNfFYP+ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a05816ee263b966e7ce0274fe64f720c037e88154dd4ee820df493f46de5f5","last_reissued_at":"2026-07-14T01:20:54.779322Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:54.779322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turbo Connection: Reasoning as Information Flow from Higher to Lower Layers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mohan Tang, Sidi Lu","submitted_at":"2026-02-20T05:01:32Z","abstract_excerpt":"Complex problems, whether in math, logic, or planning, are solved by humans through a sequence of steps where the result of one step informs the next. In this work, we adopt the perspective that the reasoning power of Transformers is fundamentally limited by a fixed maximum number of steps along any latent path of computation. To address this, we introduce Turbo Connection (TurboConn), a novel architecture that overcomes the fixed-depth constraint by routing multiple residual connections from the higher-layer hidden states of each token $t$ to the lower layers of token $t+1$. Fine-tuning pre-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.17993","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/2602.17993/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":"2602.17993","created_at":"2026-07-14T01:20:54.779753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.17993v2","created_at":"2026-07-14T01:20:54.779753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.17993","created_at":"2026-07-14T01:20:54.779753+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCQFQFXOEY5Z","created_at":"2026-07-14T01:20:54.779753+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCQFQFXOEY5ZM3T4","created_at":"2026-07-14T01:20:54.779753+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCQFQFXO","created_at":"2026-07-14T01:20:54.779753+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/GCQFQFXOEY5ZM3T44ATU7ZSPOI","json":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI.json","graph_json":"https://pith.science/api/pith-number/GCQFQFXOEY5ZM3T44ATU7ZSPOI/graph.json","events_json":"https://pith.science/api/pith-number/GCQFQFXOEY5ZM3T44ATU7ZSPOI/events.json","paper":"https://pith.science/paper/GCQFQFXO"},"agent_actions":{"view_html":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI","download_json":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI.json","view_paper":"https://pith.science/paper/GCQFQFXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.17993&json=true","fetch_graph":"https://pith.science/api/pith-number/GCQFQFXOEY5ZM3T44ATU7ZSPOI/graph.json","fetch_events":"https://pith.science/api/pith-number/GCQFQFXOEY5ZM3T44ATU7ZSPOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/action/storage_attestation","attest_author":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/action/author_attestation","sign_citation":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/action/citation_signature","submit_replication":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/action/replication_record"}},"created_at":"2026-07-14T01:20:54.779753+00:00","updated_at":"2026-07-14T01:20:54.779753+00:00"}