{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SZ6CYXB7ORF3NEVNRTDHDDZX6U","short_pith_number":"pith:SZ6CYXB7","canonical_record":{"source":{"id":"2007.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T23:08:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"45cb1c550662a283ffef9a7969559feeae16c43b6f29f39b631c1a6a7e567aa2","abstract_canon_sha256":"ee01fbb3dda0c6c8952032f2559143b9e3d475dcb4665a4f3af7c889a06a3a92"},"schema_version":"1.0"},"canonical_sha256":"967c2c5c3f744bb692ad8cc6718f37f519986c0cf11207b9bf705ce3d469cf12","source":{"kind":"arxiv","id":"2007.01434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.01434","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"2007.01434v1","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.01434","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"SZ6CYXB7ORF3","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"pith_short_16","alias_value":"SZ6CYXB7ORF3NEVN","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"pith_short_8","alias_value":"SZ6CYXB7","created_at":"2026-07-05T01:16:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SZ6CYXB7ORF3NEVNRTDHDDZX6U","target":"record","payload":{"canonical_record":{"source":{"id":"2007.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T23:08:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"45cb1c550662a283ffef9a7969559feeae16c43b6f29f39b631c1a6a7e567aa2","abstract_canon_sha256":"ee01fbb3dda0c6c8952032f2559143b9e3d475dcb4665a4f3af7c889a06a3a92"},"schema_version":"1.0"},"canonical_sha256":"967c2c5c3f744bb692ad8cc6718f37f519986c0cf11207b9bf705ce3d469cf12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:01.431916Z","signature_b64":"fgVPn+JEBZvvT7uHZ6OYXg3aGTbi/ISOyy+3Iu7aE1ehJhpLTO0vT3WbVFulOEuddWTHdDHeC09sUkWFBi5bAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"967c2c5c3f744bb692ad8cc6718f37f519986c0cf11207b9bf705ce3d469cf12","last_reissued_at":"2026-07-05T01:16:01.431428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:01.431428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.01434","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-07-05T01:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFQ8NIQe3WTErMRkA9k5GYdhtxbPsBeh4Q7aOMmUVrqJgh0ivYJ0uuLOTOQMlc5JS9Ik3yCBuxhN0ms4jg35Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:04:14.597506Z"},"content_sha256":"d633fb571b8ecd05280055477bfe12f9e0e3907d2c226368309f72e369dd8bc4","schema_version":"1.0","event_id":"sha256:d633fb571b8ecd05280055477bfe12f9e0e3907d2c226368309f72e369dd8bc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SZ6CYXB7ORF3NEVNRTDHDDZX6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In Search of Lost Domain Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Lopez-Paz, Ishaan Gulrajani","submitted_at":"2020-07-02T23:08:07Z","abstract_excerpt":"The goal of domain generalization algorithms is to predict well on distributions different from those seen during training. While a myriad of domain generalization algorithms exist, inconsistencies in experimental conditions -- datasets, architectures, and model selection criteria -- render fair and realistic comparisons difficult. In this paper, we are interested in understanding how useful domain generalization algorithms are in realistic settings. As a first step, we realize that model selection is non-trivial for domain generalization tasks. Contrary to prior work, we argue that domain gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.01434","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.01434/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-05T01:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/awLzIpR4XJSEwZCkbGtR4mg129zDFHgGf8OYljraGghbKgNm1fjqNxOvANr+keqHyygrYk1NDrEpg/RD1tCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:04:14.598026Z"},"content_sha256":"2a8fe05fb89e1a6291f0c9bbc73234438611cb5cb663e26eac6b908204e4a48a","schema_version":"1.0","event_id":"sha256:2a8fe05fb89e1a6291f0c9bbc73234438611cb5cb663e26eac6b908204e4a48a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZ6CYXB7ORF3NEVNRTDHDDZX6U/bundle.json","state_url":"https://pith.science/pith/SZ6CYXB7ORF3NEVNRTDHDDZX6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZ6CYXB7ORF3NEVNRTDHDDZX6U/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-08T07:04:14Z","links":{"resolver":"https://pith.science/pith/SZ6CYXB7ORF3NEVNRTDHDDZX6U","bundle":"https://pith.science/pith/SZ6CYXB7ORF3NEVNRTDHDDZX6U/bundle.json","state":"https://pith.science/pith/SZ6CYXB7ORF3NEVNRTDHDDZX6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZ6CYXB7ORF3NEVNRTDHDDZX6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SZ6CYXB7ORF3NEVNRTDHDDZX6U","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":"ee01fbb3dda0c6c8952032f2559143b9e3d475dcb4665a4f3af7c889a06a3a92","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T23:08:07Z","title_canon_sha256":"45cb1c550662a283ffef9a7969559feeae16c43b6f29f39b631c1a6a7e567aa2"},"schema_version":"1.0","source":{"id":"2007.01434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.01434","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"2007.01434v1","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.01434","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"SZ6CYXB7ORF3","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"pith_short_16","alias_value":"SZ6CYXB7ORF3NEVN","created_at":"2026-07-05T01:16:01Z"},{"alias_kind":"pith_short_8","alias_value":"SZ6CYXB7","created_at":"2026-07-05T01:16:01Z"}],"graph_snapshots":[{"event_id":"sha256:2a8fe05fb89e1a6291f0c9bbc73234438611cb5cb663e26eac6b908204e4a48a","target":"graph","created_at":"2026-07-05T01:16: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.01434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The goal of domain generalization algorithms is to predict well on distributions different from those seen during training. While a myriad of domain generalization algorithms exist, inconsistencies in experimental conditions -- datasets, architectures, and model selection criteria -- render fair and realistic comparisons difficult. In this paper, we are interested in understanding how useful domain generalization algorithms are in realistic settings. As a first step, we realize that model selection is non-trivial for domain generalization tasks. Contrary to prior work, we argue that domain gen","authors_text":"David Lopez-Paz, Ishaan Gulrajani","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T23:08:07Z","title":"In Search of Lost Domain Generalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.01434","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:d633fb571b8ecd05280055477bfe12f9e0e3907d2c226368309f72e369dd8bc4","target":"record","created_at":"2026-07-05T01:16: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":"ee01fbb3dda0c6c8952032f2559143b9e3d475dcb4665a4f3af7c889a06a3a92","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-02T23:08:07Z","title_canon_sha256":"45cb1c550662a283ffef9a7969559feeae16c43b6f29f39b631c1a6a7e567aa2"},"schema_version":"1.0","source":{"id":"2007.01434","kind":"arxiv","version":1}},"canonical_sha256":"967c2c5c3f744bb692ad8cc6718f37f519986c0cf11207b9bf705ce3d469cf12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"967c2c5c3f744bb692ad8cc6718f37f519986c0cf11207b9bf705ce3d469cf12","first_computed_at":"2026-07-05T01:16:01.431428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:01.431428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fgVPn+JEBZvvT7uHZ6OYXg3aGTbi/ISOyy+3Iu7aE1ehJhpLTO0vT3WbVFulOEuddWTHdDHeC09sUkWFBi5bAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:01.431916Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.01434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d633fb571b8ecd05280055477bfe12f9e0e3907d2c226368309f72e369dd8bc4","sha256:2a8fe05fb89e1a6291f0c9bbc73234438611cb5cb663e26eac6b908204e4a48a"],"state_sha256":"2955c60322902c8023822aeb57a09cd59b6bf71980a16e42103de5672c482f4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bX53ZiqvWJ9ctxP+gY/cyltl/TvEdR0mzP0RCXAhWLCOXcjep0nPa+J9a4YBjhRzYhuQw5+rB+rT0GhUqTlXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:04:14.602413Z","bundle_sha256":"a820aae736dde72285baea3bde3ae96686b432a6f56da448425c3673ddc30c2b"}}