{"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/download-url","entry":"download_url","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":32,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":3,"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":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":17,"n_samples_fingerprinted":0,"n_places":34,"n_places_pointer_only":17,"n_places_pointer_only_link_open":6,"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":1,"ran_fixture":0,"ran":0,"unverified":17},"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":"2604.17720","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-17720","title":"FlashFPS: Efficient Farthest Point Sampling for Large-Scale Point Clouds via Pruning and Caching","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Yuzhe-Fu/FlashFPS","path":"FlashFPS-Openpoints/openpoints/dataset/data_util.py","file_url":"https://github.com/Yuzhe-Fu/FlashFPS/blob/HEAD/FlashFPS-Openpoints/openpoints/dataset/data_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Yuzhe-Fu/FlashFPS (NOASSERTION)","code_sha256":"556e417290a6e1fd","code_sha256_prefix":"556e417290a6e1fd","mcp_get_code":{"code_sha256":"556e417290a6e1fd"}},{"arxiv_id":"2509.16598","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-16598","title":"PruneCD: Contrasting Pruned Self Model to Improve Decoding Factuality","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"hoeng4/PruneCD","path":"2_benchmark/1_tfqa_gen.py","file_url":"https://github.com/hoeng4/PruneCD/blob/HEAD/2_benchmark/1_tfqa_gen.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, hoeng4/PruneCD when it was checked","code_sha256":"0f14b819bc361c25","code_sha256_prefix":"0f14b819bc361c25","mcp_get_code":{"code_sha256":"0f14b819bc361c25"}},{"arxiv_id":"2506.14291","arxiv_id_is_arxiv":true,"paper":"/paper/equivariance-everywhere-all-at-once-a-recipe","title":"Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benfinkelshtein/equivarianceeverywhere","path":"helpers/datasets.py","file_url":"https://github.com/benfinkelshtein/equivarianceeverywhere/blob/HEAD/helpers/datasets.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":"f026a6607b2915ad","code_sha256_prefix":"f026a6607b2915ad","mcp_get_code":{"code_sha256":"f026a6607b2915ad"}},{"arxiv_id":"2504.04635","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2504.04635","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":null,"repo":"patqdasilva/steering-off-course","path":"DoLa/factor_eval.py","file_url":"https://github.com/patqdasilva/steering-off-course/blob/HEAD/DoLa/factor_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 voidism/DoLa, and GitHub detected no licence in that repository when it was checked","code_sha256":"0f14b819bc361c25","code_sha256_prefix":"0f14b819bc361c25","mcp_get_code":{"code_sha256":"0f14b819bc361c25"}},{"arxiv_id":"2411.02433","arxiv_id_is_arxiv":true,"paper":"/paper/sled-self-logits-evolution-decoding-for","title":"SLED: Self Logits Evolution Decoding for Improving Factuality in Large Language Models","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayZhang42/SLED","path":"utils/utils_factor.py","file_url":"https://github.com/JayZhang42/SLED/blob/HEAD/utils/utils_factor.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, JayZhang42/SLED when it was checked","code_sha256":"0ce848f1f5c6f4eb","code_sha256_prefix":"0ce848f1f5c6f4eb","mcp_get_code":{"code_sha256":"0ce848f1f5c6f4eb"}},{"arxiv_id":"2411.02433","arxiv_id_is_arxiv":true,"paper":"/paper/sled-self-logits-evolution-decoding-for","title":"SLED: Self Logits Evolution Decoding for Improving Factuality in Large Language Models","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayZhang42/SLED","path":"utils/utils_gsm8k.py","file_url":"https://github.com/JayZhang42/SLED/blob/HEAD/utils/utils_gsm8k.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, JayZhang42/SLED when it was checked","code_sha256":"d4bd3ab60e7a743a","code_sha256_prefix":"d4bd3ab60e7a743a","mcp_get_code":{"code_sha256":"d4bd3ab60e7a743a"}},{"arxiv_id":"2410.05076","arxiv_id_is_arxiv":true,"paper":"/paper/tidaldecode-fast-and-accurate-llm-decoding","title":"TidalDecode: Fast and Accurate LLM Decoding with Position Persistent Sparse Attention","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DerrickYLJ/TidalDecode","path":"src/utils.py","file_url":"https://github.com/DerrickYLJ/TidalDecode/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d196dde52e17237c","code_sha256_prefix":"d196dde52e17237c","mcp_get_code":{"code_sha256":"d196dde52e17237c"}},{"arxiv_id":"2409.18591","arxiv_id_is_arxiv":true,"paper":"/paper/off-to-new-shores-a-dataset-benchmark-for","title":"Off to new Shores: A Dataset & Benchmark for (near-)coastal Flood Inundation Forecasting","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multihuntr/gff","path":"gff/data_sources.py","file_url":"https://github.com/multihuntr/gff/blob/HEAD/gff/data_sources.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"223d3628a64c7b3c","code_sha256_prefix":"223d3628a64c7b3c","mcp_get_code":{"code_sha256":"223d3628a64c7b3c"}},{"arxiv_id":"2408.10537","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-prototype-guidance-for-mitigating","title":"Subspace Prototype Guidance for Mitigating Class Imbalance in Point Cloud Semantic Segmentation","date":"2024-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Javion11/PointLiBR","path":"openpoints/dataset/data_util.py","file_url":"https://github.com/Javion11/PointLiBR/blob/HEAD/openpoints/dataset/data_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 Yuzhe-Fu/FlashFPS, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"556e417290a6e1fd","code_sha256_prefix":"556e417290a6e1fd","mcp_get_code":{"code_sha256":"556e417290a6e1fd"}},{"arxiv_id":"2405.12528","arxiv_id_is_arxiv":true,"paper":"/paper/sirllm-streaming-infinite-retentive-llm","title":"SirLLM: Streaming Infinite Retentive LLM","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoeyyao27/sirllm","path":"sir_llm/utils.py","file_url":"https://github.com/zoeyyao27/sirllm/blob/HEAD/sir_llm/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, zoeyyao27/sirllm when it was checked","code_sha256":"d196dde52e17237c","code_sha256_prefix":"d196dde52e17237c","mcp_get_code":{"code_sha256":"d196dde52e17237c"}},{"arxiv_id":"2404.15010","arxiv_id_is_arxiv":true,"paper":"/paper/x-3d-explicit-3d-structure-modeling-for-point","title":"X-3D: Explicit 3D Structure Modeling for Point Cloud Recognition","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunshuofeng/X-3D","path":"openpoints/dataset/data_util.py","file_url":"https://github.com/sunshuofeng/X-3D/blob/HEAD/openpoints/dataset/data_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 Yuzhe-Fu/FlashFPS, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"556e417290a6e1fd","code_sha256_prefix":"556e417290a6e1fd","mcp_get_code":{"code_sha256":"556e417290a6e1fd"}},{"arxiv_id":"2403.01548","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-sharpness-as-alerts-an-inner","title":"In-Context Sharpness as Alerts: An Inner Representation Perspective for Hallucination Mitigation","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"0f14b819bc361c25","code_sha256_prefix":"0f14b819bc361c25","mcp_get_code":{"code_sha256":"0f14b819bc361c25"}},{"arxiv_id":"2403.00762","arxiv_id_is_arxiv":true,"paper":"/paper/point-could-mamba-point-cloud-learning-via","title":"Point Cloud Mamba: Point Cloud Learning via State Space Model","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skyworkai/pointcloudmamba","path":"openpoints/dataset/data_util.py","file_url":"https://github.com/skyworkai/pointcloudmamba/blob/HEAD/openpoints/dataset/data_util.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, skyworkai/pointcloudmamba when it was checked","code_sha256":"556e417290a6e1fd","code_sha256_prefix":"556e417290a6e1fd","mcp_get_code":{"code_sha256":"556e417290a6e1fd"}},{"arxiv_id":"2401.05930","arxiv_id_is_arxiv":true,"paper":"/paper/sh2-self-highlighted-hesitation-helps-you","title":"SH2: Self-Highlighted Hesitation Helps You Decode More Truthfully","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0-kaikai-0/sh2","path":"factor_eval.py","file_url":"https://github.com/0-kaikai-0/sh2/blob/HEAD/factor_eval.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, 0-kaikai-0/sh2 when it was checked","code_sha256":"0f14b819bc361c25","code_sha256_prefix":"0f14b819bc361c25","mcp_get_code":{"code_sha256":"0f14b819bc361c25"}},{"arxiv_id":"2312.15710","arxiv_id_is_arxiv":true,"paper":"/paper/alleviating-hallucinations-of-large-language","title":"Alleviating Hallucinations of Large Language Models through Induced Hallucinations","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hillzhang1999/icd","path":"src/benchmark_evaluation/factscore_eval.py","file_url":"https://github.com/hillzhang1999/icd/blob/HEAD/src/benchmark_evaluation/factscore_eval.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":"f4c68c4850723e81","code_sha256_prefix":"f4c68c4850723e81","mcp_get_code":{"code_sha256":"f4c68c4850723e81"}},{"arxiv_id":"2309.03883","arxiv_id_is_arxiv":true,"paper":"/paper/dola-decoding-by-contrasting-layers-improves","title":"DoLa: Decoding by Contrasting Layers Improves Factuality in Large Language Models","date":"2023-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"voidism/DoLa","path":"factor_eval.py","file_url":"https://github.com/voidism/DoLa/blob/HEAD/factor_eval.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, voidism/DoLa when it was checked","code_sha256":"0f14b819bc361c25","code_sha256_prefix":"0f14b819bc361c25","mcp_get_code":{"code_sha256":"0f14b819bc361c25"}},{"arxiv_id":"2308.04008","arxiv_id_is_arxiv":true,"paper":"/paper/coarse-to-fine-learning-compact","title":"Coarse-to-Fine: Learning Compact Discriminative Representation for Single-Stage Image Retrieval","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bassyess/CFCD","path":"core/io.py","file_url":"https://github.com/bassyess/CFCD/blob/HEAD/core/io.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":"e10bd0e3f25f2b57","code_sha256_prefix":"e10bd0e3f25f2b57","mcp_get_code":{"code_sha256":"e10bd0e3f25f2b57"}},{"arxiv_id":"2303.16450","arxiv_id_is_arxiv":true,"paper":"/paper/self-positioning-point-based-transformer-for","title":"Self-positioning Point-based Transformer for Point Cloud Understanding","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/SPoTr","path":"openpoints/dataset/data_util.py","file_url":"https://github.com/mlvlab/SPoTr/blob/HEAD/openpoints/dataset/data_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 Yuzhe-Fu/FlashFPS, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"556e417290a6e1fd","code_sha256_prefix":"556e417290a6e1fd","mcp_get_code":{"code_sha256":"556e417290a6e1fd"}},{"arxiv_id":"2302.07317","arxiv_id_is_arxiv":true,"paper":"/paper/algorithm-selection-for-deep-active-learning-1","title":"Algorithm Selection for Deep Active Learning with Imbalanced Datasets","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jifanz/tailor","path":"dataset/imagenet_dataset.py","file_url":"https://github.com/jifanz/tailor/blob/HEAD/dataset/imagenet_dataset.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":"fd2ed15a69e5dcfe","code_sha256_prefix":"fd2ed15a69e5dcfe","mcp_get_code":{"code_sha256":"fd2ed15a69e5dcfe"}},{"arxiv_id":"2208.00223","arxiv_id_is_arxiv":true,"paper":"/paper/polarmix-a-general-data-augmentation","title":"PolarMix: A General Data Augmentation Technique for LiDAR Point Clouds","date":"2022-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaoaoran/polarmix","path":"model_zoo.py","file_url":"https://github.com/xiaoaoran/polarmix/blob/HEAD/model_zoo.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":"82545d97082ff5f4","code_sha256_prefix":"82545d97082ff5f4","mcp_get_code":{"code_sha256":"82545d97082ff5f4"}},{"arxiv_id":"2205.10528","arxiv_id_is_arxiv":true,"paper":"/paper/point-is-a-vector-a-feature-representation-in","title":"PointVector: A Vector Representation In Point Cloud Analysis","date":"2022-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guochengqian/openpoints","path":"dataset/data_util.py","file_url":"https://github.com/guochengqian/openpoints/blob/HEAD/dataset/data_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 Yuzhe-Fu/FlashFPS, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"556e417290a6e1fd","code_sha256_prefix":"556e417290a6e1fd","mcp_get_code":{"code_sha256":"556e417290a6e1fd"}},{"arxiv_id":"2203.15207","arxiv_id_is_arxiv":true,"paper":"/paper/generalizing-few-shot-nas-with-gradient-1","title":"Generalizing Few-Shot NAS with Gradient Matching","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skhu101/GM-NAS","path":"Proxylessnas-GM/proxyless_nas/utils.py","file_url":"https://github.com/skhu101/GM-NAS/blob/HEAD/Proxylessnas-GM/proxyless_nas/utils.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":"ecbe897d347181d9","code_sha256_prefix":"ecbe897d347181d9","mcp_get_code":{"code_sha256":"ecbe897d347181d9"}},{"arxiv_id":"2108.06011","arxiv_id_is_arxiv":true,"paper":"/paper/datasets-for-studying-generalization-from","title":"Datasets for Studying Generalization from Easy to Hard Examples","date":"2021-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aks2203/easy-to-hard-data","path":"easy_to_hard_data.py","file_url":"https://github.com/aks2203/easy-to-hard-data/blob/HEAD/easy_to_hard_data.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":"da38ca7f90f7a02c","code_sha256_prefix":"da38ca7f90f7a02c","mcp_get_code":{"code_sha256":"da38ca7f90f7a02c"}},{"arxiv_id":"2108.02927","arxiv_id_is_arxiv":true,"paper":"/paper/dolg-single-stage-image-retrieval-with-deep","title":"DOLG: Single-Stage Image Retrieval with Deep Orthogonal Fusion of Local and Global Features","date":"2021-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feymanpriv/DOLG","path":"core/io.py","file_url":"https://github.com/feymanpriv/DOLG/blob/HEAD/core/io.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":"e10bd0e3f25f2b57","code_sha256_prefix":"e10bd0e3f25f2b57","mcp_get_code":{"code_sha256":"e10bd0e3f25f2b57"}},{"arxiv_id":"2106.10891","arxiv_id_is_arxiv":true,"paper":"/paper/open-set-label-noise-can-improve-robustness","title":"Open-set Label Noise Can Improve Robustness Against Inherent Label Noise","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongxin001/ODNL","path":"algorithms/odnl.py","file_url":"https://github.com/hongxin001/ODNL/blob/HEAD/algorithms/odnl.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, hongxin001/ODNL when it was checked","code_sha256":"0105f183fe8b9666","code_sha256_prefix":"0105f183fe8b9666","mcp_get_code":{"code_sha256":"0105f183fe8b9666"}},{"arxiv_id":"2010.14374","arxiv_id_is_arxiv":true,"paper":"/paper/explainable-machine-learning-for-public","title":"Explainable Machine Learning for Public Policy: Use Cases, Gaps, and Research Directions","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmougan/WRI_WellBeing_Data_Layer","path":"dssg/dataio/ntl_data_extraction.py","file_url":"https://github.com/cmougan/WRI_WellBeing_Data_Layer/blob/HEAD/dssg/dataio/ntl_data_extraction.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":"d234e70ea0c97ce9","code_sha256_prefix":"d234e70ea0c97ce9","mcp_get_code":{"code_sha256":"d234e70ea0c97ce9"}},{"arxiv_id":"2007.16100","arxiv_id_is_arxiv":true,"paper":"/paper/searching-efficient-3d-architectures-with","title":"Searching Efficient 3D Architectures with Sparse Point-Voxel Convolution","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/spvnas","path":"model_zoo.py","file_url":"https://github.com/mit-han-lab/spvnas/blob/HEAD/model_zoo.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":"82545d97082ff5f4","code_sha256_prefix":"82545d97082ff5f4","mcp_get_code":{"code_sha256":"82545d97082ff5f4"}},{"arxiv_id":"1908.09791","arxiv_id_is_arxiv":true,"paper":"/paper/once-for-all-train-one-network-and-specialize","title":"Once-for-All: Train One Network and Specialize it for Efficient Deployment","date":"2019-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seulkiyeom/once-for-all","path":"utils.py","file_url":"https://github.com/seulkiyeom/once-for-all/blob/HEAD/utils.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":"3396d2fc2ff97e58","code_sha256_prefix":"3396d2fc2ff97e58","mcp_get_code":{"code_sha256":"3396d2fc2ff97e58"}},{"arxiv_id":"1905.13214","arxiv_id_is_arxiv":true,"paper":"/paper/on-network-design-spaces-for-visual","title":"On Network Design Spaces for Visual Recognition","date":"2019-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feymanpriv/pymetric","path":"metric/core/io.py","file_url":"https://github.com/feymanpriv/pymetric/blob/HEAD/metric/core/io.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, feymanpriv/pymetric, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"e10bd0e3f25f2b57","code_sha256_prefix":"e10bd0e3f25f2b57","mcp_get_code":{"code_sha256":"e10bd0e3f25f2b57"}},{"arxiv_id":"1905.11136","arxiv_id_is_arxiv":true,"paper":"/paper/provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hadarser/ProvablyPowerfulGraphNetworks","path":"utils/get_data.py","file_url":"https://github.com/hadarser/ProvablyPowerfulGraphNetworks/blob/HEAD/utils/get_data.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":"7838e53265948514","code_sha256_prefix":"7838e53265948514","mcp_get_code":{"code_sha256":"7838e53265948514"}},{"arxiv_id":"1812.00332","arxiv_id_is_arxiv":true,"paper":"/paper/proxylessnas-direct-neural-architecture","title":"ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIT-HAN-LAB/ProxylessNAS","path":"proxyless_nas/utils.py","file_url":"https://github.com/MIT-HAN-LAB/ProxylessNAS/blob/HEAD/proxyless_nas/utils.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":"ecbe897d347181d9","code_sha256_prefix":"ecbe897d347181d9","mcp_get_code":{"code_sha256":"ecbe897d347181d9"}},{"arxiv_id":"1812.00332","arxiv_id_is_arxiv":true,"paper":"/paper/proxylessnas-direct-neural-architecture","title":"ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardware","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AhmadQasim/proxylessnas-dense","path":"proxyless_nas/utils.py","file_url":"https://github.com/AhmadQasim/proxylessnas-dense/blob/HEAD/proxyless_nas/utils.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":"fc80172ec891659e","code_sha256_prefix":"fc80172ec891659e","mcp_get_code":{"code_sha256":"fc80172ec891659e"}},{"arxiv_id":"openreview_trSWJ99WzS","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_trSWJ99WzS","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DerrickYLJ/LessIsMore","path":"src/utils.py","file_url":"https://github.com/DerrickYLJ/LessIsMore/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d196dde52e17237c","code_sha256_prefix":"d196dde52e17237c","mcp_get_code":{"code_sha256":"d196dde52e17237c"}},{"arxiv_id":"Lin_Meta_Architecture_for_Point_Cloud_Analysis_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lin_Meta_Architecture_for_Point_Cloud_Analysis_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"linhaojia13/PointMetaBase","path":"openpoints/dataset/data_util.py","file_url":"https://github.com/linhaojia13/PointMetaBase/blob/HEAD/openpoints/dataset/data_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 Yuzhe-Fu/FlashFPS, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"556e417290a6e1fd","code_sha256_prefix":"556e417290a6e1fd","mcp_get_code":{"code_sha256":"556e417290a6e1fd"}}],"record_sha256":"6cd610cec4e1e0ceec6c65be4d666eaf4defb6789bc750a132504ed6d9ff89be","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}