{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/classify","entry":"classify","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":27,"n_papers_ran":22,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":12,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":28,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":13,"n_samples_unverified":6,"n_samples_fingerprinted":10,"n_places":29,"n_places_pointer_only":8,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":1,"ran_draft_wrong":11,"ran_fixture":2,"ran":7,"unverified":6},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2609.03677","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-03677","title":"Understanding Autonomous Driving Datasets by Describing Differences between Image Subsets in Natural Language","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"KIT-MRT/AD-Diff","path":"components/ranker.py","file_url":"https://github.com/KIT-MRT/AD-Diff/blob/HEAD/components/ranker.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7bd7b8929851dff6","code_sha256_prefix":"7bd7b8929851dff6","mcp_get_code":{"code_sha256":"7bd7b8929851dff6"}},{"arxiv_id":"2609.00275","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00275","title":"The Irreversibility Budget: Fleet-Level Risk Accounting and Admission Control for Agent Operating Systems","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"mpi-dsg/irreversibility-budget","path":"sim/traces/classify.py","file_url":"https://github.com/mpi-dsg/irreversibility-budget/blob/HEAD/sim/traces/classify.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81960c37a9c658eb","code_sha256_prefix":"81960c37a9c658eb","mcp_get_code":{"code_sha256":"81960c37a9c658eb"}},{"arxiv_id":"2608.15286","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-15286","title":"No Task Fails Every Time: Why One-Shot Audits Are Structurally Blind to Agent Damage","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"shivenkk/agentrelbench","path":"m1_audit/test1_tool_inventory.py","file_url":"https://github.com/shivenkk/agentrelbench/blob/HEAD/m1_audit/test1_tool_inventory.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b314c288935e52c","code_sha256_prefix":"4b314c288935e52c","mcp_get_code":{"code_sha256":"4b314c288935e52c"}},{"arxiv_id":"2606.26803","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-26803","title":"From Vajrayana Tara to Bengali Baul: A Computational Study of Lexical Transmission Across Buddhist, Shakta, and Vaishnava Traditions in Bengal","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"joyboseroy/bengal-dharma-corpus","path":"patch_v3.py","file_url":"https://github.com/joyboseroy/bengal-dharma-corpus/blob/HEAD/patch_v3.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3537dada33405b3e","code_sha256_prefix":"3537dada33405b3e","mcp_get_code":{"code_sha256":"3537dada33405b3e"}},{"arxiv_id":"2606.10403","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10403","title":"KCSAT-ML: Probing Reasoning Models with Nationwide-Cohort Human Difficulty","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"naver-ai/KCSAT-ML","path":"analysis/contamination_analysis.py","file_url":"https://github.com/naver-ai/KCSAT-ML/blob/HEAD/analysis/contamination_analysis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, naver-ai/KCSAT-ML, is not in the permissive set Syntology serves inline","code_sha256":"ee089fe2b6308e10","code_sha256_prefix":"ee089fe2b6308e10","mcp_get_code":{"code_sha256":"ee089fe2b6308e10"}},{"arxiv_id":"2606.10403","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10403","title":"KCSAT-ML: Probing Reasoning Models with Nationwide-Cohort Human Difficulty","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"naver-ai/KCSAT-ML","path":"analysis/difficulty_signal_analysis.py","file_url":"https://github.com/naver-ai/KCSAT-ML/blob/HEAD/analysis/difficulty_signal_analysis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, naver-ai/KCSAT-ML, is not in the permissive set Syntology serves inline","code_sha256":"b786586bab293243","code_sha256_prefix":"b786586bab293243","mcp_get_code":{"code_sha256":"b786586bab293243"}},{"arxiv_id":"2605.03465","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-03465","title":"FINER-SQL: Boosting Small Language Models for Text-to-SQL","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"thanhdath/finer-sql","path":"db_execution/api.py","file_url":"https://github.com/thanhdath/finer-sql/blob/HEAD/db_execution/api.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thanhdath/finer-sql when it was checked","code_sha256":"dc377d73d6870e1a","code_sha256_prefix":"dc377d73d6870e1a","mcp_get_code":{"code_sha256":"dc377d73d6870e1a"}},{"arxiv_id":"2604.27776","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27776","title":"WindowsWorld: A Process-Centric Benchmark of Autonomous GUI Agents in Professional Cross-Application Environments","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"HITsz-TMG/WindowsWorld","path":"show_result.py","file_url":"https://github.com/HITsz-TMG/WindowsWorld/blob/HEAD/show_result.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0fba8134784628a","code_sha256_prefix":"e0fba8134784628a","mcp_get_code":{"code_sha256":"e0fba8134784628a"}},{"arxiv_id":"2604.26052","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-26052","title":"From Prompt Risk to Response Risk: Paired Analysis of Safety Behavior of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"microsoft/PairedSafety","path":"analysis/grader_error_analysis/analyze_grader_errors.py","file_url":"https://github.com/microsoft/PairedSafety/blob/HEAD/analysis/grader_error_analysis/analyze_grader_errors.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"997b1fcda4c2d309","code_sha256_prefix":"997b1fcda4c2d309","mcp_get_code":{"code_sha256":"997b1fcda4c2d309"}},{"arxiv_id":"2604.09588","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-09588","title":"A Multi-Anchor Architecture for Resilient Memory and Continuity","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"menonpg/soul.py","path":"hybrid_agent.py","file_url":"https://github.com/menonpg/soul.py/blob/HEAD/hybrid_agent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, menonpg/soul.py when it was checked","code_sha256":"52bdf3a07ed13126","code_sha256_prefix":"52bdf3a07ed13126","mcp_get_code":{"code_sha256":"52bdf3a07ed13126"}},{"arxiv_id":"2603.17685","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-17685","title":"Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints","date":"2026-03-18","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"lzqw/FLAME","path":"analysis/plot_exp37_main_figures.py","file_url":"https://github.com/lzqw/FLAME/blob/HEAD/analysis/plot_exp37_main_figures.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lzqw/FLAME when it was checked","code_sha256":"8f52d69d86b15b42","code_sha256_prefix":"8f52d69d86b15b42","mcp_get_code":{"code_sha256":"8f52d69d86b15b42"}},{"arxiv_id":"2412.02529","arxiv_id_is_arxiv":true,"paper":"/paper/active-learning-of-neural-population-dynamics","title":"Active learning of neural population dynamics using two-photon holographic optogenetics","date":"2024-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MouseLand/suite2p","path":"suite2p/classification/classify.py","file_url":"https://github.com/MouseLand/suite2p/blob/HEAD/suite2p/classification/classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, MouseLand/suite2p, is not in the permissive set Syntology serves inline","code_sha256":"1901e04637145fb3","code_sha256_prefix":"1901e04637145fb3","mcp_get_code":{"code_sha256":"1901e04637145fb3"}},{"arxiv_id":"2402.11782","arxiv_id_is_arxiv":true,"paper":"/paper/what-evidence-do-language-models-find","title":"What Evidence Do Language Models Find Convincing?","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexWan0/rag-convincingness","path":"features/sentiment.py","file_url":"https://github.com/AlexWan0/rag-convincingness/blob/HEAD/features/sentiment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b770f867538c53bd","code_sha256_prefix":"b770f867538c53bd","mcp_get_code":{"code_sha256":"b770f867538c53bd"}},{"arxiv_id":"2401.09266","arxiv_id_is_arxiv":true,"paper":"/paper/p-2-ot-progressive-partial-optimal-transport","title":"P$^2$OT: Progressive Partial Optimal Transport for Deep Imbalanced Clustering","date":"2024-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhfeiyang/ppot","path":"models/classifer.py","file_url":"https://github.com/rhfeiyang/ppot/blob/HEAD/models/classifer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rhfeiyang/ppot (NOASSERTION)","code_sha256":"d003b47d8f4e4a87","code_sha256_prefix":"d003b47d8f4e4a87","mcp_get_code":{"code_sha256":"d003b47d8f4e4a87"}},{"arxiv_id":"2401.06766","arxiv_id_is_arxiv":true,"paper":"/paper/mind-your-format-towards-consistent","title":"Mind Your Format: Towards Consistent Evaluation of In-Context Learning Improvements","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/mind-your-format","path":"evaluate.py","file_url":"https://github.com/yandex-research/mind-your-format/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aba3849d1ad68f1f","code_sha256_prefix":"aba3849d1ad68f1f","mcp_get_code":{"code_sha256":"aba3849d1ad68f1f"}},{"arxiv_id":"2312.02974","arxiv_id_is_arxiv":true,"paper":"/paper/describing-differences-in-image-sets-with","title":"Describing Differences in Image Sets with Natural Language","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"understanding-visual-datasets/visdiff","path":"components/ranker.py","file_url":"https://github.com/understanding-visual-datasets/visdiff/blob/HEAD/components/ranker.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7bd7b8929851dff6","code_sha256_prefix":"7bd7b8929851dff6","mcp_get_code":{"code_sha256":"7bd7b8929851dff6"}},{"arxiv_id":"2312.00194","arxiv_id_is_arxiv":true,"paper":"/paper/robust-concept-erasure-via-kernelized-rate-1","title":"Robust Concept Erasure via Kernelized Rate-Distortion Maximization","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brcsomnath/KRaM","path":"src/utils.py","file_url":"https://github.com/brcsomnath/KRaM/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"590b4d2c85eae0a0","code_sha256_prefix":"590b4d2c85eae0a0","mcp_get_code":{"code_sha256":"590b4d2c85eae0a0"}},{"arxiv_id":"2308.01313","arxiv_id_is_arxiv":true,"paper":"/paper/more-context-less-distraction-visual","title":"PerceptionCLIP: Visual Classification by Inferring and Conditioning on Contexts","date":"2023-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/perceptionclip","path":"src/zero_shot_inference/perceptionclip_two_step.py","file_url":"https://github.com/umd-huang-lab/perceptionclip/blob/HEAD/src/zero_shot_inference/perceptionclip_two_step.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"707f6200db45227e","code_sha256_prefix":"707f6200db45227e","mcp_get_code":{"code_sha256":"707f6200db45227e"}},{"arxiv_id":"2209.06861","arxiv_id_is_arxiv":true,"paper":"/paper/landmark-free-statistical-shape-modeling-via","title":"Landmark-free Statistical Shape Modeling via Neural Flow Deformations","date":"2022-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davecasp/flowssm","path":"utils/classifier.py","file_url":"https://github.com/davecasp/flowssm/blob/HEAD/utils/classifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e3305489b1b034bd","code_sha256_prefix":"e3305489b1b034bd","mcp_get_code":{"code_sha256":"e3305489b1b034bd"}},{"arxiv_id":"2203.14463","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-bilingual-language-image","title":"Large-scale Bilingual Language-Image Contrastive Learning","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"navervision/kelip","path":"demo/demo_zeroshot.py","file_url":"https://github.com/navervision/kelip/blob/HEAD/demo/demo_zeroshot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b87858058388425","code_sha256_prefix":"7b87858058388425","mcp_get_code":{"code_sha256":"7b87858058388425"}},{"arxiv_id":"2112.05224","arxiv_id_is_arxiv":true,"paper":"/paper/spinning-language-models-for-propaganda-as-a","title":"Spinning Language Models: Risks of Propaganda-As-A-Service and Countermeasures","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ebagdasa/propaganda_as_a_service","path":"examples/pytorch/translation/run_translation.py","file_url":"https://github.com/ebagdasa/propaganda_as_a_service/blob/HEAD/examples/pytorch/translation/run_translation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"67d3837326021806","code_sha256_prefix":"67d3837326021806","mcp_get_code":{"code_sha256":"67d3837326021806"}},{"arxiv_id":"2008.06376","arxiv_id_is_arxiv":true,"paper":"/paper/mlm-a-benchmark-dataset-for-multitask","title":"MLM: A Benchmark Dataset for Multitask Learning with Multiple Languages and Modalities","date":"2020-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GOALCLEOPATRA/MLM","path":"utils.py","file_url":"https://github.com/GOALCLEOPATRA/MLM/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fc1deb03f7852eb2","code_sha256_prefix":"fc1deb03f7852eb2","mcp_get_code":{"code_sha256":"fc1deb03f7852eb2"}},{"arxiv_id":"2006.12101","arxiv_id_is_arxiv":true,"paper":"/paper/p3gm-private-high-dimensional-data-release","title":"P3GM: Private High-Dimensional Data Release via Privacy Preserving Phased Generative Model","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsubasat/P3GM","path":"ml_task/tabledata_classification.py","file_url":"https://github.com/tsubasat/P3GM/blob/HEAD/ml_task/tabledata_classification.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6da71f6fed8df80b","code_sha256_prefix":"6da71f6fed8df80b","mcp_get_code":{"code_sha256":"6da71f6fed8df80b"}},{"arxiv_id":"2006.12101","arxiv_id_is_arxiv":true,"paper":"/paper/p3gm-private-high-dimensional-data-release","title":"P3GM: Private High-Dimensional Data Release via Privacy Preserving Phased Generative Model","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsubasat/P3GM","path":"ml_task/mnist_classification.py","file_url":"https://github.com/tsubasat/P3GM/blob/HEAD/ml_task/mnist_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b3372fdcfeff79d","code_sha256_prefix":"2b3372fdcfeff79d","mcp_get_code":{"code_sha256":"2b3372fdcfeff79d"}},{"arxiv_id":"1907.05982","arxiv_id_is_arxiv":true,"paper":"/paper/learning-complex-basis-functions-for","title":"Learning Complex Basis Functions for Invariant Representations of Audio","date":"2019-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SonyCSLParis/cae-invar","path":"convert.py","file_url":"https://github.com/SonyCSLParis/cae-invar/blob/HEAD/convert.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, SonyCSLParis/cae-invar (NOASSERTION)","code_sha256":"cb2dd797c889d65b","code_sha256_prefix":"cb2dd797c889d65b","mcp_get_code":{"code_sha256":"cb2dd797c889d65b"}},{"arxiv_id":"1606.03657","arxiv_id_is_arxiv":true,"paper":"/paper/infogan-interpretable-representation-learning","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","date":"2016-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reihaneh-torkzadehmahani/DP-CGAN","path":"DP_CGAN/dp_conditional_gan_mnist/DP_CGAN_MomentAcc.py","file_url":"https://github.com/reihaneh-torkzadehmahani/DP-CGAN/blob/HEAD/DP_CGAN/dp_conditional_gan_mnist/DP_CGAN_MomentAcc.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"effa600d353bed01","code_sha256_prefix":"effa600d353bed01","mcp_get_code":{"code_sha256":"effa600d353bed01"}},{"arxiv_id":"1512.00567","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DanishShah/DeepDiagnosis","path":"Web/Backend/predict.py","file_url":"https://github.com/DanishShah/DeepDiagnosis/blob/HEAD/Web/Backend/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d804546ecbde837","code_sha256_prefix":"1d804546ecbde837","mcp_get_code":{"code_sha256":"1d804546ecbde837"}},{"arxiv_id":"aaai_29068","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29068","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NJUyued/SoC4SS-FGVC","path":"models/soc/soc_utils.py","file_url":"https://github.com/NJUyued/SoC4SS-FGVC/blob/HEAD/models/soc/soc_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"46c00ea45d5825c1","code_sha256_prefix":"46c00ea45d5825c1","mcp_get_code":{"code_sha256":"46c00ea45d5825c1"}},{"arxiv_id":"2024.findings-emnlp.130","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.130","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wojciechowskiofficial/FLEX","path":"src/utils.py","file_url":"https://github.com/wojciechowskiofficial/FLEX/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"383aa52de4a5faf8","code_sha256_prefix":"383aa52de4a5faf8","mcp_get_code":{"code_sha256":"383aa52de4a5faf8"}}],"record_sha256":"3fdb3930e3ab8fc561a7bdd109ffa836d160639dff8cf13879b1052ebb2f7d69","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}