{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C7FB2ZWOGNBU3KHPXKP4OVTV3Z","short_pith_number":"pith:C7FB2ZWO","canonical_record":{"source":{"id":"1703.01785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-06T09:44:32Z","cross_cats_sorted":[],"title_canon_sha256":"2bb4a1cbd6c268d034d08f7edc5127e54cc617a6cdbf441eab4f65927e26f6db","abstract_canon_sha256":"b8c4a889469141d638d872f9e991dac25f5f6471e0b30200a9b3ae6d8a4de3fb"},"schema_version":"1.0"},"canonical_sha256":"17ca1d66ce33434da8efba9fc75675de595b4b00c785d7ff44a164cf38a0ef03","source":{"kind":"arxiv","id":"1703.01785","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01785","created_at":"2026-05-18T00:28:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01785v3","created_at":"2026-05-18T00:28:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01785","created_at":"2026-05-18T00:28:16Z"},{"alias_kind":"pith_short_12","alias_value":"C7FB2ZWOGNBU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7FB2ZWOGNBU3KHP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7FB2ZWO","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C7FB2ZWOGNBU3KHPXKP4OVTV3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-06T09:44:32Z","cross_cats_sorted":[],"title_canon_sha256":"2bb4a1cbd6c268d034d08f7edc5127e54cc617a6cdbf441eab4f65927e26f6db","abstract_canon_sha256":"b8c4a889469141d638d872f9e991dac25f5f6471e0b30200a9b3ae6d8a4de3fb"},"schema_version":"1.0"},"canonical_sha256":"17ca1d66ce33434da8efba9fc75675de595b4b00c785d7ff44a164cf38a0ef03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:16.105356Z","signature_b64":"taDGvzDm5loZ+oS556Gc4dCwJjzPFacm4Qk4gH7Dx2jrMPN428kMl9JB7PqPZjWYzpSH5+zvn0yTv80d/QpKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17ca1d66ce33434da8efba9fc75675de595b4b00c785d7ff44a164cf38a0ef03","last_reissued_at":"2026-05-18T00:28:16.104637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:16.104637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01785","source_version":3,"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:28:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CBUHi0pH2jsKrQ91Pduk7HAuoQ+wHCDQtnG+7R1hzbCJoBbBqDgrcnmkEiQiw7am8tDDTHX3jyAfcU1Ez70AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:38:56.028557Z"},"content_sha256":"493832f2aa78cd37a1816899bcb3d0d126c962483b51dfa67d6dcbea770549c9","schema_version":"1.0","event_id":"sha256:493832f2aa78cd37a1816899bcb3d0d126c962483b51dfa67d6dcbea770549c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C7FB2ZWOGNBU3KHPXKP4OVTV3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forward and Reverse Gradient-Based Hyperparameter Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Luca Franceschi, Massimiliano Pontil, Michele Donini, Paolo Frasconi","submitted_at":"2017-03-06T09:44:32Z","abstract_excerpt":"We study two procedures (reverse-mode and forward-mode) for computing the gradient of the validation error with respect to the hyperparameters of any iterative learning algorithm such as stochastic gradient descent. These procedures mirror two methods of computing gradients for recurrent neural networks and have different trade-offs in terms of running time and space requirements. Our formulation of the reverse-mode procedure is linked to previous work by Maclaurin et al. [2015] but does not require reversible dynamics. The forward-mode procedure is suitable for real-time hyperparameter update"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01785","kind":"arxiv","version":3},"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:28:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvO7RmZxds4wvmYqyXsdCAi3tJSKeBp7zJWrGU2+AcT7ZbJQgoIT5BAX3E0SXXT8Bp/aKjMYlTgoTfF93FyMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:38:56.028906Z"},"content_sha256":"85732e0b3f029c6efe5431b97927a0766fd8e671e33b88ac78a0c4f2e73c3b03","schema_version":"1.0","event_id":"sha256:85732e0b3f029c6efe5431b97927a0766fd8e671e33b88ac78a0c4f2e73c3b03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7FB2ZWOGNBU3KHPXKP4OVTV3Z/bundle.json","state_url":"https://pith.science/pith/C7FB2ZWOGNBU3KHPXKP4OVTV3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7FB2ZWOGNBU3KHPXKP4OVTV3Z/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-02T21:38:56Z","links":{"resolver":"https://pith.science/pith/C7FB2ZWOGNBU3KHPXKP4OVTV3Z","bundle":"https://pith.science/pith/C7FB2ZWOGNBU3KHPXKP4OVTV3Z/bundle.json","state":"https://pith.science/pith/C7FB2ZWOGNBU3KHPXKP4OVTV3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7FB2ZWOGNBU3KHPXKP4OVTV3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C7FB2ZWOGNBU3KHPXKP4OVTV3Z","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":"b8c4a889469141d638d872f9e991dac25f5f6471e0b30200a9b3ae6d8a4de3fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-06T09:44:32Z","title_canon_sha256":"2bb4a1cbd6c268d034d08f7edc5127e54cc617a6cdbf441eab4f65927e26f6db"},"schema_version":"1.0","source":{"id":"1703.01785","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01785","created_at":"2026-05-18T00:28:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01785v3","created_at":"2026-05-18T00:28:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01785","created_at":"2026-05-18T00:28:16Z"},{"alias_kind":"pith_short_12","alias_value":"C7FB2ZWOGNBU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7FB2ZWOGNBU3KHP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7FB2ZWO","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:85732e0b3f029c6efe5431b97927a0766fd8e671e33b88ac78a0c4f2e73c3b03","target":"graph","created_at":"2026-05-18T00:28:16Z","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":"We study two procedures (reverse-mode and forward-mode) for computing the gradient of the validation error with respect to the hyperparameters of any iterative learning algorithm such as stochastic gradient descent. These procedures mirror two methods of computing gradients for recurrent neural networks and have different trade-offs in terms of running time and space requirements. Our formulation of the reverse-mode procedure is linked to previous work by Maclaurin et al. [2015] but does not require reversible dynamics. The forward-mode procedure is suitable for real-time hyperparameter update","authors_text":"Luca Franceschi, Massimiliano Pontil, Michele Donini, Paolo Frasconi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-06T09:44:32Z","title":"Forward and Reverse Gradient-Based Hyperparameter Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01785","kind":"arxiv","version":3},"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:493832f2aa78cd37a1816899bcb3d0d126c962483b51dfa67d6dcbea770549c9","target":"record","created_at":"2026-05-18T00:28:16Z","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":"b8c4a889469141d638d872f9e991dac25f5f6471e0b30200a9b3ae6d8a4de3fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-06T09:44:32Z","title_canon_sha256":"2bb4a1cbd6c268d034d08f7edc5127e54cc617a6cdbf441eab4f65927e26f6db"},"schema_version":"1.0","source":{"id":"1703.01785","kind":"arxiv","version":3}},"canonical_sha256":"17ca1d66ce33434da8efba9fc75675de595b4b00c785d7ff44a164cf38a0ef03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17ca1d66ce33434da8efba9fc75675de595b4b00c785d7ff44a164cf38a0ef03","first_computed_at":"2026-05-18T00:28:16.104637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:16.104637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"taDGvzDm5loZ+oS556Gc4dCwJjzPFacm4Qk4gH7Dx2jrMPN428kMl9JB7PqPZjWYzpSH5+zvn0yTv80d/QpKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:16.105356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01785","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:493832f2aa78cd37a1816899bcb3d0d126c962483b51dfa67d6dcbea770549c9","sha256:85732e0b3f029c6efe5431b97927a0766fd8e671e33b88ac78a0c4f2e73c3b03"],"state_sha256":"5f81f3eba627c9b249d2abcf79e8842b8656bd0dadb1210ab72ab01996d69f29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bD6vmcTqYF+KF0vukx/QKvmGMR3YcZiM3XHgiDSUfZFV8etlBkThjTLDnhxC27b/I8da+0CHL9bA+344c87OBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:38:56.030860Z","bundle_sha256":"598119b188aae87fc73522b00d07e550f7a9a2f480d5bb77cfecbb7f0993bd63"}}