{"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/majority-vote","entry":"majority_vote","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":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":6,"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":13,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":6,"n_samples_unverified":2,"n_samples_fingerprinted":7,"n_places":13,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":1,"ran_draft_wrong":5,"ran_fixture":1,"ran":3,"unverified":2},"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":"2607.13433","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-13433","title":"When Rubrics Change: Cross-Rubric Generalization for Critical Thinking Essay Scoring","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"umass-ml4ed/generalization-in-essay-scoring","path":"majority_vote_traits.py","file_url":"https://github.com/umass-ml4ed/generalization-in-essay-scoring/blob/HEAD/majority_vote_traits.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":"965991a74fc77621","code_sha256_prefix":"965991a74fc77621","mcp_get_code":{"code_sha256":"965991a74fc77621"}},{"arxiv_id":"2605.08045","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08045","title":"Uncertainty-Aware Structured Data Extraction from Full CMR Reports via Distilled LLMS","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yuyi1005/CMR-EXTR","path":"inference_gpt-oss-20b.py","file_url":"https://github.com/yuyi1005/CMR-EXTR/blob/HEAD/inference_gpt-oss-20b.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, yuyi1005/CMR-EXTR when it was checked","code_sha256":"e99d52393527e4fd","code_sha256_prefix":"e99d52393527e4fd","mcp_get_code":{"code_sha256":"e99d52393527e4fd"}},{"arxiv_id":"2506.08691","arxiv_id_is_arxiv":true,"paper":"/paper/vrest-enhancing-reasoning-in-large-vision","title":"VReST: Enhancing Reasoning in Large Vision-Language Models through Tree Search and Self-Reward Mechanism","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GaryJiajia/VReST","path":"prompt_methods/ours/our6.py","file_url":"https://github.com/GaryJiajia/VReST/blob/HEAD/prompt_methods/ours/our6.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, GaryJiajia/VReST when it was checked","code_sha256":"ade82f4c3e15e030","code_sha256_prefix":"ade82f4c3e15e030","mcp_get_code":{"code_sha256":"ade82f4c3e15e030"}},{"arxiv_id":"2504.17454","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-orchestration-of-modular-generative","title":"Adaptive Orchestration of Modular Generative Information Access Systems","date":"2025-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"informagi/AQA","path":"CMAB_last_swarm.py","file_url":"https://github.com/informagi/AQA/blob/HEAD/CMAB_last_swarm.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":"415284d931b57325","code_sha256_prefix":"415284d931b57325","mcp_get_code":{"code_sha256":"415284d931b57325"}},{"arxiv_id":"2412.00207","arxiv_id_is_arxiv":true,"paper":"/paper/can-llm-self-report-evaluating-the-validity","title":"Can LLM \"Self-report\"?: Evaluating the Validity of Self-report Scales in Measuring Personality Design in LLM-based Chatbots","date":null,"month_inferred_from_arxiv_id":"2024-12","title_source":"archive","repo":"isle-dev/self-report","path":"src/utils.py","file_url":"https://github.com/isle-dev/self-report/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, isle-dev/self-report when it was checked","code_sha256":"b798859eeff7712c","code_sha256_prefix":"b798859eeff7712c","mcp_get_code":{"code_sha256":"b798859eeff7712c"}},{"arxiv_id":"2410.17534","arxiv_id_is_arxiv":true,"paper":"/paper/ovt-b-a-new-large-scale-benchmark-for-open","title":"OVT-B: A New Large-Scale Benchmark for Open-Vocabulary Multi-Object Tracking","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Coo1Sea/OVT-B-Dataset","path":"ovtrack/datasets/bdd_video_dataset.py","file_url":"https://github.com/Coo1Sea/OVT-B-Dataset/blob/HEAD/ovtrack/datasets/bdd_video_dataset.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":"d669627a4785e5e9","code_sha256_prefix":"d669627a4785e5e9","mcp_get_code":{"code_sha256":"d669627a4785e5e9"}},{"arxiv_id":"2410.17196","arxiv_id_is_arxiv":true,"paper":"/paper/voicebench-benchmarking-llm-based-voice","title":"VoiceBench: Benchmarking LLM-Based Voice Assistants","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matthewcym/voicebench","path":"src/evaluator/qa.py","file_url":"https://github.com/matthewcym/voicebench/blob/HEAD/src/evaluator/qa.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"11cff48e62b2f561","code_sha256_prefix":"11cff48e62b2f561","mcp_get_code":{"code_sha256":"11cff48e62b2f561"}},{"arxiv_id":"2410.09403","arxiv_id_is_arxiv":true,"paper":"/paper/two-heads-are-better-than-one-a-multi-agent","title":"Many Heads Are Better Than One: Improved Scientific Idea Generation by A LLM-Based Multi-Agent System","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open-sciencelab/social_science","path":"sci_platform/utils/scientist_utils.py","file_url":"https://github.com/open-sciencelab/social_science/blob/HEAD/sci_platform/utils/scientist_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f2d5c7d1a4ce59c","code_sha256_prefix":"7f2d5c7d1a4ce59c","mcp_get_code":{"code_sha256":"7f2d5c7d1a4ce59c"}},{"arxiv_id":"2403.00799","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-data-ability-boundary","title":"An Empirical Study of Data Ability Boundary in LLMs' Math Reasoning","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyzhh/MMOS","path":"eval/evaluate.py","file_url":"https://github.com/cyzhh/MMOS/blob/HEAD/eval/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, cyzhh/MMOS when it was checked","code_sha256":"c6427c534ee50108","code_sha256_prefix":"c6427c534ee50108","mcp_get_code":{"code_sha256":"c6427c534ee50108"}},{"arxiv_id":"2402.10426","arxiv_id_is_arxiv":true,"paper":"/paper/dell-generating-reactions-and-explanations","title":"DELL: Generating Reactions and Explanations for LLM-Based Misinformation Detection","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whr000001/dell","path":"ensemble/ensemble_utils.py","file_url":"https://github.com/whr000001/dell/blob/HEAD/ensemble/ensemble_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":"0df62fff81a45786","code_sha256_prefix":"0df62fff81a45786","mcp_get_code":{"code_sha256":"0df62fff81a45786"}},{"arxiv_id":"2310.01926","arxiv_id_is_arxiv":true,"paper":"/paper/darth-holistic-test-time-adaptation-for-1","title":"DARTH: Holistic Test-time Adaptation for Multiple Object Tracking","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattiasegu/darth","path":"darth/core/track/postprocessing.py","file_url":"https://github.com/mattiasegu/darth/blob/HEAD/darth/core/track/postprocessing.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":"d322dd3188b65f75","code_sha256_prefix":"d322dd3188b65f75","mcp_get_code":{"code_sha256":"d322dd3188b65f75"}},{"arxiv_id":"2305.05976","arxiv_id_is_arxiv":true,"paper":"/paper/say-what-you-mean-large-language-models-speak","title":"Say What You Mean! Large Language Models Speak Too Positively about Negative Commonsense Knowledge","date":"2023-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangjiechen/uncommongen","path":"evaluation/eval_constrained_generation.py","file_url":"https://github.com/jiangjiechen/uncommongen/blob/HEAD/evaluation/eval_constrained_generation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"379f828142e3c658","code_sha256_prefix":"379f828142e3c658","mcp_get_code":{"code_sha256":"379f828142e3c658"}},{"arxiv_id":"2106.01074","arxiv_id_is_arxiv":true,"paper":"/paper/database-reasoning-over-text","title":"Database Reasoning Over Text","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/NeuralDB","path":"modelling/src/neuraldb/convert_spj_to_predictions.py","file_url":"https://github.com/facebookresearch/NeuralDB/blob/HEAD/modelling/src/neuraldb/convert_spj_to_predictions.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27128b75e407172f","code_sha256_prefix":"27128b75e407172f","mcp_get_code":{"code_sha256":"27128b75e407172f"}}],"record_sha256":"5884feba9e8c1aca4d89673742b36e7a254e2351f1230a6a0908f717a9088148","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}