{"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/cc152k/papers/ran/1","list_of":"/dataset/cc152k","dataset":"CC152K","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":15,"with_a_code_link":11,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":15,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/cc152k/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/recon-enhancing-true-correspondence-1","slug":"recon-enhancing-true-correspondence-1","title":"ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence Learning","date":"2025-02-27","arxiv_id":"2502.19962","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":1,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["qxzha/ReCon"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recon-enhancing-true-correspondence-1#ran","syntology_url":"https://syntology.ai/paper/2502.19962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19962"}}}},{"paper":"/paper/mitigating-noisy-correspondence-by","slug":"mitigating-noisy-correspondence-by","title":"Mitigating Noisy Correspondence by Geometrical Structure Consistency Learning","date":"2024-05-27","arxiv_id":"2405.16996","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":6,"official":{"repos":["MediaBrain-SJTU/GSC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mitigating-noisy-correspondence-by#ran","syntology_url":"https://syntology.ai/paper/2405.16996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16996"}}}},{"paper":"/paper/learning-to-rematch-mismatched-pairs-for","slug":"learning-to-rematch-mismatched-pairs-for","title":"Learning to Rematch Mismatched Pairs for Robust Cross-Modal Retrieval","date":"2024-03-08","arxiv_id":"2403.05105","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":6,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":10,"official":{"repos":["hhc1997/l2rm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":6,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-rematch-mismatched-pairs-for#ran","syntology_url":"https://syntology.ai/paper/2403.05105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05105"}}}},{"paper":"/paper/cross-modal-active-complementary-learning-1","slug":"cross-modal-active-complementary-learning-1","title":"Cross-modal Active Complementary Learning with Self-refining Correspondence","date":"2023-10-26","arxiv_id":"2310.17468","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":28,"samples_ran":23,"samples_constructed":8,"samples_ran_checked":17,"samples_ran_instrument_failed":6,"samples_unverified":5,"pointer_only_for_licence":28,"official":{"repos":["qinyang79/crcl"],"state":"official (archive's flag): 22 ran","n_ran":22,"n_constructed":8,"n_ran_no_instrument_failure":17,"n_unverified":5,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cross-modal-active-complementary-learning-1#ran","syntology_url":"https://syntology.ai/paper/2310.17468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17468"}}}},{"paper":"/paper/noisy-correspondence-learning-with-meta","slug":"noisy-correspondence-learning-with-meta","title":"Noisy Correspondence Learning with Meta Similarity Correction","date":"2023-04-13","arxiv_id":"2304.06275","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["hhc1997/mscn"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/noisy-correspondence-learning-with-meta#ran","syntology_url":"https://syntology.ai/paper/2304.06275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.06275"}}}},{"paper":"/paper/bicro-noisy-correspondence-rectification-for","slug":"bicro-noisy-correspondence-rectification-for","title":"BiCro: Noisy Correspondence Rectification for Multi-modality Data via Bi-directional Cross-modal Similarity Consistency","date":"2023-03-22","arxiv_id":"2303.12419","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":5,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":11,"official":{"repos":["xu5zhao/bicro"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"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/bicro-noisy-correspondence-rectification-for#ran","syntology_url":"https://syntology.ai/paper/2303.12419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12419"}}}}],"record_sha256":"03558d5b37e8accd1c05886c0ec4a4f3e2c1bc7d0a1681758f4dcc2a7297920d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}