{"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/calculate-auc","entry":"calculate_auc","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":9,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":8,"unverified":0},"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":"2602.17531","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17531","title":"Position: Evaluation of ECG Representations Must Be Fixed","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"zackeberger/ecg-fix","path":"external_src/CLOCS/prepare_miscellaneous.py","file_url":"https://github.com/zackeberger/ecg-fix/blob/HEAD/external_src/CLOCS/prepare_miscellaneous.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zackeberger/ecg-fix when it was checked","code_sha256":"589a7e55ed3ed424","code_sha256_prefix":"589a7e55ed3ed424","mcp_get_code":{"code_sha256":"589a7e55ed3ed424"}},{"arxiv_id":"2602.03895","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03895","title":"Benchmarking Bias Mitigation Toward Fairness Without Harm from Vision to LVLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"osu-srml/NH-Fair","path":"src/release_benchmark/methods/vlm/clip_fairer.py","file_url":"https://github.com/osu-srml/NH-Fair/blob/HEAD/src/release_benchmark/methods/vlm/clip_fairer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d26ce6032a0e6929","code_sha256_prefix":"d26ce6032a0e6929","mcp_get_code":{"code_sha256":"d26ce6032a0e6929"}},{"arxiv_id":"2412.16577","arxiv_id_is_arxiv":true,"paper":"/paper/a-meta-learning-approach-to-bayesian-causal","title":"A Meta-Learning Approach to Bayesian Causal Discovery","date":"2024-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Anish144/CausalStructureNeuralProcess","path":"ml2_meta_causal_discovery/utils/metrics.py","file_url":"https://github.com/Anish144/CausalStructureNeuralProcess/blob/HEAD/ml2_meta_causal_discovery/utils/metrics.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":"1731dc78c5f9c460","code_sha256_prefix":"1731dc78c5f9c460","mcp_get_code":{"code_sha256":"1731dc78c5f9c460"}},{"arxiv_id":"2406.12284","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-the-recency-heuristic-in","title":"Demystifying the Recency Heuristic in Temporal-Difference Learning","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brett-daley/recency-heuristic","path":"plotting/utils.py","file_url":"https://github.com/brett-daley/recency-heuristic/blob/HEAD/plotting/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, brett-daley/recency-heuristic when it was checked","code_sha256":"dcf8fb5c2dde194d","code_sha256_prefix":"dcf8fb5c2dde194d","mcp_get_code":{"code_sha256":"dcf8fb5c2dde194d"}},{"arxiv_id":"2401.06654","arxiv_id_is_arxiv":true,"paper":"/paper/decoupling-pixel-flipping-and-occlusion","title":"Decoupling Pixel Flipping and Occlusion Strategy for Consistent XAI Benchmarks","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bluecher31/pixel-flipping","path":"src/plotting.py","file_url":"https://github.com/bluecher31/pixel-flipping/blob/HEAD/src/plotting.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-2.1","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-2.1, as GitHub detects it on this paper's repository, bluecher31/pixel-flipping, is not in the permissive set Syntology serves inline","code_sha256":"d09d3325aee96b41","code_sha256_prefix":"d09d3325aee96b41","mcp_get_code":{"code_sha256":"d09d3325aee96b41"}},{"arxiv_id":"2104.01528","arxiv_id_is_arxiv":true,"paper":"/paper/sgcn-sparse-graph-convolution-network-for","title":"SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/sgcn","path":"src/ms_utils.py","file_url":"https://github.com/lyqcom/sgcn/blob/HEAD/src/ms_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f3ab1fd10395d35","code_sha256_prefix":"5f3ab1fd10395d35","mcp_get_code":{"code_sha256":"5f3ab1fd10395d35"}},{"arxiv_id":"2003.09572","arxiv_id_is_arxiv":true,"paper":"/paper/monocular-real-time-hand-shape-and-motion","title":"Monocular Real-time Hand Shape and Motion Capture using Multi-modal Data","date":"2020-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CalciferZh/minimal-hand","path":"plot.py","file_url":"https://github.com/CalciferZh/minimal-hand/blob/HEAD/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"293235daae8170bd","code_sha256_prefix":"293235daae8170bd","mcp_get_code":{"code_sha256":"293235daae8170bd"}},{"arxiv_id":"ijcai2025_0843","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0843","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wason981/Frequency-Fingerprinting","path":"auc_matching_rate.py","file_url":"https://github.com/wason981/Frequency-Fingerprinting/blob/HEAD/auc_matching_rate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e7601177172f8fe","code_sha256_prefix":"9e7601177172f8fe","mcp_get_code":{"code_sha256":"9e7601177172f8fe"}},{"arxiv_id":"ijcai2025_0843","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0843","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wason981/Frequency-Fingerprinting","path":"utils.py","file_url":"https://github.com/wason981/Frequency-Fingerprinting/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43040d895e89c0cf","code_sha256_prefix":"43040d895e89c0cf","mcp_get_code":{"code_sha256":"43040d895e89c0cf"}}],"record_sha256":"97cf635ba94eb70da721c608222ba1a18d46f23aa9d7dbe4f984db436544b9da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}