{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CPTFXWSCGSIMXT6XSA6UTRRING","short_pith_number":"pith:CPTFXWSC","schema_version":"1.0","canonical_sha256":"13e65bda423490cbcfd7903d49c62869a9315fc75056f6eb90b24d98bb828cc5","source":{"kind":"arxiv","id":"1606.05381","version":2},"attestation_state":"computed","paper":{"title":"Deep Image Set Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"I-Hong Jhuo, Jie Feng, Shih-Fu Chang, Svebor Karaman","submitted_at":"2016-06-16T23:04:02Z","abstract_excerpt":"In applications involving matching of image sets, the information from multiple images must be effectively exploited to represent each set. State-of-the-art methods use probabilistic distribution or subspace to model a set and use specific distance measure to compare two sets. These methods are slow to compute and not compact to use in a large scale scenario. Learning-based hashing is often used in large scale image retrieval as they provide a compact representation of each sample and the Hamming distance can be used to efficiently compare two samples. However, most hashing methods encode each"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.05381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-16T23:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"349c581a65c7a334fab2296be380d47d1d4af33503d86fab896674af65337461","abstract_canon_sha256":"83087d16bbd859b9a4dafa43fa299cbd48730c576eb000ba6fda55475d495c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:32.451016Z","signature_b64":"WgSOPIYnku63FUbjjwDl+clteiahszPITYzYGlve4ShhUp4WwL9LyCVmW92s+WM4q5WMzroCRzsGqCZMzJn9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e65bda423490cbcfd7903d49c62869a9315fc75056f6eb90b24d98bb828cc5","last_reissued_at":"2026-05-18T01:03:32.450294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:32.450294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Image Set Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"I-Hong Jhuo, Jie Feng, Shih-Fu Chang, Svebor Karaman","submitted_at":"2016-06-16T23:04:02Z","abstract_excerpt":"In applications involving matching of image sets, the information from multiple images must be effectively exploited to represent each set. State-of-the-art methods use probabilistic distribution or subspace to model a set and use specific distance measure to compare two sets. These methods are slow to compute and not compact to use in a large scale scenario. Learning-based hashing is often used in large scale image retrieval as they provide a compact representation of each sample and the Hamming distance can be used to efficiently compare two samples. However, most hashing methods encode each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05381","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.05381","created_at":"2026-05-18T01:03:32.450430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05381v2","created_at":"2026-05-18T01:03:32.450430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05381","created_at":"2026-05-18T01:03:32.450430+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPTFXWSCGSIM","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPTFXWSCGSIMXT6X","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPTFXWSC","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING","json":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING.json","graph_json":"https://pith.science/api/pith-number/CPTFXWSCGSIMXT6XSA6UTRRING/graph.json","events_json":"https://pith.science/api/pith-number/CPTFXWSCGSIMXT6XSA6UTRRING/events.json","paper":"https://pith.science/paper/CPTFXWSC"},"agent_actions":{"view_html":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING","download_json":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING.json","view_paper":"https://pith.science/paper/CPTFXWSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05381&json=true","fetch_graph":"https://pith.science/api/pith-number/CPTFXWSCGSIMXT6XSA6UTRRING/graph.json","fetch_events":"https://pith.science/api/pith-number/CPTFXWSCGSIMXT6XSA6UTRRING/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING/action/storage_attestation","attest_author":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING/action/author_attestation","sign_citation":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING/action/citation_signature","submit_replication":"https://pith.science/pith/CPTFXWSCGSIMXT6XSA6UTRRING/action/replication_record"}},"created_at":"2026-05-18T01:03:32.450430+00:00","updated_at":"2026-05-18T01:03:32.450430+00:00"}