{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CHETRMZ6L3QNBFXOO7WU7GRRX2","short_pith_number":"pith:CHETRMZ6","schema_version":"1.0","canonical_sha256":"11c938b33e5ee0d096ee77ed4f9a31be9ad4abf854cd9e27d2d35d40bf2089d2","source":{"kind":"arxiv","id":"1704.00860","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Feature Aggregating and Hashing for Large-scale Image Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dang-Khoa Le Tan, Ngai-Man Cheung, Thanh-Toan Do, Trung T. Pham","submitted_at":"2017-04-04T03:04:30Z","abstract_excerpt":"In most state-of-the-art hashing-based visual search systems, local image descriptors of an image are first aggregated as a single feature vector. This feature vector is then subjected to a hashing function that produces a binary hash code. In previous work, the aggregating and the hashing processes are designed independently. In this paper, we propose a novel framework where feature aggregating and hashing are designed simultaneously and optimized jointly. Specifically, our joint optimization produces aggregated representations that can be better reconstructed by some binary codes. This leads"},"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":"1704.00860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-04T03:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"aacb237d5e56b7ca75f650d4336296731fcae523f3a79a18259f9896432285fb","abstract_canon_sha256":"7b15bf3c500c3f214e1515456a3e88579b56c8e297dc9aaf48338728306ef102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:19.030443Z","signature_b64":"iCvLMdlf0x89tNx3vlAFOxCCSVVQG6ItB4Ej0WAGExyM1FeZ069LG9XqNxTnwdVEwWk3tuouhSEUdQRIhLeOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11c938b33e5ee0d096ee77ed4f9a31be9ad4abf854cd9e27d2d35d40bf2089d2","last_reissued_at":"2026-05-18T00:47:19.029752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:19.029752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Feature Aggregating and Hashing for Large-scale Image Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dang-Khoa Le Tan, Ngai-Man Cheung, Thanh-Toan Do, Trung T. Pham","submitted_at":"2017-04-04T03:04:30Z","abstract_excerpt":"In most state-of-the-art hashing-based visual search systems, local image descriptors of an image are first aggregated as a single feature vector. This feature vector is then subjected to a hashing function that produces a binary hash code. In previous work, the aggregating and the hashing processes are designed independently. In this paper, we propose a novel framework where feature aggregating and hashing are designed simultaneously and optimized jointly. Specifically, our joint optimization produces aggregated representations that can be better reconstructed by some binary codes. This leads"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00860","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.00860","created_at":"2026-05-18T00:47:19.029853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00860v1","created_at":"2026-05-18T00:47:19.029853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00860","created_at":"2026-05-18T00:47:19.029853+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHETRMZ6L3QN","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHETRMZ6L3QNBFXO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHETRMZ6","created_at":"2026-05-18T12:31:10.602751+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/CHETRMZ6L3QNBFXOO7WU7GRRX2","json":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2.json","graph_json":"https://pith.science/api/pith-number/CHETRMZ6L3QNBFXOO7WU7GRRX2/graph.json","events_json":"https://pith.science/api/pith-number/CHETRMZ6L3QNBFXOO7WU7GRRX2/events.json","paper":"https://pith.science/paper/CHETRMZ6"},"agent_actions":{"view_html":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2","download_json":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2.json","view_paper":"https://pith.science/paper/CHETRMZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00860&json=true","fetch_graph":"https://pith.science/api/pith-number/CHETRMZ6L3QNBFXOO7WU7GRRX2/graph.json","fetch_events":"https://pith.science/api/pith-number/CHETRMZ6L3QNBFXOO7WU7GRRX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2/action/storage_attestation","attest_author":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2/action/author_attestation","sign_citation":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2/action/citation_signature","submit_replication":"https://pith.science/pith/CHETRMZ6L3QNBFXOO7WU7GRRX2/action/replication_record"}},"created_at":"2026-05-18T00:47:19.029853+00:00","updated_at":"2026-05-18T00:47:19.029853+00:00"}