{"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/get-classes","entry":"get_classes","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":2,"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":1,"ran_violates":1,"ran_draft_wrong":1,"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":"2405.14736","arxiv_id_is_arxiv":true,"paper":"/paper/gift-unlocking-full-potential-of-labels-in","title":"GIFT: Unlocking Full Potential of Labels in Distilled Dataset at Near-zero Cost","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/gift","path":"utils/load_dataset.py","file_url":"https://github.com/lins-lab/gift/blob/HEAD/utils/load_dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lins-lab/gift when it was checked","code_sha256":"b81fa02a8d523453","code_sha256_prefix":"b81fa02a8d523453","mcp_get_code":{"code_sha256":"b81fa02a8d523453"}},{"arxiv_id":"2309.00570","arxiv_id_is_arxiv":true,"paper":"/paper/mechanism-of-feature-learning-in","title":"Mechanism of feature learning in convolutional neural networks","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aradha/convrfm","path":"conv_nets/binary_main.py","file_url":"https://github.com/aradha/convrfm/blob/HEAD/conv_nets/binary_main.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, aradha/convrfm when it was checked","code_sha256":"f9033f488349f9e8","code_sha256_prefix":"f9033f488349f9e8","mcp_get_code":{"code_sha256":"f9033f488349f9e8"}},{"arxiv_id":"2206.02659","arxiv_id_is_arxiv":true,"paper":"/paper/robust-fine-tuning-of-deep-neural-networks","title":"Robust Fine-Tuning of Deep Neural Networks with Hessian-based Generalization Guarantees","date":"2022-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VirtuosoResearch/Robust-fine-tuning","path":"exps_on_image_datasets/data_loader/mini_domain_net.py","file_url":"https://github.com/VirtuosoResearch/Robust-fine-tuning/blob/HEAD/exps_on_image_datasets/data_loader/mini_domain_net.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":"0a6dcb72cc637951","code_sha256_prefix":"0a6dcb72cc637951","mcp_get_code":{"code_sha256":"0a6dcb72cc637951"}},{"arxiv_id":"2205.08340","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-framework-for-dataset-shift","title":"A unified framework for dataset shift diagnostics","date":"2022-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipemaiapolo/detectshift","path":"detectshift/tools.py","file_url":"https://github.com/felipemaiapolo/detectshift/blob/HEAD/detectshift/tools.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"de8dbae9e4ef5bad","code_sha256_prefix":"de8dbae9e4ef5bad","mcp_get_code":{"code_sha256":"de8dbae9e4ef5bad"}},{"arxiv_id":"2112.09327","arxiv_id_is_arxiv":true,"paper":"/paper/incentivizing-collaboration-in-machine","title":"Incentivizing Collaboration in Machine Learning via Synthetic Data Rewards","date":"2021-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XinyiYS/CML-RewardDistribution","path":"metrics/class_imbalance.py","file_url":"https://github.com/XinyiYS/CML-RewardDistribution/blob/HEAD/metrics/class_imbalance.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":"1f09a140e61a66d1","code_sha256_prefix":"1f09a140e61a66d1","mcp_get_code":{"code_sha256":"1f09a140e61a66d1"}},{"arxiv_id":"2108.08165","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-and-incremental-few-shot-learning","title":"Generalized and Incremental Few-Shot Learning by Explicit Learning and Calibration without Forgetting","date":"2021-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"annusha/lcwof","path":"mini_imgnet/create_episodes.py","file_url":"https://github.com/annusha/lcwof/blob/HEAD/mini_imgnet/create_episodes.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":"5251b5bd5881ebf2","code_sha256_prefix":"5251b5bd5881ebf2","mcp_get_code":{"code_sha256":"5251b5bd5881ebf2"}},{"arxiv_id":"2106.10271","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-temporal-action-detection-with","title":"End-to-end Temporal Action Detection with Transformer","date":"2021-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlliu7/TadTR","path":"Evaluation/eval_detection.py","file_url":"https://github.com/xlliu7/TadTR/blob/HEAD/Evaluation/eval_detection.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4bbeee84bc07a00","code_sha256_prefix":"f4bbeee84bc07a00","mcp_get_code":{"code_sha256":"f4bbeee84bc07a00"}},{"arxiv_id":"2104.00487","arxiv_id_is_arxiv":true,"paper":"/paper/linear-semantics-in-generative-adversarial","title":"Linear Semantics in Generative Adversarial Networks","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AtlantixJJ/LinearGAN","path":"figure/layer_plot.py","file_url":"https://github.com/AtlantixJJ/LinearGAN/blob/HEAD/figure/layer_plot.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":"fb61c14dfdff06f2","code_sha256_prefix":"fb61c14dfdff06f2","mcp_get_code":{"code_sha256":"fb61c14dfdff06f2"}},{"arxiv_id":"2004.10934","arxiv_id_is_arxiv":true,"paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bubbliiiing/yolov4-pytorch","path":"utils/utils.py","file_url":"https://github.com/bubbliiiing/yolov4-pytorch/blob/HEAD/utils/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":"25609cd2d07a364b","code_sha256_prefix":"25609cd2d07a364b","mcp_get_code":{"code_sha256":"25609cd2d07a364b"}},{"arxiv_id":"2004.10934","arxiv_id_is_arxiv":true,"paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michhar/azureml-keras-yolov3-custom","path":"project/train_azureml.py","file_url":"https://github.com/michhar/azureml-keras-yolov3-custom/blob/HEAD/project/train_azureml.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":"688442602fea3347","code_sha256_prefix":"688442602fea3347","mcp_get_code":{"code_sha256":"688442602fea3347"}},{"arxiv_id":"1804.02767","arxiv_id_is_arxiv":true,"paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qqwweee/keras-yolo3","path":"train_bottleneck.py","file_url":"https://github.com/qqwweee/keras-yolo3/blob/HEAD/train_bottleneck.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":"688442602fea3347","code_sha256_prefix":"688442602fea3347","mcp_get_code":{"code_sha256":"688442602fea3347"}}],"record_sha256":"4b50059ce39d3b99ae2fade937cf180341314db4d032aaad9f4bf330567d6bde","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}