{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FIVJ4AW7L6PACQCNMPBNFVU57V","short_pith_number":"pith:FIVJ4AW7","canonical_record":{"source":{"id":"1904.11740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T09:43:11Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"620650dfdfbd98ea0da73638e4d29876d913a65a5fa23e831527043d938d4d51","abstract_canon_sha256":"4e40c9beaf30b5f8cbcfe6c291f90ec4bae59b88c221a1a158db56501084d382"},"schema_version":"1.0"},"canonical_sha256":"2a2a9e02df5f9e01404d63c2d2d69dfd42c93f967c642a598b9ba9da083e2274","source":{"kind":"arxiv","id":"1904.11740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11740","created_at":"2026-05-17T23:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11740v1","created_at":"2026-05-17T23:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11740","created_at":"2026-05-17T23:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"FIVJ4AW7L6PA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIVJ4AW7L6PACQCN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIVJ4AW7","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FIVJ4AW7L6PACQCNMPBNFVU57V","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T09:43:11Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"620650dfdfbd98ea0da73638e4d29876d913a65a5fa23e831527043d938d4d51","abstract_canon_sha256":"4e40c9beaf30b5f8cbcfe6c291f90ec4bae59b88c221a1a158db56501084d382"},"schema_version":"1.0"},"canonical_sha256":"2a2a9e02df5f9e01404d63c2d2d69dfd42c93f967c642a598b9ba9da083e2274","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:41.066166Z","signature_b64":"yQ4BqBemKATeEHRf4bAMfk3MOtKOwebnWbwKZ5DR2TRkJa6znkrr57uYEURKI9UCBXeGcQo/T/K0IfeNiuB5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a2a9e02df5f9e01404d63c2d2d69dfd42c93f967c642a598b9ba9da083e2274","last_reissued_at":"2026-05-17T23:47:41.065567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:41.065567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11740","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-17T23:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zfujeAva+6o4RzIfdo/MyPg4NcP82yezD6yF5FbjLWcAjWmXTmJ9C2Pwm9w7zSIMP3ARapYK2lbQpvKdDgZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:02:58.494805Z"},"content_sha256":"6a5dd8f43ddec82586de5b06c7b78f8c79962ae6243c0e7b45089f89666105d7","schema_version":"1.0","event_id":"sha256:6a5dd8f43ddec82586de5b06c7b78f8c79962ae6243c0e7b45089f89666105d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FIVJ4AW7L6PACQCNMPBNFVU57V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representation Similarity Analysis for Efficient Task taxonomy & Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Gemma Roig, Kshitij Dwivedi","submitted_at":"2019-04-26T09:43:11Z","abstract_excerpt":"Transfer learning is widely used in deep neural network models when there are few labeled examples available. The common approach is to take a pre-trained network in a similar task and finetune the model parameters. This is usually done blindly without a pre-selection from a set of pre-trained models, or by finetuning a set of models trained on different tasks and selecting the best performing one by cross-validation. We address this problem by proposing an approach to assess the relationship between visual tasks and their task-specific models. Our method uses Representation Similarity Analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11740","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-17T23:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NL52wanhIUWMataJkObz7oPGyO0TAE38MjV+8Fuabm4hFntjozsqExhB2yiC3hOVnsgy0LbylCUwSaz6ypGWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:02:58.495469Z"},"content_sha256":"63c9f4fa2f2c2e034f1aef4b90a202d340f8bc4a35df67107be5ae567edcddbc","schema_version":"1.0","event_id":"sha256:63c9f4fa2f2c2e034f1aef4b90a202d340f8bc4a35df67107be5ae567edcddbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIVJ4AW7L6PACQCNMPBNFVU57V/bundle.json","state_url":"https://pith.science/pith/FIVJ4AW7L6PACQCNMPBNFVU57V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIVJ4AW7L6PACQCNMPBNFVU57V/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-30T20:02:58Z","links":{"resolver":"https://pith.science/pith/FIVJ4AW7L6PACQCNMPBNFVU57V","bundle":"https://pith.science/pith/FIVJ4AW7L6PACQCNMPBNFVU57V/bundle.json","state":"https://pith.science/pith/FIVJ4AW7L6PACQCNMPBNFVU57V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIVJ4AW7L6PACQCNMPBNFVU57V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FIVJ4AW7L6PACQCNMPBNFVU57V","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":"4e40c9beaf30b5f8cbcfe6c291f90ec4bae59b88c221a1a158db56501084d382","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T09:43:11Z","title_canon_sha256":"620650dfdfbd98ea0da73638e4d29876d913a65a5fa23e831527043d938d4d51"},"schema_version":"1.0","source":{"id":"1904.11740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11740","created_at":"2026-05-17T23:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11740v1","created_at":"2026-05-17T23:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11740","created_at":"2026-05-17T23:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"FIVJ4AW7L6PA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIVJ4AW7L6PACQCN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIVJ4AW7","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:63c9f4fa2f2c2e034f1aef4b90a202d340f8bc4a35df67107be5ae567edcddbc","target":"graph","created_at":"2026-05-17T23:47:41Z","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":"Transfer learning is widely used in deep neural network models when there are few labeled examples available. The common approach is to take a pre-trained network in a similar task and finetune the model parameters. This is usually done blindly without a pre-selection from a set of pre-trained models, or by finetuning a set of models trained on different tasks and selecting the best performing one by cross-validation. We address this problem by proposing an approach to assess the relationship between visual tasks and their task-specific models. Our method uses Representation Similarity Analysi","authors_text":"Gemma Roig, Kshitij Dwivedi","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T09:43:11Z","title":"Representation Similarity Analysis for Efficient Task taxonomy & Transfer Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11740","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:6a5dd8f43ddec82586de5b06c7b78f8c79962ae6243c0e7b45089f89666105d7","target":"record","created_at":"2026-05-17T23:47:41Z","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":"4e40c9beaf30b5f8cbcfe6c291f90ec4bae59b88c221a1a158db56501084d382","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T09:43:11Z","title_canon_sha256":"620650dfdfbd98ea0da73638e4d29876d913a65a5fa23e831527043d938d4d51"},"schema_version":"1.0","source":{"id":"1904.11740","kind":"arxiv","version":1}},"canonical_sha256":"2a2a9e02df5f9e01404d63c2d2d69dfd42c93f967c642a598b9ba9da083e2274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a2a9e02df5f9e01404d63c2d2d69dfd42c93f967c642a598b9ba9da083e2274","first_computed_at":"2026-05-17T23:47:41.065567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:41.065567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yQ4BqBemKATeEHRf4bAMfk3MOtKOwebnWbwKZ5DR2TRkJa6znkrr57uYEURKI9UCBXeGcQo/T/K0IfeNiuB5Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:41.066166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a5dd8f43ddec82586de5b06c7b78f8c79962ae6243c0e7b45089f89666105d7","sha256:63c9f4fa2f2c2e034f1aef4b90a202d340f8bc4a35df67107be5ae567edcddbc"],"state_sha256":"adfc1849d38e03ed54193cabbd07056abc6ce092e2b31ae8beb4f21c1e220678"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mWPXQ2XxpbWBgMF9VS32G1wst2AfJCNvgsXqzy0vn2Kpb18puH1WgWKSxIGQY+9vAZLY/VNylexEzEQYySgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:02:58.499068Z","bundle_sha256":"a7a553f87f99da071671fd7fe8c5ad00696e6e001de661844b0a6f94a173dbe2"}}