{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FVTFDIK52TLJFXW25JDPQXQMAN","short_pith_number":"pith:FVTFDIK5","canonical_record":{"source":{"id":"1711.00888","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-02T18:57:43Z","cross_cats_sorted":["cs.LG","cs.MM"],"title_canon_sha256":"b6d9fa3820519ef89036a3d4ac362ceabfb82ba06aa48076273d5202ec9ec320","abstract_canon_sha256":"95b4e0bf7e7bf3880d22735ec6459ab0fb971cd36a2e5fc63c3d72c8b78d6a2c"},"schema_version":"1.0"},"canonical_sha256":"2d6651a15dd4d692dedaea46f85e0c035a5dd3559be4142b0c0742c4d31ee3dc","source":{"kind":"arxiv","id":"1711.00888","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00888","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00888v2","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00888","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"FVTFDIK52TLJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVTFDIK52TLJFXW2","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVTFDIK5","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FVTFDIK52TLJFXW25JDPQXQMAN","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00888","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-02T18:57:43Z","cross_cats_sorted":["cs.LG","cs.MM"],"title_canon_sha256":"b6d9fa3820519ef89036a3d4ac362ceabfb82ba06aa48076273d5202ec9ec320","abstract_canon_sha256":"95b4e0bf7e7bf3880d22735ec6459ab0fb971cd36a2e5fc63c3d72c8b78d6a2c"},"schema_version":"1.0"},"canonical_sha256":"2d6651a15dd4d692dedaea46f85e0c035a5dd3559be4142b0c0742c4d31ee3dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:48.480530Z","signature_b64":"8BgwZrmaP5vZwKey3KYdAaXIWM8CN+Sw+TxYdifPzmE20XHfv5K7LBHvSngE/r05BPnl+6NfLVHP/mbEdg7zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6651a15dd4d692dedaea46f85e0c035a5dd3559be4142b0c0742c4d31ee3dc","last_reissued_at":"2026-05-17T23:44:48.480110Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:48.480110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00888","source_version":2,"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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3C1Ta7UWWuslXvZdGkyQv4lP0l+qWhRYrJsJi83vmxsdR6+dcPrdtdX1/yUVJ6ZAD4Kl0n8ig4wgd+w4idTJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:55:48.128801Z"},"content_sha256":"c6d89560aa55f6acf9f0ec639701d727aac2b1cee8150a26fa1c10e1f6267d1e","schema_version":"1.0","event_id":"sha256:c6d89560aa55f6acf9f0ec639701d727aac2b1cee8150a26fa1c10e1f6267d1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FVTFDIK52TLJFXW25JDPQXQMAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Set-to-Set Hashing with Applications in Visual Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MM"],"primary_cat":"cs.CV","authors_text":"I-Hong Jhuo, Jun Wang","submitted_at":"2017-11-02T18:57:43Z","abstract_excerpt":"Visual data, such as an image or a sequence of video frames, is often naturally represented as a point set. In this paper, we consider the fundamental problem of finding a nearest set from a collection of sets, to a query set. This problem has obvious applications in large-scale visual retrieval and recognition, and also in applied fields beyond computer vision. One challenge stands out in solving the problem---set representation and measure of similarity. Particularly, the query set and the sets in dataset collection can have varying cardinalities. The training collection is large enough such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00888","kind":"arxiv","version":2},"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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WRsfNStWsrfV+DmfukfiEOBlxCKB2F5kAyVawVL/5fnAwfJXmuBDIbnTGuc1kOIqtlJ95YaBe2/2WxZ9/CLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:55:48.129430Z"},"content_sha256":"e2b110fdfecc1feab8884a1e2404a55a581675e10bccedcd0cdb73be7ab093ed","schema_version":"1.0","event_id":"sha256:e2b110fdfecc1feab8884a1e2404a55a581675e10bccedcd0cdb73be7ab093ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVTFDIK52TLJFXW25JDPQXQMAN/bundle.json","state_url":"https://pith.science/pith/FVTFDIK52TLJFXW25JDPQXQMAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVTFDIK52TLJFXW25JDPQXQMAN/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-26T05:55:48Z","links":{"resolver":"https://pith.science/pith/FVTFDIK52TLJFXW25JDPQXQMAN","bundle":"https://pith.science/pith/FVTFDIK52TLJFXW25JDPQXQMAN/bundle.json","state":"https://pith.science/pith/FVTFDIK52TLJFXW25JDPQXQMAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVTFDIK52TLJFXW25JDPQXQMAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FVTFDIK52TLJFXW25JDPQXQMAN","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":"95b4e0bf7e7bf3880d22735ec6459ab0fb971cd36a2e5fc63c3d72c8b78d6a2c","cross_cats_sorted":["cs.LG","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-02T18:57:43Z","title_canon_sha256":"b6d9fa3820519ef89036a3d4ac362ceabfb82ba06aa48076273d5202ec9ec320"},"schema_version":"1.0","source":{"id":"1711.00888","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00888","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00888v2","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00888","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"FVTFDIK52TLJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVTFDIK52TLJFXW2","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVTFDIK5","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:e2b110fdfecc1feab8884a1e2404a55a581675e10bccedcd0cdb73be7ab093ed","target":"graph","created_at":"2026-05-17T23:44:48Z","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":"Visual data, such as an image or a sequence of video frames, is often naturally represented as a point set. In this paper, we consider the fundamental problem of finding a nearest set from a collection of sets, to a query set. This problem has obvious applications in large-scale visual retrieval and recognition, and also in applied fields beyond computer vision. One challenge stands out in solving the problem---set representation and measure of similarity. Particularly, the query set and the sets in dataset collection can have varying cardinalities. The training collection is large enough such","authors_text":"I-Hong Jhuo, Jun Wang","cross_cats":["cs.LG","cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-02T18:57:43Z","title":"Set-to-Set Hashing with Applications in Visual Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00888","kind":"arxiv","version":2},"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:c6d89560aa55f6acf9f0ec639701d727aac2b1cee8150a26fa1c10e1f6267d1e","target":"record","created_at":"2026-05-17T23:44:48Z","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":"95b4e0bf7e7bf3880d22735ec6459ab0fb971cd36a2e5fc63c3d72c8b78d6a2c","cross_cats_sorted":["cs.LG","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-02T18:57:43Z","title_canon_sha256":"b6d9fa3820519ef89036a3d4ac362ceabfb82ba06aa48076273d5202ec9ec320"},"schema_version":"1.0","source":{"id":"1711.00888","kind":"arxiv","version":2}},"canonical_sha256":"2d6651a15dd4d692dedaea46f85e0c035a5dd3559be4142b0c0742c4d31ee3dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d6651a15dd4d692dedaea46f85e0c035a5dd3559be4142b0c0742c4d31ee3dc","first_computed_at":"2026-05-17T23:44:48.480110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:48.480110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8BgwZrmaP5vZwKey3KYdAaXIWM8CN+Sw+TxYdifPzmE20XHfv5K7LBHvSngE/r05BPnl+6NfLVHP/mbEdg7zDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:48.480530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00888","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6d89560aa55f6acf9f0ec639701d727aac2b1cee8150a26fa1c10e1f6267d1e","sha256:e2b110fdfecc1feab8884a1e2404a55a581675e10bccedcd0cdb73be7ab093ed"],"state_sha256":"b40bf880cadde0a05cdc4071791940734a445a91b83ef0e8e3a0a61a7454ce37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sV8xMtt/2MJkmNlYmOQsx1jycQIPxCSawrUAm8tYd+ufK5hHfh/HpWJcJhTpbw5OXuQpwJSR1J3KtRzMpKHTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:55:48.132550Z","bundle_sha256":"8c82d633c0f24c5609e70a69f121db783312172d282a29dfd0439ba5e77fb34c"}}