{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/ijb-b/papers/ran/1","list_of":"/dataset/ijb-b","dataset":"IJB-B","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,6],"of":6,"counts":{"papers_with_a_benchmark_row":13,"with_a_code_link":13,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":13,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/ijb-b/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/edgeface-efficient-face-recognition-model-for","slug":"edgeface-efficient-face-recognition-model-for","title":"EdgeFace: Efficient Face Recognition Model for Edge Devices","date":"2023-07-04","arxiv_id":"2307.01838","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["otroshi/edgeface"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/edgeface-efficient-face-recognition-model-for#ran","syntology_url":"https://syntology.ai/paper/2307.01838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.01838"}}}},{"paper":"/paper/cluster-and-aggregate-face-recognition-with","slug":"cluster-and-aggregate-face-recognition-with","title":"Cluster and Aggregate: Face Recognition with Large Probe Set","date":"2022-10-19","arxiv_id":"2210.10864","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":6,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mk-minchul/caface"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cluster-and-aggregate-face-recognition-with#ran","syntology_url":"https://syntology.ai/paper/2210.10864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10864"}}}},{"paper":"/paper/adaface-quality-adaptive-margin-for-face","slug":"adaface-quality-adaptive-margin-for-face","title":"AdaFace: Quality Adaptive Margin for Face Recognition","date":"2022-04-03","arxiv_id":"2204.00964","rows_on_this_dataset":5,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":22,"samples_ran":17,"samples_constructed":2,"samples_ran_checked":14,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":11,"official":{"repos":["mk-minchul/adaface"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adaface-quality-adaptive-margin-for-face#ran","syntology_url":"https://syntology.ai/paper/2204.00964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.00964"}}}},{"paper":"/paper/killing-two-birds-with-one-stone-efficient","slug":"killing-two-birds-with-one-stone-efficient","title":"Killing Two Birds with One Stone:Efficient and Robust Training of Face Recognition CNNs by Partial FC","date":"2022-03-28","arxiv_id":"2203.15565","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":10,"samples_constructed":3,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":{"repos":["deepinsight/insightface"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/killing-two-birds-with-one-stone-efficient#ran","syntology_url":"https://syntology.ai/paper/2203.15565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15565"}}}},{"paper":"/paper/unified-negative-pair-generation-toward-well","slug":"unified-negative-pair-generation-toward-well","title":"Unified Negative Pair Generation toward Well-discriminative Feature Space for Face Recognition","date":"2022-03-22","arxiv_id":"2203.11593","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["jung-jun-uk/unpg"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unified-negative-pair-generation-toward-well#ran","syntology_url":"https://syntology.ai/paper/2203.11593","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11593"}}}},{"paper":"/paper/vggface2-a-dataset-for-recognising-faces","slug":"vggface2-a-dataset-for-recognising-faces","title":"VGGFace2: A dataset for recognising faces across pose and age","date":"2017-10-23","arxiv_id":"1710.08092","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":4,"samples_unverified":3,"pointer_only_for_licence":6,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/vggface2-a-dataset-for-recognising-faces#ran","syntology_url":"https://syntology.ai/paper/1710.08092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.08092"}}}}],"record_sha256":"908265a428754b451b29a0bff5b108377a6dcf2fa3cbc37db44dccbc545ab716","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}