{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F3GDN43TVU6JJ632G2XUVYMTE2","short_pith_number":"pith:F3GDN43T","canonical_record":{"source":{"id":"1907.09008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-21T17:08:50Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"cc289ad29c7d9c217cc1edb963320785bd8145163fec076130e8f8fb777d28c3","abstract_canon_sha256":"aaf336c5f56ed6b621efd078d9b2cd9de5ed485379995be5162edd843a1c518c"},"schema_version":"1.0"},"canonical_sha256":"2ecc36f373ad3c94fb7a36af4ae1932682ed3f1b24c002f1c1238e499d90a2f6","source":{"kind":"arxiv","id":"1907.09008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09008","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09008v1","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09008","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"F3GDN43TVU6J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3GDN43TVU6JJ632","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3GDN43T","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F3GDN43TVU6JJ632G2XUVYMTE2","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-21T17:08:50Z","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"title_canon_sha256":"cc289ad29c7d9c217cc1edb963320785bd8145163fec076130e8f8fb777d28c3","abstract_canon_sha256":"aaf336c5f56ed6b621efd078d9b2cd9de5ed485379995be5162edd843a1c518c"},"schema_version":"1.0"},"canonical_sha256":"2ecc36f373ad3c94fb7a36af4ae1932682ed3f1b24c002f1c1238e499d90a2f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:02.439742Z","signature_b64":"r+B9vVlYCkN7YZIx51lrJL+B6thcL04R1bGrb86Bhn96UFvE05gUSpAV1g5ZLu3RKtXllvzdbfeVUatBE4XgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ecc36f373ad3c94fb7a36af4ae1932682ed3f1b24c002f1c1238e499d90a2f6","last_reissued_at":"2026-05-17T23:40:02.439246Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:02.439246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09008","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-17T23:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7y1UBjA3GgOl77GEcZC3nWfFebm6evfH7M3/mJnEgZqtGP3Y6EEPVkB/e0AvLy419ayJ4S+J/AE9k/2INd/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:23:55.761711Z"},"content_sha256":"504a6dd6d7799c040340849a7429856ffb4841a5f75b71cd1f2c1ceae3864ea7","schema_version":"1.0","event_id":"sha256:504a6dd6d7799c040340849a7429856ffb4841a5f75b71cd1f2c1ceae3864ea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F3GDN43TVU6JJ632G2XUVYMTE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"signADAM: Learning Confidences for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.ML"],"primary_cat":"cs.CV","authors_text":"Dong Wang, Fanhua Shang, Hongying Liu, Licheng Jiao, Qigong Sun, Wenwo Tang, Yicheng Liu","submitted_at":"2019-07-21T17:08:50Z","abstract_excerpt":"In this paper, we propose a new first-order gradient-based algorithm to train deep neural networks. We first introduce the sign operation of stochastic gradients (as in sign-based methods, e.g., SIGN-SGD) into ADAM, which is called as signADAM. Moreover, in order to make the rate of fitting each feature closer, we define a confidence function to distinguish different components of gradients and apply it to our algorithm. It can generate more sparse gradients than existing algorithms do. We call this new algorithm signADAM++. In particular, both our algorithms are easy to implement and can spee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09008","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-17T23:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhLMZsEcGlpQnrJXAi/2qHKpnQ1cP6k4Nn42f+5Tcd3idwYDS8aS2eD7cuwzc5jAaQUmlzXWTCOb9QHg4kCLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:23:55.762374Z"},"content_sha256":"a9336bd4a1fe88e12715ccd54623c4ec3609b513190dc76b6c2831103f09e5cc","schema_version":"1.0","event_id":"sha256:a9336bd4a1fe88e12715ccd54623c4ec3609b513190dc76b6c2831103f09e5cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3GDN43TVU6JJ632G2XUVYMTE2/bundle.json","state_url":"https://pith.science/pith/F3GDN43TVU6JJ632G2XUVYMTE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3GDN43TVU6JJ632G2XUVYMTE2/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-04T22:23:55Z","links":{"resolver":"https://pith.science/pith/F3GDN43TVU6JJ632G2XUVYMTE2","bundle":"https://pith.science/pith/F3GDN43TVU6JJ632G2XUVYMTE2/bundle.json","state":"https://pith.science/pith/F3GDN43TVU6JJ632G2XUVYMTE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3GDN43TVU6JJ632G2XUVYMTE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F3GDN43TVU6JJ632G2XUVYMTE2","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":"aaf336c5f56ed6b621efd078d9b2cd9de5ed485379995be5162edd843a1c518c","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-21T17:08:50Z","title_canon_sha256":"cc289ad29c7d9c217cc1edb963320785bd8145163fec076130e8f8fb777d28c3"},"schema_version":"1.0","source":{"id":"1907.09008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09008","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09008v1","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09008","created_at":"2026-05-17T23:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"F3GDN43TVU6J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"F3GDN43TVU6JJ632","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"F3GDN43T","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:a9336bd4a1fe88e12715ccd54623c4ec3609b513190dc76b6c2831103f09e5cc","target":"graph","created_at":"2026-05-17T23:40:02Z","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":"In this paper, we propose a new first-order gradient-based algorithm to train deep neural networks. We first introduce the sign operation of stochastic gradients (as in sign-based methods, e.g., SIGN-SGD) into ADAM, which is called as signADAM. Moreover, in order to make the rate of fitting each feature closer, we define a confidence function to distinguish different components of gradients and apply it to our algorithm. It can generate more sparse gradients than existing algorithms do. We call this new algorithm signADAM++. In particular, both our algorithms are easy to implement and can spee","authors_text":"Dong Wang, Fanhua Shang, Hongying Liu, Licheng Jiao, Qigong Sun, Wenwo Tang, Yicheng Liu","cross_cats":["cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-21T17:08:50Z","title":"signADAM: Learning Confidences for Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09008","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:504a6dd6d7799c040340849a7429856ffb4841a5f75b71cd1f2c1ceae3864ea7","target":"record","created_at":"2026-05-17T23:40:02Z","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":"aaf336c5f56ed6b621efd078d9b2cd9de5ed485379995be5162edd843a1c518c","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-21T17:08:50Z","title_canon_sha256":"cc289ad29c7d9c217cc1edb963320785bd8145163fec076130e8f8fb777d28c3"},"schema_version":"1.0","source":{"id":"1907.09008","kind":"arxiv","version":1}},"canonical_sha256":"2ecc36f373ad3c94fb7a36af4ae1932682ed3f1b24c002f1c1238e499d90a2f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ecc36f373ad3c94fb7a36af4ae1932682ed3f1b24c002f1c1238e499d90a2f6","first_computed_at":"2026-05-17T23:40:02.439246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:02.439246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r+B9vVlYCkN7YZIx51lrJL+B6thcL04R1bGrb86Bhn96UFvE05gUSpAV1g5ZLu3RKtXllvzdbfeVUatBE4XgAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:02.439742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:504a6dd6d7799c040340849a7429856ffb4841a5f75b71cd1f2c1ceae3864ea7","sha256:a9336bd4a1fe88e12715ccd54623c4ec3609b513190dc76b6c2831103f09e5cc"],"state_sha256":"f65dcc6ac1a455925b5f616584cd8f77174774ba61b55954e16dec9e202bb473"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTKZv6RNZmJM+3LSI7uEgKMGKerTgHOvWuetw87BJGaWGXgJiqsXHUcuiJK4KlbAL7LgnOt4///kHZOSOcZVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:23:55.765820Z","bundle_sha256":"ee4e6cbd8d7b0e18593111961e305238754dfd3fab7598f23391d31a6b18b803"}}