{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GCQFQFXOEY5ZM3T44ATU7ZSPOI","short_pith_number":"pith:GCQFQFXO","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"},"canonical_sha256":"30a05816ee263b966e7ce0274fe64f720c037e88154dd4ee820df493f46de5f5","source":{"kind":"arxiv","id":"2602.17993","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.17993","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2602.17993v2","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.17993","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"GCQFQFXOEY5Z","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"GCQFQFXOEY5ZM3T4","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"GCQFQFXO","created_at":"2026-07-14T01:20:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GCQFQFXOEY5ZM3T44ATU7ZSPOI","target":"record","payload":{"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"},"canonical_sha256":"30a05816ee263b966e7ce0274fe64f720c037e88154dd4ee820df493f46de5f5","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"},"source_kind":"arxiv","source_id":"2602.17993","source_version":2,"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-07-14T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7BbVMeDdC3AQ7CZBtB8NuU33ZNtEHFCCvtxUFg6bZsFAZxc7/mJxd49/LUGwvhRkzHX4cTLAXm1ps0GAt7NjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:40:46.262727Z"},"content_sha256":"a02d4f58a52b231e900e5389bbcbc253cf08ced8790351c2d698198ba9005dc0","schema_version":"1.0","event_id":"sha256:a02d4f58a52b231e900e5389bbcbc253cf08ced8790351c2d698198ba9005dc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GCQFQFXOEY5ZM3T44ATU7ZSPOI","target":"graph","payload":{"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"},"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-07-14T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Sfym13n01rsJQQv9VF/EdAGDBG/dbkyHoZ0fZWpsmHnNEE/mKvjEYo87HEZMj+ICh1vyNiTdaFhjJdPe7z5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:40:46.264481Z"},"content_sha256":"f1d5143835a26e73586d74be4f5bb82575d5f8e75837259679ed053a9a26a6ee","schema_version":"1.0","event_id":"sha256:f1d5143835a26e73586d74be4f5bb82575d5f8e75837259679ed053a9a26a6ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/bundle.json","state_url":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/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-04T02:40:46Z","links":{"resolver":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI","bundle":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/bundle.json","state":"https://pith.science/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCQFQFXOEY5ZM3T44ATU7ZSPOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GCQFQFXOEY5ZM3T44ATU7ZSPOI","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":"5c0ead04734e6798c1e7f1b586c3ec981c704bf112b65a5602825a079acb9ab6","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-20T05:01:32Z","title_canon_sha256":"2ad1438c18c70ac48be1b40382befa004575b4676efe9bb2dfb80eefaecc451d"},"schema_version":"1.0","source":{"id":"2602.17993","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.17993","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"2602.17993v2","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.17993","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"GCQFQFXOEY5Z","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_16","alias_value":"GCQFQFXOEY5ZM3T4","created_at":"2026-07-14T01:20:54Z"},{"alias_kind":"pith_short_8","alias_value":"GCQFQFXO","created_at":"2026-07-14T01:20:54Z"}],"graph_snapshots":[{"event_id":"sha256:f1d5143835a26e73586d74be4f5bb82575d5f8e75837259679ed053a9a26a6ee","target":"graph","created_at":"2026-07-14T01:20:54Z","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/2602.17993/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mohan Tang, Sidi Lu","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-20T05:01:32Z","title":"Turbo Connection: Reasoning as Information Flow from Higher to Lower Layers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.17993","kind":"arxiv","version":2},"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:a02d4f58a52b231e900e5389bbcbc253cf08ced8790351c2d698198ba9005dc0","target":"record","created_at":"2026-07-14T01:20:54Z","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":"5c0ead04734e6798c1e7f1b586c3ec981c704bf112b65a5602825a079acb9ab6","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-20T05:01:32Z","title_canon_sha256":"2ad1438c18c70ac48be1b40382befa004575b4676efe9bb2dfb80eefaecc451d"},"schema_version":"1.0","source":{"id":"2602.17993","kind":"arxiv","version":2}},"canonical_sha256":"30a05816ee263b966e7ce0274fe64f720c037e88154dd4ee820df493f46de5f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30a05816ee263b966e7ce0274fe64f720c037e88154dd4ee820df493f46de5f5","first_computed_at":"2026-07-14T01:20:54.779322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:20:54.779322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+RdUeY7I9MN+gCNQlQ/3IeVBrrT795QmGqoIfSKvb6nQm4OVchbc7ZM+0fCbD/uC0Edns6Ho9qcLbNfFYP+ZBQ==","signature_status":"signed_v1","signed_at":"2026-07-14T01:20:54.780239Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.17993","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a02d4f58a52b231e900e5389bbcbc253cf08ced8790351c2d698198ba9005dc0","sha256:f1d5143835a26e73586d74be4f5bb82575d5f8e75837259679ed053a9a26a6ee"],"state_sha256":"387222921f0361883a5732ae46f573e952cd533b7ebd114f0f57fb67a1166322"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bsnyBjtki3EPxAP76h8liFseyBUi9R0zh0z1udUQunDSASA7Er1FQLGTI+BYqlIW/eaCw267RM6n60MuH/eYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:40:46.272319Z","bundle_sha256":"24a3f9bdda03afc3f01a4c090a1b8ac7fe5f4aea681896e097df6d122fff0208"}}