{"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/filter","entry":"filter","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":20,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":4,"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":18,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":4,"n_samples_unverified":3,"n_samples_fingerprinted":5,"n_places":20,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":1,"ran_draft_wrong":2,"ran_fixture":2,"ran":10,"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":"2601.04754","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04754","title":"PROFUSE: Efficient Cross-View Context Fusion for Open-Vocabulary 3D Gaussian Splatting","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"chiou1203/ProFuse","path":"feature_registration/preprocessing.py","file_url":"https://github.com/chiou1203/ProFuse/blob/HEAD/feature_registration/preprocessing.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chiou1203/ProFuse when it was checked","code_sha256":"2e7f3dd0cf98f11e","code_sha256_prefix":"2e7f3dd0cf98f11e","mcp_get_code":{"code_sha256":"2e7f3dd0cf98f11e"}},{"arxiv_id":"2511.03824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-03824","title":"Sketch-Augmented Features Improve Learning Long-Range Dependencies in Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"ryienh/sketched-random-features","path":"experiments/molecules-pe/src/pe.py","file_url":"https://github.com/ryienh/sketched-random-features/blob/HEAD/experiments/molecules-pe/src/pe.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":"0bb4e54d5a247147","code_sha256_prefix":"0bb4e54d5a247147","mcp_get_code":{"code_sha256":"0bb4e54d5a247147"}},{"arxiv_id":"2511.00116","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-00116","title":"LC-Opt: Benchmarking Reinforcement Learning and Agentic AI for End-to-End Liquid Cooling Optimization in Data Centers","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"lbl-srg/modelica-buildings","path":"Buildings/Resources/Python-Sources/KalmanFilter.py","file_url":"https://github.com/lbl-srg/modelica-buildings/blob/HEAD/Buildings/Resources/Python-Sources/KalmanFilter.py","status":"unverified","verification_level":0,"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, lbl-srg/modelica-buildings when it was checked","code_sha256":"79ad013902016bd0","code_sha256_prefix":"79ad013902016bd0","mcp_get_code":{"code_sha256":"79ad013902016bd0"}},{"arxiv_id":"2505.13898","arxiv_id_is_arxiv":true,"paper":"/paper/do-language-models-use-their-depth","title":"Do Language Models Use Their Depth Efficiently?","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robertcsordas/llm_effective_depth","path":"analysis/open_llm_leaderboard_stat.py","file_url":"https://github.com/robertcsordas/llm_effective_depth/blob/HEAD/analysis/open_llm_leaderboard_stat.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":"300f42cd22764ce0","code_sha256_prefix":"300f42cd22764ce0","mcp_get_code":{"code_sha256":"300f42cd22764ce0"}},{"arxiv_id":"2503.03519","arxiv_id_is_arxiv":true,"paper":"/paper/do-imagenet-trained-models-learn-shortcuts","title":"Do ImageNet-trained models learn shortcuts? The impact of frequency shortcuts on generalization","date":"2025-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nis-research/hfss","path":"hfss/LSI.py","file_url":"https://github.com/nis-research/hfss/blob/HEAD/hfss/LSI.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3609e233a3276554","code_sha256_prefix":"3609e233a3276554","mcp_get_code":{"code_sha256":"3609e233a3276554"}},{"arxiv_id":"2412.06540","arxiv_id_is_arxiv":true,"paper":"/paper/sloth-scaling-laws-for-llm-skills-to-predict","title":"Sloth: scaling laws for LLM skills to predict multi-benchmark performance across families","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipemaiapolo/sloth","path":"sloth/utils.py","file_url":"https://github.com/felipemaiapolo/sloth/blob/HEAD/sloth/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"869a887d132f2470","code_sha256_prefix":"869a887d132f2470","mcp_get_code":{"code_sha256":"869a887d132f2470"}},{"arxiv_id":"2407.00499","arxiv_id_is_arxiv":true,"paper":"/paper/conu-conformal-uncertainty-in-large-language","title":"ConU: Conformal Uncertainty in Large Language Models with Correctness Coverage Guarantees","date":"2024-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiyuan-gg/conformal-uncertainty-criterion","path":"clean_open_domain_qa.py","file_url":"https://github.com/zhiyuan-gg/conformal-uncertainty-criterion/blob/HEAD/clean_open_domain_qa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhiyuan-gg/conformal-uncertainty-criterion when it was checked","code_sha256":"49f009cbaad7cefe","code_sha256_prefix":"49f009cbaad7cefe","mcp_get_code":{"code_sha256":"49f009cbaad7cefe"}},{"arxiv_id":"2403.10446","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-llm-factual-accuracy-with-rag-to","title":"Enhancing LLM Factual Accuracy with RAG to Counter Hallucinations: A Case Study on Domain-Specific Queries in Private Knowledge-Bases","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anlp-team/LTI_Neural_Navigator","path":"src/data_prep/get_paper.py","file_url":"https://github.com/anlp-team/LTI_Neural_Navigator/blob/HEAD/src/data_prep/get_paper.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":"16f4131c96c45844","code_sha256_prefix":"16f4131c96c45844","mcp_get_code":{"code_sha256":"16f4131c96c45844"}},{"arxiv_id":"2312.16084","arxiv_id_is_arxiv":true,"paper":"/paper/langsplat-3d-language-gaussian-splatting","title":"LangSplat: 3D Language Gaussian Splatting","date":"2023-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minghanqin/LangSplat","path":"preprocess.py","file_url":"https://github.com/minghanqin/LangSplat/blob/HEAD/preprocess.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, minghanqin/LangSplat (NOASSERTION)","code_sha256":"2e7f3dd0cf98f11e","code_sha256_prefix":"2e7f3dd0cf98f11e","mcp_get_code":{"code_sha256":"2e7f3dd0cf98f11e"}},{"arxiv_id":"2312.03203","arxiv_id_is_arxiv":true,"paper":"/paper/feature-3dgs-supercharging-3d-gaussian","title":"Feature 3DGS: Supercharging 3D Gaussian Splatting to Enable Distilled Feature Fields","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keloee/maskfield","path":"extract_feature.py","file_url":"https://github.com/keloee/maskfield/blob/HEAD/extract_feature.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from minghanqin/LangSplat, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2e7f3dd0cf98f11e","code_sha256_prefix":"2e7f3dd0cf98f11e","mcp_get_code":{"code_sha256":"2e7f3dd0cf98f11e"}},{"arxiv_id":"2305.14327","arxiv_id_is_arxiv":true,"paper":"/paper/dynosaur-a-dynamic-growth-paradigm-for","title":"Dynosaur: A Dynamic Growth Paradigm for Instruction-Tuning Data Curation","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WadeYin9712/Dynosaur","path":"code/instruction_generation/filter_invalid_tasks.py","file_url":"https://github.com/WadeYin9712/Dynosaur/blob/HEAD/code/instruction_generation/filter_invalid_tasks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1850cf8a582d56b6","code_sha256_prefix":"1850cf8a582d56b6","mcp_get_code":{"code_sha256":"1850cf8a582d56b6"}},{"arxiv_id":"2210.08402","arxiv_id_is_arxiv":true,"paper":"/paper/laion-5b-an-open-large-scale-dataset-for-1","title":"LAION-5B: An open large-scale dataset for training next generation image-text models","date":"2022-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rvencu/crawlingathome-gpu-hcloud","path":"gpu_inference.py","file_url":"https://github.com/rvencu/crawlingathome-gpu-hcloud/blob/HEAD/gpu_inference.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":"0f5ca6c21457febb","code_sha256_prefix":"0f5ca6c21457febb","mcp_get_code":{"code_sha256":"0f5ca6c21457febb"}},{"arxiv_id":"2109.01135","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-sequence-learning-with-latent","title":"Sequence-to-Sequence Learning with Latent Neural Grammars","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yli1/CGPS","path":"adj_data_generator.py","file_url":"https://github.com/yli1/CGPS/blob/HEAD/adj_data_generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eebdf51e5b834f99","code_sha256_prefix":"eebdf51e5b834f99","mcp_get_code":{"code_sha256":"eebdf51e5b834f99"}},{"arxiv_id":"2106.00967","arxiv_id_is_arxiv":true,"paper":"/paper/multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hytruongson/mgvae","path":"citation_link_prediction/train_mgvae.py","file_url":"https://github.com/hytruongson/mgvae/blob/HEAD/citation_link_prediction/train_mgvae.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hytruongson/mgvae when it was checked","code_sha256":"5dd9c22126dfe7c8","code_sha256_prefix":"5dd9c22126dfe7c8","mcp_get_code":{"code_sha256":"5dd9c22126dfe7c8"}},{"arxiv_id":"1912.09522","arxiv_id_is_arxiv":true,"paper":"/paper/contextual-outlier-detection-in-continuous","title":"Event Outlier Detection in Continuous Time","date":"2019-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siqil/CPPOD","path":"summarize_results_std.py","file_url":"https://github.com/siqil/CPPOD/blob/HEAD/summarize_results_std.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":"4aa3c5ddeab25e27","code_sha256_prefix":"4aa3c5ddeab25e27","mcp_get_code":{"code_sha256":"4aa3c5ddeab25e27"}},{"arxiv_id":"1912.06218","arxiv_id_is_arxiv":true,"paper":"/paper/yolact-better-real-time-instance-segmentation","title":"YOLACT++: Better Real-time Instance Segmentation","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KevinJia1212/yolact_cityscapes_550","path":"log2pic.py","file_url":"https://github.com/KevinJia1212/yolact_cityscapes_550/blob/HEAD/log2pic.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":"5deaafb309a80f98","code_sha256_prefix":"5deaafb309a80f98","mcp_get_code":{"code_sha256":"5deaafb309a80f98"}},{"arxiv_id":"1911.03221","arxiv_id_is_arxiv":true,"paper":"/paper/dreem-open-datasets-multi-scored-sleep","title":"Dreem Open Datasets: Multi-Scored Sleep Datasets to compare Human and Automated sleep staging","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dreem-Organization/dreem-learning-open","path":"dreem_learning_open/preprocessings/signal_processing.py","file_url":"https://github.com/Dreem-Organization/dreem-learning-open/blob/HEAD/dreem_learning_open/preprocessings/signal_processing.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":"9ccdc341527e4e3d","code_sha256_prefix":"9ccdc341527e4e3d","mcp_get_code":{"code_sha256":"9ccdc341527e4e3d"}},{"arxiv_id":"1909.11957","arxiv_id_is_arxiv":true,"paper":"/paper/drawing-early-bird-tickets-towards-more","title":"Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RICE-EIC/Early-Bird-Tickets","path":"filter.py","file_url":"https://github.com/RICE-EIC/Early-Bird-Tickets/blob/HEAD/filter.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":"8828ea67235a9bc6","code_sha256_prefix":"8828ea67235a9bc6","mcp_get_code":{"code_sha256":"8828ea67235a9bc6"}},{"arxiv_id":"1908.01210","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-predict-3d-objects-with-an","title":"Learning to Predict 3D Objects with an Interpolation-based Differentiable Renderer","date":"2019-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nv-tlabs/DIB-R","path":"dib-render/check_iou.py","file_url":"https://github.com/nv-tlabs/DIB-R/blob/HEAD/dib-render/check_iou.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d6b9618b13230b91","code_sha256_prefix":"d6b9618b13230b91","mcp_get_code":{"code_sha256":"d6b9618b13230b91"}},{"arxiv_id":"1907.03950","arxiv_id_is_arxiv":true,"paper":"/paper/learning-by-abstraction-the-neural-state","title":"Learning by Abstraction: The Neural State Machine","date":"2019-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordnlp/mac-network","path":"visualization.py","file_url":"https://github.com/stanfordnlp/mac-network/blob/HEAD/visualization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4834aa38d80ec5ee","code_sha256_prefix":"4834aa38d80ec5ee","mcp_get_code":{"code_sha256":"4834aa38d80ec5ee"}}],"record_sha256":"638025bdb3feba03ac4fbcbecf898d89e3b94154f08edf64a329595031d2ea84","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}