{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EQTGNVMHTRMHW74SV55Q5V2AW7","short_pith_number":"pith:EQTGNVMH","canonical_record":{"source":{"id":"1212.5701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-22T15:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"d9535d5011182e0b66cc5b5be264ea4176903142dcca2c073a8d71348cf551d8","abstract_canon_sha256":"67bdc6a56879597a0ec2b9b29697590f77e9886228f8cc287af5af708866838a"},"schema_version":"1.0"},"canonical_sha256":"242666d5879c587b7f92af7b0ed740b7d0c61692c0f4f103a324ec1198ed579d","source":{"kind":"arxiv","id":"1212.5701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5701","created_at":"2026-05-18T03:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5701v1","created_at":"2026-05-18T03:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5701","created_at":"2026-05-18T03:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"EQTGNVMHTRMH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQTGNVMHTRMHW74S","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQTGNVMH","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EQTGNVMHTRMHW74SV55Q5V2AW7","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-22T15:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"d9535d5011182e0b66cc5b5be264ea4176903142dcca2c073a8d71348cf551d8","abstract_canon_sha256":"67bdc6a56879597a0ec2b9b29697590f77e9886228f8cc287af5af708866838a"},"schema_version":"1.0"},"canonical_sha256":"242666d5879c587b7f92af7b0ed740b7d0c61692c0f4f103a324ec1198ed579d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:51.710504Z","signature_b64":"6voO9GC5g8zFScXkFckWztXnZt3dMLpxqaNcB+0FANyPsZokOThWJg/VzwLX+EJh3bFNuBnKCFjIMOPrJIGxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"242666d5879c587b7f92af7b0ed740b7d0c61692c0f4f103a324ec1198ed579d","last_reissued_at":"2026-05-18T03:37:51.709825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:51.709825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5701","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-18T03:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftQwazITky886Ev0hM/LVmuKy94e5+w/fgM63LCPAOQT7GmCuwRIJtAX5rP6zj/6FA+37GlpOJii88/JKTt5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:49:48.224736Z"},"content_sha256":"4484da43223e47f346527e914e02dbf29ff557adfdf796c8175259e039faf884","schema_version":"1.0","event_id":"sha256:4484da43223e47f346527e914e02dbf29ff557adfdf796c8175259e039faf884"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EQTGNVMHTRMHW74SV55Q5V2AW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ADADELTA: An Adaptive Learning Rate Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Matthew D. Zeiler","submitted_at":"2012-12-22T15:46:49Z","abstract_excerpt":"We present a novel per-dimension learning rate method for gradient descent called ADADELTA. The method dynamically adapts over time using only first order information and has minimal computational overhead beyond vanilla stochastic gradient descent. The method requires no manual tuning of a learning rate and appears robust to noisy gradient information, different model architecture choices, various data modalities and selection of hyperparameters. We show promising results compared to other methods on the MNIST digit classification task using a single machine and on a large scale voice dataset"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5701","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-18T03:37:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNkxfnJRyU9RuPbkgZPIoN4AemBs51DxU10ZgO5r/Ll0shC1Bd7DRYU3fPfA2vb8cHdsAsfPalLmMnn1Gu5OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:49:48.225214Z"},"content_sha256":"89d706d8d0041ad8f0e42382b1b58564a1696029f2eba477ef5d702de581e0c2","schema_version":"1.0","event_id":"sha256:89d706d8d0041ad8f0e42382b1b58564a1696029f2eba477ef5d702de581e0c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQTGNVMHTRMHW74SV55Q5V2AW7/bundle.json","state_url":"https://pith.science/pith/EQTGNVMHTRMHW74SV55Q5V2AW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQTGNVMHTRMHW74SV55Q5V2AW7/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-05T02:49:48Z","links":{"resolver":"https://pith.science/pith/EQTGNVMHTRMHW74SV55Q5V2AW7","bundle":"https://pith.science/pith/EQTGNVMHTRMHW74SV55Q5V2AW7/bundle.json","state":"https://pith.science/pith/EQTGNVMHTRMHW74SV55Q5V2AW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQTGNVMHTRMHW74SV55Q5V2AW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EQTGNVMHTRMHW74SV55Q5V2AW7","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":"67bdc6a56879597a0ec2b9b29697590f77e9886228f8cc287af5af708866838a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-22T15:46:49Z","title_canon_sha256":"d9535d5011182e0b66cc5b5be264ea4176903142dcca2c073a8d71348cf551d8"},"schema_version":"1.0","source":{"id":"1212.5701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5701","created_at":"2026-05-18T03:37:51Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5701v1","created_at":"2026-05-18T03:37:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5701","created_at":"2026-05-18T03:37:51Z"},{"alias_kind":"pith_short_12","alias_value":"EQTGNVMHTRMH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQTGNVMHTRMHW74S","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQTGNVMH","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:89d706d8d0041ad8f0e42382b1b58564a1696029f2eba477ef5d702de581e0c2","target":"graph","created_at":"2026-05-18T03:37:51Z","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 present a novel per-dimension learning rate method for gradient descent called ADADELTA. The method dynamically adapts over time using only first order information and has minimal computational overhead beyond vanilla stochastic gradient descent. The method requires no manual tuning of a learning rate and appears robust to noisy gradient information, different model architecture choices, various data modalities and selection of hyperparameters. We show promising results compared to other methods on the MNIST digit classification task using a single machine and on a large scale voice dataset","authors_text":"Matthew D. Zeiler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-22T15:46:49Z","title":"ADADELTA: An Adaptive Learning Rate Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5701","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:4484da43223e47f346527e914e02dbf29ff557adfdf796c8175259e039faf884","target":"record","created_at":"2026-05-18T03:37:51Z","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":"67bdc6a56879597a0ec2b9b29697590f77e9886228f8cc287af5af708866838a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-22T15:46:49Z","title_canon_sha256":"d9535d5011182e0b66cc5b5be264ea4176903142dcca2c073a8d71348cf551d8"},"schema_version":"1.0","source":{"id":"1212.5701","kind":"arxiv","version":1}},"canonical_sha256":"242666d5879c587b7f92af7b0ed740b7d0c61692c0f4f103a324ec1198ed579d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"242666d5879c587b7f92af7b0ed740b7d0c61692c0f4f103a324ec1198ed579d","first_computed_at":"2026-05-18T03:37:51.709825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:51.709825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6voO9GC5g8zFScXkFckWztXnZt3dMLpxqaNcB+0FANyPsZokOThWJg/VzwLX+EJh3bFNuBnKCFjIMOPrJIGxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:51.710504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4484da43223e47f346527e914e02dbf29ff557adfdf796c8175259e039faf884","sha256:89d706d8d0041ad8f0e42382b1b58564a1696029f2eba477ef5d702de581e0c2"],"state_sha256":"cd6783491aeae518e64f70cc1381012eae78a19cae7a0eaa1d930b4058538297"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ukCUIX5WrykmOylAmZqo8DCblFWaiPyT6Z4LDWvxEwOjVotFhePG5NaqMNM94WL7kTnu6hbx/6UBWojs94u5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T02:49:48.229922Z","bundle_sha256":"c8d6cefde8076da7e30a832b8f9ca4e5ab935ab4c759ffb8a55646c902f89c6f"}}