{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:V7MWSMFJTA2SNN2ZH7YKFJ7QXM","short_pith_number":"pith:V7MWSMFJ","canonical_record":{"source":{"id":"1802.10026","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-27T17:13:28Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e21e68e83d5b17ba47a9a75d59e68a49cc0ee1629ebdb29ddccde3879bd4d8ed","abstract_canon_sha256":"57ad56caf62e2b06a70cb9b238e39a696e0e46a782a8be6e3833fb1ec79da75c"},"schema_version":"1.0"},"canonical_sha256":"afd96930a9983526b7593ff0a2a7f0bb253fcb6e2c81b6b3d92269c516a2b911","source":{"kind":"arxiv","id":"1802.10026","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10026","created_at":"2026-05-18T00:02:01Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10026v4","created_at":"2026-05-18T00:02:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10026","created_at":"2026-05-18T00:02:01Z"},{"alias_kind":"pith_short_12","alias_value":"V7MWSMFJTA2S","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"V7MWSMFJTA2SNN2Z","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"V7MWSMFJ","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:V7MWSMFJTA2SNN2ZH7YKFJ7QXM","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10026","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-27T17:13:28Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e21e68e83d5b17ba47a9a75d59e68a49cc0ee1629ebdb29ddccde3879bd4d8ed","abstract_canon_sha256":"57ad56caf62e2b06a70cb9b238e39a696e0e46a782a8be6e3833fb1ec79da75c"},"schema_version":"1.0"},"canonical_sha256":"afd96930a9983526b7593ff0a2a7f0bb253fcb6e2c81b6b3d92269c516a2b911","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:01.537327Z","signature_b64":"r7OQbacCDPvomb+x+KVeEq3nGkZ4WRCG7akVC3L3tmGrWK1w5FSIPet4nWd7ajOONEIjBbJSyHJ6/wKIZaS9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd96930a9983526b7593ff0a2a7f0bb253fcb6e2c81b6b3d92269c516a2b911","last_reissued_at":"2026-05-18T00:02:01.536821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:01.536821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10026","source_version":4,"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:02:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAsMdch+ChUSe+iRMOnil/3DHUDTIvci7p/ElWUiyJmzxAynbQmbgDQRmUH9Gs3A11oqn0F7gn4yHvw/Kg2TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:45:51.579725Z"},"content_sha256":"cfaf41eab23aaafcace8b01b25de34353be880716231d155efade61b0f31154d","schema_version":"1.0","event_id":"sha256:cfaf41eab23aaafcace8b01b25de34353be880716231d155efade61b0f31154d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:V7MWSMFJTA2SNN2ZH7YKFJ7QXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrew Gordon Wilson, Dmitrii Podoprikhin, Dmitry Vetrov, Pavel Izmailov, Timur Garipov","submitted_at":"2018-02-27T17:13:28Z","abstract_excerpt":"The loss functions of deep neural networks are complex and their geometric properties are not well understood. We show that the optima of these complex loss functions are in fact connected by simple curves over which training and test accuracy are nearly constant. We introduce a training procedure to discover these high-accuracy pathways between modes. Inspired by this new geometric insight, we also propose a new ensembling method entitled Fast Geometric Ensembling (FGE). Using FGE we can train high-performing ensembles in the time required to train a single model. We achieve improved performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10026","kind":"arxiv","version":4},"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:02:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hvdP2tNXR3DMtMpl8jEcR0SkEQHEw7yoT8F9DlpG6kd2Eoz6LtLQGVj1OCquDyGCxg6ZpvK985oJU+k1ifuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:45:51.580398Z"},"content_sha256":"c39608e1833e838a08466d1e671a5ee9a1d13d44517510dceed246f56da7ab44","schema_version":"1.0","event_id":"sha256:c39608e1833e838a08466d1e671a5ee9a1d13d44517510dceed246f56da7ab44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7MWSMFJTA2SNN2ZH7YKFJ7QXM/bundle.json","state_url":"https://pith.science/pith/V7MWSMFJTA2SNN2ZH7YKFJ7QXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7MWSMFJTA2SNN2ZH7YKFJ7QXM/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-25T21:45:51Z","links":{"resolver":"https://pith.science/pith/V7MWSMFJTA2SNN2ZH7YKFJ7QXM","bundle":"https://pith.science/pith/V7MWSMFJTA2SNN2ZH7YKFJ7QXM/bundle.json","state":"https://pith.science/pith/V7MWSMFJTA2SNN2ZH7YKFJ7QXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7MWSMFJTA2SNN2ZH7YKFJ7QXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V7MWSMFJTA2SNN2ZH7YKFJ7QXM","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":"57ad56caf62e2b06a70cb9b238e39a696e0e46a782a8be6e3833fb1ec79da75c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-27T17:13:28Z","title_canon_sha256":"e21e68e83d5b17ba47a9a75d59e68a49cc0ee1629ebdb29ddccde3879bd4d8ed"},"schema_version":"1.0","source":{"id":"1802.10026","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10026","created_at":"2026-05-18T00:02:01Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10026v4","created_at":"2026-05-18T00:02:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10026","created_at":"2026-05-18T00:02:01Z"},{"alias_kind":"pith_short_12","alias_value":"V7MWSMFJTA2S","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"V7MWSMFJTA2SNN2Z","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"V7MWSMFJ","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:c39608e1833e838a08466d1e671a5ee9a1d13d44517510dceed246f56da7ab44","target":"graph","created_at":"2026-05-18T00:02:01Z","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":"The loss functions of deep neural networks are complex and their geometric properties are not well understood. We show that the optima of these complex loss functions are in fact connected by simple curves over which training and test accuracy are nearly constant. We introduce a training procedure to discover these high-accuracy pathways between modes. Inspired by this new geometric insight, we also propose a new ensembling method entitled Fast Geometric Ensembling (FGE). Using FGE we can train high-performing ensembles in the time required to train a single model. We achieve improved performa","authors_text":"Andrew Gordon Wilson, Dmitrii Podoprikhin, Dmitry Vetrov, Pavel Izmailov, Timur Garipov","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-27T17:13:28Z","title":"Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10026","kind":"arxiv","version":4},"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:cfaf41eab23aaafcace8b01b25de34353be880716231d155efade61b0f31154d","target":"record","created_at":"2026-05-18T00:02:01Z","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":"57ad56caf62e2b06a70cb9b238e39a696e0e46a782a8be6e3833fb1ec79da75c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-27T17:13:28Z","title_canon_sha256":"e21e68e83d5b17ba47a9a75d59e68a49cc0ee1629ebdb29ddccde3879bd4d8ed"},"schema_version":"1.0","source":{"id":"1802.10026","kind":"arxiv","version":4}},"canonical_sha256":"afd96930a9983526b7593ff0a2a7f0bb253fcb6e2c81b6b3d92269c516a2b911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afd96930a9983526b7593ff0a2a7f0bb253fcb6e2c81b6b3d92269c516a2b911","first_computed_at":"2026-05-18T00:02:01.536821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:01.536821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7OQbacCDPvomb+x+KVeEq3nGkZ4WRCG7akVC3L3tmGrWK1w5FSIPet4nWd7ajOONEIjBbJSyHJ6/wKIZaS9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:01.537327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10026","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfaf41eab23aaafcace8b01b25de34353be880716231d155efade61b0f31154d","sha256:c39608e1833e838a08466d1e671a5ee9a1d13d44517510dceed246f56da7ab44"],"state_sha256":"187639ee47f096417ec99296c6e53d1420e5deb5e8e378b70a3e48ba4b80de2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3PmzB+chgUHexYgwwdXhrpZtkg9M9VNGZYnGzgqiy/OgB/H+iHZy2/nc6JVNOD8AzD0uVa6xw1TltJ5cbAmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:45:51.584641Z","bundle_sha256":"cfcd48aa613f31bda151a5c795cc0882f0199bf0f579e2aa07381e44eafcf66b"}}