{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DGT3CIALS75DISZ456ATEJHLE3","short_pith_number":"pith:DGT3CIAL","canonical_record":{"source":{"id":"2409.07387","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-11T16:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"24b1bb146dca943b7c1c3effdc1709541a3c885fe0c5327303486503f0871c1d","abstract_canon_sha256":"99851075be8a8960f047eece49ad9ca7324f3491879027e9ecdb31dd5318e885"},"schema_version":"1.0"},"canonical_sha256":"19a7b1200b97fa344b3cef813224eb26cdf590cdc248d071ae43148a2c1967bc","source":{"kind":"arxiv","id":"2409.07387","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.07387","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"2409.07387v2","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07387","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"DGT3CIALS75D","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"DGT3CIALS75DISZ4","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"DGT3CIAL","created_at":"2026-07-05T09:58:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DGT3CIALS75DISZ456ATEJHLE3","target":"record","payload":{"canonical_record":{"source":{"id":"2409.07387","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-11T16:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"24b1bb146dca943b7c1c3effdc1709541a3c885fe0c5327303486503f0871c1d","abstract_canon_sha256":"99851075be8a8960f047eece49ad9ca7324f3491879027e9ecdb31dd5318e885"},"schema_version":"1.0"},"canonical_sha256":"19a7b1200b97fa344b3cef813224eb26cdf590cdc248d071ae43148a2c1967bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:59.815150Z","signature_b64":"2VoPpmkCvYrYg49PcIEzIUFLO+3M7c05vsz1gGfcGHU/UPqKnEfShzZK+LE9yJrOfN8eqlcWm+MfOAE2NSWnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a7b1200b97fa344b3cef813224eb26cdf590cdc248d071ae43148a2c1967bc","last_reissued_at":"2026-07-05T09:58:59.814646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:59.814646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.07387","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-05T09:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRkn3x/sOWJbfyUBQi9hO1zmVHnOrTUxplpKbMCWsapUi9A9AV9Wkay/bjmyKhjWqBql7UOQWwesba7OmiFDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T16:22:24.381281Z"},"content_sha256":"aabfa1929a6c2d5d7a53cf75add5adeff4a1c982b8f3502b73a104537f6c8c91","schema_version":"1.0","event_id":"sha256:aabfa1929a6c2d5d7a53cf75add5adeff4a1c982b8f3502b73a104537f6c8c91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DGT3CIALS75DISZ456ATEJHLE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Contrastive Symmetric Forward-Forward Algorithm (SFFA) for Continual Learning Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Erik B. Terres-Escudero, Javier Del Ser, Pablo Garcia Bringas","submitted_at":"2024-09-11T16:21:44Z","abstract_excerpt":"The so-called Forward-Forward Algorithm (FFA) has recently gained momentum as an alternative to the conventional back-propagation algorithm for neural network learning, yielding competitive performance across various modeling tasks. By replacing the backward pass of gradient back-propagation with two contrastive forward passes, the FFA avoids several shortcomings undergone by its predecessor (e.g., vanishing/exploding gradient) by enabling layer-wise training heuristics. In classification tasks, this contrastive method has been proven to effectively create a latent sparse representation of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07387","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/2409.07387/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:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdVzYVz0XcATxUPV2p+xBlGfWfmCgkbfa5oNvX4LCzMBR1Yp5+lqWX7TG4vaGnJKhPnMHI1DifjudhR5Bf/UBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T16:22:24.382091Z"},"content_sha256":"8d47778a970f7c5f63036858d27e44daa0ff2ed14e85fba997a2800c6c20e073","schema_version":"1.0","event_id":"sha256:8d47778a970f7c5f63036858d27e44daa0ff2ed14e85fba997a2800c6c20e073"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGT3CIALS75DISZ456ATEJHLE3/bundle.json","state_url":"https://pith.science/pith/DGT3CIALS75DISZ456ATEJHLE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGT3CIALS75DISZ456ATEJHLE3/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-17T16:22:24Z","links":{"resolver":"https://pith.science/pith/DGT3CIALS75DISZ456ATEJHLE3","bundle":"https://pith.science/pith/DGT3CIALS75DISZ456ATEJHLE3/bundle.json","state":"https://pith.science/pith/DGT3CIALS75DISZ456ATEJHLE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGT3CIALS75DISZ456ATEJHLE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DGT3CIALS75DISZ456ATEJHLE3","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":"99851075be8a8960f047eece49ad9ca7324f3491879027e9ecdb31dd5318e885","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-11T16:21:44Z","title_canon_sha256":"24b1bb146dca943b7c1c3effdc1709541a3c885fe0c5327303486503f0871c1d"},"schema_version":"1.0","source":{"id":"2409.07387","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.07387","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"2409.07387v2","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.07387","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"DGT3CIALS75D","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"DGT3CIALS75DISZ4","created_at":"2026-07-05T09:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"DGT3CIAL","created_at":"2026-07-05T09:58:59Z"}],"graph_snapshots":[{"event_id":"sha256:8d47778a970f7c5f63036858d27e44daa0ff2ed14e85fba997a2800c6c20e073","target":"graph","created_at":"2026-07-05T09:58:59Z","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/2409.07387/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The so-called Forward-Forward Algorithm (FFA) has recently gained momentum as an alternative to the conventional back-propagation algorithm for neural network learning, yielding competitive performance across various modeling tasks. By replacing the backward pass of gradient back-propagation with two contrastive forward passes, the FFA avoids several shortcomings undergone by its predecessor (e.g., vanishing/exploding gradient) by enabling layer-wise training heuristics. In classification tasks, this contrastive method has been proven to effectively create a latent sparse representation of the","authors_text":"Erik B. Terres-Escudero, Javier Del Ser, Pablo Garcia Bringas","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-11T16:21:44Z","title":"A Contrastive Symmetric Forward-Forward Algorithm (SFFA) for Continual Learning Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.07387","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:aabfa1929a6c2d5d7a53cf75add5adeff4a1c982b8f3502b73a104537f6c8c91","target":"record","created_at":"2026-07-05T09:58:59Z","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":"99851075be8a8960f047eece49ad9ca7324f3491879027e9ecdb31dd5318e885","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-11T16:21:44Z","title_canon_sha256":"24b1bb146dca943b7c1c3effdc1709541a3c885fe0c5327303486503f0871c1d"},"schema_version":"1.0","source":{"id":"2409.07387","kind":"arxiv","version":2}},"canonical_sha256":"19a7b1200b97fa344b3cef813224eb26cdf590cdc248d071ae43148a2c1967bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19a7b1200b97fa344b3cef813224eb26cdf590cdc248d071ae43148a2c1967bc","first_computed_at":"2026-07-05T09:58:59.814646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:59.814646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2VoPpmkCvYrYg49PcIEzIUFLO+3M7c05vsz1gGfcGHU/UPqKnEfShzZK+LE9yJrOfN8eqlcWm+MfOAE2NSWnCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:59.815150Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.07387","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aabfa1929a6c2d5d7a53cf75add5adeff4a1c982b8f3502b73a104537f6c8c91","sha256:8d47778a970f7c5f63036858d27e44daa0ff2ed14e85fba997a2800c6c20e073"],"state_sha256":"f93c23d188e343ea3d65ab755d17c6a141dfe1bf6860ce6c374aead34a829c9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PATi7mO+NqAwdNJpXHm0ExeWVb719xHagndOItq2ES9Rs92dF5+YYzaiOFfQJ1Z4Fhjgt7uaeDTNwFoCXblkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T16:22:24.388322Z","bundle_sha256":"0686f20d2aa8fb5da15346028d6f827960e591267e976268a853cb3c426d9701"}}