{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XGIYCEP4KBEU6G5HE7NR5ISPME","short_pith_number":"pith:XGIYCEP4","canonical_record":{"source":{"id":"1408.1292","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-06T14:27:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"edcb152e48adedd1753bff084fdce2f784ed33c1595f23fe0036c5f34ff52a5d","abstract_canon_sha256":"fe2c7ddeb7ad3cc1b570072120eb285f3035406a225081538edf98e773365e7c"},"schema_version":"1.0"},"canonical_sha256":"b9918111fc50494f1ba727db1ea24f6125e526f5a4f7526239bfbcf361502406","source":{"kind":"arxiv","id":"1408.1292","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1292","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1292v4","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1292","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"XGIYCEP4KBEU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XGIYCEP4KBEU6G5H","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XGIYCEP4","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XGIYCEP4KBEU6G5HE7NR5ISPME","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1292","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-06T14:27:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"edcb152e48adedd1753bff084fdce2f784ed33c1595f23fe0036c5f34ff52a5d","abstract_canon_sha256":"fe2c7ddeb7ad3cc1b570072120eb285f3035406a225081538edf98e773365e7c"},"schema_version":"1.0"},"canonical_sha256":"b9918111fc50494f1ba727db1ea24f6125e526f5a4f7526239bfbcf361502406","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.952613Z","signature_b64":"53wvI/TuayIhU+WIgN32pwi6nPbIzqXh4RjqpiNCI7jbnr5kluhbhy3Do7Y4eqJSEpVCQ4wq2Ozk3w5V5JvlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9918111fc50494f1ba727db1ea24f6125e526f5a4f7526239bfbcf361502406","last_reissued_at":"2026-05-18T01:04:37.951976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.951976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1292","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-18T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgUEPuov+SI6/kTJZVap+3d7iWAv2DIa0CJcljfU+oufz27YGEGCLt++ji1mPyQpHgAm535xEL0a8K7gdINYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:21:36.775791Z"},"content_sha256":"c25670fc1226412cfbdccbac68ab11b471e604cb9ea3fe45a5148cb83e92064b","schema_version":"1.0","event_id":"sha256:c25670fc1226412cfbdccbac68ab11b471e604cb9ea3fe45a5148cb83e92064b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XGIYCEP4KBEU6G5HE7NR5ISPME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Greedy Algorithms for Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Barbara Caputo, Francesco Orabona, Ilja Kuzborskij","submitted_at":"2014-08-06T14:27:57Z","abstract_excerpt":"In this paper we consider the binary transfer learning problem, focusing on how to select and combine sources from a large pool to yield a good performance on a target task. Constraining our scenario to real world, we do not assume the direct access to the source data, but rather we employ the source hypotheses trained from them. We propose an efficient algorithm that selects relevant source hypotheses and feature dimensions simultaneously, building on the literature on the best subset selection problem. Our algorithm achieves state-of-the-art results on three computer vision datasets, substan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1292","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-18T01:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+834mWk6twN+4ih/S1Qp3/gRteeT/1DxbOoW/zkMudMb47BlhCVDbadPWk5ne4o2Oc2t5Wn/0iVEY5zf3LHnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:21:36.776425Z"},"content_sha256":"5dfcecf28258565b75a7fcc3694de1df4a0470fc1efeb8d5f4ba7ca2760a5179","schema_version":"1.0","event_id":"sha256:5dfcecf28258565b75a7fcc3694de1df4a0470fc1efeb8d5f4ba7ca2760a5179"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGIYCEP4KBEU6G5HE7NR5ISPME/bundle.json","state_url":"https://pith.science/pith/XGIYCEP4KBEU6G5HE7NR5ISPME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGIYCEP4KBEU6G5HE7NR5ISPME/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-26T12:21:36Z","links":{"resolver":"https://pith.science/pith/XGIYCEP4KBEU6G5HE7NR5ISPME","bundle":"https://pith.science/pith/XGIYCEP4KBEU6G5HE7NR5ISPME/bundle.json","state":"https://pith.science/pith/XGIYCEP4KBEU6G5HE7NR5ISPME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGIYCEP4KBEU6G5HE7NR5ISPME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XGIYCEP4KBEU6G5HE7NR5ISPME","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":"fe2c7ddeb7ad3cc1b570072120eb285f3035406a225081538edf98e773365e7c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-06T14:27:57Z","title_canon_sha256":"edcb152e48adedd1753bff084fdce2f784ed33c1595f23fe0036c5f34ff52a5d"},"schema_version":"1.0","source":{"id":"1408.1292","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1292","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1292v4","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1292","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"XGIYCEP4KBEU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XGIYCEP4KBEU6G5H","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XGIYCEP4","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:5dfcecf28258565b75a7fcc3694de1df4a0470fc1efeb8d5f4ba7ca2760a5179","target":"graph","created_at":"2026-05-18T01:04:37Z","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":"In this paper we consider the binary transfer learning problem, focusing on how to select and combine sources from a large pool to yield a good performance on a target task. Constraining our scenario to real world, we do not assume the direct access to the source data, but rather we employ the source hypotheses trained from them. We propose an efficient algorithm that selects relevant source hypotheses and feature dimensions simultaneously, building on the literature on the best subset selection problem. Our algorithm achieves state-of-the-art results on three computer vision datasets, substan","authors_text":"Barbara Caputo, Francesco Orabona, Ilja Kuzborskij","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-06T14:27:57Z","title":"Scalable Greedy Algorithms for Transfer Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1292","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:c25670fc1226412cfbdccbac68ab11b471e604cb9ea3fe45a5148cb83e92064b","target":"record","created_at":"2026-05-18T01:04:37Z","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":"fe2c7ddeb7ad3cc1b570072120eb285f3035406a225081538edf98e773365e7c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-06T14:27:57Z","title_canon_sha256":"edcb152e48adedd1753bff084fdce2f784ed33c1595f23fe0036c5f34ff52a5d"},"schema_version":"1.0","source":{"id":"1408.1292","kind":"arxiv","version":4}},"canonical_sha256":"b9918111fc50494f1ba727db1ea24f6125e526f5a4f7526239bfbcf361502406","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9918111fc50494f1ba727db1ea24f6125e526f5a4f7526239bfbcf361502406","first_computed_at":"2026-05-18T01:04:37.951976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:37.951976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"53wvI/TuayIhU+WIgN32pwi6nPbIzqXh4RjqpiNCI7jbnr5kluhbhy3Do7Y4eqJSEpVCQ4wq2Ozk3w5V5JvlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:37.952613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1292","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c25670fc1226412cfbdccbac68ab11b471e604cb9ea3fe45a5148cb83e92064b","sha256:5dfcecf28258565b75a7fcc3694de1df4a0470fc1efeb8d5f4ba7ca2760a5179"],"state_sha256":"10fd737fa9ced0a923ac98dbc5f988aac08dc74fc56cf7e4806f86156d4014b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOzQtkQT5qCFf5CyW2Pjhv68QlKqXDoWYF9oEvQZl2X/dueWZsAd8ACwVudVPDA8M37UHcE8bl73s91gzfefAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:21:36.779052Z","bundle_sha256":"8dd5a3de1f5978eea624fb155db7b58aa0c8239acfc0bfa3e64c6747d85a1960"}}