{"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":"/task/fairness/papers/ran/1","list_of":"/task/fairness","task":"Fairness","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":5,"rows_per_page":100,"rows":[1,100],"of":404,"counts":{"archive_papers_tagged":5676,"with_a_code_link":1714,"where_syntology_ran_a_sample":404,"not_listed_spam_title":0,"listed":5676,"listed_where_code_ran":404,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":329,"every_run_a_failure_of_syntologys_instrument":75,"listed_with_a_run_with_no_instrument_failure":329,"listed_every_run_a_failure_of_syntologys_instrument":75,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/fairness/papers/ran/1","prev":null,"next":"/task/fairness/papers/ran/2","papers":[{"url":"/paper/composing-agents-to-minimize-worst-case-risk","slug":"composing-agents-to-minimize-worst-case-risk","title":"Composing Agents to Minimize Worst-case Risk","date":"2025-06-05","arxiv_id":"2506.04632","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/composing-agents-to-minimize-worst-case-risk#ran","syntology_url":"https://syntology.ai/paper/2506.04632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.04632"}},"official":{"repos":["guruprerana/worm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fedfact-a-provable-framework-for-controllable","slug":"fedfact-a-provable-framework-for-controllable","title":"FedFACT: A Provable Framework for Controllable Group-Fairness Calibration in Federated Learning","date":"2025-06-04","arxiv_id":"2506.03777","repositories_listed":0,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fedfact-a-provable-framework-for-controllable#ran","syntology_url":"https://syntology.ai/paper/2506.03777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03777"}},"official":null}},{"url":"/paper/towards-reward-fairness-in-rlhf-from-a","slug":"towards-reward-fairness-in-rlhf-from-a","title":"Towards Reward Fairness in RLHF: From a Resource Allocation Perspective","date":"2025-05-29","arxiv_id":"2505.23349","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-reward-fairness-in-rlhf-from-a#ran","syntology_url":"https://syntology.ai/paper/2505.23349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23349"}},"official":{"repos":["shoyua/towards-reward-fairness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/logic-gate-neural-networks-are-good-for","slug":"logic-gate-neural-networks-are-good-for","title":"Logic Gate Neural Networks are Good for Verification","date":"2025-05-26","arxiv_id":"2505.19932","repositories_listed":1,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/logic-gate-neural-networks-are-good-for#ran","syntology_url":"https://syntology.ai/paper/2505.19932","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19932"}},"official":{"repos":["HyberionBrew/difflogic_verify"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generic-framework-for-conformal-fairness","slug":"a-generic-framework-for-conformal-fairness","title":"A Generic Framework for Conformal Fairness","date":"2025-05-22","arxiv_id":"2505.16115","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":14,"n_ran_checked":14,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 14 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-generic-framework-for-conformal-fairness#ran","syntology_url":"https://syntology.ai/paper/2505.16115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16115"}},"official":{"repos":["adityavadlamani/conformal-fairness"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":14,"n_ran_no_instrument_failure":14,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/audiotrust-benchmarking-the-multifaceted","slug":"audiotrust-benchmarking-the-multifaceted","title":"AudioTrust: Benchmarking the Multifaceted Trustworthiness of Audio Large Language Models","date":"2025-05-22","arxiv_id":"2505.16211","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/audiotrust-benchmarking-the-multifaceted#ran","syntology_url":"https://syntology.ai/paper/2505.16211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16211"}},"official":{"repos":["jusperlee/audiotrust"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cpret-a-dataset-benchmark-and-model-for","slug":"cpret-a-dataset-benchmark-and-model-for","title":"CPRet: A Dataset, Benchmark, and Model for Retrieval in Competitive Programming","date":"2025-05-19","arxiv_id":"2505.12925","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cpret-a-dataset-benchmark-and-model-for#ran","syntology_url":"https://syntology.ai/paper/2505.12925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12925"}},"official":{"repos":["coldchair/cpret"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/sakura-on-the-multi-hop-reasoning-of-large","slug":"sakura-on-the-multi-hop-reasoning-of-large","title":"SAKURA: On the Multi-hop Reasoning of Large Audio-Language Models Based on Speech and Audio Information","date":"2025-05-19","arxiv_id":"2505.13237","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sakura-on-the-multi-hop-reasoning-of-large#ran","syntology_url":"https://syntology.ai/paper/2505.13237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.13237"}},"official":{"repos":["b08202033/SAKURA","ckyang1124/sakura"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reasoning-towards-fairness-mitigating-bias-in","slug":"reasoning-towards-fairness-mitigating-bias-in","title":"Reasoning Towards Fairness: Mitigating Bias in Language Models through Reasoning-Guided Fine-Tuning","date":"2025-04-08","arxiv_id":"2504.05632","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reasoning-towards-fairness-mitigating-bias-in#ran","syntology_url":"https://syntology.ai/paper/2504.05632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.05632"}},"official":{"repos":["Sanchit-404/Reasoing-Towards-Fairness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/are-you-getting-what-you-pay-for-auditing","slug":"are-you-getting-what-you-pay-for-auditing","title":"Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs","date":"2025-04-07","arxiv_id":"2504.04715","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/are-you-getting-what-you-pay-for-auditing#ran","syntology_url":"https://syntology.ai/paper/2504.04715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.04715"}},"official":{"repos":["sunblaze-ucb/llm-api-audit"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/statistical-impossibility-and-possibility-of","slug":"statistical-impossibility-and-possibility-of","title":"Statistical Impossibility and Possibility of Aligning LLMs with Human Preferences: From Condorcet Paradox to Nash Equilibrium","date":"2025-03-14","arxiv_id":"2503.10990","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/statistical-impossibility-and-possibility-of#ran","syntology_url":"https://syntology.ai/paper/2503.10990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.10990"}},"official":{"repos":["szk123456789/Nash_RS"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/group-robust-machine-unlearning","slug":"group-robust-machine-unlearning","title":"Group-robust Machine Unlearning","date":"2025-03-12","arxiv_id":"2503.09330","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/group-robust-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2503.09330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09330"}},"official":{"repos":["tdemin16/group-robust_machine_unlearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/political-neutrality-in-ai-is-impossible-but","slug":"political-neutrality-in-ai-is-impossible-but","title":"Political Neutrality in AI Is Impossible- But Here Is How to Approximate It","date":"2025-02-18","arxiv_id":"2503.05728","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/political-neutrality-in-ai-is-impossible-but#ran","syntology_url":"https://syntology.ai/paper/2503.05728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.05728"}},"official":{"repos":["jfisher52/approximation_political_neutrality"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-jensen-gap-for-max-min-group","slug":"bridging-jensen-gap-for-max-min-group","title":"Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation","date":"2025-02-13","arxiv_id":"2502.09319","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bridging-jensen-gap-for-max-min-group#ran","syntology_url":"https://syntology.ai/paper/2502.09319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09319"}},"official":{"repos":["xuchen0427/fairdual"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distribution-aware-fairness-learning-in","slug":"distribution-aware-fairness-learning-in","title":"Distribution-aware Fairness Learning in Medical Image Segmentation From A Control-Theoretic Perspective","date":"2025-02-02","arxiv_id":"2502.00619","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distribution-aware-fairness-learning-in#ran","syntology_url":"https://syntology.ai/paper/2502.00619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00619"}},"official":{"repos":["tvseg/dmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/watching-the-ai-watchdogs-a-fairness-and","slug":"watching-the-ai-watchdogs-a-fairness-and","title":"Watching the AI Watchdogs: A Fairness and Robustness Analysis of AI Safety Moderation Classifiers","date":"2025-01-23","arxiv_id":"2501.13302","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/watching-the-ai-watchdogs-a-fairness-and#ran","syntology_url":"https://syntology.ai/paper/2501.13302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13302"}},"official":{"repos":["acharaakshit/fairmod"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tabularargn-a-flexible-and-efficient-auto-1","slug":"tabularargn-a-flexible-and-efficient-auto-1","title":"TabularARGN: A Flexible and Efficient Auto-Regressive Framework for Generating High-Fidelity Synthetic Data","date":"2025-01-21","arxiv_id":"2501.12012","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tabularargn-a-flexible-and-efficient-auto-1#ran","syntology_url":"https://syntology.ai/paper/2501.12012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.12012"}},"official":{"repos":["mostly-ai/mostlyai-engine"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/beyond-reward-hacking-causal-rewards-for","slug":"beyond-reward-hacking-causal-rewards-for","title":"Beyond Reward Hacking: Causal Rewards for Large Language Model Alignment","date":"2025-01-16","arxiv_id":"2501.09620","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/beyond-reward-hacking-causal-rewards-for#ran","syntology_url":"https://syntology.ai/paper/2501.09620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09620"}},"official":{"repos":["tatsu-lab/alpaca_farm"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ecbench-can-multi-modal-foundation-models","slug":"ecbench-can-multi-modal-foundation-models","title":"ECBench: Can Multi-modal Foundation Models Understand the Egocentric World? A Holistic Embodied Cognition Benchmark","date":"2025-01-09","arxiv_id":"2501.05031","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ecbench-can-multi-modal-foundation-models#ran","syntology_url":"https://syntology.ai/paper/2501.05031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.05031"}},"official":{"repos":["rh-dang/ecbench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autotrust-benchmarking-trustworthiness-in","slug":"autotrust-benchmarking-trustworthiness-in","title":"AutoTrust: Benchmarking Trustworthiness in Large Vision Language Models for Autonomous Driving","date":"2024-12-19","arxiv_id":"2412.15206","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/autotrust-benchmarking-trustworthiness-in#ran","syntology_url":"https://syntology.ai/paper/2412.15206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15206"}},"official":{"repos":["taco-group/autotrust"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sprec-leveraging-self-play-to-debias","slug":"sprec-leveraging-self-play-to-debias","title":"SPRec: Leveraging Self-Play to Debias Preference Alignment for Large Language Model-based Recommendations","date":"2024-12-12","arxiv_id":"2412.09243","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sprec-leveraging-self-play-to-debias#ran","syntology_url":"https://syntology.ai/paper/2412.09243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09243"}},"official":{"repos":["regionch/sprec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/suremap-simultaneous-mean-estimation-for","slug":"suremap-simultaneous-mean-estimation-for","title":"SureMap: Simultaneous Mean Estimation for Single-Task and Multi-Task Disaggregated Evaluation","date":"2024-11-14","arxiv_id":"2411.09730","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/suremap-simultaneous-mean-estimation-for#ran","syntology_url":"https://syntology.ai/paper/2411.09730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.09730"}},"official":{"repos":["mkhodak/SureMap"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-summarization-bridging-quality-and","slug":"fair-summarization-bridging-quality-and","title":"Fair Summarization: Bridging Quality and Diversity in Extractive Summaries","date":"2024-11-12","arxiv_id":"2411.07521","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fair-summarization-bridging-quality-and#ran","syntology_url":"https://syntology.ai/paper/2411.07521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07521"}},"official":{"repos":["PortNLP/FairEXTSummarizer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/mitigating-bias-in-queer-representation","slug":"mitigating-bias-in-queer-representation","title":"Mitigating Bias in Queer Representation within Large Language Models: A Collaborative Agent Approach","date":"2024-11-12","arxiv_id":"2411.07656","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mitigating-bias-in-queer-representation#ran","syntology_url":"https://syntology.ai/paper/2411.07656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07656"}},"official":{"repos":["tonyhrule/queer-bias-llms"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/smoa-improving-multi-agent-large-language","slug":"smoa-improving-multi-agent-large-language","title":"SMoA: Improving Multi-agent Large Language Models with Sparse Mixture-of-Agents","date":"2024-11-05","arxiv_id":"2411.03284","repositories_listed":1,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/smoa-improving-multi-agent-large-language#ran","syntology_url":"https://syntology.ai/paper/2411.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03284"}},"official":{"repos":["david-li0406/smoa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-harmless-rawlsian-fairness-regardless","slug":"towards-harmless-rawlsian-fairness-regardless","title":"Towards Harmless Rawlsian Fairness Regardless of Demographic Prior","date":"2024-11-04","arxiv_id":"2411.02467","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-harmless-rawlsian-fairness-regardless#ran","syntology_url":"https://syntology.ai/paper/2411.02467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02467"}},"official":{"repos":["wxqpxw/vfair"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-and-welfare-efficient-constrained-multi","slug":"fair-and-welfare-efficient-constrained-multi","title":"Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty","date":"2024-11-04","arxiv_id":"2411.02654","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fair-and-welfare-efficient-constrained-multi#ran","syntology_url":"https://syntology.ai/paper/2411.02654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02654"}},"official":{"repos":["justinpayan/RAU2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/constrained-sampling-with-primal-dual","slug":"constrained-sampling-with-primal-dual","title":"Constrained Sampling with Primal-Dual Langevin Monte Carlo","date":"2024-11-01","arxiv_id":"2411.00568","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/constrained-sampling-with-primal-dual#ran","syntology_url":"https://syntology.ai/paper/2411.00568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.00568"}},"official":{"repos":["lfochamon/pdlmc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/evocodebench-an-evolving-code-generation-1","slug":"evocodebench-an-evolving-code-generation-1","title":"EvoCodeBench: An Evolving Code Generation Benchmark with Domain-Specific Evaluations","date":"2024-10-30","arxiv_id":"2410.22821","repositories_listed":0,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evocodebench-an-evolving-code-generation-1#ran","syntology_url":"https://syntology.ai/paper/2410.22821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22821"}},"official":null}},{"url":"/paper/mm-eval-a-multilingual-meta-evaluation","slug":"mm-eval-a-multilingual-meta-evaluation","title":"MM-Eval: A Multilingual Meta-Evaluation Benchmark for LLM-as-a-Judge and Reward Models","date":"2024-10-23","arxiv_id":"2410.17578","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mm-eval-a-multilingual-meta-evaluation#ran","syntology_url":"https://syntology.ai/paper/2410.17578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17578"}},"official":{"repos":["guijinSON/MM-Eval"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-bilevel-neural-network-fairbinn-on","slug":"fair-bilevel-neural-network-fairbinn-on","title":"Fair Bilevel Neural Network (FairBiNN): On Balancing fairness and accuracy via Stackelberg Equilibrium","date":"2024-10-21","arxiv_id":"2410.16432","repositories_listed":2,"syntology":{"n":20,"n_ran":16,"n_constructed":3,"n_ran_checked":13,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":4,"phrase":"16 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fair-bilevel-neural-network-fairbinn-on#ran","syntology_url":"https://syntology.ai/paper/2410.16432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16432"}},"official":{"repos":["yazdanimehdi/fairbinn"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":1,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/the-disparate-benefits-of-deep-ensembles","slug":"the-disparate-benefits-of-deep-ensembles","title":"The Disparate Benefits of Deep Ensembles","date":"2024-10-17","arxiv_id":"2410.13831","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-disparate-benefits-of-deep-ensembles#ran","syntology_url":"https://syntology.ai/paper/2410.13831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13831"}},"official":{"repos":["ml-jku/disparate-benefits"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mctbench-multimodal-cognition-towards-text","slug":"mctbench-multimodal-cognition-towards-text","title":"MCTBench: Multimodal Cognition towards Text-Rich Visual Scenes Benchmark","date":"2024-10-15","arxiv_id":"2410.11538","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mctbench-multimodal-cognition-towards-text#ran","syntology_url":"https://syntology.ai/paper/2410.11538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.11538"}},"official":{"repos":["xfey/mctbench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/one-language-many-gaps-evaluating-dialect","slug":"one-language-many-gaps-evaluating-dialect","title":"One Language, Many Gaps: Evaluating Dialect Fairness and Robustness of Large Language Models in Reasoning Tasks","date":"2024-10-14","arxiv_id":"2410.11005","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-language-many-gaps-evaluating-dialect#ran","syntology_url":"https://syntology.ai/paper/2410.11005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.11005"}},"official":{"repos":["fangru-lin/redial_dialect_robustness_fairness"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/the-fragility-of-fairness-causal-sensitivity","slug":"the-fragility-of-fairness-causal-sensitivity","title":"The Fragility of Fairness: Causal Sensitivity Analysis for Fair Machine Learning","date":"2024-10-12","arxiv_id":"2410.09600","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-fragility-of-fairness-causal-sensitivity#ran","syntology_url":"https://syntology.ai/paper/2410.09600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09600"}},"official":{"repos":["jakefawkes/fragile_fair"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/compl-ai-framework-a-technical-interpretation","slug":"compl-ai-framework-a-technical-interpretation","title":"COMPL-AI Framework: A Technical Interpretation and LLM Benchmarking Suite for the EU Artificial Intelligence Act","date":"2024-10-10","arxiv_id":"2410.07959","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compl-ai-framework-a-technical-interpretation#ran","syntology_url":"https://syntology.ai/paper/2410.07959","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07959"}},"official":{"repos":["compl-ai/compl-ai"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-legal-case-retrieval-via-scaling","slug":"enhancing-legal-case-retrieval-via-scaling","title":"Enhancing Legal Case Retrieval via Scaling High-quality Synthetic Query-Candidate Pairs","date":"2024-10-09","arxiv_id":"2410.06581","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":2,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/enhancing-legal-case-retrieval-via-scaling#ran","syntology_url":"https://syntology.ai/paper/2410.06581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06581"}},"official":{"repos":["thunlp/lead"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/benchmarking-data-heterogeneity-evaluation","slug":"benchmarking-data-heterogeneity-evaluation","title":"Benchmarking Data Heterogeneity Evaluation Approaches for Personalized Federated Learning","date":"2024-10-09","arxiv_id":"2410.07286","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/benchmarking-data-heterogeneity-evaluation#ran","syntology_url":"https://syntology.ai/paper/2410.07286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07286"}},"official":{"repos":["xiaoni-61/dh-benchmark"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fairfml-fair-federated-machine-learning-with","slug":"fairfml-fair-federated-machine-learning-with","title":"FairFML: Fair Federated Machine Learning with a Case Study on Reducing Gender Disparities in Cardiac Arrest Outcome Prediction","date":"2024-10-07","arxiv_id":"2410.17269","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairfml-fair-federated-machine-learning-with#ran","syntology_url":"https://syntology.ai/paper/2410.17269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17269"}},"official":{"repos":["nliulab/FairFML"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/collapsed-language-models-promote-fairness","slug":"collapsed-language-models-promote-fairness","title":"Collapsed Language Models Promote Fairness","date":"2024-10-06","arxiv_id":"2410.04472","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":9,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":13,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/collapsed-language-models-promote-fairness#ran","syntology_url":"https://syntology.ai/paper/2410.04472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04472"}},"official":{"repos":["Xujxyang/Fairness-NC-main"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/conformal-prediction-sets-can-cause-disparate","slug":"conformal-prediction-sets-can-cause-disparate","title":"Conformal Prediction Sets Can Cause Disparate Impact","date":"2024-10-02","arxiv_id":"2410.01888","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformal-prediction-sets-can-cause-disparate#ran","syntology_url":"https://syntology.ai/paper/2410.01888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01888"}},"official":{"repos":["layer6ai-labs/conformal-prediction-fairness"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-introduction-to-deep-survival-analysis","slug":"an-introduction-to-deep-survival-analysis","title":"An Introduction to Deep Survival Analysis Models for Predicting Time-to-Event Outcomes","date":"2024-10-01","arxiv_id":"2410.01086","repositories_listed":2,"syntology":{"n":24,"n_ran":20,"n_constructed":0,"n_ran_checked":18,"n_instrument":2,"n_unverified":4,"n_honours":4,"n_violates":0,"n_no_contract":14,"n_pointer_only":24,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 4 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/an-introduction-to-deep-survival-analysis#ran","syntology_url":"https://syntology.ai/paper/2410.01086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01086"}},"official":{"repos":["georgehc/survival-intro","georgehc/survival-kernets"],"state":"official (archive's flag): 20 ran","n_ran":20,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/lexeval-a-comprehensive-chinese-legal","slug":"lexeval-a-comprehensive-chinese-legal","title":"LexEval: A Comprehensive Chinese Legal Benchmark for Evaluating Large Language Models","date":"2024-09-30","arxiv_id":"2409.20288","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lexeval-a-comprehensive-chinese-legal#ran","syntology_url":"https://syntology.ai/paper/2409.20288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.20288"}},"official":{"repos":["cshaitao/lexeval"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/does-rag-introduce-unfairness-in-llms","slug":"does-rag-introduce-unfairness-in-llms","title":"Does RAG Introduce Unfairness in LLMs? Evaluating Fairness in Retrieval-Augmented Generation Systems","date":"2024-09-29","arxiv_id":"2409.19804","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/does-rag-introduce-unfairness-in-llms#ran","syntology_url":"https://syntology.ai/paper/2409.19804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19804"}},"official":{"repos":["elviswxy/rag_fairness"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-fairness-performance-pareto-front","slug":"efficient-fairness-performance-pareto-front","title":"Efficient Fairness-Performance Pareto Front Computation","date":"2024-09-26","arxiv_id":"2409.17643","repositories_listed":0,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-fairness-performance-pareto-front#ran","syntology_url":"https://syntology.ai/paper/2409.17643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17643"}},"official":null}},{"url":"/paper/abcfair-an-adaptable-benchmark-approach-for","slug":"abcfair-an-adaptable-benchmark-approach-for","title":"ABCFair: an Adaptable Benchmark approach for Comparing Fairness Methods","date":"2024-09-25","arxiv_id":"2409.16965","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/abcfair-an-adaptable-benchmark-approach-for#ran","syntology_url":"https://syntology.ai/paper/2409.16965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.16965"}},"official":{"repos":["aida-ugent/abcfair"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-fair-rag-on-the-impact-of-fair","slug":"towards-fair-rag-on-the-impact-of-fair","title":"Towards Fair RAG: On the Impact of Fair Ranking in Retrieval-Augmented Generation","date":"2024-09-17","arxiv_id":"2409.11598","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-fair-rag-on-the-impact-of-fair#ran","syntology_url":"https://syntology.ai/paper/2409.11598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.11598"}},"official":{"repos":["kimdanny/fair-rag"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/trustworthiness-in-retrieval-augmented","slug":"trustworthiness-in-retrieval-augmented","title":"Trustworthiness in Retrieval-Augmented Generation Systems: A Survey","date":"2024-09-16","arxiv_id":"2409.10102","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/trustworthiness-in-retrieval-augmented#ran","syntology_url":"https://syntology.ai/paper/2409.10102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.10102"}},"official":{"repos":["smallporridge/trustworthyrag"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/influence-based-attributions-can-be","slug":"influence-based-attributions-can-be","title":"Influence-based Attributions can be Manipulated","date":"2024-09-08","arxiv_id":"2409.05208","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/influence-based-attributions-can-be#ran","syntology_url":"https://syntology.ai/paper/2409.05208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05208"}},"official":{"repos":["infinite-pursuits/influence-based-attributions-can-be-manipulated"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/synthetic-tabular-data-generation-for-class","slug":"synthetic-tabular-data-generation-for-class","title":"Synthetic Tabular Data Generation for Class Imbalance and Fairness: A Comparative Study","date":"2024-09-08","arxiv_id":"2409.05215","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/synthetic-tabular-data-generation-for-class#ran","syntology_url":"https://syntology.ai/paper/2409.05215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05215"}},"official":{"repos":["panagiotou/fairaugment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/centralized-selection-with-preferences-in-the","slug":"centralized-selection-with-preferences-in-the","title":"Centralized Selection with Preferences in the Presence of Biases","date":"2024-09-07","arxiv_id":"2409.04897","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/centralized-selection-with-preferences-in-the#ran","syntology_url":"https://syntology.ai/paper/2409.04897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.04897"}},"official":{"repos":["sandrewxu/centralizedselectionwithpreferencebias"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/counterfactual-fairness-by-combining-factual","slug":"counterfactual-fairness-by-combining-factual","title":"Counterfactual Fairness by Combining Factual and Counterfactual Predictions","date":"2024-09-03","arxiv_id":"2409.01977","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/counterfactual-fairness-by-combining-factual#ran","syntology_url":"https://syntology.ai/paper/2409.01977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.01977"}},"official":{"repos":["inouye-lab/pcf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-in-survival-analysis-with","slug":"fairness-in-survival-analysis-with","title":"Fairness in Survival Analysis with Distributionally Robust Optimization","date":"2024-08-31","arxiv_id":"2409.10538","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-in-survival-analysis-with#ran","syntology_url":"https://syntology.ai/paper/2409.10538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.10538"}},"official":{"repos":["discovershu/dro_survival"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-aware-estimation-of-graphical-models","slug":"fairness-aware-estimation-of-graphical-models","title":"Fairness-Aware Estimation of Graphical Models","date":"2024-08-30","arxiv_id":"2408.17396","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-aware-estimation-of-graphical-models#ran","syntology_url":"https://syntology.ai/paper/2408.17396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.17396"}},"official":{"repos":["pennshenlab/fair_gms"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cure4rec-a-benchmark-for-recommendation","slug":"cure4rec-a-benchmark-for-recommendation","title":"CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence","date":"2024-08-26","arxiv_id":"2408.14393","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cure4rec-a-benchmark-for-recommendation#ran","syntology_url":"https://syntology.ai/paper/2408.14393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14393"}},"official":{"repos":["xiye7lai/cure4rec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-data-addition-dilemma","slug":"the-data-addition-dilemma","title":"The Data Addition Dilemma","date":"2024-08-08","arxiv_id":"2408.04154","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":15,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/the-data-addition-dilemma#ran","syntology_url":"https://syntology.ai/paper/2408.04154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.04154"}},"official":{"repos":["the-chen-lab/data-addition-dilemma"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-00992","slug":"2408-00992","title":"Fairness in Large Language Models in Three Hours","date":"2024-08-02","arxiv_id":"2408.00992","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/2408-00992#ran","syntology_url":"https://syntology.ai/paper/2408.00992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00992"}},"official":{"repos":["lavinwong/fairness-in-large-language-models"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/can-editing-llms-inject-harm","slug":"can-editing-llms-inject-harm","title":"Can Editing LLMs Inject Harm?","date":"2024-07-29","arxiv_id":"2407.20224","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/can-editing-llms-inject-harm#ran","syntology_url":"https://syntology.ai/paper/2407.20224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20224"}},"official":null}},{"url":"/paper/hidden-or-inferred-fair-learning-to-rank-with","slug":"hidden-or-inferred-fair-learning-to-rank-with","title":"Hidden or Inferred: Fair Learning-To-Rank with Unknown Demographics","date":"2024-07-24","arxiv_id":"2407.17459","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/hidden-or-inferred-fair-learning-to-rank-with#ran","syntology_url":"https://syntology.ai/paper/2407.17459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.17459"}},"official":{"repos":["sewen007/hoiltr"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unifying-post-processing-framework-for","slug":"a-unifying-post-processing-framework-for","title":"A Unifying Post-Processing Framework for Multi-Objective Learn-to-Defer Problems","date":"2024-07-17","arxiv_id":"2407.12710","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-unifying-post-processing-framework-for#ran","syntology_url":"https://syntology.ai/paper/2407.12710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12710"}},"official":{"repos":["aminchrs/postprocess"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-fair-graph-neural-networks-from-re","slug":"rethinking-fair-graph-neural-networks-from-re","title":"Rethinking Fair Graph Neural Networks from Re-balancing","date":"2024-07-16","arxiv_id":"2407.11624","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-fair-graph-neural-networks-from-re#ran","syntology_url":"https://syntology.ai/paper/2407.11624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11624"}},"official":{"repos":["zhixunlee/fairgb"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-actionable-framework-for-assessing-bias","slug":"an-actionable-framework-for-assessing-bias","title":"An Actionable Framework for Assessing Bias and Fairness in Large Language Model Use Cases","date":"2024-07-15","arxiv_id":"2407.10853","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-actionable-framework-for-assessing-bias#ran","syntology_url":"https://syntology.ai/paper/2407.10853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10853"}},"official":{"repos":["cvs-health/langfair"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/open-clinical-llms-are-sensitive-to","slug":"open-clinical-llms-are-sensitive-to","title":"Open (Clinical) LLMs are Sensitive to Instruction Phrasings","date":"2024-07-12","arxiv_id":"2407.09429","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/open-clinical-llms-are-sensitive-to#ran","syntology_url":"https://syntology.ai/paper/2407.09429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.09429"}},"official":{"repos":["alceballosa/clin-robust"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fairdiff-fair-segmentation-with-point-image","slug":"fairdiff-fair-segmentation-with-point-image","title":"FairDiff: Fair Segmentation with Point-Image Diffusion","date":"2024-07-08","arxiv_id":"2407.06250","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fairdiff-fair-segmentation-with-point-image#ran","syntology_url":"https://syntology.ai/paper/2407.06250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06250"}},"official":{"repos":["wenyi-li/fairdiff"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fairjob-a-real-world-dataset-for-fairness-in","slug":"fairjob-a-real-world-dataset-for-fairness-in","title":"FairJob: A Real-World Dataset for Fairness in Online Systems","date":"2024-07-03","arxiv_id":"2407.03059","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairjob-a-real-world-dataset-for-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2407.03059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.03059"}},"official":{"repos":["criteo-research/fairjob-dataset"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multilingual-trolley-problems-for-language","slug":"multilingual-trolley-problems-for-language","title":"Language Model Alignment in Multilingual Trolley Problems","date":"2024-07-02","arxiv_id":"2407.02273","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multilingual-trolley-problems-for-language#ran","syntology_url":"https://syntology.ai/paper/2407.02273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02273"}},"official":{"repos":["causalNLP/moralmachine","causalnlp/multitp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ceb-compositional-evaluation-benchmark-for","slug":"ceb-compositional-evaluation-benchmark-for","title":"CEB: Compositional Evaluation Benchmark for Fairness in Large Language Models","date":"2024-07-02","arxiv_id":"2407.02408","repositories_listed":0,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ceb-compositional-evaluation-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2407.02408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02408"}},"official":null}},{"url":"/paper/fairmedfm-fairness-benchmarking-for-medical","slug":"fairmedfm-fairness-benchmarking-for-medical","title":"FairMedFM: Fairness Benchmarking for Medical Imaging Foundation Models","date":"2024-07-01","arxiv_id":"2407.00983","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairmedfm-fairness-benchmarking-for-medical#ran","syntology_url":"https://syntology.ai/paper/2407.00983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.00983"}},"official":{"repos":["FairMedFM/FairMedFM"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-interpretable-legal-case-retrieval","slug":"learning-interpretable-legal-case-retrieval","title":"Learning Interpretable Legal Case Retrieval via Knowledge-Guided Case Reformulation","date":"2024-06-28","arxiv_id":"2406.19760","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/learning-interpretable-legal-case-retrieval#ran","syntology_url":"https://syntology.ai/paper/2406.19760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19760"}},"official":{"repos":["ChenlongDeng/KELLER"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/torchspatial-a-location-encoding-framework","slug":"torchspatial-a-location-encoding-framework","title":"TorchSpatial: A Location Encoding Framework and Benchmark for Spatial Representation Learning","date":"2024-06-21","arxiv_id":"2406.15658","repositories_listed":2,"syntology":{"n":22,"n_ran":21,"n_constructed":0,"n_ran_checked":17,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":16,"n_pointer_only":4,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 1 violated, 16 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/torchspatial-a-location-encoding-framework#ran","syntology_url":"https://syntology.ai/paper/2406.15658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15658"}},"official":{"repos":["seai-lab/torchspatial","seai-lab/pygbs"],"state":"official (archive's flag): 21 ran","n_ran":21,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fairer-preferences-elicit-improved-human","slug":"fairer-preferences-elicit-improved-human","title":"Fairer Preferences Elicit Improved Human-Aligned Large Language Model Judgments","date":"2024-06-17","arxiv_id":"2406.11370","repositories_listed":2,"syntology":{"n":29,"n_ran":20,"n_constructed":4,"n_ran_checked":10,"n_instrument":10,"n_unverified":9,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":2,"phrase":"20 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 10 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/fairer-preferences-elicit-improved-human#ran","syntology_url":"https://syntology.ai/paper/2406.11370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11370"}},"official":{"repos":["cambridgeltl/zepo"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":3,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/cbgbench-fill-in-the-blank-of-protein","slug":"cbgbench-fill-in-the-blank-of-protein","title":"CBGBench: Fill in the Blank of Protein-Molecule Complex Binding Graph","date":"2024-06-16","arxiv_id":"2406.10840","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cbgbench-fill-in-the-blank-of-protein#ran","syntology_url":"https://syntology.ai/paper/2406.10840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10840"}},"official":{"repos":["edapinenut/cbgbench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/aim-attributing-interpreting-mitigating-data","slug":"aim-attributing-interpreting-mitigating-data","title":"AIM: Attributing, Interpreting, Mitigating Data Unfairness","date":"2024-06-13","arxiv_id":"2406.08819","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/aim-attributing-interpreting-mitigating-data#ran","syntology_url":"https://syntology.ai/paper/2406.08819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08819"}},"official":{"repos":["zhiningliu1998/aim"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/you-are-what-you-eat-feeding-foundation","slug":"you-are-what-you-eat-feeding-foundation","title":"The World Wide recipe: A community-centred framework for fine-grained data collection and regional bias operationalisation","date":"2024-06-13","arxiv_id":"2406.09496","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/you-are-what-you-eat-feeding-foundation#ran","syntology_url":"https://syntology.ai/paper/2406.09496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09496"}},"official":{"repos":["oxai/world-wide-dishes"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/judging-the-judges-a-systematic-investigation","slug":"judging-the-judges-a-systematic-investigation","title":"Judging the Judges: A Systematic Study of Position Bias in LLM-as-a-Judge","date":"2024-06-12","arxiv_id":"2406.07791","repositories_listed":1,"syntology":{"n":16,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":16,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/judging-the-judges-a-systematic-investigation#ran","syntology_url":"https://syntology.ai/paper/2406.07791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07791"}},"official":{"repos":["Slimshilin/Position-Bias-Analyzer-Demo"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-max-min-formulation-of-multi-objective","slug":"the-max-min-formulation-of-multi-objective","title":"The Max-Min Formulation of Multi-Objective Reinforcement Learning: From Theory to a Model-Free Algorithm","date":"2024-06-12","arxiv_id":"2406.07826","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-max-min-formulation-of-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2406.07826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07826"}},"official":{"repos":["giseung-park/maxmin-morl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cares-a-comprehensive-benchmark-of","slug":"cares-a-comprehensive-benchmark-of","title":"CARES: A Comprehensive Benchmark of Trustworthiness in Medical Vision Language Models","date":"2024-06-10","arxiv_id":"2406.06007","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cares-a-comprehensive-benchmark-of#ran","syntology_url":"https://syntology.ai/paper/2406.06007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06007"}},"official":{"repos":["richard-peng-xia/cares"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/when-is-multicalibration-post-processing","slug":"when-is-multicalibration-post-processing","title":"When is Multicalibration Post-Processing Necessary?","date":"2024-06-10","arxiv_id":"2406.06487","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/when-is-multicalibration-post-processing#ran","syntology_url":"https://syntology.ai/paper/2406.06487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06487"}},"official":{"repos":["dutchhansen/multicalibration","dutchhansen/empirical-multicalibration","sid-devic/multicalibration"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/why-don-t-prompt-based-fairness-metrics","slug":"why-don-t-prompt-based-fairness-metrics","title":"Why Don't Prompt-Based Fairness Metrics Correlate?","date":"2024-06-09","arxiv_id":"2406.05918","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/why-don-t-prompt-based-fairness-metrics#ran","syntology_url":"https://syntology.ai/paper/2406.05918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05918"}},"official":{"repos":["chandar-lab/cairo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/measuring-and-addressing-indexical-bias-in","slug":"measuring-and-addressing-indexical-bias-in","title":"Measuring and Addressing Indexical Bias in Information Retrieval","date":"2024-06-06","arxiv_id":"2406.04298","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/measuring-and-addressing-indexical-bias-in#ran","syntology_url":"https://syntology.ai/paper/2406.04298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04298"}},"official":{"repos":["SALT-NLP/pair"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/are-your-models-still-fair-fairness-attacks","slug":"are-your-models-still-fair-fairness-attacks","title":"Are Your Models Still Fair? Fairness Attacks on Graph Neural Networks via Node Injections","date":"2024-06-05","arxiv_id":"2406.03052","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/are-your-models-still-fair-fairness-attacks#ran","syntology_url":"https://syntology.ai/paper/2406.03052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03052"}},"official":{"repos":["cgcl-codes/nifa","LuoZhhh/NIFA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/building-socially-equitable-public-models","slug":"building-socially-equitable-public-models","title":"Building Socially-Equitable Public Models","date":"2024-06-04","arxiv_id":"2406.02790","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":0,"n_instrument":7,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/building-socially-equitable-public-models#ran","syntology_url":"https://syntology.ai/paper/2406.02790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02790"}},"official":{"repos":["ren-research/socially-equitable-public-models"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/redefining-contributions-shapley-driven","slug":"redefining-contributions-shapley-driven","title":"Redefining Contributions: Shapley-Driven Federated Learning","date":"2024-06-01","arxiv_id":"2406.00569","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/redefining-contributions-shapley-driven#ran","syntology_url":"https://syntology.ai/paper/2406.00569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00569"}},"official":{"repos":["tnurbek/shapfed"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/intersectional-unfairness-discovery","slug":"intersectional-unfairness-discovery","title":"Intersectional Unfairness Discovery","date":"2024-05-31","arxiv_id":"2405.20790","repositories_listed":1,"syntology":{"n":36,"n_ran":24,"n_constructed":0,"n_ran_checked":7,"n_instrument":17,"n_unverified":12,"n_honours":6,"n_violates":1,"n_no_contract":0,"n_pointer_only":36,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 6 honoured, 1 violated, 0 with no contract checked; 17 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/intersectional-unfairness-discovery#ran","syntology_url":"https://syntology.ai/paper/2405.20790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20790"}},"official":{"repos":["xugezheng/bggn"],"state":"official (archive's flag): 24 ran","n_ran":24,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/pursuing-overall-welfare-in-federated","slug":"pursuing-overall-welfare-in-federated","title":"Pursuing Overall Welfare in Federated Learning through Sequential Decision Making","date":"2024-05-31","arxiv_id":"2405.20821","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pursuing-overall-welfare-in-federated#ran","syntology_url":"https://syntology.ai/paper/2405.20821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20821"}},"official":{"repos":["vaseline555/aaggff"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/chexpert-plus-hundreds-of-thousands-of","slug":"chexpert-plus-hundreds-of-thousands-of","title":"CheXpert Plus: Augmenting a Large Chest X-ray Dataset with Text Radiology Reports, Patient Demographics and Additional Image Formats","date":"2024-05-29","arxiv_id":"2405.19538","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/chexpert-plus-hundreds-of-thousands-of#ran","syntology_url":"https://syntology.ai/paper/2405.19538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19538"}},"official":{"repos":["stanford-aimi/chexpert-plus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-verification-of-neural-networks-1","slug":"probabilistic-verification-of-neural-networks-1","title":"Probabilistic Verification of Neural Networks using Branch and Bound","date":"2024-05-27","arxiv_id":"2405.17556","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/probabilistic-verification-of-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2405.17556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17556"}},"official":{"repos":["sen-uni-kn/probspecs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/freeva-offline-mllm-as-training-free-video","slug":"freeva-offline-mllm-as-training-free-video","title":"FreeVA: Offline MLLM as Training-Free Video Assistant","date":"2024-05-13","arxiv_id":"2405.07798","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/freeva-offline-mllm-as-training-free-video#ran","syntology_url":"https://syntology.ai/paper/2405.07798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.07798"}},"official":{"repos":["whwu95/freeva"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/localized-adaptive-risk-control","slug":"localized-adaptive-risk-control","title":"Localized Adaptive Risk Control","date":"2024-05-13","arxiv_id":"2405.07976","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/localized-adaptive-risk-control#ran","syntology_url":"https://syntology.ai/paper/2405.07976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.07976"}},"official":{"repos":["kclip/localized-adaptive-risk-control"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/differentially-private-post-processing-for","slug":"differentially-private-post-processing-for","title":"Differentially Private Post-Processing for Fair Regression","date":"2024-05-07","arxiv_id":"2405.04034","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentially-private-post-processing-for#ran","syntology_url":"https://syntology.ai/paper/2405.04034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04034"}},"official":{"repos":["rxian/fair-regression"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hire-me-or-not-examining-language-model-s","slug":"hire-me-or-not-examining-language-model-s","title":"Hire Me or Not? Examining Language Model's Behavior with Occupation Attributes","date":"2024-05-06","arxiv_id":"2405.06687","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hire-me-or-not-examining-language-model-s#ran","syntology_url":"https://syntology.ai/paper/2405.06687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06687"}},"official":{"repos":["daminz97/multi-step_gsv"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/from-optimization-to-generalization-fair","slug":"from-optimization-to-generalization-fair","title":"From Optimization to Generalization: Fair Federated Learning against Quality Shift via Inter-Client Sharpness Matching","date":"2024-04-27","arxiv_id":"2404.17805","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/from-optimization-to-generalization-fair#ran","syntology_url":"https://syntology.ai/paper/2404.17805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17805"}},"official":{"repos":["wnn2000/ffl4mia"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fairgt-a-fairness-aware-graph-transformer","slug":"fairgt-a-fairness-aware-graph-transformer","title":"FairGT: A Fairness-aware Graph Transformer","date":"2024-04-26","arxiv_id":"2404.17169","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairgt-a-fairness-aware-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2404.17169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17169"}},"official":{"repos":["yushuowiki/fairgt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/culture-gen-revealing-global-cultural","slug":"culture-gen-revealing-global-cultural","title":"CULTURE-GEN: Revealing Global Cultural Perception in Language Models through Natural Language Prompting","date":"2024-04-16","arxiv_id":"2404.10199","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/culture-gen-revealing-global-cultural#ran","syntology_url":"https://syntology.ai/paper/2404.10199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10199"}},"official":{"repos":["huihanlhh/culture-gen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/what-hides-behind-unfairness-exploring","slug":"what-hides-behind-unfairness-exploring","title":"What Hides behind Unfairness? Exploring Dynamics Fairness in Reinforcement Learning","date":"2024-04-16","arxiv_id":"2404.10942","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/what-hides-behind-unfairness-exploring#ran","syntology_url":"https://syntology.ai/paper/2404.10942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10942"}},"official":{"repos":["familyld/insightfair"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/praffl-a-preference-aware-scheme-in-fair","slug":"praffl-a-preference-aware-scheme-in-fair","title":"PraFFL: A Preference-Aware Scheme in Fair Federated Learning","date":"2024-04-13","arxiv_id":"2404.08973","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/praffl-a-preference-aware-scheme-in-fair#ran","syntology_url":"https://syntology.ai/paper/2404.08973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08973"}},"official":{"repos":["rg223/praffl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/balanced-mixed-type-tabular-data-synthesis","slug":"balanced-mixed-type-tabular-data-synthesis","title":"Balanced Mixed-Type Tabular Data Synthesis with Diffusion Models","date":"2024-04-12","arxiv_id":"2404.08254","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/balanced-mixed-type-tabular-data-synthesis#ran","syntology_url":"https://syntology.ai/paper/2404.08254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08254"}},"official":{"repos":["comp-well-org/fair-tab-diffusion"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/openbias-open-set-bias-detection-in-text-to","slug":"openbias-open-set-bias-detection-in-text-to","title":"OpenBias: Open-set Bias Detection in Text-to-Image Generative Models","date":"2024-04-11","arxiv_id":"2404.07990","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/openbias-open-set-bias-detection-in-text-to#ran","syntology_url":"https://syntology.ai/paper/2404.07990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07990"}},"official":{"repos":["picsart-ai-research/openbias"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/freeeval-a-modular-framework-for-trustworthy","slug":"freeeval-a-modular-framework-for-trustworthy","title":"FreeEval: A Modular Framework for Trustworthy and Efficient Evaluation of Large Language Models","date":"2024-04-09","arxiv_id":"2404.06003","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/freeeval-a-modular-framework-for-trustworthy#ran","syntology_url":"https://syntology.ai/paper/2404.06003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06003"}},"official":{"repos":["wisdomshell/freeeval"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/flexible-fairness-learning-via-inverse","slug":"flexible-fairness-learning-via-inverse","title":"FairICP: Encouraging Equalized Odds via Inverse Conditional Permutation","date":"2024-04-08","arxiv_id":"2404.05678","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/flexible-fairness-learning-via-inverse#ran","syntology_url":"https://syntology.ai/paper/2404.05678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05678"}},"official":{"repos":["yuhenglai/fairicp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}}],"record_sha256":"7c4a4b0453ff3c1ce42e6a782772aedeea9657c56fb54a3408297e85df780fa1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}