{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EDKWZBTIDWIQ6J2YCVZ23V2MSE","short_pith_number":"pith:EDKWZBTI","canonical_record":{"source":{"id":"2012.13717","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-26T11:14:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ef7758e8def8cce19eda51e662ae2271784abb66964be3ab2575dda22c01c7f4","abstract_canon_sha256":"4a922799557ff1baa3e42ce60aafa6f400f717e1117efafacf72fb49c7a43475"},"schema_version":"1.0"},"canonical_sha256":"20d56c86681d910f27581573add74c9120476064999cb753d0cee07418b3cf75","source":{"kind":"arxiv","id":"2012.13717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.13717","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"2012.13717v1","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.13717","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"EDKWZBTIDWIQ","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDKWZBTIDWIQ6J2Y","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDKWZBTI","created_at":"2026-07-05T02:02:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EDKWZBTIDWIQ6J2YCVZ23V2MSE","target":"record","payload":{"canonical_record":{"source":{"id":"2012.13717","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-26T11:14:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ef7758e8def8cce19eda51e662ae2271784abb66964be3ab2575dda22c01c7f4","abstract_canon_sha256":"4a922799557ff1baa3e42ce60aafa6f400f717e1117efafacf72fb49c7a43475"},"schema_version":"1.0"},"canonical_sha256":"20d56c86681d910f27581573add74c9120476064999cb753d0cee07418b3cf75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:02:12.348689Z","signature_b64":"jLjW+MxNd0OYC0RO4l0K2GIWimQIe8H8/Qvf/GePmQNMFIMuYULq4+lJpRggLU5aeaqKAICLTHL3mEx0Q9NLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d56c86681d910f27581573add74c9120476064999cb753d0cee07418b3cf75","last_reissued_at":"2026-07-05T02:02:12.348333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:02:12.348333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.13717","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-05T02:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JQOxIz2J3XLv2K76/yX4jkcX0XrZzetZNnEY2LV+AIhcVhf3VYgVCdqcKkf0kehq/jgqaH3xkxiaZqVW3QbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:31:53.710252Z"},"content_sha256":"0f903428b60012e7468196ed5fda19fc0efa6158d80370ce083f3b700965dcd8","schema_version":"1.0","event_id":"sha256:0f903428b60012e7468196ed5fda19fc0efa6158d80370ce083f3b700965dcd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EDKWZBTIDWIQ6J2YCVZ23V2MSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking and Rejecting of Pre-Trained Deep Neural Networks in Transfer Learning based on Separation Index","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmad Kalhor, Mehdi Rahmani, Mostafa Kalhor","submitted_at":"2020-12-26T11:14:12Z","abstract_excerpt":"Automated ranking of pre-trained Deep Neural Networks (DNNs) reduces the required time for selecting optimal pre-trained DNN and boost the classification performance in transfer learning. In this paper, we introduce a novel algorithm to rank pre-trained DNNs by applying a straightforward distance-based complexity measure named Separation Index (SI) to the target dataset. For this purpose, at first, a background about the SI is given and then the automated ranking algorithm is explained. In this algorithm, the SI is computed for the target dataset which passes from the feature extracting parts "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.13717","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/2012.13717/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-05T02:02:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRQioa42HQKntHd4TY3vq67CodKVcnzfUBFd0Apgt71viFQyh6kIqIvEtTaQyr6EBRwuTRxfbDII4mA0Bc+/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T18:31:53.710980Z"},"content_sha256":"9f7e774154c455be3e2f79ae84da3b7e89231241ec8d04d8b1f5ffe6f80be055","schema_version":"1.0","event_id":"sha256:9f7e774154c455be3e2f79ae84da3b7e89231241ec8d04d8b1f5ffe6f80be055"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDKWZBTIDWIQ6J2YCVZ23V2MSE/bundle.json","state_url":"https://pith.science/pith/EDKWZBTIDWIQ6J2YCVZ23V2MSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDKWZBTIDWIQ6J2YCVZ23V2MSE/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-07T18:31:53Z","links":{"resolver":"https://pith.science/pith/EDKWZBTIDWIQ6J2YCVZ23V2MSE","bundle":"https://pith.science/pith/EDKWZBTIDWIQ6J2YCVZ23V2MSE/bundle.json","state":"https://pith.science/pith/EDKWZBTIDWIQ6J2YCVZ23V2MSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDKWZBTIDWIQ6J2YCVZ23V2MSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EDKWZBTIDWIQ6J2YCVZ23V2MSE","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":"4a922799557ff1baa3e42ce60aafa6f400f717e1117efafacf72fb49c7a43475","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-26T11:14:12Z","title_canon_sha256":"ef7758e8def8cce19eda51e662ae2271784abb66964be3ab2575dda22c01c7f4"},"schema_version":"1.0","source":{"id":"2012.13717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.13717","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"arxiv_version","alias_value":"2012.13717v1","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.13717","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"pith_short_12","alias_value":"EDKWZBTIDWIQ","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDKWZBTIDWIQ6J2Y","created_at":"2026-07-05T02:02:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDKWZBTI","created_at":"2026-07-05T02:02:12Z"}],"graph_snapshots":[{"event_id":"sha256:9f7e774154c455be3e2f79ae84da3b7e89231241ec8d04d8b1f5ffe6f80be055","target":"graph","created_at":"2026-07-05T02:02:12Z","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/2012.13717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Automated ranking of pre-trained Deep Neural Networks (DNNs) reduces the required time for selecting optimal pre-trained DNN and boost the classification performance in transfer learning. In this paper, we introduce a novel algorithm to rank pre-trained DNNs by applying a straightforward distance-based complexity measure named Separation Index (SI) to the target dataset. For this purpose, at first, a background about the SI is given and then the automated ranking algorithm is explained. In this algorithm, the SI is computed for the target dataset which passes from the feature extracting parts ","authors_text":"Ahmad Kalhor, Mehdi Rahmani, Mostafa Kalhor","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-26T11:14:12Z","title":"Ranking and Rejecting of Pre-Trained Deep Neural Networks in Transfer Learning based on Separation Index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.13717","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:0f903428b60012e7468196ed5fda19fc0efa6158d80370ce083f3b700965dcd8","target":"record","created_at":"2026-07-05T02:02:12Z","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":"4a922799557ff1baa3e42ce60aafa6f400f717e1117efafacf72fb49c7a43475","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-26T11:14:12Z","title_canon_sha256":"ef7758e8def8cce19eda51e662ae2271784abb66964be3ab2575dda22c01c7f4"},"schema_version":"1.0","source":{"id":"2012.13717","kind":"arxiv","version":1}},"canonical_sha256":"20d56c86681d910f27581573add74c9120476064999cb753d0cee07418b3cf75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20d56c86681d910f27581573add74c9120476064999cb753d0cee07418b3cf75","first_computed_at":"2026-07-05T02:02:12.348333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:02:12.348333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jLjW+MxNd0OYC0RO4l0K2GIWimQIe8H8/Qvf/GePmQNMFIMuYULq4+lJpRggLU5aeaqKAICLTHL3mEx0Q9NLAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:02:12.348689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.13717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f903428b60012e7468196ed5fda19fc0efa6158d80370ce083f3b700965dcd8","sha256:9f7e774154c455be3e2f79ae84da3b7e89231241ec8d04d8b1f5ffe6f80be055"],"state_sha256":"4785259acaaf4e75b299ccb41247245a6eeb5d92a26c9e4dd4f0cb6438856207"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOtsTj5fIgNAxvhkPUDNbpWOvVOurxRNvDZ3sBQh8yt18a+O4llSH6exytqwbHwW2ZT1I1pCkVl4v7PPfCkbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T18:31:53.719738Z","bundle_sha256":"415b8414dea50b0decaea758f458b53a411cc8cd11b501a4d0f19e9c0a8a32ea"}}