{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MBB4B7VMIUQHJOBTQAA3W2HR5Z","short_pith_number":"pith:MBB4B7VM","canonical_record":{"source":{"id":"2212.13345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-27T02:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"20312e01d27bb10cce4542ba2dd4aad00bdac35266cd8678915a4cb201c17b00","abstract_canon_sha256":"09ee603b3ec62e67288d84628794bb0c1175a0410aad0e60d8e2db3b1ab93312"},"schema_version":"1.0"},"canonical_sha256":"6043c0feac452074b8338001bb68f1ee5e65dd466e20733753c349d5b0125c06","source":{"kind":"arxiv","id":"2212.13345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.13345","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"arxiv_version","alias_value":"2212.13345v1","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.13345","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"pith_short_12","alias_value":"MBB4B7VMIUQH","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"pith_short_16","alias_value":"MBB4B7VMIUQHJOBT","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"pith_short_8","alias_value":"MBB4B7VM","created_at":"2026-07-05T05:28:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MBB4B7VMIUQHJOBTQAA3W2HR5Z","target":"record","payload":{"canonical_record":{"source":{"id":"2212.13345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-27T02:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"20312e01d27bb10cce4542ba2dd4aad00bdac35266cd8678915a4cb201c17b00","abstract_canon_sha256":"09ee603b3ec62e67288d84628794bb0c1175a0410aad0e60d8e2db3b1ab93312"},"schema_version":"1.0"},"canonical_sha256":"6043c0feac452074b8338001bb68f1ee5e65dd466e20733753c349d5b0125c06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:50.658473Z","signature_b64":"XddkZM+uXm6t+GNVyoY/b3OW+3h8WZUpE4MCKvVsFcqZx8bPBAkJY8UqNqmKRnBAU+he8rMVJ/88i7Zoexs2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6043c0feac452074b8338001bb68f1ee5e65dd466e20733753c349d5b0125c06","last_reissued_at":"2026-07-05T05:28:50.658052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:50.658052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.13345","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-05T05:28:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MB8TQPwpMzSc/TURXIukQVUxwMXVMCsCL/VHisT6puhyyeRlDYQyBEg4qxqnRFpNi5V2IgPo8OheqApaUejSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:04:05.420431Z"},"content_sha256":"8b93702359959bfa6564ef91ea02ddf65bbfc1f341864b6b7360af242831f6bf","schema_version":"1.0","event_id":"sha256:8b93702359959bfa6564ef91ea02ddf65bbfc1f341864b6b7360af242831f6bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MBB4B7VMIUQHJOBTQAA3W2HR5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Forward-Forward Algorithm: Some Preliminary Investigations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Geoffrey Hinton","submitted_at":"2022-12-27T02:54:46Z","abstract_excerpt":"The aim of this paper is to introduce a new learning procedure for neural networks and to demonstrate that it works well enough on a few small problems to be worth further investigation. The Forward-Forward algorithm replaces the forward and backward passes of backpropagation by two forward passes, one with positive (i.e. real) data and the other with negative data which could be generated by the network itself. Each layer has its own objective function which is simply to have high goodness for positive data and low goodness for negative data. The sum of the squared activities in a layer can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.13345","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/2212.13345/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-05T05:28:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpNFuFxBu1zdSGQZecxbzNI9TQp6J+tScSrgBdNLMpKlHsyTiEGP3dhQifMlb3APbbZHuSCTIU6nSJSQ0lrHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:04:05.421404Z"},"content_sha256":"f87c5f8169be098dec3fd425e52c9adde271630464b040e105f23d8d37439668","schema_version":"1.0","event_id":"sha256:f87c5f8169be098dec3fd425e52c9adde271630464b040e105f23d8d37439668"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBB4B7VMIUQHJOBTQAA3W2HR5Z/bundle.json","state_url":"https://pith.science/pith/MBB4B7VMIUQHJOBTQAA3W2HR5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBB4B7VMIUQHJOBTQAA3W2HR5Z/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-05T18:04:05Z","links":{"resolver":"https://pith.science/pith/MBB4B7VMIUQHJOBTQAA3W2HR5Z","bundle":"https://pith.science/pith/MBB4B7VMIUQHJOBTQAA3W2HR5Z/bundle.json","state":"https://pith.science/pith/MBB4B7VMIUQHJOBTQAA3W2HR5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBB4B7VMIUQHJOBTQAA3W2HR5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MBB4B7VMIUQHJOBTQAA3W2HR5Z","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":"09ee603b3ec62e67288d84628794bb0c1175a0410aad0e60d8e2db3b1ab93312","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-27T02:54:46Z","title_canon_sha256":"20312e01d27bb10cce4542ba2dd4aad00bdac35266cd8678915a4cb201c17b00"},"schema_version":"1.0","source":{"id":"2212.13345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.13345","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"arxiv_version","alias_value":"2212.13345v1","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.13345","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"pith_short_12","alias_value":"MBB4B7VMIUQH","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"pith_short_16","alias_value":"MBB4B7VMIUQHJOBT","created_at":"2026-07-05T05:28:50Z"},{"alias_kind":"pith_short_8","alias_value":"MBB4B7VM","created_at":"2026-07-05T05:28:50Z"}],"graph_snapshots":[{"event_id":"sha256:f87c5f8169be098dec3fd425e52c9adde271630464b040e105f23d8d37439668","target":"graph","created_at":"2026-07-05T05:28:50Z","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/2212.13345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The aim of this paper is to introduce a new learning procedure for neural networks and to demonstrate that it works well enough on a few small problems to be worth further investigation. The Forward-Forward algorithm replaces the forward and backward passes of backpropagation by two forward passes, one with positive (i.e. real) data and the other with negative data which could be generated by the network itself. Each layer has its own objective function which is simply to have high goodness for positive data and low goodness for negative data. The sum of the squared activities in a layer can b","authors_text":"Geoffrey Hinton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-27T02:54:46Z","title":"The Forward-Forward Algorithm: Some Preliminary Investigations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.13345","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:8b93702359959bfa6564ef91ea02ddf65bbfc1f341864b6b7360af242831f6bf","target":"record","created_at":"2026-07-05T05:28:50Z","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":"09ee603b3ec62e67288d84628794bb0c1175a0410aad0e60d8e2db3b1ab93312","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-27T02:54:46Z","title_canon_sha256":"20312e01d27bb10cce4542ba2dd4aad00bdac35266cd8678915a4cb201c17b00"},"schema_version":"1.0","source":{"id":"2212.13345","kind":"arxiv","version":1}},"canonical_sha256":"6043c0feac452074b8338001bb68f1ee5e65dd466e20733753c349d5b0125c06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6043c0feac452074b8338001bb68f1ee5e65dd466e20733753c349d5b0125c06","first_computed_at":"2026-07-05T05:28:50.658052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:28:50.658052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XddkZM+uXm6t+GNVyoY/b3OW+3h8WZUpE4MCKvVsFcqZx8bPBAkJY8UqNqmKRnBAU+he8rMVJ/88i7Zoexs2DA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:28:50.658473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.13345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b93702359959bfa6564ef91ea02ddf65bbfc1f341864b6b7360af242831f6bf","sha256:f87c5f8169be098dec3fd425e52c9adde271630464b040e105f23d8d37439668"],"state_sha256":"1ed9baccd07bef06d2247e86fed24344d0353a9053713a1f91aaa39f248ede20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aPEaftYV/9ta7LhOK9PvGhAhKnPXjPVJ23PawCsEJDFrXPMbnjvlt64ozCEVmbGYhdNDLVizUKzamFiAdmSGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:04:05.430546Z","bundle_sha256":"af233b427ab3511e06415698178bfad7281f20448b1eca88bf212e0104a339e7"}}