{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JEN5QKW7OUHBMXA5AJ2ME2OQ2W","short_pith_number":"pith:JEN5QKW7","canonical_record":{"source":{"id":"2501.03176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-06T17:49:00Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"f4da50ee3719567b467d8bdb3a1f89aa7002dd07760ae0329c3b2ae5b4d313a0","abstract_canon_sha256":"cab063961111582a58ec6f8aa440c78209a0089e56f9ea381acc20eba2df1df5"},"schema_version":"1.0"},"canonical_sha256":"491bd82adf750e165c1d0274c269d0d5b40f8c2f4ea8e1ef0a252f3aa880ee3f","source":{"kind":"arxiv","id":"2501.03176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.03176","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"2501.03176v1","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03176","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"JEN5QKW7OUHB","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"pith_short_16","alias_value":"JEN5QKW7OUHBMXA5","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"pith_short_8","alias_value":"JEN5QKW7","created_at":"2026-07-05T09:57:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JEN5QKW7OUHBMXA5AJ2ME2OQ2W","target":"record","payload":{"canonical_record":{"source":{"id":"2501.03176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-06T17:49:00Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"f4da50ee3719567b467d8bdb3a1f89aa7002dd07760ae0329c3b2ae5b4d313a0","abstract_canon_sha256":"cab063961111582a58ec6f8aa440c78209a0089e56f9ea381acc20eba2df1df5"},"schema_version":"1.0"},"canonical_sha256":"491bd82adf750e165c1d0274c269d0d5b40f8c2f4ea8e1ef0a252f3aa880ee3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:32.688912Z","signature_b64":"L2NYkZvOidoBFXA+sHWkrwiRx1ZwzPGUX7PPcrY00mZl6LpBtmpHVPHfiRjNen43OcVkSuTnNoO1ubYn9zSbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"491bd82adf750e165c1d0274c269d0d5b40f8c2f4ea8e1ef0a252f3aa880ee3f","last_reissued_at":"2026-07-05T09:57:32.688483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:32.688483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.03176","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-07-05T09:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tg9orku0jiwxRTdA6KKq6eOIfhahtoOZrht9yWIeJvVVPnYedVrxpKcF1V+aRfUulY8nvC7dIB11aV8/iI8cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:29:20.396122Z"},"content_sha256":"14f8a89a56f5a291d2cf9d913e8a597038688d45fe87f5cfc3118649bf5a7258","schema_version":"1.0","event_id":"sha256:14f8a89a56f5a291d2cf9d913e8a597038688d45fe87f5cfc3118649bf5a7258"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JEN5QKW7OUHBMXA5AJ2ME2OQ2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Forward-Forward Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Andrii Krutsylo","submitted_at":"2025-01-06T17:49:00Z","abstract_excerpt":"We propose a scalable Forward-Forward (FF) algorithm that eliminates the need for backpropagation by training each layer separately. Unlike backpropagation, FF avoids backward gradients and can be more modular and memory efficient, making it appealing for large networks. We extend FF to modern convolutional architectures, such as MobileNetV3 and ResNet18, by introducing a new way to compute losses for convolutional layers. Experiments show that our method achieves performance comparable to standard backpropagation. Furthermore, when we divide the network into blocks, such as the residual block"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03176","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/2501.03176/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-05T09:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mO5pv9vzF0frqbTfFU0Cl7ylFCsal6sr2CMVi/oB/lcsgplXj1GlBSYC/Vm3eeyVDXDnohsB6DqWCbUpaWaIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:29:20.396676Z"},"content_sha256":"731fbaf7d615329c0ba1727155e6071d8a8e26c95a74f9542cee18a0c0b59aae","schema_version":"1.0","event_id":"sha256:731fbaf7d615329c0ba1727155e6071d8a8e26c95a74f9542cee18a0c0b59aae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEN5QKW7OUHBMXA5AJ2ME2OQ2W/bundle.json","state_url":"https://pith.science/pith/JEN5QKW7OUHBMXA5AJ2ME2OQ2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEN5QKW7OUHBMXA5AJ2ME2OQ2W/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-16T02:29:20Z","links":{"resolver":"https://pith.science/pith/JEN5QKW7OUHBMXA5AJ2ME2OQ2W","bundle":"https://pith.science/pith/JEN5QKW7OUHBMXA5AJ2ME2OQ2W/bundle.json","state":"https://pith.science/pith/JEN5QKW7OUHBMXA5AJ2ME2OQ2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEN5QKW7OUHBMXA5AJ2ME2OQ2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JEN5QKW7OUHBMXA5AJ2ME2OQ2W","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":"cab063961111582a58ec6f8aa440c78209a0089e56f9ea381acc20eba2df1df5","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-06T17:49:00Z","title_canon_sha256":"f4da50ee3719567b467d8bdb3a1f89aa7002dd07760ae0329c3b2ae5b4d313a0"},"schema_version":"1.0","source":{"id":"2501.03176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.03176","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"2501.03176v1","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03176","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"JEN5QKW7OUHB","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"pith_short_16","alias_value":"JEN5QKW7OUHBMXA5","created_at":"2026-07-05T09:57:32Z"},{"alias_kind":"pith_short_8","alias_value":"JEN5QKW7","created_at":"2026-07-05T09:57:32Z"}],"graph_snapshots":[{"event_id":"sha256:731fbaf7d615329c0ba1727155e6071d8a8e26c95a74f9542cee18a0c0b59aae","target":"graph","created_at":"2026-07-05T09:57:32Z","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/2501.03176/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a scalable Forward-Forward (FF) algorithm that eliminates the need for backpropagation by training each layer separately. Unlike backpropagation, FF avoids backward gradients and can be more modular and memory efficient, making it appealing for large networks. We extend FF to modern convolutional architectures, such as MobileNetV3 and ResNet18, by introducing a new way to compute losses for convolutional layers. Experiments show that our method achieves performance comparable to standard backpropagation. Furthermore, when we divide the network into blocks, such as the residual block","authors_text":"Andrii Krutsylo","cross_cats":["cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-06T17:49:00Z","title":"Scalable Forward-Forward Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03176","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:14f8a89a56f5a291d2cf9d913e8a597038688d45fe87f5cfc3118649bf5a7258","target":"record","created_at":"2026-07-05T09:57:32Z","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":"cab063961111582a58ec6f8aa440c78209a0089e56f9ea381acc20eba2df1df5","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-06T17:49:00Z","title_canon_sha256":"f4da50ee3719567b467d8bdb3a1f89aa7002dd07760ae0329c3b2ae5b4d313a0"},"schema_version":"1.0","source":{"id":"2501.03176","kind":"arxiv","version":1}},"canonical_sha256":"491bd82adf750e165c1d0274c269d0d5b40f8c2f4ea8e1ef0a252f3aa880ee3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"491bd82adf750e165c1d0274c269d0d5b40f8c2f4ea8e1ef0a252f3aa880ee3f","first_computed_at":"2026-07-05T09:57:32.688483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:32.688483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2NYkZvOidoBFXA+sHWkrwiRx1ZwzPGUX7PPcrY00mZl6LpBtmpHVPHfiRjNen43OcVkSuTnNoO1ubYn9zSbCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:32.688912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.03176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14f8a89a56f5a291d2cf9d913e8a597038688d45fe87f5cfc3118649bf5a7258","sha256:731fbaf7d615329c0ba1727155e6071d8a8e26c95a74f9542cee18a0c0b59aae"],"state_sha256":"ba062043233443233437dbca815129922ccde67ae0f6c73f7e5efc296f29a1f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqLDnReKEQ3Cm3rEzqHdCKcL4+t/BOV8wvd5sCi75/0V67kEleTt7DtWIQlV5ojrG94dkoKTKm92aN5Fe6LmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T02:29:20.401134Z","bundle_sha256":"d3d64fff4204b018ec12154d748a9a83357997e5416bc5c78c9994c4bf03aeee"}}