{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WCD3EY36RQBRSRFGMKPDJT6P5U","short_pith_number":"pith:WCD3EY36","canonical_record":{"source":{"id":"1802.00027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-25T05:33:26Z","cross_cats_sorted":[],"title_canon_sha256":"c80c9c85a6dd393a21aba0098d6207b91a3f3d9d4f7110fa00b7cdbde6f86e46","abstract_canon_sha256":"31974caf1c7271b64b153914ed388f2c718f72e181a31f37bb9a5118e94e0f1e"},"schema_version":"1.0"},"canonical_sha256":"b087b2637e8c031944a6629e34cfcfed17129f5b57c3a147fe67901545049c37","source":{"kind":"arxiv","id":"1802.00027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00027","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00027v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00027","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"WCD3EY36RQBR","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCD3EY36RQBRSRFG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCD3EY36","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WCD3EY36RQBRSRFGMKPDJT6P5U","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-25T05:33:26Z","cross_cats_sorted":[],"title_canon_sha256":"c80c9c85a6dd393a21aba0098d6207b91a3f3d9d4f7110fa00b7cdbde6f86e46","abstract_canon_sha256":"31974caf1c7271b64b153914ed388f2c718f72e181a31f37bb9a5118e94e0f1e"},"schema_version":"1.0"},"canonical_sha256":"b087b2637e8c031944a6629e34cfcfed17129f5b57c3a147fe67901545049c37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.968565Z","signature_b64":"ZwsAt5x3S/kcGmii7yu28I5zwuRfmUSYlDM0qRg73KHWx4HHgE9Y6yVirU3m0Fz2erumOJOhyHUsOY7+3+p6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b087b2637e8c031944a6629e34cfcfed17129f5b57c3a147fe67901545049c37","last_reissued_at":"2026-05-18T00:24:36.968155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.968155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00027","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-05-18T00:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQPLRnJG8yjmW7szLTy2T53ii5lfo1St/JWnJ4V54kFpNs1EztloTCvzOQFb3FwA2ADAwGIooHv9EOS8+iOdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:51:20.281235Z"},"content_sha256":"eeed74f0d45beac18b5bc3ea12e7e0caf4ad71df282c7b7d490a34cdd6308562","schema_version":"1.0","event_id":"sha256:eeed74f0d45beac18b5bc3ea12e7e0caf4ad71df282c7b7d490a34cdd6308562"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WCD3EY36RQBRSRFGMKPDJT6P5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Backpropagation Algorithm without Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"S. Natarajan, Varun Ranganathan","submitted_at":"2018-01-25T05:33:26Z","abstract_excerpt":"The backpropagation algorithm, which had been originally introduced in the 1970s, is the workhorse of learning in neural networks. This backpropagation algorithm makes use of the famous machine learning algorithm known as Gradient Descent, which is a first-order iterative optimization algorithm for finding the minimum of a function. To find a local minimum of a function using gradient descent, one takes steps proportional to the negative of the gradient (or of the approximate gradient) of the function at the current point. In this paper, we develop an alternative to the backpropagation without"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00027","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":""},"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-05-18T00:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vlckg8OTm7HGRHR046Md9In0OlUSA9sj0UOTFsP6ZwKKTErgvis4pv0UZ5ieH+bJigr4Ai4BpPCWN9hn3mqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:51:20.281816Z"},"content_sha256":"44221014920adb3d628e933e7af6f7aa1d232e2282ae3ef0b84c56b2b8e39172","schema_version":"1.0","event_id":"sha256:44221014920adb3d628e933e7af6f7aa1d232e2282ae3ef0b84c56b2b8e39172"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCD3EY36RQBRSRFGMKPDJT6P5U/bundle.json","state_url":"https://pith.science/pith/WCD3EY36RQBRSRFGMKPDJT6P5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCD3EY36RQBRSRFGMKPDJT6P5U/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-06-05T03:51:20Z","links":{"resolver":"https://pith.science/pith/WCD3EY36RQBRSRFGMKPDJT6P5U","bundle":"https://pith.science/pith/WCD3EY36RQBRSRFGMKPDJT6P5U/bundle.json","state":"https://pith.science/pith/WCD3EY36RQBRSRFGMKPDJT6P5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCD3EY36RQBRSRFGMKPDJT6P5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WCD3EY36RQBRSRFGMKPDJT6P5U","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":"31974caf1c7271b64b153914ed388f2c718f72e181a31f37bb9a5118e94e0f1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-25T05:33:26Z","title_canon_sha256":"c80c9c85a6dd393a21aba0098d6207b91a3f3d9d4f7110fa00b7cdbde6f86e46"},"schema_version":"1.0","source":{"id":"1802.00027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00027","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00027v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00027","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"WCD3EY36RQBR","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCD3EY36RQBRSRFG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCD3EY36","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:44221014920adb3d628e933e7af6f7aa1d232e2282ae3ef0b84c56b2b8e39172","target":"graph","created_at":"2026-05-18T00:24:36Z","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"},"paper":{"abstract_excerpt":"The backpropagation algorithm, which had been originally introduced in the 1970s, is the workhorse of learning in neural networks. This backpropagation algorithm makes use of the famous machine learning algorithm known as Gradient Descent, which is a first-order iterative optimization algorithm for finding the minimum of a function. To find a local minimum of a function using gradient descent, one takes steps proportional to the negative of the gradient (or of the approximate gradient) of the function at the current point. In this paper, we develop an alternative to the backpropagation without","authors_text":"S. Natarajan, Varun Ranganathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-25T05:33:26Z","title":"A New Backpropagation Algorithm without Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00027","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:eeed74f0d45beac18b5bc3ea12e7e0caf4ad71df282c7b7d490a34cdd6308562","target":"record","created_at":"2026-05-18T00:24:36Z","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":"31974caf1c7271b64b153914ed388f2c718f72e181a31f37bb9a5118e94e0f1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-25T05:33:26Z","title_canon_sha256":"c80c9c85a6dd393a21aba0098d6207b91a3f3d9d4f7110fa00b7cdbde6f86e46"},"schema_version":"1.0","source":{"id":"1802.00027","kind":"arxiv","version":1}},"canonical_sha256":"b087b2637e8c031944a6629e34cfcfed17129f5b57c3a147fe67901545049c37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b087b2637e8c031944a6629e34cfcfed17129f5b57c3a147fe67901545049c37","first_computed_at":"2026-05-18T00:24:36.968155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.968155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZwsAt5x3S/kcGmii7yu28I5zwuRfmUSYlDM0qRg73KHWx4HHgE9Y6yVirU3m0Fz2erumOJOhyHUsOY7+3+p6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.968565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeed74f0d45beac18b5bc3ea12e7e0caf4ad71df282c7b7d490a34cdd6308562","sha256:44221014920adb3d628e933e7af6f7aa1d232e2282ae3ef0b84c56b2b8e39172"],"state_sha256":"d28f4fd85996c15a554011b9a53e08b45c49011ef144ffd0011056af890b6969"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+tOzxEaPb3tlU0Dz39wQUL0StbnQ3BV4jF/BNp8H6zFERVq+/iQpDej0foQ+oa8lVRKfVnhNIZ8egIvH32jUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:51:20.285151Z","bundle_sha256":"b3f870041f9ca58ffc3a6083e38d92165bba5e5b86d8eeb155956870a07bf408"}}