{"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/parse-file","entry":"parse_file","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":3,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":2},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2608.10470","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10470","title":"A Joint-Distribution Route to Fair Representations with Continuous Sensitive Attributes","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Yijin911/FRHSIC","path":"experiments/compute_matched_aup.py","file_url":"https://github.com/Yijin911/FRHSIC/blob/HEAD/experiments/compute_matched_aup.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c3621cd01e12cc1","code_sha256_prefix":"2c3621cd01e12cc1","mcp_get_code":{"code_sha256":"2c3621cd01e12cc1"}},{"arxiv_id":"2608.10470","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10470","title":"A Joint-Distribution Route to Fair Representations with Continuous Sensitive Attributes","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Yijin911/FRHSIC","path":"experiments/compute_pareto_summary.py","file_url":"https://github.com/Yijin911/FRHSIC/blob/HEAD/experiments/compute_pareto_summary.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"40ba51bc6026b2a9","code_sha256_prefix":"40ba51bc6026b2a9","mcp_get_code":{"code_sha256":"40ba51bc6026b2a9"}},{"arxiv_id":"2601.05355","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05355","title":"An AI-powered Bayesian Generative Modeling Approach for Arbitrary Conditional Inference","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"liuq-lab/bayesgm","path":"src/bayesgm/utils/data_io.py","file_url":"https://github.com/liuq-lab/bayesgm/blob/HEAD/src/bayesgm/utils/data_io.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":"68474fd11e08b18e","code_sha256_prefix":"68474fd11e08b18e","mcp_get_code":{"code_sha256":"68474fd11e08b18e"}},{"arxiv_id":"2506.09944","arxiv_id_is_arxiv":true,"paper":"/paper/query-focused-retrieval-heads-improve-long","title":"Query-Focused Retrieval Heads Improve Long-Context Reasoning and Re-ranking","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-pli/QRHead","path":"exp_scripts/generation/eval_generation_clipper.py","file_url":"https://github.com/princeton-pli/QRHead/blob/HEAD/exp_scripts/generation/eval_generation_clipper.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":"1340e53f675329ea","code_sha256_prefix":"1340e53f675329ea","mcp_get_code":{"code_sha256":"1340e53f675329ea"}},{"arxiv_id":"2403.16218","arxiv_id_is_arxiv":true,"paper":"/paper/coverup-coverage-guided-llm-based-test","title":"CoverUp: Effective High Coverage Test Generation for Python","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plasma-umass/coverup","path":"src/coverup/codeinfo.py","file_url":"https://github.com/plasma-umass/coverup/blob/HEAD/src/coverup/codeinfo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7bb4f87378c340a8","code_sha256_prefix":"7bb4f87378c340a8","mcp_get_code":{"code_sha256":"7bb4f87378c340a8"}},{"arxiv_id":"2403.12844","arxiv_id_is_arxiv":true,"paper":"/paper/melting-point-mobile-evaluation-of-language","title":"MELTing point: Mobile Evaluation of Language Transformers","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brave-experiments/melt-public","path":"src/parsers/utils/utils.py","file_url":"https://github.com/brave-experiments/melt-public/blob/HEAD/src/parsers/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, brave-experiments/melt-public (NOASSERTION)","code_sha256":"ef5a8d3df237c9ff","code_sha256_prefix":"ef5a8d3df237c9ff","mcp_get_code":{"code_sha256":"ef5a8d3df237c9ff"}},{"arxiv_id":"2212.12672","arxiv_id_is_arxiv":true,"paper":"/paper/real-or-fake-text-investigating-human-ability","title":"Real or Fake Text?: Investigating Human Ability to Detect Boundaries Between Human-Written and Machine-Generated Text","date":"2022-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liamdugan/human-detection","path":"generation/process_datasets/process-Speeches.py","file_url":"https://github.com/liamdugan/human-detection/blob/HEAD/generation/process_datasets/process-Speeches.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":"8a6414ef46ee5bc8","code_sha256_prefix":"8a6414ef46ee5bc8","mcp_get_code":{"code_sha256":"8a6414ef46ee5bc8"}},{"arxiv_id":"2107.06263","arxiv_id_is_arxiv":true,"paper":"/paper/cmt-convolutional-neural-networks-meet-vision","title":"CMT: Convolutional Neural Networks Meet Vision Transformers","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FlyEgle/CMT-pytorch","path":"utils/calculate_acc.py","file_url":"https://github.com/FlyEgle/CMT-pytorch/blob/HEAD/utils/calculate_acc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FlyEgle/CMT-pytorch when it was checked","code_sha256":"fab5a21985473f72","code_sha256_prefix":"fab5a21985473f72","mcp_get_code":{"code_sha256":"fab5a21985473f72"}},{"arxiv_id":"2102.07804","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-up-exact-neural-network-compression","title":"Scaling Up Exact Neural Network Compression by ReLU Stability","date":"2021-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuxwind/exactcompression","path":"get_activation_patterns.py","file_url":"https://github.com/yuxwind/exactcompression/blob/HEAD/get_activation_patterns.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yuxwind/exactcompression when it was checked","code_sha256":"d04f5ead368dc743","code_sha256_prefix":"d04f5ead368dc743","mcp_get_code":{"code_sha256":"d04f5ead368dc743"}},{"arxiv_id":"1912.05372","arxiv_id_is_arxiv":true,"paper":"/paper/flaubert-unsupervised-language-model-pre","title":"FlauBERT: Unsupervised Language Model Pre-training for French","date":"2019-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TheophileBlard/french-sentiment-analysis-with-bert","path":"utils_acl.py","file_url":"https://github.com/TheophileBlard/french-sentiment-analysis-with-bert/blob/HEAD/utils_acl.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":"7843e5379321e72d","code_sha256_prefix":"7843e5379321e72d","mcp_get_code":{"code_sha256":"7843e5379321e72d"}}],"record_sha256":"08afdfe10550801a492cdf85e41655ca99c019a5a9a75897e30bc68cd05471d2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}