{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XBLQWJERKJGNAHUTXHYAW4O4FF","short_pith_number":"pith:XBLQWJER","canonical_record":{"source":{"id":"1708.00523","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-01T21:24:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7a18f790688b373d50140d38efa76afa4ef43405fda55ca963cffbcd27ee5225","abstract_canon_sha256":"d394bbd16023319624b196d43fa043bd525a3deb4fd01576c11e902635f9ac67"},"schema_version":"1.0"},"canonical_sha256":"b8570b2491524cd01e93b9f00b71dc2948884855905bcd1a37fdf24ac08d9b40","source":{"kind":"arxiv","id":"1708.00523","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00523","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00523v8","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00523","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"XBLQWJERKJGN","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"pith_short_16","alias_value":"XBLQWJERKJGNAHUT","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"pith_short_8","alias_value":"XBLQWJER","created_at":"2026-07-05T08:32:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XBLQWJERKJGNAHUTXHYAW4O4FF","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00523","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-01T21:24:38Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7a18f790688b373d50140d38efa76afa4ef43405fda55ca963cffbcd27ee5225","abstract_canon_sha256":"d394bbd16023319624b196d43fa043bd525a3deb4fd01576c11e902635f9ac67"},"schema_version":"1.0"},"canonical_sha256":"b8570b2491524cd01e93b9f00b71dc2948884855905bcd1a37fdf24ac08d9b40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:07.164552Z","signature_b64":"YuKRlUk9UyCc70jixpP/xG06ZeDX1xy0CiIkU1u9qWmJHVU8oQnI8VCUCg01nRAMkUK8EGDVN0gLZ7+cZFf/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8570b2491524cd01e93b9f00b71dc2948884855905bcd1a37fdf24ac08d9b40","last_reissued_at":"2026-07-05T08:32:07.164047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:07.164047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00523","source_version":8,"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-05T08:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+q9CvWifF8uQuLQKHmUjTlTFiJmOb5K6+PLE69okJyJcut83eVnvTtXnqPa/qXupU7kWLA7zsDAH7zUnOPbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:29:17.826808Z"},"content_sha256":"8c4a22dea0f4bbc62d8c725e79194a0965b0927378e9175f7fbeb2e8f94e1fc0","schema_version":"1.0","event_id":"sha256:8c4a22dea0f4bbc62d8c725e79194a0965b0927378e9175f7fbeb2e8f94e1fc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XBLQWJERKJGNAHUTXHYAW4O4FF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The duality structure gradient descent algorithm: analysis and applications to neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Thomas Flynn","submitted_at":"2017-08-01T21:24:38Z","abstract_excerpt":"The training of machine learning models is typically carried out using some form of gradient descent, often with great success. However, non-asymptotic analyses of first-order optimization algorithms typically employ a gradient smoothness assumption (formally, Lipschitz continuity of the gradient) that is too strong to be applicable in the case of deep neural networks. To address this, we propose an algorithm named duality structure gradient descent (DSGD) that is amenable to non-asymptotic performance analysis, under mild assumptions on the training set and network architecture. The algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00523","kind":"arxiv","version":8},"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/1708.00523/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-05T08:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEecIadulDVfF6hd281u1nqhUnDiP2I4ZsDP8Y/xsb4gWCkJjGN/y7+L9GgLj+xLnVHVuvYpF9B4Hx7asoAfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:29:17.827687Z"},"content_sha256":"fe49ff68c88586f121205c3297bb0a59e42ca3cb361df6f1c5a30114d8dd6a8a","schema_version":"1.0","event_id":"sha256:fe49ff68c88586f121205c3297bb0a59e42ca3cb361df6f1c5a30114d8dd6a8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBLQWJERKJGNAHUTXHYAW4O4FF/bundle.json","state_url":"https://pith.science/pith/XBLQWJERKJGNAHUTXHYAW4O4FF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBLQWJERKJGNAHUTXHYAW4O4FF/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-10T16:29:17Z","links":{"resolver":"https://pith.science/pith/XBLQWJERKJGNAHUTXHYAW4O4FF","bundle":"https://pith.science/pith/XBLQWJERKJGNAHUTXHYAW4O4FF/bundle.json","state":"https://pith.science/pith/XBLQWJERKJGNAHUTXHYAW4O4FF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBLQWJERKJGNAHUTXHYAW4O4FF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XBLQWJERKJGNAHUTXHYAW4O4FF","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":"d394bbd16023319624b196d43fa043bd525a3deb4fd01576c11e902635f9ac67","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-01T21:24:38Z","title_canon_sha256":"7a18f790688b373d50140d38efa76afa4ef43405fda55ca963cffbcd27ee5225"},"schema_version":"1.0","source":{"id":"1708.00523","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00523","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00523v8","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00523","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"XBLQWJERKJGN","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"pith_short_16","alias_value":"XBLQWJERKJGNAHUT","created_at":"2026-07-05T08:32:07Z"},{"alias_kind":"pith_short_8","alias_value":"XBLQWJER","created_at":"2026-07-05T08:32:07Z"}],"graph_snapshots":[{"event_id":"sha256:fe49ff68c88586f121205c3297bb0a59e42ca3cb361df6f1c5a30114d8dd6a8a","target":"graph","created_at":"2026-07-05T08:32:07Z","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/1708.00523/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The training of machine learning models is typically carried out using some form of gradient descent, often with great success. However, non-asymptotic analyses of first-order optimization algorithms typically employ a gradient smoothness assumption (formally, Lipschitz continuity of the gradient) that is too strong to be applicable in the case of deep neural networks. To address this, we propose an algorithm named duality structure gradient descent (DSGD) that is amenable to non-asymptotic performance analysis, under mild assumptions on the training set and network architecture. The algorithm","authors_text":"Thomas Flynn","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-01T21:24:38Z","title":"The duality structure gradient descent algorithm: analysis and applications to neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00523","kind":"arxiv","version":8},"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:8c4a22dea0f4bbc62d8c725e79194a0965b0927378e9175f7fbeb2e8f94e1fc0","target":"record","created_at":"2026-07-05T08:32:07Z","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":"d394bbd16023319624b196d43fa043bd525a3deb4fd01576c11e902635f9ac67","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-01T21:24:38Z","title_canon_sha256":"7a18f790688b373d50140d38efa76afa4ef43405fda55ca963cffbcd27ee5225"},"schema_version":"1.0","source":{"id":"1708.00523","kind":"arxiv","version":8}},"canonical_sha256":"b8570b2491524cd01e93b9f00b71dc2948884855905bcd1a37fdf24ac08d9b40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8570b2491524cd01e93b9f00b71dc2948884855905bcd1a37fdf24ac08d9b40","first_computed_at":"2026-07-05T08:32:07.164047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:32:07.164047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YuKRlUk9UyCc70jixpP/xG06ZeDX1xy0CiIkU1u9qWmJHVU8oQnI8VCUCg01nRAMkUK8EGDVN0gLZ7+cZFf/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:32:07.164552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00523","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c4a22dea0f4bbc62d8c725e79194a0965b0927378e9175f7fbeb2e8f94e1fc0","sha256:fe49ff68c88586f121205c3297bb0a59e42ca3cb361df6f1c5a30114d8dd6a8a"],"state_sha256":"751aa8cf2d26ab66f7d421cdeb084a96ab61e40a541af22bd1573628d4d54bd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqweQ7opekgaKS8tM9W21Jb20PVWezXc9T0NicgIkH5JLMKUcXfudH8bOiSNr3dZkOtktqxZTXVIT26DPFCADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T16:29:17.833692Z","bundle_sha256":"3621f0e33bb05b96905ee52165a9f19559fc77a1b16d2e85f57c2728351dda14"}}