{"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/l1-distance","entry":"l1_distance","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"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":"2410.04118","arxiv_id_is_arxiv":true,"paper":"/paper/riemann-sum-optimization-for-accurate","title":"Riemann Sum Optimization for Accurate Integrated Gradients Computation","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShreeSinghi/RiemannOpt","path":"gig.py","file_url":"https://github.com/ShreeSinghi/RiemannOpt/blob/HEAD/gig.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ShreeSinghi/RiemannOpt when it was checked","code_sha256":"2bddbe8f3d657d11","code_sha256_prefix":"2bddbe8f3d657d11","mcp_get_code":{"code_sha256":"2bddbe8f3d657d11"}},{"arxiv_id":"2403.20287","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-counterfactual-image-generation","title":"Benchmarking Counterfactual Image Generation","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gulnazaki/counterfactual-benchmark","path":"counterfactual_benchmark/evaluation/metrics/composition.py","file_url":"https://github.com/gulnazaki/counterfactual-benchmark/blob/HEAD/counterfactual_benchmark/evaluation/metrics/composition.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":"785be62d438020c7","code_sha256_prefix":"785be62d438020c7","mcp_get_code":{"code_sha256":"785be62d438020c7"}},{"arxiv_id":"2312.01811","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-potential-games-for-joint-motion","title":"Energy-based Potential Games for Joint Motion Forecasting and Control","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rst-tu-dortmund/diff_epo_planner","path":"source_code/model/losses.py","file_url":"https://github.com/rst-tu-dortmund/diff_epo_planner/blob/HEAD/source_code/model/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"984f6501ea229809","code_sha256_prefix":"984f6501ea229809","mcp_get_code":{"code_sha256":"984f6501ea229809"}},{"arxiv_id":"2304.06715","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-the-robustness-of-interpretability","title":"Evaluating the Robustness of Interpretability Methods through Explanation Invariance and Equivariance","date":"2023-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonathanCrabbe/RobustXAI","path":"interpretability/robustness.py","file_url":"https://github.com/JonathanCrabbe/RobustXAI/blob/HEAD/interpretability/robustness.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JonathanCrabbe/RobustXAI when it was checked","code_sha256":"bd9383f51198bb85","code_sha256_prefix":"bd9383f51198bb85","mcp_get_code":{"code_sha256":"bd9383f51198bb85"}},{"arxiv_id":"2210.12438","arxiv_id_is_arxiv":true,"paper":"/paper/algorithms-with-prediction-portfolios","title":"Algorithms with Prediction Portfolios","date":"2022-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tlavastida/PredictionPortfolios","path":"KMedian.py","file_url":"https://github.com/tlavastida/PredictionPortfolios/blob/HEAD/KMedian.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":"8689b1b268903675","code_sha256_prefix":"8689b1b268903675","mcp_get_code":{"code_sha256":"8689b1b268903675"}},{"arxiv_id":"2209.08801","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-set-generative-models","title":"Sequence-to-Set Generative Models","date":"2022-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longtaotang/setlearning","path":"utility/metric.py","file_url":"https://github.com/longtaotang/setlearning/blob/HEAD/utility/metric.py","status":"unverified","verification_level":0,"contract_check":"VIOLATES","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, longtaotang/setlearning when it was checked","code_sha256":"dac4293cef446a2a","code_sha256_prefix":"dac4293cef446a2a","mcp_get_code":{"code_sha256":"dac4293cef446a2a"}},{"arxiv_id":"2106.09788","arxiv_id_is_arxiv":true,"paper":"/paper/guided-integrated-gradients-an-adaptive-path","title":"Guided Integrated Gradients: An Adaptive Path Method for Removing Noise","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PAIR-code/saliency","path":"saliency/core/guided_ig.py","file_url":"https://github.com/PAIR-code/saliency/blob/HEAD/saliency/core/guided_ig.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d1b7fc161031727","code_sha256_prefix":"4d1b7fc161031727","mcp_get_code":{"code_sha256":"4d1b7fc161031727"}},{"arxiv_id":"1908.08705","arxiv_id_is_arxiv":true,"paper":"/paper/advhat-real-world-adversarial-attack-on","title":"AdvHat: Real-world adversarial attack on ArcFace Face ID system","date":"2019-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jiawei955/detection-of-physical-adversarial-attack","path":"Codes/defense.py","file_url":"https://github.com/Jiawei955/detection-of-physical-adversarial-attack/blob/HEAD/Codes/defense.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Jiawei955/detection-of-physical-adversarial-attack when it was checked","code_sha256":"9bd45ffd1997cac2","code_sha256_prefix":"9bd45ffd1997cac2","mcp_get_code":{"code_sha256":"9bd45ffd1997cac2"}}],"record_sha256":"378bc012a40d204ddbef4097bf8a5bf2ab135c6f00231acf54a00f6c7f0f05e4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}