{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:36QXMUAW3THSQIKSPORMMTXAOB","short_pith_number":"pith:36QXMUAW","schema_version":"1.0","canonical_sha256":"dfa1765016dccf2821527ba2c64ee07057d3436db3009fd47aa4ef2a5bdc3d3e","source":{"kind":"arxiv","id":"2407.08723","version":2},"attestation_state":"computed","paper":{"title":"Topological Generalization Bounds for Discrete-Time Stochastic Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.LG","authors_text":"Benjamin Dupuis, Rayna Andreeva, Rik Sarkar, Tolga Birdal, Umut \\c{S}im\\c{s}ekli","submitted_at":"2024-07-11T17:56:03Z","abstract_excerpt":"We present a novel set of rigorous and computationally efficient topology-based complexity notions that exhibit a strong correlation with the generalization gap in modern deep neural networks (DNNs). DNNs show remarkable generalization properties, yet the source of these capabilities remains elusive, defying the established statistical learning theory. Recent studies have revealed that properties of training trajectories can be indicative of generalization. Building on this insight, state-of-the-art methods have leveraged the topology of these trajectories, particularly their fractal dimension"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2407.08723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-11T17:56:03Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"cc38ad39e658a3a631e04ec4ebd647ffafbfaa5f1d23912b4a4340e6d94202fc","abstract_canon_sha256":"acd5c92679b31b229f2e855a7fc4925991897f1369ec4ca1f24996e6783d7ba4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:07.699048Z","signature_b64":"AoSH+vXoFZnWhI+qr9xq2v1QOydqPRKrxyYB1iZowtqNAMmMsQHFuCuh/m8GbAPGnS4wsLpuLos9tjpfXwxvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfa1765016dccf2821527ba2c64ee07057d3436db3009fd47aa4ef2a5bdc3d3e","last_reissued_at":"2026-07-05T09:49:07.698513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:07.698513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Generalization Bounds for Discrete-Time Stochastic Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.LG","authors_text":"Benjamin Dupuis, Rayna Andreeva, Rik Sarkar, Tolga Birdal, Umut \\c{S}im\\c{s}ekli","submitted_at":"2024-07-11T17:56:03Z","abstract_excerpt":"We present a novel set of rigorous and computationally efficient topology-based complexity notions that exhibit a strong correlation with the generalization gap in modern deep neural networks (DNNs). DNNs show remarkable generalization properties, yet the source of these capabilities remains elusive, defying the established statistical learning theory. Recent studies have revealed that properties of training trajectories can be indicative of generalization. Building on this insight, state-of-the-art methods have leveraged the topology of these trajectories, particularly their fractal dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08723","kind":"arxiv","version":2},"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/2407.08723/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.08723","created_at":"2026-07-05T09:49:07.698575+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08723v2","created_at":"2026-07-05T09:49:07.698575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08723","created_at":"2026-07-05T09:49:07.698575+00:00"},{"alias_kind":"pith_short_12","alias_value":"36QXMUAW3THS","created_at":"2026-07-05T09:49:07.698575+00:00"},{"alias_kind":"pith_short_16","alias_value":"36QXMUAW3THSQIKS","created_at":"2026-07-05T09:49:07.698575+00:00"},{"alias_kind":"pith_short_8","alias_value":"36QXMUAW","created_at":"2026-07-05T09:49:07.698575+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB","json":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB.json","graph_json":"https://pith.science/api/pith-number/36QXMUAW3THSQIKSPORMMTXAOB/graph.json","events_json":"https://pith.science/api/pith-number/36QXMUAW3THSQIKSPORMMTXAOB/events.json","paper":"https://pith.science/paper/36QXMUAW"},"agent_actions":{"view_html":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB","download_json":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB.json","view_paper":"https://pith.science/paper/36QXMUAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08723&json=true","fetch_graph":"https://pith.science/api/pith-number/36QXMUAW3THSQIKSPORMMTXAOB/graph.json","fetch_events":"https://pith.science/api/pith-number/36QXMUAW3THSQIKSPORMMTXAOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB/action/storage_attestation","attest_author":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB/action/author_attestation","sign_citation":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB/action/citation_signature","submit_replication":"https://pith.science/pith/36QXMUAW3THSQIKSPORMMTXAOB/action/replication_record"}},"created_at":"2026-07-05T09:49:07.698575+00:00","updated_at":"2026-07-05T09:49:07.698575+00:00"}