{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:Z4EKZ4NTUIALSCRAY2VISA3PPO","short_pith_number":"pith:Z4EKZ4NT","canonical_record":{"source":{"id":"2002.02923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-07T17:51:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a9260048887fc076692041854bb9488d3eb17e20f825796c797e18e15980abd7","abstract_canon_sha256":"4318c8fa777b9d47cbf50547e901998f5e4f14fcbb267359332bd3520b8906a7"},"schema_version":"1.0"},"canonical_sha256":"cf08acf1b3a200b90a20c6aa89036f7bbb0aa7521f9584d7816fcf09286876f8","source":{"kind":"arxiv","id":"2002.02923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02923","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02923v1","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02923","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z4EKZ4NTUIAL","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"pith_short_16","alias_value":"Z4EKZ4NTUIALSCRA","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"pith_short_8","alias_value":"Z4EKZ4NT","created_at":"2026-07-05T00:39:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:Z4EKZ4NTUIALSCRAY2VISA3PPO","target":"record","payload":{"canonical_record":{"source":{"id":"2002.02923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-07T17:51:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a9260048887fc076692041854bb9488d3eb17e20f825796c797e18e15980abd7","abstract_canon_sha256":"4318c8fa777b9d47cbf50547e901998f5e4f14fcbb267359332bd3520b8906a7"},"schema_version":"1.0"},"canonical_sha256":"cf08acf1b3a200b90a20c6aa89036f7bbb0aa7521f9584d7816fcf09286876f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:06.434570Z","signature_b64":"z5VNf98mz1mMKQwV5mRwxdb38fG+uvpat5UVELnigI7Osr6kavhP8JUA7ul4SDD6PCbm4FsSBA8Vdl+/ZpYnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf08acf1b3a200b90a20c6aa89036f7bbb0aa7521f9584d7816fcf09286876f8","last_reissued_at":"2026-07-05T00:39:06.434157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:06.434157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.02923","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-05T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+I4+Uy43U/QFKnyhx8qWWBMM4PjdM5T3lAqG4i5dTCn01YFjEB79+Rq5aeo7CM5WX1J6/WKUqLXScRT45bhECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:32:00.406419Z"},"content_sha256":"e4d5b1d2fbfacbc8dd054b2633e97e438b26701ce7ffb6941ad0db4def0e71f2","schema_version":"1.0","event_id":"sha256:e4d5b1d2fbfacbc8dd054b2633e97e438b26701ce7ffb6941ad0db4def0e71f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:Z4EKZ4NTUIALSCRAY2VISA3PPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Dataset Distances via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Alvarez-Melis, Nicol\\`o Fusi","submitted_at":"2020-02-07T17:51:26Z","abstract_excerpt":"The notion of task similarity is at the core of various machine learning paradigms, such as domain adaptation and meta-learning. Current methods to quantify it are often heuristic, make strong assumptions on the label sets across the tasks, and many are architecture-dependent, relying on task-specific optimal parameters (e.g., require training a model on each dataset). In this work we propose an alternative notion of distance between datasets that (i) is model-agnostic, (ii) does not involve training, (iii) can compare datasets even if their label sets are completely disjoint and (iv) has soli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02923","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/2002.02923/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-05T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NdMbX4ycQzXgqntTayG0xKVstRY9Sz67CV1WaXuZLTXHgxFfD7oV+GLTxkfdkr9hrpELFz6SzoBvQJEVUVzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:32:00.406903Z"},"content_sha256":"ca9c77bbd634e68883fddf0b032f7edd9e3da84211c60654997e057b3a44719c","schema_version":"1.0","event_id":"sha256:ca9c77bbd634e68883fddf0b032f7edd9e3da84211c60654997e057b3a44719c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4EKZ4NTUIALSCRAY2VISA3PPO/bundle.json","state_url":"https://pith.science/pith/Z4EKZ4NTUIALSCRAY2VISA3PPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4EKZ4NTUIALSCRAY2VISA3PPO/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-04T12:32:00Z","links":{"resolver":"https://pith.science/pith/Z4EKZ4NTUIALSCRAY2VISA3PPO","bundle":"https://pith.science/pith/Z4EKZ4NTUIALSCRAY2VISA3PPO/bundle.json","state":"https://pith.science/pith/Z4EKZ4NTUIALSCRAY2VISA3PPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4EKZ4NTUIALSCRAY2VISA3PPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:Z4EKZ4NTUIALSCRAY2VISA3PPO","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":"4318c8fa777b9d47cbf50547e901998f5e4f14fcbb267359332bd3520b8906a7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-07T17:51:26Z","title_canon_sha256":"a9260048887fc076692041854bb9488d3eb17e20f825796c797e18e15980abd7"},"schema_version":"1.0","source":{"id":"2002.02923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02923","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02923v1","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02923","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z4EKZ4NTUIAL","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"pith_short_16","alias_value":"Z4EKZ4NTUIALSCRA","created_at":"2026-07-05T00:39:06Z"},{"alias_kind":"pith_short_8","alias_value":"Z4EKZ4NT","created_at":"2026-07-05T00:39:06Z"}],"graph_snapshots":[{"event_id":"sha256:ca9c77bbd634e68883fddf0b032f7edd9e3da84211c60654997e057b3a44719c","target":"graph","created_at":"2026-07-05T00:39:06Z","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/2002.02923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The notion of task similarity is at the core of various machine learning paradigms, such as domain adaptation and meta-learning. Current methods to quantify it are often heuristic, make strong assumptions on the label sets across the tasks, and many are architecture-dependent, relying on task-specific optimal parameters (e.g., require training a model on each dataset). In this work we propose an alternative notion of distance between datasets that (i) is model-agnostic, (ii) does not involve training, (iii) can compare datasets even if their label sets are completely disjoint and (iv) has soli","authors_text":"David Alvarez-Melis, Nicol\\`o Fusi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-07T17:51:26Z","title":"Geometric Dataset Distances via Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02923","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:e4d5b1d2fbfacbc8dd054b2633e97e438b26701ce7ffb6941ad0db4def0e71f2","target":"record","created_at":"2026-07-05T00:39:06Z","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":"4318c8fa777b9d47cbf50547e901998f5e4f14fcbb267359332bd3520b8906a7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-07T17:51:26Z","title_canon_sha256":"a9260048887fc076692041854bb9488d3eb17e20f825796c797e18e15980abd7"},"schema_version":"1.0","source":{"id":"2002.02923","kind":"arxiv","version":1}},"canonical_sha256":"cf08acf1b3a200b90a20c6aa89036f7bbb0aa7521f9584d7816fcf09286876f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf08acf1b3a200b90a20c6aa89036f7bbb0aa7521f9584d7816fcf09286876f8","first_computed_at":"2026-07-05T00:39:06.434157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:06.434157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z5VNf98mz1mMKQwV5mRwxdb38fG+uvpat5UVELnigI7Osr6kavhP8JUA7ul4SDD6PCbm4FsSBA8Vdl+/ZpYnAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:06.434570Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.02923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4d5b1d2fbfacbc8dd054b2633e97e438b26701ce7ffb6941ad0db4def0e71f2","sha256:ca9c77bbd634e68883fddf0b032f7edd9e3da84211c60654997e057b3a44719c"],"state_sha256":"2239aeeb8559052ea69246e69844d0010f1dcdebb3fd16711d25c5d299946700"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaEvmnTgl9LaDK3n+9CtoINUsMEfD+RAmYiCi5Ge7FyXK8a53uakz5qQ8PyEi1h4ouKRS9E3xYYkKRri7nPEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:32:00.411304Z","bundle_sha256":"6230745cde957090e0151c653079af7879a7900a01782be0dfcc29317bf17f5c"}}