{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CEAOCDG6YWOQW236MNO5XU67M7","short_pith_number":"pith:CEAOCDG6","canonical_record":{"source":{"id":"1811.03270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2018-11-08T05:02:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e9b65b27d9125f83adc6503a2cb6fd0a6c28e0d28c5dfd376a46917de48b4a97","abstract_canon_sha256":"cc125005540642384f9044b8d07287d4b38720bdc158a84554a3a412bea3885d"},"schema_version":"1.0"},"canonical_sha256":"1100e10cdec59d0b6b7e635ddbd3df67d8c6bf04c314bc5c54b27dad38a78b49","source":{"kind":"arxiv","id":"1811.03270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03270","created_at":"2026-05-18T00:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03270v1","created_at":"2026-05-18T00:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03270","created_at":"2026-05-18T00:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"CEAOCDG6YWOQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CEAOCDG6YWOQW236","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CEAOCDG6","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CEAOCDG6YWOQW236MNO5XU67M7","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2018-11-08T05:02:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e9b65b27d9125f83adc6503a2cb6fd0a6c28e0d28c5dfd376a46917de48b4a97","abstract_canon_sha256":"cc125005540642384f9044b8d07287d4b38720bdc158a84554a3a412bea3885d"},"schema_version":"1.0"},"canonical_sha256":"1100e10cdec59d0b6b7e635ddbd3df67d8c6bf04c314bc5c54b27dad38a78b49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:17.106241Z","signature_b64":"JURw2M2AR3nZDmLhp+hHsc9A/MLKXxkMS1EajHg2XZFU21pZ0KdOlgFjDEZPBqiE9OpAgXF78OwaruA7X8+FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1100e10cdec59d0b6b7e635ddbd3df67d8c6bf04c314bc5c54b27dad38a78b49","last_reissued_at":"2026-05-18T00:01:17.105637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:17.105637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03270","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:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O33a2YQSGht91Q20THNHoFbIPyYj+wVgQBzqxQOtpnUEBsGurOF+0uropklXyicRi16jtDGL5nbfztZe0C+yCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:36:10.239480Z"},"content_sha256":"22393fcb206c36b0ffdd36c9ffd22f9cabee6d0db0f1ff86da5edb7a00a98391","schema_version":"1.0","event_id":"sha256:22393fcb206c36b0ffdd36c9ffd22f9cabee6d0db0f1ff86da5edb7a00a98391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CEAOCDG6YWOQW236MNO5XU67M7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Transport View on Generalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dacheng Tao, Jingwei Zhang, Tongliang Liu","submitted_at":"2018-11-08T05:02:11Z","abstract_excerpt":"We derive upper bounds on the generalization error of learning algorithms based on their \\emph{algorithmic transport cost}: the expected Wasserstein distance between the output hypothesis and the output hypothesis conditioned on an input example. The bounds provide a novel approach to study the generalization of learning algorithms from an optimal transport view and impose less constraints on the loss function, such as sub-gaussian or bounded. We further provide several upper bounds on the algorithmic transport cost in terms of total variation distance, relative entropy (or KL-divergence), and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03270","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:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IeZ5+hle4SbHzzrLcEQJzy6DyW6niIQSfkYihISg/DJZJqDm7ZRnLWu5paafjINL4Fv+yizmWTAYpDQVpIh4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:36:10.240125Z"},"content_sha256":"ca9c0bc26b9fba463a88467ac4f1d9fb0b35178acc358edb92835a9250946509","schema_version":"1.0","event_id":"sha256:ca9c0bc26b9fba463a88467ac4f1d9fb0b35178acc358edb92835a9250946509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEAOCDG6YWOQW236MNO5XU67M7/bundle.json","state_url":"https://pith.science/pith/CEAOCDG6YWOQW236MNO5XU67M7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEAOCDG6YWOQW236MNO5XU67M7/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-31T22:36:10Z","links":{"resolver":"https://pith.science/pith/CEAOCDG6YWOQW236MNO5XU67M7","bundle":"https://pith.science/pith/CEAOCDG6YWOQW236MNO5XU67M7/bundle.json","state":"https://pith.science/pith/CEAOCDG6YWOQW236MNO5XU67M7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEAOCDG6YWOQW236MNO5XU67M7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CEAOCDG6YWOQW236MNO5XU67M7","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":"cc125005540642384f9044b8d07287d4b38720bdc158a84554a3a412bea3885d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2018-11-08T05:02:11Z","title_canon_sha256":"e9b65b27d9125f83adc6503a2cb6fd0a6c28e0d28c5dfd376a46917de48b4a97"},"schema_version":"1.0","source":{"id":"1811.03270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03270","created_at":"2026-05-18T00:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03270v1","created_at":"2026-05-18T00:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03270","created_at":"2026-05-18T00:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"CEAOCDG6YWOQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CEAOCDG6YWOQW236","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CEAOCDG6","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:ca9c0bc26b9fba463a88467ac4f1d9fb0b35178acc358edb92835a9250946509","target":"graph","created_at":"2026-05-18T00:01:17Z","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 derive upper bounds on the generalization error of learning algorithms based on their \\emph{algorithmic transport cost}: the expected Wasserstein distance between the output hypothesis and the output hypothesis conditioned on an input example. The bounds provide a novel approach to study the generalization of learning algorithms from an optimal transport view and impose less constraints on the loss function, such as sub-gaussian or bounded. We further provide several upper bounds on the algorithmic transport cost in terms of total variation distance, relative entropy (or KL-divergence), and","authors_text":"Dacheng Tao, Jingwei Zhang, Tongliang Liu","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2018-11-08T05:02:11Z","title":"An Optimal Transport View on Generalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03270","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:22393fcb206c36b0ffdd36c9ffd22f9cabee6d0db0f1ff86da5edb7a00a98391","target":"record","created_at":"2026-05-18T00:01:17Z","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":"cc125005540642384f9044b8d07287d4b38720bdc158a84554a3a412bea3885d","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2018-11-08T05:02:11Z","title_canon_sha256":"e9b65b27d9125f83adc6503a2cb6fd0a6c28e0d28c5dfd376a46917de48b4a97"},"schema_version":"1.0","source":{"id":"1811.03270","kind":"arxiv","version":1}},"canonical_sha256":"1100e10cdec59d0b6b7e635ddbd3df67d8c6bf04c314bc5c54b27dad38a78b49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1100e10cdec59d0b6b7e635ddbd3df67d8c6bf04c314bc5c54b27dad38a78b49","first_computed_at":"2026-05-18T00:01:17.105637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:17.105637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JURw2M2AR3nZDmLhp+hHsc9A/MLKXxkMS1EajHg2XZFU21pZ0KdOlgFjDEZPBqiE9OpAgXF78OwaruA7X8+FDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:17.106241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22393fcb206c36b0ffdd36c9ffd22f9cabee6d0db0f1ff86da5edb7a00a98391","sha256:ca9c0bc26b9fba463a88467ac4f1d9fb0b35178acc358edb92835a9250946509"],"state_sha256":"2aed55328f38e5ea8f19d6565e308132cd5fac6161a50303d239da5823fc9525"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxvqVzTjMc+zH1gX3O1faKCOIZ7CKNI75WJ4HJYZY+r8hxEXIF2XEcEfPI07c8iJ7rR3g9EdiKde3KH2gJA0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:36:10.243207Z","bundle_sha256":"941dcbadc0aa8c9f5353639deba8a5df6959dc5515300faa156c0a928f58d3b3"}}