{"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/process-file","entry":"process_file","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":33,"n_papers_ran":22,"n_papers_ran_no_instrument_failure":18,"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":47,"n_samples_ran":31,"n_samples_constructed":0,"n_samples_ran_checked":26,"n_samples_instrument":5,"n_samples_unverified":16,"n_samples_fingerprinted":0,"n_places":47,"n_places_pointer_only":17,"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":2,"ran_violates":2,"ran_draft_wrong":5,"ran_fixture":0,"ran":22,"unverified":16},"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":"2606.02578","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02578","title":"Mitigating Perceptual Judgment Bias in Multimodal LLM-as-a-Judge via Perceptual Perturbation and Reward Modeling","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"kaist-cvml/perception-judge","path":"prepare-datasets/post_processing_filter_after_gen.py","file_url":"https://github.com/kaist-cvml/perception-judge/blob/HEAD/prepare-datasets/post_processing_filter_after_gen.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, kaist-cvml/perception-judge when it was checked","code_sha256":"9e9e9289a06c8157","code_sha256_prefix":"9e9e9289a06c8157","mcp_get_code":{"code_sha256":"9e9e9289a06c8157"}},{"arxiv_id":"2605.16843","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16843","title":"RTI-Bench: A Structured Dataset for Indian Right-to-Information Decision Analysis","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"joyboseroy/rti-bench","path":"pipeline/extract_cic_pdfs_v4.py","file_url":"https://github.com/joyboseroy/rti-bench/blob/HEAD/pipeline/extract_cic_pdfs_v4.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":"67c1faa4ce7ef4b3","code_sha256_prefix":"67c1faa4ce7ef4b3","mcp_get_code":{"code_sha256":"67c1faa4ce7ef4b3"}},{"arxiv_id":"2605.12220","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12220","title":"TriBand-BEV: Real-Time LiDAR-Only 3D Pedestrian Detection via Height-Aware BEV and High-Resolution Feature Fusion","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mohammadkhsh/TriBand-BEV","path":"result_final_inter.py","file_url":"https://github.com/mohammadkhsh/TriBand-BEV/blob/HEAD/result_final_inter.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"88f89f03faae952f","code_sha256_prefix":"88f89f03faae952f","mcp_get_code":{"code_sha256":"88f89f03faae952f"}},{"arxiv_id":"2603.28387","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28387","title":"Prompts Without Evidence: How Neuroimaging Mentions Shift Clinical Vision-Language Model Predictions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"long21wt/scaffold-effect","path":"src/f1_eval.py","file_url":"https://github.com/long21wt/scaffold-effect/blob/HEAD/src/f1_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, long21wt/scaffold-effect when it was checked","code_sha256":"0436233c4822645f","code_sha256_prefix":"0436233c4822645f","mcp_get_code":{"code_sha256":"0436233c4822645f"}},{"arxiv_id":"2603.28387","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28387","title":"Prompts Without Evidence: How Neuroimaging Mentions Shift Clinical Vision-Language Model Predictions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"long21wt/scaffold-effect","path":"src/f1_eval_oasis.py","file_url":"https://github.com/long21wt/scaffold-effect/blob/HEAD/src/f1_eval_oasis.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, long21wt/scaffold-effect when it was checked","code_sha256":"b844a1ca1b279a3a","code_sha256_prefix":"b844a1ca1b279a3a","mcp_get_code":{"code_sha256":"b844a1ca1b279a3a"}},{"arxiv_id":"2603.22882","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-22882","title":"TreeTeaming: Autonomous Red-Teaming of Vision-Language Models via Hierarchical Strategy Exploration","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ChunXiaostudy/TreeTeaming","path":"benchmark/score_jsonl.py","file_url":"https://github.com/ChunXiaostudy/TreeTeaming/blob/HEAD/benchmark/score_jsonl.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, ChunXiaostudy/TreeTeaming when it was checked","code_sha256":"8d053a9f8dca0089","code_sha256_prefix":"8d053a9f8dca0089","mcp_get_code":{"code_sha256":"8d053a9f8dca0089"}},{"arxiv_id":"2507.10225","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.10225","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"Jarvisgivemeasuit/SynOOD","path":"texts/clean_prompt.py","file_url":"https://github.com/Jarvisgivemeasuit/SynOOD/blob/HEAD/texts/clean_prompt.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":"0b8c67201af06908","code_sha256_prefix":"0b8c67201af06908","mcp_get_code":{"code_sha256":"0b8c67201af06908"}},{"arxiv_id":"2505.22939","arxiv_id_is_arxiv":true,"paper":"/paper/generative-social-choice-the-next-generation","title":"Generative Social Choice: The Next Generation","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sara-fish/gen-soc-choice-next-gen","path":"synthetic_experiments/process.py","file_url":"https://github.com/sara-fish/gen-soc-choice-next-gen/blob/HEAD/synthetic_experiments/process.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":"255faefc4183008f","code_sha256_prefix":"255faefc4183008f","mcp_get_code":{"code_sha256":"255faefc4183008f"}},{"arxiv_id":"2505.20292","arxiv_id_is_arxiv":true,"paper":"/paper/opens2v-nexus-a-detailed-benchmark-and","title":"OpenS2V-Nexus: A Detailed Benchmark and Million-Scale Dataset for Subject-to-Video Generation","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-YuanGroup/OpenS2V-Nexus","path":"data_process/step3-0_merge_json.py","file_url":"https://github.com/PKU-YuanGroup/OpenS2V-Nexus/blob/HEAD/data_process/step3-0_merge_json.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":"8310d1132ebd9370","code_sha256_prefix":"8310d1132ebd9370","mcp_get_code":{"code_sha256":"8310d1132ebd9370"}},{"arxiv_id":"2505.20292","arxiv_id_is_arxiv":true,"paper":"/paper/opens2v-nexus-a-detailed-benchmark-and","title":"OpenS2V-Nexus: A Detailed Benchmark and Million-Scale Dataset for Subject-to-Video Generation","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-YuanGroup/OpenS2V-Nexus","path":"data_process/step4-0_merge_json.py","file_url":"https://github.com/PKU-YuanGroup/OpenS2V-Nexus/blob/HEAD/data_process/step4-0_merge_json.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":"4a34cdc1b72ef759","code_sha256_prefix":"4a34cdc1b72ef759","mcp_get_code":{"code_sha256":"4a34cdc1b72ef759"}},{"arxiv_id":"2502.20122","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-elicits-concise-reasoning-in","title":"Self-Training Elicits Concise Reasoning in Large Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tergelmunkhbat/concise-reasoning","path":"src/estimated_budget_process.py","file_url":"https://github.com/tergelmunkhbat/concise-reasoning/blob/HEAD/src/estimated_budget_process.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":"3edbfe5817ad1b08","code_sha256_prefix":"3edbfe5817ad1b08","mcp_get_code":{"code_sha256":"3edbfe5817ad1b08"}},{"arxiv_id":"2502.20122","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-elicits-concise-reasoning-in","title":"Self-Training Elicits Concise Reasoning in Large Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tergelmunkhbat/concise-reasoning","path":"src/preprocess.py","file_url":"https://github.com/tergelmunkhbat/concise-reasoning/blob/HEAD/src/preprocess.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":"c687c5d4e753d025","code_sha256_prefix":"c687c5d4e753d025","mcp_get_code":{"code_sha256":"c687c5d4e753d025"}},{"arxiv_id":"2501.06186","arxiv_id_is_arxiv":true,"paper":"/paper/llamav-o1-rethinking-step-by-step-visual","title":"LlamaV-o1: Rethinking Step-by-step Visual Reasoning in LLMs","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-oryx/llamav-o1","path":"eval/get_result.py","file_url":"https://github.com/mbzuai-oryx/llamav-o1/blob/HEAD/eval/get_result.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":"4fcf4b31c07c510c","code_sha256_prefix":"4fcf4b31c07c510c","mcp_get_code":{"code_sha256":"4fcf4b31c07c510c"}},{"arxiv_id":"2411.04427","arxiv_id_is_arxiv":true,"paper":"/paper/one-fish-two-fish-but-not-the-whole-sea","title":"One fish, two fish, but not the whole sea: Alignment reduces language models' conceptual diversity","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skmur/onefish-twofish","path":"analysis/process-data.py","file_url":"https://github.com/skmur/onefish-twofish/blob/HEAD/analysis/process-data.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, skmur/onefish-twofish when it was checked","code_sha256":"a50db35d03e3fa4d","code_sha256_prefix":"a50db35d03e3fa4d","mcp_get_code":{"code_sha256":"a50db35d03e3fa4d"}},{"arxiv_id":"2410.17193","arxiv_id_is_arxiv":true,"paper":"/paper/emphasizing-discriminative-features-for","title":"Emphasizing Discriminative Features for Dataset Distillation in Complex Scenarios","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nus-hpc-ai-lab/edf","path":"calculate_the_ratio.py","file_url":"https://github.com/nus-hpc-ai-lab/edf/blob/HEAD/calculate_the_ratio.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, nus-hpc-ai-lab/edf when it was checked","code_sha256":"ad84d1668d85b6ba","code_sha256_prefix":"ad84d1668d85b6ba","mcp_get_code":{"code_sha256":"ad84d1668d85b6ba"}},{"arxiv_id":"2410.02131","arxiv_id_is_arxiv":true,"paper":"/paper/c-melt-contrastive-enhanced-masked-auto","title":"Boosting Masked ECG-Text Auto-Encoders as Discriminative Learners","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manhph2211/D-BETA","path":"datasets/n3s.py","file_url":"https://github.com/manhph2211/D-BETA/blob/HEAD/datasets/n3s.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, manhph2211/D-BETA (NOASSERTION)","code_sha256":"0d81a17c01ba1f9a","code_sha256_prefix":"0d81a17c01ba1f9a","mcp_get_code":{"code_sha256":"0d81a17c01ba1f9a"}},{"arxiv_id":"2409.17892","arxiv_id_is_arxiv":true,"paper":"/paper/emma-500-enhancing-massively-multilingual","title":"EMMA-500: Enhancing Massively Multilingual Adaptation of Large Language Models","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaLA-LM/emma-500","path":"evaluation/Aya/evaluate.py","file_url":"https://github.com/MaLA-LM/emma-500/blob/HEAD/evaluation/Aya/evaluate.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, MaLA-LM/emma-500 when it was checked","code_sha256":"cfcff66fced80dfc","code_sha256_prefix":"cfcff66fced80dfc","mcp_get_code":{"code_sha256":"cfcff66fced80dfc"}},{"arxiv_id":"2407.20906","arxiv_id_is_arxiv":true,"paper":"/paper/automated-review-generation-method-based-on","title":"Automated Review Generation Method Based on Large Language Models","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tju-ecat-ai/automaticreviewgeneration","path":"ReviewComposition/Advanced_ComparedScore.py","file_url":"https://github.com/tju-ecat-ai/automaticreviewgeneration/blob/HEAD/ReviewComposition/Advanced_ComparedScore.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":"8f9db599f9f467a3","code_sha256_prefix":"8f9db599f9f467a3","mcp_get_code":{"code_sha256":"8f9db599f9f467a3"}},{"arxiv_id":"2406.18846","arxiv_id_is_arxiv":true,"paper":"/paper/afbench-a-large-scale-benchmark-for-airfoil","title":"AFBench: A Large-scale Benchmark for Airfoil Design","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"hitcslj/Xfoil-cal","path":"check_valid.py","file_url":"https://github.com/hitcslj/Xfoil-cal/blob/HEAD/check_valid.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, hitcslj/Xfoil-cal when it was checked","code_sha256":"bf1b390abffb23a7","code_sha256_prefix":"bf1b390abffb23a7","mcp_get_code":{"code_sha256":"bf1b390abffb23a7"}},{"arxiv_id":"2406.18846","arxiv_id_is_arxiv":true,"paper":"/paper/afbench-a-large-scale-benchmark-for-airfoil","title":"AFBench: A Large-scale Benchmark for Airfoil Design","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"hitcslj/Xfoil-cal","path":"check_valid_aero.py","file_url":"https://github.com/hitcslj/Xfoil-cal/blob/HEAD/check_valid_aero.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, hitcslj/Xfoil-cal when it was checked","code_sha256":"111d2e64e145c96d","code_sha256_prefix":"111d2e64e145c96d","mcp_get_code":{"code_sha256":"111d2e64e145c96d"}},{"arxiv_id":"2405.14014","arxiv_id_is_arxiv":true,"paper":"/paper/radarocc-robust-3d-occupancy-prediction-with","title":"RadarOcc: Robust 3D Occupancy Prediction with 4D Imaging Radar","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toytiny/radarocc","path":"generate_3d_polar.py","file_url":"https://github.com/toytiny/radarocc/blob/HEAD/generate_3d_polar.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":"58f05ca94a1f16ad","code_sha256_prefix":"58f05ca94a1f16ad","mcp_get_code":{"code_sha256":"58f05ca94a1f16ad"}},{"arxiv_id":"2405.14014","arxiv_id_is_arxiv":true,"paper":"/paper/radarocc-robust-3d-occupancy-prediction-with","title":"RadarOcc: Robust 3D Occupancy Prediction with 4D Imaging Radar","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toytiny/radarocc","path":"generate_4d_polar.py","file_url":"https://github.com/toytiny/radarocc/blob/HEAD/generate_4d_polar.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":"cccc647437ae78d0","code_sha256_prefix":"cccc647437ae78d0","mcp_get_code":{"code_sha256":"cccc647437ae78d0"}},{"arxiv_id":"2405.14014","arxiv_id_is_arxiv":true,"paper":"/paper/radarocc-robust-3d-occupancy-prediction-with","title":"RadarOcc: Robust 3D Occupancy Prediction with 4D Imaging Radar","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Toytiny/RadarOcc","path":"generate_4d_polar_doppler.py","file_url":"https://github.com/Toytiny/RadarOcc/blob/HEAD/generate_4d_polar_doppler.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":"7ca7350ddb4ca251","code_sha256_prefix":"7ca7350ddb4ca251","mcp_get_code":{"code_sha256":"7ca7350ddb4ca251"}},{"arxiv_id":"2405.14014","arxiv_id_is_arxiv":true,"paper":"/paper/radarocc-robust-3d-occupancy-prediction-with","title":"RadarOcc: Robust 3D Occupancy Prediction with 4D Imaging Radar","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toytiny/radarocc","path":"generate_4d_polar_doppler.py","file_url":"https://github.com/toytiny/radarocc/blob/HEAD/generate_4d_polar_doppler.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":"bca17c9a1a27be2b","code_sha256_prefix":"bca17c9a1a27be2b","mcp_get_code":{"code_sha256":"bca17c9a1a27be2b"}},{"arxiv_id":"2405.14014","arxiv_id_is_arxiv":true,"paper":"/paper/radarocc-robust-3d-occupancy-prediction-with","title":"RadarOcc: Robust 3D Occupancy Prediction with 4D Imaging Radar","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toytiny/radarocc","path":"generate_4d_polar_percentil.py","file_url":"https://github.com/toytiny/radarocc/blob/HEAD/generate_4d_polar_percentil.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":"c69c41474090b153","code_sha256_prefix":"c69c41474090b153","mcp_get_code":{"code_sha256":"c69c41474090b153"}},{"arxiv_id":"2405.10143","arxiv_id_is_arxiv":true,"paper":"/paper/relational-dnn-verification-with-cross","title":"Relational DNN Verification With Cross Executional Bound Refinement","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debangshu-banerjee/racoon","path":"racoon_processor.py","file_url":"https://github.com/debangshu-banerjee/racoon/blob/HEAD/racoon_processor.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, debangshu-banerjee/racoon when it was checked","code_sha256":"ad46388f7e27e4bf","code_sha256_prefix":"ad46388f7e27e4bf","mcp_get_code":{"code_sha256":"ad46388f7e27e4bf"}},{"arxiv_id":"2405.10143","arxiv_id_is_arxiv":true,"paper":"/paper/relational-dnn-verification-with-cross","title":"Relational DNN Verification With Cross Executional Bound Refinement","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debangshu-banerjee/racoon","path":"racoon_processor_hamming.py","file_url":"https://github.com/debangshu-banerjee/racoon/blob/HEAD/racoon_processor_hamming.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, debangshu-banerjee/racoon when it was checked","code_sha256":"4496a4aaefebb050","code_sha256_prefix":"4496a4aaefebb050","mcp_get_code":{"code_sha256":"4496a4aaefebb050"}},{"arxiv_id":"2405.10143","arxiv_id_is_arxiv":true,"paper":"/paper/relational-dnn-verification-with-cross","title":"Relational DNN Verification With Cross Executional Bound Refinement","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debangshu-banerjee/racoon","path":"bound_refinement_processor.py","file_url":"https://github.com/debangshu-banerjee/racoon/blob/HEAD/bound_refinement_processor.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, debangshu-banerjee/racoon when it was checked","code_sha256":"49d5a240375f2f85","code_sha256_prefix":"49d5a240375f2f85","mcp_get_code":{"code_sha256":"49d5a240375f2f85"}},{"arxiv_id":"2405.05506","arxiv_id_is_arxiv":true,"paper":"/paper/cross-care-assessing-the-healthcare","title":"Cross-Care: Assessing the Healthcare Implications of Pre-training Data on Language Model Bias","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shan23chen/cross-care","path":"co_occurrence_generate/jsonl_data_filtering.py","file_url":"https://github.com/shan23chen/cross-care/blob/HEAD/co_occurrence_generate/jsonl_data_filtering.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":"293bc1ef76e375ef","code_sha256_prefix":"293bc1ef76e375ef","mcp_get_code":{"code_sha256":"293bc1ef76e375ef"}},{"arxiv_id":"2405.05506","arxiv_id_is_arxiv":true,"paper":"/paper/cross-care-assessing-the-healthcare","title":"Cross-Care: Assessing the Healthcare Implications of Pre-training Data on Language Model Bias","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shan23chen/cross-care","path":"co_occurrence_generate/jsonl_data_filtering_c4.py","file_url":"https://github.com/shan23chen/cross-care/blob/HEAD/co_occurrence_generate/jsonl_data_filtering_c4.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":"fe4d91f2f027fe4e","code_sha256_prefix":"fe4d91f2f027fe4e","mcp_get_code":{"code_sha256":"fe4d91f2f027fe4e"}},{"arxiv_id":"2403.07369","arxiv_id_is_arxiv":true,"paper":"/paper/textual-knowledge-matters-cross-modality-co","title":"Textual Knowledge Matters: Cross-Modality Co-Teaching for Generalized Visual Class Discovery","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haiyangzheng/textgcd","path":"utils/text_process.py","file_url":"https://github.com/haiyangzheng/textgcd/blob/HEAD/utils/text_process.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, haiyangzheng/textgcd when it was checked","code_sha256":"f8466b7c87d6147d","code_sha256_prefix":"f8466b7c87d6147d","mcp_get_code":{"code_sha256":"f8466b7c87d6147d"}},{"arxiv_id":"2402.13213","arxiv_id_is_arxiv":true,"paper":"/paper/softmax-probabilities-mostly-predict-large","title":"Probabilities of Chat LLMs Are Miscalibrated but Still Predict Correctness on Multiple-Choice Q&A","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bplaut/softmax-probs-predict-llm-correctness","path":"show_msp_distributions.py","file_url":"https://github.com/bplaut/softmax-probs-predict-llm-correctness/blob/HEAD/show_msp_distributions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c29fde88ebbe1cd","code_sha256_prefix":"0c29fde88ebbe1cd","mcp_get_code":{"code_sha256":"0c29fde88ebbe1cd"}},{"arxiv_id":"2402.12503","arxiv_id_is_arxiv":true,"paper":"/paper/parcv2-physics-aware-recurrent-convolutional","title":"PARCv2: Physics-aware Recurrent Convolutional Neural Networks for Spatiotemporal Dynamics Modeling","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hphong1990/parcv2","path":"PARC/utils.py","file_url":"https://github.com/hphong1990/parcv2/blob/HEAD/PARC/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, hphong1990/parcv2, is not in the permissive set Syntology serves inline","code_sha256":"47d67295b295834e","code_sha256_prefix":"47d67295b295834e","mcp_get_code":{"code_sha256":"47d67295b295834e"}},{"arxiv_id":"2401.06416","arxiv_id_is_arxiv":true,"paper":"/paper/mission-impossible-language-models","title":"Mission: Impossible Language Models","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkallini/mission-impossible-language-models","path":"edge_probing/load_phrase_data.py","file_url":"https://github.com/jkallini/mission-impossible-language-models/blob/HEAD/edge_probing/load_phrase_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dfc460bf3c3be3c","code_sha256_prefix":"2dfc460bf3c3be3c","mcp_get_code":{"code_sha256":"2dfc460bf3c3be3c"}},{"arxiv_id":"2401.06091","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-auroc-and-auprc-under-class","title":"A Closer Look at AUROC and AUPRC under Class Imbalance","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lassehhansen/ArxivMLClaimSearch","path":"src/arxiv_search.py","file_url":"https://github.com/Lassehhansen/ArxivMLClaimSearch/blob/HEAD/src/arxiv_search.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":"c4d0403439e31706","code_sha256_prefix":"c4d0403439e31706","mcp_get_code":{"code_sha256":"c4d0403439e31706"}},{"arxiv_id":"2401.06091","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-auroc-and-auprc-under-class","title":"A Closer Look at AUROC and AUPRC under Class Imbalance","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lassehhansen/ArxivMLClaimSearch","path":"src/arxiv_search_regex.py","file_url":"https://github.com/Lassehhansen/ArxivMLClaimSearch/blob/HEAD/src/arxiv_search_regex.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":"1ba401f99899baa4","code_sha256_prefix":"1ba401f99899baa4","mcp_get_code":{"code_sha256":"1ba401f99899baa4"}},{"arxiv_id":"2401.06091","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-auroc-and-auprc-under-class","title":"A Closer Look at AUROC and AUPRC under Class Imbalance","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lassehhansen/arxiv-search","path":"src/arxiv_search.py","file_url":"https://github.com/lassehhansen/arxiv-search/blob/HEAD/src/arxiv_search.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, lassehhansen/arxiv-search when it was checked","code_sha256":"66ad8fb02e5834bf","code_sha256_prefix":"66ad8fb02e5834bf","mcp_get_code":{"code_sha256":"66ad8fb02e5834bf"}},{"arxiv_id":"2401.06091","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-auroc-and-auprc-under-class","title":"A Closer Look at AUROC and AUPRC under Class Imbalance","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lassehhansen/arxiv-search","path":"src/arxiv_search_regex.py","file_url":"https://github.com/lassehhansen/arxiv-search/blob/HEAD/src/arxiv_search_regex.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, lassehhansen/arxiv-search when it was checked","code_sha256":"5e0a79f969743a5f","code_sha256_prefix":"5e0a79f969743a5f","mcp_get_code":{"code_sha256":"5e0a79f969743a5f"}},{"arxiv_id":"2310.10704","arxiv_id_is_arxiv":true,"paper":"/paper/optimized-tokenization-for-transcribed-error","title":"Optimized Tokenization for Transcribed Error Correction","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/sentencepiece","path":"lite/amalgamate.py","file_url":"https://github.com/google/sentencepiece/blob/HEAD/lite/amalgamate.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":"ba2d61e10485367a","code_sha256_prefix":"ba2d61e10485367a","mcp_get_code":{"code_sha256":"ba2d61e10485367a"}},{"arxiv_id":"2305.01750","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-in-context-learning-for-knowledge","title":"Few-shot In-context Learning for Knowledge Base Question Answering","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ltl3A87/KB-BINDER","path":"utils.py","file_url":"https://github.com/ltl3A87/KB-BINDER/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":"767c14bec8de2d7b","code_sha256_prefix":"767c14bec8de2d7b","mcp_get_code":{"code_sha256":"767c14bec8de2d7b"}},{"arxiv_id":"2212.13120","arxiv_id_is_arxiv":true,"paper":"/paper/neural-structure-fields-with-application-to","title":"Neural Structure Fields with Application to Crystal Structure Autoencoders","date":"2022-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omron-sinicx/neural-structure-field","path":"src/dataset_generation/02_extract_structures.py","file_url":"https://github.com/omron-sinicx/neural-structure-field/blob/HEAD/src/dataset_generation/02_extract_structures.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":"47e6d373a8ee71e9","code_sha256_prefix":"47e6d373a8ee71e9","mcp_get_code":{"code_sha256":"47e6d373a8ee71e9"}},{"arxiv_id":"2211.06196","arxiv_id_is_arxiv":true,"paper":"/paper/improving-factual-consistency-in","title":"Improving Factual Consistency in Summarization with Compression-Based Post-Editing","date":"2022-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/CompEdit","path":"entity_score.py","file_url":"https://github.com/salesforce/CompEdit/blob/HEAD/entity_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad8f0274bbfb39b6","code_sha256_prefix":"ad8f0274bbfb39b6","mcp_get_code":{"code_sha256":"ad8f0274bbfb39b6"}},{"arxiv_id":"2206.00259","arxiv_id_is_arxiv":true,"paper":"/paper/idani-inference-time-domain-adaptation-via","title":"IDANI: Inference-time Domain Adaptation via Neuron-level Interventions","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"technion-cs-nlp/idani","path":"code/analysis.py","file_url":"https://github.com/technion-cs-nlp/idani/blob/HEAD/code/analysis.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":"9d3248b9abfd2262","code_sha256_prefix":"9d3248b9abfd2262","mcp_get_code":{"code_sha256":"9d3248b9abfd2262"}},{"arxiv_id":"2010.10727","arxiv_id_is_arxiv":true,"paper":"/paper/learning-disentangled-phone-and-speaker","title":"Learning Disentangled Phone and Speaker Representations in a Semi-Supervised VQ-VAE Paradigm","date":"2020-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhoposit/icassp2021","path":"preprocess_vqvae.py","file_url":"https://github.com/rhoposit/icassp2021/blob/HEAD/preprocess_vqvae.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":"e5f6756a2fd822c7","code_sha256_prefix":"e5f6756a2fd822c7","mcp_get_code":{"code_sha256":"e5f6756a2fd822c7"}},{"arxiv_id":"1910.07517","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-examples-for-models-of-code","title":"Adversarial Examples for Models of Code","date":"2019-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tech-srl/code2seq","path":"preprocess.py","file_url":"https://github.com/tech-srl/code2seq/blob/HEAD/preprocess.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":"8de0a4310800437e","code_sha256_prefix":"8de0a4310800437e","mcp_get_code":{"code_sha256":"8de0a4310800437e"}},{"arxiv_id":"1603.07252","arxiv_id_is_arxiv":true,"paper":"/paper/neural-summarization-by-extracting-sentences","title":"Neural Summarization by Extracting Sentences and Words","date":"2016-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adrian9631/TextSumma","path":"predict_model.py","file_url":"https://github.com/adrian9631/TextSumma/blob/HEAD/predict_model.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":"a58c910689a3db8c","code_sha256_prefix":"a58c910689a3db8c","mcp_get_code":{"code_sha256":"a58c910689a3db8c"}},{"arxiv_id":"2023.findings-acl.76","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.76","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HKUST-KnowComp/FolkScope","path":"src/pattern/generation_parser.py","file_url":"https://github.com/HKUST-KnowComp/FolkScope/blob/HEAD/src/pattern/generation_parser.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":"b87934889baa1464","code_sha256_prefix":"b87934889baa1464","mcp_get_code":{"code_sha256":"b87934889baa1464"}}],"record_sha256":"481109ee7df53363b98869ccce719b33581f805419493f1a27681f4c7a0215c0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}