{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5N2FP47KTAP3TWJTUWHS3XBETO","short_pith_number":"pith:5N2FP47K","canonical_record":{"source":{"id":"1710.08402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T17:42:30Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"be94cb9184cee522a394f6f646d6fefad6d7d972890d51090d27d98e3c68f2be","abstract_canon_sha256":"d39745019d3e4bf2d5f9a76e3e4b0a7dd8dc180adf85006b4c3e83d5d630be70"},"schema_version":"1.0"},"canonical_sha256":"eb7457f3ea981fb9d933a58f2ddc249ba37b3f09707a99579e390b84ee1fdce4","source":{"kind":"arxiv","id":"1710.08402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08402","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08402v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08402","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"5N2FP47KTAP3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5N2FP47KTAP3TWJT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5N2FP47K","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5N2FP47KTAP3TWJTUWHS3XBETO","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T17:42:30Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"be94cb9184cee522a394f6f646d6fefad6d7d972890d51090d27d98e3c68f2be","abstract_canon_sha256":"d39745019d3e4bf2d5f9a76e3e4b0a7dd8dc180adf85006b4c3e83d5d630be70"},"schema_version":"1.0"},"canonical_sha256":"eb7457f3ea981fb9d933a58f2ddc249ba37b3f09707a99579e390b84ee1fdce4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:16.119542Z","signature_b64":"NXAElBS60BV9pZBRXywTtYHQ1SvCxlneCkYk0u+asunfpfFkyyfn7qb5zePCHnSd3CLFthWQWlmKojTTL//8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb7457f3ea981fb9d933a58f2ddc249ba37b3f09707a99579e390b84ee1fdce4","last_reissued_at":"2026-05-18T00:32:16.118741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:16.118741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08402","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:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4egJrJn3z3bad3AZJtj4UCJLeZGY8tpo41gNbarfq6WSado1no1Vz1hsdGz8NuQucAwywm2HBEzwaWeXeqNAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:16.339441Z"},"content_sha256":"a6042c8c34f450fb8b192993660607bb683dfe32528f7c5a89941f3e17a9932d","schema_version":"1.0","event_id":"sha256:a6042c8c34f450fb8b192993660607bb683dfe32528f7c5a89941f3e17a9932d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5N2FP47KTAP3TWJTUWHS3XBETO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability and Generalization of Learning Algorithms that Converge to Global Optima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Dimitris Papailiopoulos, Zachary Charles","submitted_at":"2017-10-23T17:42:30Z","abstract_excerpt":"We establish novel generalization bounds for learning algorithms that converge to global minima. We do so by deriving black-box stability results that only depend on the convergence of a learning algorithm and the geometry around the minimizers of the loss function. The results are shown for nonconvex loss functions satisfying the Polyak-{\\L}ojasiewicz (PL) and the quadratic growth (QG) conditions. We further show that these conditions arise for some neural networks with linear activations. We use our black-box results to establish the stability of optimization algorithms such as stochastic gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08402","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:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UdR1cCTGir7okZd0/qKaFMGQkhZfmB07nzdvYEUbA8Qb/p7tVsKqCcwAoZsHdLKC+Tbvr4GJhHIcidVtPoNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:16.339799Z"},"content_sha256":"4bb87a6db55c515db72d9f8b436a6d263c89813c3544befac8e4388e49b8b1ff","schema_version":"1.0","event_id":"sha256:4bb87a6db55c515db72d9f8b436a6d263c89813c3544befac8e4388e49b8b1ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5N2FP47KTAP3TWJTUWHS3XBETO/bundle.json","state_url":"https://pith.science/pith/5N2FP47KTAP3TWJTUWHS3XBETO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5N2FP47KTAP3TWJTUWHS3XBETO/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-05-28T09:27:16Z","links":{"resolver":"https://pith.science/pith/5N2FP47KTAP3TWJTUWHS3XBETO","bundle":"https://pith.science/pith/5N2FP47KTAP3TWJTUWHS3XBETO/bundle.json","state":"https://pith.science/pith/5N2FP47KTAP3TWJTUWHS3XBETO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5N2FP47KTAP3TWJTUWHS3XBETO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5N2FP47KTAP3TWJTUWHS3XBETO","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":"d39745019d3e4bf2d5f9a76e3e4b0a7dd8dc180adf85006b4c3e83d5d630be70","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T17:42:30Z","title_canon_sha256":"be94cb9184cee522a394f6f646d6fefad6d7d972890d51090d27d98e3c68f2be"},"schema_version":"1.0","source":{"id":"1710.08402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08402","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08402v1","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08402","created_at":"2026-05-18T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"5N2FP47KTAP3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5N2FP47KTAP3TWJT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5N2FP47K","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:4bb87a6db55c515db72d9f8b436a6d263c89813c3544befac8e4388e49b8b1ff","target":"graph","created_at":"2026-05-18T00:32: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 establish novel generalization bounds for learning algorithms that converge to global minima. We do so by deriving black-box stability results that only depend on the convergence of a learning algorithm and the geometry around the minimizers of the loss function. The results are shown for nonconvex loss functions satisfying the Polyak-{\\L}ojasiewicz (PL) and the quadratic growth (QG) conditions. We further show that these conditions arise for some neural networks with linear activations. We use our black-box results to establish the stability of optimization algorithms such as stochastic gr","authors_text":"Dimitris Papailiopoulos, Zachary Charles","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T17:42:30Z","title":"Stability and Generalization of Learning Algorithms that Converge to Global Optima"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08402","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:a6042c8c34f450fb8b192993660607bb683dfe32528f7c5a89941f3e17a9932d","target":"record","created_at":"2026-05-18T00:32: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":"d39745019d3e4bf2d5f9a76e3e4b0a7dd8dc180adf85006b4c3e83d5d630be70","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-23T17:42:30Z","title_canon_sha256":"be94cb9184cee522a394f6f646d6fefad6d7d972890d51090d27d98e3c68f2be"},"schema_version":"1.0","source":{"id":"1710.08402","kind":"arxiv","version":1}},"canonical_sha256":"eb7457f3ea981fb9d933a58f2ddc249ba37b3f09707a99579e390b84ee1fdce4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb7457f3ea981fb9d933a58f2ddc249ba37b3f09707a99579e390b84ee1fdce4","first_computed_at":"2026-05-18T00:32:16.118741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:16.118741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NXAElBS60BV9pZBRXywTtYHQ1SvCxlneCkYk0u+asunfpfFkyyfn7qb5zePCHnSd3CLFthWQWlmKojTTL//8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:16.119542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6042c8c34f450fb8b192993660607bb683dfe32528f7c5a89941f3e17a9932d","sha256:4bb87a6db55c515db72d9f8b436a6d263c89813c3544befac8e4388e49b8b1ff"],"state_sha256":"8e34f8547ae9b59d40ca639e495ccc587c646ea38371fc3d369cdbf4bbae9240"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfD85L+YQZJz7brtyDWahCBcUbs1R7cSgiWJVlzO4YiI6X/Ka8w9ync98WnaD4fHJ6JBMjMXwtXzeB7Lx3QKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:27:16.341881Z","bundle_sha256":"8809da89091b74a2ef07db0fd74de0db45dd56d4cf249aee3a2bf0b63a9b1b4f"}}