{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KUBFIXJROZDTWSZS3DH3WDCIY7","short_pith_number":"pith:KUBFIXJR","schema_version":"1.0","canonical_sha256":"5502545d3176473b4b32d8cfbb0c48c7e91daaa41ca3d2100af81a84459b33be","source":{"kind":"arxiv","id":"1904.02749","version":2},"attestation_state":"computed","paper":{"title":"Learning to Cluster Faces on an Affinity Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chen Change Loy, Dahua Lin, Dapeng Chen, Junjie Yan, Lei Yang, Xiaohang Zhan","submitted_at":"2019-04-04T19:01:35Z","abstract_excerpt":"Face recognition sees remarkable progress in recent years, and its performance has reached a very high level. Taking it to a next level requires substantially larger data, which would involve prohibitive annotation cost. Hence, exploiting unlabeled data becomes an appealing alternative. Recent works have shown that clustering unlabeled faces is a promising approach, often leading to notable performance gains. Yet, how to effectively cluster, especially on a large-scale (i.e. million-level or above) dataset, remains an open question. A key challenge lies in the complex variations of cluster pat"},"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":"1904.02749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T19:01:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"07103d0d86857c5ec436a358438bc53237ad8459ffe96a036aa40cb3edf6915d","abstract_canon_sha256":"2b84ff95142d2363ae923b0a78945f85a263ded0916b4b80c0cfd6c9c15dae5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:01.467935Z","signature_b64":"KCqs0wvvGyi/TjUCYNM8YHg5SOHlegx2hd8T/G93BQjcc0UQVlQFCAb9dfweQKbK8bo3V/1na5LppHDMJqCBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5502545d3176473b4b32d8cfbb0c48c7e91daaa41ca3d2100af81a84459b33be","last_reissued_at":"2026-05-17T23:47:01.467199Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:01.467199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Cluster Faces on an Affinity Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chen Change Loy, Dahua Lin, Dapeng Chen, Junjie Yan, Lei Yang, Xiaohang Zhan","submitted_at":"2019-04-04T19:01:35Z","abstract_excerpt":"Face recognition sees remarkable progress in recent years, and its performance has reached a very high level. Taking it to a next level requires substantially larger data, which would involve prohibitive annotation cost. Hence, exploiting unlabeled data becomes an appealing alternative. Recent works have shown that clustering unlabeled faces is a promising approach, often leading to notable performance gains. Yet, how to effectively cluster, especially on a large-scale (i.e. million-level or above) dataset, remains an open question. A key challenge lies in the complex variations of cluster pat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02749","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":"1904.02749","created_at":"2026-05-17T23:47:01.467310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02749v2","created_at":"2026-05-17T23:47:01.467310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02749","created_at":"2026-05-17T23:47:01.467310+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUBFIXJROZDT","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUBFIXJROZDTWSZS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUBFIXJR","created_at":"2026-05-18T12:33:21.387695+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/KUBFIXJROZDTWSZS3DH3WDCIY7","json":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7.json","graph_json":"https://pith.science/api/pith-number/KUBFIXJROZDTWSZS3DH3WDCIY7/graph.json","events_json":"https://pith.science/api/pith-number/KUBFIXJROZDTWSZS3DH3WDCIY7/events.json","paper":"https://pith.science/paper/KUBFIXJR"},"agent_actions":{"view_html":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7","download_json":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7.json","view_paper":"https://pith.science/paper/KUBFIXJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02749&json=true","fetch_graph":"https://pith.science/api/pith-number/KUBFIXJROZDTWSZS3DH3WDCIY7/graph.json","fetch_events":"https://pith.science/api/pith-number/KUBFIXJROZDTWSZS3DH3WDCIY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/action/storage_attestation","attest_author":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/action/author_attestation","sign_citation":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/action/citation_signature","submit_replication":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/action/replication_record"}},"created_at":"2026-05-17T23:47:01.467310+00:00","updated_at":"2026-05-17T23:47:01.467310+00:00"}