{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KUBFIXJROZDTWSZS3DH3WDCIY7","short_pith_number":"pith:KUBFIXJR","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"},"canonical_sha256":"5502545d3176473b4b32d8cfbb0c48c7e91daaa41ca3d2100af81a84459b33be","source":{"kind":"arxiv","id":"1904.02749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02749","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02749v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02749","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"KUBFIXJROZDT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KUBFIXJROZDTWSZS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KUBFIXJR","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KUBFIXJROZDTWSZS3DH3WDCIY7","target":"record","payload":{"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"},"canonical_sha256":"5502545d3176473b4b32d8cfbb0c48c7e91daaa41ca3d2100af81a84459b33be","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"},"source_kind":"arxiv","source_id":"1904.02749","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:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bV9ydgGFQN18+ifyfmjLZb8u9SIQBBWLT0T0Q+OTuzaaomtbAyleuDfBcQiZ1vsHLoxAHGUi0pbfWE1WjJk5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T12:58:11.562309Z"},"content_sha256":"a7ab0134489ef13271f2ee6bd0eae5ffdbb4c4897bbed3272f7801e4026d41ad","schema_version":"1.0","event_id":"sha256:a7ab0134489ef13271f2ee6bd0eae5ffdbb4c4897bbed3272f7801e4026d41ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KUBFIXJROZDTWSZS3DH3WDCIY7","target":"graph","payload":{"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"},"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:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ex+jDF99J9V+LjipxPlrJD4C36iQ8QpYEAlld6SgduD2ErrKqg8eEET7iDPZ5Xcl91O4xuy4piGDK56/2QXAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T12:58:11.562679Z"},"content_sha256":"509f1fccbb177d9779b72a4863a83c0a3b45cca924f3c47dc48956e43dba109a","schema_version":"1.0","event_id":"sha256:509f1fccbb177d9779b72a4863a83c0a3b45cca924f3c47dc48956e43dba109a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/bundle.json","state_url":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/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-19T12:58:11Z","links":{"resolver":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7","bundle":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/bundle.json","state":"https://pith.science/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUBFIXJROZDTWSZS3DH3WDCIY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KUBFIXJROZDTWSZS3DH3WDCIY7","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":"2b84ff95142d2363ae923b0a78945f85a263ded0916b4b80c0cfd6c9c15dae5a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T19:01:35Z","title_canon_sha256":"07103d0d86857c5ec436a358438bc53237ad8459ffe96a036aa40cb3edf6915d"},"schema_version":"1.0","source":{"id":"1904.02749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02749","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02749v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02749","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"KUBFIXJROZDT","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KUBFIXJROZDTWSZS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KUBFIXJR","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:509f1fccbb177d9779b72a4863a83c0a3b45cca924f3c47dc48956e43dba109a","target":"graph","created_at":"2026-05-17T23:47:01Z","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":"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","authors_text":"Chen Change Loy, Dahua Lin, Dapeng Chen, Junjie Yan, Lei Yang, Xiaohang Zhan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T19:01:35Z","title":"Learning to Cluster Faces on an Affinity Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02749","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:a7ab0134489ef13271f2ee6bd0eae5ffdbb4c4897bbed3272f7801e4026d41ad","target":"record","created_at":"2026-05-17T23:47:01Z","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":"2b84ff95142d2363ae923b0a78945f85a263ded0916b4b80c0cfd6c9c15dae5a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-04T19:01:35Z","title_canon_sha256":"07103d0d86857c5ec436a358438bc53237ad8459ffe96a036aa40cb3edf6915d"},"schema_version":"1.0","source":{"id":"1904.02749","kind":"arxiv","version":2}},"canonical_sha256":"5502545d3176473b4b32d8cfbb0c48c7e91daaa41ca3d2100af81a84459b33be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5502545d3176473b4b32d8cfbb0c48c7e91daaa41ca3d2100af81a84459b33be","first_computed_at":"2026-05-17T23:47:01.467199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:01.467199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KCqs0wvvGyi/TjUCYNM8YHg5SOHlegx2hd8T/G93BQjcc0UQVlQFCAb9dfweQKbK8bo3V/1na5LppHDMJqCBCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:01.467935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7ab0134489ef13271f2ee6bd0eae5ffdbb4c4897bbed3272f7801e4026d41ad","sha256:509f1fccbb177d9779b72a4863a83c0a3b45cca924f3c47dc48956e43dba109a"],"state_sha256":"bf54ba163e2a0b5e3407647164427ef15bd48071828f493d1fd0a3b53de5f416"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIZDVq3QRjhSo4PfIzxwlBdd/Ko7WkeEkm5pekPB007ealpjg85m8x5FAKHAhiduBy20mw9nji9eUxOTck18Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T12:58:11.564680Z","bundle_sha256":"4793d598821f080e0af96615b6be9570604b5b8b9fc4989e44c562edaf6c2586"}}