{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JKBXE6LXMZNJ3X2ZW2HCPENSZL","short_pith_number":"pith:JKBXE6LX","canonical_record":{"source":{"id":"1903.00711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T14:45:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"24f6bbd6714044c3da6ba4cecb44cba086bd8863fd578deddc9146dd91045f35","abstract_canon_sha256":"5a06ff30cfcf1233bdb16d53d417083adc6bfd7aeb0e7b4a0441ebcb8f3854f4"},"schema_version":"1.0"},"canonical_sha256":"4a83727977665a9ddf59b68e2791b2caf0f2e753659fd06d1546c524779633b8","source":{"kind":"arxiv","id":"1903.00711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00711","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00711v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00711","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"JKBXE6LXMZNJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JKBXE6LXMZNJ3X2Z","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JKBXE6LX","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JKBXE6LXMZNJ3X2ZW2HCPENSZL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T14:45:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"24f6bbd6714044c3da6ba4cecb44cba086bd8863fd578deddc9146dd91045f35","abstract_canon_sha256":"5a06ff30cfcf1233bdb16d53d417083adc6bfd7aeb0e7b4a0441ebcb8f3854f4"},"schema_version":"1.0"},"canonical_sha256":"4a83727977665a9ddf59b68e2791b2caf0f2e753659fd06d1546c524779633b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:00.730707Z","signature_b64":"8obKvCnzde1oxHpH5HSwmiWMvFxrkyWyRWqXeGkDwwX53wVopWPu2HsGSLOf2HX9Zrnie4y4P4YjE13ZhJfjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a83727977665a9ddf59b68e2791b2caf0f2e753659fd06d1546c524779633b8","last_reissued_at":"2026-05-17T23:52:00.730221Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:00.730221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00711","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:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eGCGAWCnX/YWXg6LW9NH5l0M6YMeqS9/MkSXqyX9rnLJBizkENacLjSnoWSXiBWF5e/byRjZfnc2MLvPfMTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:38:20.965368Z"},"content_sha256":"ab1d2d5edd146c548417093d7c5f73ef9b83875daddbb27d143a60a6801b50b2","schema_version":"1.0","event_id":"sha256:ab1d2d5edd146c548417093d7c5f73ef9b83875daddbb27d143a60a6801b50b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JKBXE6LXMZNJ3X2ZW2HCPENSZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"neuralRank: Searching and ranking ANN-based model repositories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Linsong Chu, Mudhakar Srivatsa, Nirmit Desai, Raghu K. Ganti, Sebastian Stein","submitted_at":"2019-03-02T14:45:41Z","abstract_excerpt":"Widespread applications of deep learning have led to a plethora of pre-trained neural network models for common tasks. Such models are often adapted from other models via transfer learning. The models may have varying training sets, training algorithms, network architectures, and hyper-parameters. For a given application, what isthe most suitable model in a model repository? This is a critical question for practical deployments but it has not received much attention. This paper introduces the novel problem of searching and ranking models based on suitability relative to a target dataset and pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00711","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:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiMJRk7d03yV5BWozJVU+oPgB+wG9Jhh+0O8j2BLrJVs3OUPi/MQEWk4h6UXcMYBtBEDxFX7RcQ4o+mrexItDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:38:20.965934Z"},"content_sha256":"31e89840e3a59ae71897ba5198850cb6ff50e3cd9f0d6efa2734fd5bf8913b1c","schema_version":"1.0","event_id":"sha256:31e89840e3a59ae71897ba5198850cb6ff50e3cd9f0d6efa2734fd5bf8913b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKBXE6LXMZNJ3X2ZW2HCPENSZL/bundle.json","state_url":"https://pith.science/pith/JKBXE6LXMZNJ3X2ZW2HCPENSZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKBXE6LXMZNJ3X2ZW2HCPENSZL/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-26T10:38:20Z","links":{"resolver":"https://pith.science/pith/JKBXE6LXMZNJ3X2ZW2HCPENSZL","bundle":"https://pith.science/pith/JKBXE6LXMZNJ3X2ZW2HCPENSZL/bundle.json","state":"https://pith.science/pith/JKBXE6LXMZNJ3X2ZW2HCPENSZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKBXE6LXMZNJ3X2ZW2HCPENSZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JKBXE6LXMZNJ3X2ZW2HCPENSZL","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":"5a06ff30cfcf1233bdb16d53d417083adc6bfd7aeb0e7b4a0441ebcb8f3854f4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T14:45:41Z","title_canon_sha256":"24f6bbd6714044c3da6ba4cecb44cba086bd8863fd578deddc9146dd91045f35"},"schema_version":"1.0","source":{"id":"1903.00711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00711","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00711v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00711","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"JKBXE6LXMZNJ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JKBXE6LXMZNJ3X2Z","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JKBXE6LX","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:31e89840e3a59ae71897ba5198850cb6ff50e3cd9f0d6efa2734fd5bf8913b1c","target":"graph","created_at":"2026-05-17T23:52:00Z","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":"Widespread applications of deep learning have led to a plethora of pre-trained neural network models for common tasks. Such models are often adapted from other models via transfer learning. The models may have varying training sets, training algorithms, network architectures, and hyper-parameters. For a given application, what isthe most suitable model in a model repository? This is a critical question for practical deployments but it has not received much attention. This paper introduces the novel problem of searching and ranking models based on suitability relative to a target dataset and pr","authors_text":"Linsong Chu, Mudhakar Srivatsa, Nirmit Desai, Raghu K. Ganti, Sebastian Stein","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T14:45:41Z","title":"neuralRank: Searching and ranking ANN-based model repositories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00711","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:ab1d2d5edd146c548417093d7c5f73ef9b83875daddbb27d143a60a6801b50b2","target":"record","created_at":"2026-05-17T23:52:00Z","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":"5a06ff30cfcf1233bdb16d53d417083adc6bfd7aeb0e7b4a0441ebcb8f3854f4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-02T14:45:41Z","title_canon_sha256":"24f6bbd6714044c3da6ba4cecb44cba086bd8863fd578deddc9146dd91045f35"},"schema_version":"1.0","source":{"id":"1903.00711","kind":"arxiv","version":1}},"canonical_sha256":"4a83727977665a9ddf59b68e2791b2caf0f2e753659fd06d1546c524779633b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a83727977665a9ddf59b68e2791b2caf0f2e753659fd06d1546c524779633b8","first_computed_at":"2026-05-17T23:52:00.730221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:00.730221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8obKvCnzde1oxHpH5HSwmiWMvFxrkyWyRWqXeGkDwwX53wVopWPu2HsGSLOf2HX9Zrnie4y4P4YjE13ZhJfjAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:00.730707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab1d2d5edd146c548417093d7c5f73ef9b83875daddbb27d143a60a6801b50b2","sha256:31e89840e3a59ae71897ba5198850cb6ff50e3cd9f0d6efa2734fd5bf8913b1c"],"state_sha256":"cd458a4603511cb8cb8ad870e1c894fc4a112cef08eb62ac23aa0b65f3c25670"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btgU3LN3oApB/Hf86fZQ/u0m7n393onvU5KUmngl0vv+SVAbty4mOWPKxoo4bx9Viyh33EvB+RgHxL6bhNBWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:38:20.968779Z","bundle_sha256":"0e0140d73c6e57abbff57da5bf75301e496029e0c93dd6f8f346d36747debee1"}}