{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F5FOEV7FTKFGIDVWCSY4Q22BQL","short_pith_number":"pith:F5FOEV7F","schema_version":"1.0","canonical_sha256":"2f4ae257e59a8a640eb614b1c86b4182cc3f22cc0bccb0c4227cf3a4cc517a2e","source":{"kind":"arxiv","id":"1806.00365","version":1},"attestation_state":"computed","paper":{"title":"Accurate and Efficient Similarity Search for Large Scale Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ce Qi, Fei Su, Zhizhong Liu","submitted_at":"2018-06-01T14:13:56Z","abstract_excerpt":"Face verification is a relatively easy task with the help of discriminative features from deep neural networks. However, it is still a challenge to recognize faces on millions of identities while keeping high performance and efficiency. The challenge 2 of MS-Celeb-1M is a classification task. However, the number of identities is too large and it is not that elegant to treat the task as an image classification task. We treat the classification task as similarity search and do experiments on different similarity search strategies. Similarity search strategy accelerates the speed of searching and"},"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":"1806.00365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-01T14:13:56Z","cross_cats_sorted":[],"title_canon_sha256":"235ab63906512c3c23fcab5643c6bc21296c065673a167a9b586eb1f393d1b59","abstract_canon_sha256":"4b4d11f31b82347ca69635c5c12903a2973682a87852a46d231544b0014deccd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:23.872379Z","signature_b64":"Iseg1AwOcLqFdyySc4YGaSlQYnticpNm/vxX8ZSxWzItXEIFM+Y6OTnzFiveq9hVSCtag8o1SMC9I216rNfyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f4ae257e59a8a640eb614b1c86b4182cc3f22cc0bccb0c4227cf3a4cc517a2e","last_reissued_at":"2026-05-18T00:14:23.871652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:23.871652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accurate and Efficient Similarity Search for Large Scale Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ce Qi, Fei Su, Zhizhong Liu","submitted_at":"2018-06-01T14:13:56Z","abstract_excerpt":"Face verification is a relatively easy task with the help of discriminative features from deep neural networks. However, it is still a challenge to recognize faces on millions of identities while keeping high performance and efficiency. The challenge 2 of MS-Celeb-1M is a classification task. However, the number of identities is too large and it is not that elegant to treat the task as an image classification task. We treat the classification task as similarity search and do experiments on different similarity search strategies. Similarity search strategy accelerates the speed of searching and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00365","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":"1806.00365","created_at":"2026-05-18T00:14:23.871760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00365v1","created_at":"2026-05-18T00:14:23.871760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00365","created_at":"2026-05-18T00:14:23.871760+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5FOEV7FTKFG","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5FOEV7FTKFGIDVW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5FOEV7F","created_at":"2026-05-18T12:32:22.470017+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/F5FOEV7FTKFGIDVWCSY4Q22BQL","json":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL.json","graph_json":"https://pith.science/api/pith-number/F5FOEV7FTKFGIDVWCSY4Q22BQL/graph.json","events_json":"https://pith.science/api/pith-number/F5FOEV7FTKFGIDVWCSY4Q22BQL/events.json","paper":"https://pith.science/paper/F5FOEV7F"},"agent_actions":{"view_html":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL","download_json":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL.json","view_paper":"https://pith.science/paper/F5FOEV7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00365&json=true","fetch_graph":"https://pith.science/api/pith-number/F5FOEV7FTKFGIDVWCSY4Q22BQL/graph.json","fetch_events":"https://pith.science/api/pith-number/F5FOEV7FTKFGIDVWCSY4Q22BQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL/action/storage_attestation","attest_author":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL/action/author_attestation","sign_citation":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL/action/citation_signature","submit_replication":"https://pith.science/pith/F5FOEV7FTKFGIDVWCSY4Q22BQL/action/replication_record"}},"created_at":"2026-05-18T00:14:23.871760+00:00","updated_at":"2026-05-18T00:14:23.871760+00:00"}