{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OGWBSBY5Q2DUMSXUX4E4U4MVEZ","short_pith_number":"pith:OGWBSBY5","canonical_record":{"source":{"id":"1703.05724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-03-16T17:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"597806b6ebf78e4d8d6c60b48ebdbeb2cedaa9fb75d5832211760bc3b389db74","abstract_canon_sha256":"01d3244cf9b6d0e1ca40f4878711f33182b7341d954ff6e4ee3db1267ce981d8"},"schema_version":"1.0"},"canonical_sha256":"71ac19071d8687464af4bf09ca719526693a20612fdeb4ffcdaa46396d707d26","source":{"kind":"arxiv","id":"1703.05724","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05724","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05724v1","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05724","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"OGWBSBY5Q2DU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OGWBSBY5Q2DUMSXU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OGWBSBY5","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OGWBSBY5Q2DUMSXUX4E4U4MVEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-03-16T17:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"597806b6ebf78e4d8d6c60b48ebdbeb2cedaa9fb75d5832211760bc3b389db74","abstract_canon_sha256":"01d3244cf9b6d0e1ca40f4878711f33182b7341d954ff6e4ee3db1267ce981d8"},"schema_version":"1.0"},"canonical_sha256":"71ac19071d8687464af4bf09ca719526693a20612fdeb4ffcdaa46396d707d26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:33.552251Z","signature_b64":"ctzD1EBbMG4czmJdF5QfPQ7vxYnfq2k0vTN3t0ypWIgaJevYu3+D7cC03pOY9wbNA3OIHqbNYW9hgwuPQyv9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71ac19071d8687464af4bf09ca719526693a20612fdeb4ffcdaa46396d707d26","last_reissued_at":"2026-05-18T00:48:33.551558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:33.551558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05724","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-18T00:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6o89ZioIpsJ0KeXf2WxG6TSrJWgI6cTwxD4DwPEI+8JSHZXOUy1WA03/v+UTzoBc+zjIBRI0h0V+o4wyeQ+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:50:11.390516Z"},"content_sha256":"b23cc63548c61afe2ae1b4c534be2833ecb33ac48a8e00fd13d1772ea02a6fb2","schema_version":"1.0","event_id":"sha256:b23cc63548c61afe2ae1b4c534be2833ecb33ac48a8e00fd13d1772ea02a6fb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OGWBSBY5Q2DUMSXUX4E4U4MVEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Robust Hash Codes for Multiple Instance Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amin Katouzian, Magdalini Paschali, Nassir Navab, Sailesh Conjeti","submitted_at":"2017-03-16T17:07:26Z","abstract_excerpt":"In this paper, for the first time, we introduce a multiple instance (MI) deep hashing technique for learning discriminative hash codes with weak bag-level supervision suited for large-scale retrieval. We learn such hash codes by aggregating deeply learnt hierarchical representations across bag members through a dedicated MI pool layer. For better trainability and retrieval quality, we propose a two-pronged approach that includes robust optimization and training with an auxiliary single instance hashing arm which is down-regulated gradually. We pose retrieval for tumor assessment as an MI probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05724","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-18T00:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5IZESgshReMiYZF22aVhFtAobOZK/PC0nL511zsgFxUHBLWAXMANGDeJLx1JKQi1UTPvrzuLfc69hdqhr5XAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:50:11.391233Z"},"content_sha256":"d07677e1c8f52e2bf75ef60c9df8926a62b2254c39c011d62f3707268cd8cfdd","schema_version":"1.0","event_id":"sha256:d07677e1c8f52e2bf75ef60c9df8926a62b2254c39c011d62f3707268cd8cfdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGWBSBY5Q2DUMSXUX4E4U4MVEZ/bundle.json","state_url":"https://pith.science/pith/OGWBSBY5Q2DUMSXUX4E4U4MVEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGWBSBY5Q2DUMSXUX4E4U4MVEZ/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-27T00:50:11Z","links":{"resolver":"https://pith.science/pith/OGWBSBY5Q2DUMSXUX4E4U4MVEZ","bundle":"https://pith.science/pith/OGWBSBY5Q2DUMSXUX4E4U4MVEZ/bundle.json","state":"https://pith.science/pith/OGWBSBY5Q2DUMSXUX4E4U4MVEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGWBSBY5Q2DUMSXUX4E4U4MVEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OGWBSBY5Q2DUMSXUX4E4U4MVEZ","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":"01d3244cf9b6d0e1ca40f4878711f33182b7341d954ff6e4ee3db1267ce981d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-03-16T17:07:26Z","title_canon_sha256":"597806b6ebf78e4d8d6c60b48ebdbeb2cedaa9fb75d5832211760bc3b389db74"},"schema_version":"1.0","source":{"id":"1703.05724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05724","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05724v1","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05724","created_at":"2026-05-18T00:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"OGWBSBY5Q2DU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OGWBSBY5Q2DUMSXU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OGWBSBY5","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:d07677e1c8f52e2bf75ef60c9df8926a62b2254c39c011d62f3707268cd8cfdd","target":"graph","created_at":"2026-05-18T00:48:33Z","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, for the first time, we introduce a multiple instance (MI) deep hashing technique for learning discriminative hash codes with weak bag-level supervision suited for large-scale retrieval. We learn such hash codes by aggregating deeply learnt hierarchical representations across bag members through a dedicated MI pool layer. For better trainability and retrieval quality, we propose a two-pronged approach that includes robust optimization and training with an auxiliary single instance hashing arm which is down-regulated gradually. We pose retrieval for tumor assessment as an MI probl","authors_text":"Amin Katouzian, Magdalini Paschali, Nassir Navab, Sailesh Conjeti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-03-16T17:07:26Z","title":"Learning Robust Hash Codes for Multiple Instance Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05724","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:b23cc63548c61afe2ae1b4c534be2833ecb33ac48a8e00fd13d1772ea02a6fb2","target":"record","created_at":"2026-05-18T00:48:33Z","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":"01d3244cf9b6d0e1ca40f4878711f33182b7341d954ff6e4ee3db1267ce981d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-03-16T17:07:26Z","title_canon_sha256":"597806b6ebf78e4d8d6c60b48ebdbeb2cedaa9fb75d5832211760bc3b389db74"},"schema_version":"1.0","source":{"id":"1703.05724","kind":"arxiv","version":1}},"canonical_sha256":"71ac19071d8687464af4bf09ca719526693a20612fdeb4ffcdaa46396d707d26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71ac19071d8687464af4bf09ca719526693a20612fdeb4ffcdaa46396d707d26","first_computed_at":"2026-05-18T00:48:33.551558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:33.551558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ctzD1EBbMG4czmJdF5QfPQ7vxYnfq2k0vTN3t0ypWIgaJevYu3+D7cC03pOY9wbNA3OIHqbNYW9hgwuPQyv9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:33.552251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b23cc63548c61afe2ae1b4c534be2833ecb33ac48a8e00fd13d1772ea02a6fb2","sha256:d07677e1c8f52e2bf75ef60c9df8926a62b2254c39c011d62f3707268cd8cfdd"],"state_sha256":"e191df39fde883e81c05fd31f441a2e99479d6493fab29478e716be5e17e1948"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtwY/Uau3QKvGUeBdKJwr8BWY2qNP0yqEYv6tgeEsGU+MBL5GJL+joi4CKDIjQfpOmXmAhcAwzTuzIRpkTwWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:50:11.394843Z","bundle_sha256":"6fe9e18986cdfa4986fbcbde9100253038d0f41d28790d04ad2bc5ba92b0b86b"}}