{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:KSSC3CCKACS3PYPCAF4GKT6Q2M","short_pith_number":"pith:KSSC3CCK","canonical_record":{"source":{"id":"2208.04352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-08T18:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"1a8fb29ee5f79e174a81cc86c879bf830d4423d7a51e1d989ab328cdd5034203","abstract_canon_sha256":"67be066215a89611da4bc99593ae2ba8f0bde09b6665d837232bd70d27eb2d70"},"schema_version":"1.0"},"canonical_sha256":"54a42d884a00a5b7e1e20178654fd0d3102c2110ad2c44e25ef795beec9cdc07","source":{"kind":"arxiv","id":"2208.04352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.04352","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"2208.04352v1","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04352","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"KSSC3CCKACS3","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"pith_short_16","alias_value":"KSSC3CCKACS3PYPC","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"pith_short_8","alias_value":"KSSC3CCK","created_at":"2026-07-05T04:46:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:KSSC3CCKACS3PYPCAF4GKT6Q2M","target":"record","payload":{"canonical_record":{"source":{"id":"2208.04352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-08T18:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"1a8fb29ee5f79e174a81cc86c879bf830d4423d7a51e1d989ab328cdd5034203","abstract_canon_sha256":"67be066215a89611da4bc99593ae2ba8f0bde09b6665d837232bd70d27eb2d70"},"schema_version":"1.0"},"canonical_sha256":"54a42d884a00a5b7e1e20178654fd0d3102c2110ad2c44e25ef795beec9cdc07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:46:55.734186Z","signature_b64":"cESIa33Vo+cnOJcyBoVZyTQ8bGQyrf/wxYG445x6SU6+NTjVfWte8/1yEx4ZaTVQJUKsPdFfn8jKdDDo2KcgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54a42d884a00a5b7e1e20178654fd0d3102c2110ad2c44e25ef795beec9cdc07","last_reissued_at":"2026-07-05T04:46:55.733762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:46:55.733762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.04352","source_version":1,"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-07-05T04:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9Trxrz7qWfubi0HAL8Qrsdu75GKk8j8A4Nu8MpmELMz3ut7mcg4QHa9HCl9sHtnf4fUsp788BYnoGA4lq7LCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:09:10.276671Z"},"content_sha256":"901dc1f77c4c92b6f540f510ecb85e40054f69f3eeb3bbcff3d63867fa381a8b","schema_version":"1.0","event_id":"sha256:901dc1f77c4c92b6f540f510ecb85e40054f69f3eeb3bbcff3d63867fa381a8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:KSSC3CCKACS3PYPCAF4GKT6Q2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rethinking Robust Representation Learning Under Fine-grained Noisy Faces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bingqi Ma, Boxiao Liu, Guanglu Song, Yu Liu","submitted_at":"2022-08-08T18:18:57Z","abstract_excerpt":"Learning robust feature representation from large-scale noisy faces stands out as one of the key challenges in high-performance face recognition. Recent attempts have been made to cope with this challenge by alleviating the intra-class conflict and inter-class conflict. However, the unconstrained noise type in each conflict still makes it difficult for these algorithms to perform well. To better understand this, we reformulate the noise type of each class in a more fine-grained manner as N-identities|K^C-clusters. Different types of noisy faces can be generated by adjusting the values of \\nkc."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04352","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.04352/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnEVa9lFXYzeBQONCpdrbym6edbPHL+pgl1Y6GUR3cRnbOHBQVNiS+i/tB0CraEQZpi0aPH2ipvZyy+ynJlKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:09:10.277072Z"},"content_sha256":"f278a7f5df32e81f6da60649dd1df2d78848c2ae21a1f31542234b3782c6c0cd","schema_version":"1.0","event_id":"sha256:f278a7f5df32e81f6da60649dd1df2d78848c2ae21a1f31542234b3782c6c0cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSSC3CCKACS3PYPCAF4GKT6Q2M/bundle.json","state_url":"https://pith.science/pith/KSSC3CCKACS3PYPCAF4GKT6Q2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSSC3CCKACS3PYPCAF4GKT6Q2M/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-07-07T06:09:10Z","links":{"resolver":"https://pith.science/pith/KSSC3CCKACS3PYPCAF4GKT6Q2M","bundle":"https://pith.science/pith/KSSC3CCKACS3PYPCAF4GKT6Q2M/bundle.json","state":"https://pith.science/pith/KSSC3CCKACS3PYPCAF4GKT6Q2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSSC3CCKACS3PYPCAF4GKT6Q2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KSSC3CCKACS3PYPCAF4GKT6Q2M","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":"67be066215a89611da4bc99593ae2ba8f0bde09b6665d837232bd70d27eb2d70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-08T18:18:57Z","title_canon_sha256":"1a8fb29ee5f79e174a81cc86c879bf830d4423d7a51e1d989ab328cdd5034203"},"schema_version":"1.0","source":{"id":"2208.04352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.04352","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"2208.04352v1","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04352","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"KSSC3CCKACS3","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"pith_short_16","alias_value":"KSSC3CCKACS3PYPC","created_at":"2026-07-05T04:46:55Z"},{"alias_kind":"pith_short_8","alias_value":"KSSC3CCK","created_at":"2026-07-05T04:46:55Z"}],"graph_snapshots":[{"event_id":"sha256:f278a7f5df32e81f6da60649dd1df2d78848c2ae21a1f31542234b3782c6c0cd","target":"graph","created_at":"2026-07-05T04:46:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.04352/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning robust feature representation from large-scale noisy faces stands out as one of the key challenges in high-performance face recognition. Recent attempts have been made to cope with this challenge by alleviating the intra-class conflict and inter-class conflict. However, the unconstrained noise type in each conflict still makes it difficult for these algorithms to perform well. To better understand this, we reformulate the noise type of each class in a more fine-grained manner as N-identities|K^C-clusters. Different types of noisy faces can be generated by adjusting the values of \\nkc.","authors_text":"Bingqi Ma, Boxiao Liu, Guanglu Song, Yu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-08T18:18:57Z","title":"Rethinking Robust Representation Learning Under Fine-grained Noisy Faces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04352","kind":"arxiv","version":1},"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:901dc1f77c4c92b6f540f510ecb85e40054f69f3eeb3bbcff3d63867fa381a8b","target":"record","created_at":"2026-07-05T04:46:55Z","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":"67be066215a89611da4bc99593ae2ba8f0bde09b6665d837232bd70d27eb2d70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-08T18:18:57Z","title_canon_sha256":"1a8fb29ee5f79e174a81cc86c879bf830d4423d7a51e1d989ab328cdd5034203"},"schema_version":"1.0","source":{"id":"2208.04352","kind":"arxiv","version":1}},"canonical_sha256":"54a42d884a00a5b7e1e20178654fd0d3102c2110ad2c44e25ef795beec9cdc07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54a42d884a00a5b7e1e20178654fd0d3102c2110ad2c44e25ef795beec9cdc07","first_computed_at":"2026-07-05T04:46:55.733762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:46:55.733762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cESIa33Vo+cnOJcyBoVZyTQ8bGQyrf/wxYG445x6SU6+NTjVfWte8/1yEx4ZaTVQJUKsPdFfn8jKdDDo2KcgCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:46:55.734186Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.04352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:901dc1f77c4c92b6f540f510ecb85e40054f69f3eeb3bbcff3d63867fa381a8b","sha256:f278a7f5df32e81f6da60649dd1df2d78848c2ae21a1f31542234b3782c6c0cd"],"state_sha256":"42e23a66c3b6abd44ff4a41e486568d1488bf8d008a27fffec405e05077a7061"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XALbTAOsBtDygEwZF6I73w8AKFokPZ7eb/WPdR0CFW7wdXPu2vK+P6jJl3tk2NdXcHRTqhhrUFyyQEw9jC9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:09:10.279822Z","bundle_sha256":"712f6b83fcc90cbb4917d6f572d0bf7e750974c3691007111a31bd2e7521979e"}}