{"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":"/code/train-clf","entry":"train_clf","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":3},"key_notes":{"n_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'","n_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2410.02116","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-via-knowledge","title":"Dataset Distillation via Knowledge Distillation: Towards Efficient Self-Supervised Pre-Training of Deep Networks","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BigML-CS-UCLA/MKDT","path":"evaluation/linear_evaluation.py","file_url":"https://github.com/BigML-CS-UCLA/MKDT/blob/HEAD/evaluation/linear_evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, BigML-CS-UCLA/MKDT when it was checked","code_sha256":"9fca0e5d57b72af3","code_sha256_prefix":"9fca0e5d57b72af3","mcp_get_code":{"code_sha256":"9fca0e5d57b72af3"}},{"arxiv_id":"2404.13736","arxiv_id_is_arxiv":true,"paper":"/paper/interval-abstractions-for-robust","title":"Interval Abstractions for Robust Counterfactual Explanations","date":"2024-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junqi-jiang/interval-abstractions","path":"intabs/classifier_binary.py","file_url":"https://github.com/junqi-jiang/interval-abstractions/blob/HEAD/intabs/classifier_binary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3500269bdb2aa1c1","code_sha256_prefix":"3500269bdb2aa1c1","mcp_get_code":{"code_sha256":"3500269bdb2aa1c1"}},{"arxiv_id":"2404.13736","arxiv_id_is_arxiv":true,"paper":"/paper/interval-abstractions-for-robust","title":"Interval Abstractions for Robust Counterfactual Explanations","date":"2024-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junqi-jiang/interval-abstractions","path":"intabs_multi/classifier_multi.py","file_url":"https://github.com/junqi-jiang/interval-abstractions/blob/HEAD/intabs_multi/classifier_multi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1bb99cc138e49dec","code_sha256_prefix":"1bb99cc138e49dec","mcp_get_code":{"code_sha256":"1bb99cc138e49dec"}},{"arxiv_id":"2309.12545","arxiv_id_is_arxiv":true,"paper":"/paper/provably-robust-and-plausible-counterfactual","title":"Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisation","date":"2023-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junqi-jiang/proplace","path":"proplace/clfutils.py","file_url":"https://github.com/junqi-jiang/proplace/blob/HEAD/proplace/clfutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1010d65049c03d26","code_sha256_prefix":"1010d65049c03d26","mcp_get_code":{"code_sha256":"1010d65049c03d26"}},{"arxiv_id":"2010.09515","arxiv_id_is_arxiv":true,"paper":"/paper/improving-transformation-invariance-in-1","title":"Improving Transformation Invariance in Contrastive Representation Learning","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ae-foster/invclr","path":"evaluate/lbfgs.py","file_url":"https://github.com/ae-foster/invclr/blob/HEAD/evaluate/lbfgs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d6204b19819b6764","code_sha256_prefix":"d6204b19819b6764","mcp_get_code":{"code_sha256":"d6204b19819b6764"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ae-foster/pytorch-simclr","path":"evaluate/lbfgs.py","file_url":"https://github.com/ae-foster/pytorch-simclr/blob/HEAD/evaluate/lbfgs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ec61811bee71758","code_sha256_prefix":"4ec61811bee71758","mcp_get_code":{"code_sha256":"4ec61811bee71758"}},{"arxiv_id":"openreview_WkPYWGHQR2","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_WkPYWGHQR2","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"arakotom/flowllp","path":"utils.py","file_url":"https://github.com/arakotom/flowllp/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"67c27a2435c66d31","code_sha256_prefix":"67c27a2435c66d31","mcp_get_code":{"code_sha256":"67c27a2435c66d31"}}],"record_sha256":"9e7723b812e04c111dcb016bc5ae88e522f1538eed713a735df9e6f89791fa8b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}