{"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/get-classifier","entry":"get_classifier","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":16,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"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":15,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":7,"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":1,"ran_fixture":0,"ran":8,"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":"2605.02167","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-02167","title":"Manifold-Aligned Guided Integrated Gradients for Reliable Feature Attribution","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"leekwoon/ma-gig","path":"cleanig/classifier/utils.py","file_url":"https://github.com/leekwoon/ma-gig/blob/HEAD/cleanig/classifier/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":"b82506d701961b39","code_sha256_prefix":"b82506d701961b39","mcp_get_code":{"code_sha256":"b82506d701961b39"}},{"arxiv_id":"2501.05040","arxiv_id_is_arxiv":true,"paper":"/paper/swe-fixer-training-open-source-llms-for","title":"SWE-Fixer: Training Open-Source LLMs for Effective and Efficient GitHub Issue Resolution","date":"2025-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jorge-martinez-gil/graphcodebert-feature-integration","path":"src/featfuse/experiment.py","file_url":"https://github.com/jorge-martinez-gil/graphcodebert-feature-integration/blob/HEAD/src/featfuse/experiment.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":"306fd49af7f42a7e","code_sha256_prefix":"306fd49af7f42a7e","mcp_get_code":{"code_sha256":"306fd49af7f42a7e"}},{"arxiv_id":"2410.24012","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-twigs-with-loop-guidance-for","title":"Diffusion Twigs with Loop Guidance for Conditional Graph Generation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aalto-quml/diffusion_twigs","path":"cond_gen/model.py","file_url":"https://github.com/aalto-quml/diffusion_twigs/blob/HEAD/cond_gen/model.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":"5c23bdb7b2567c43","code_sha256_prefix":"5c23bdb7b2567c43","mcp_get_code":{"code_sha256":"5c23bdb7b2567c43"}},{"arxiv_id":"2410.06746","arxiv_id_is_arxiv":true,"paper":"/paper/cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUMIA-Group/Cluster-wise-Graph-Transformer","path":"Cluster_GT_N2C_L.py","file_url":"https://github.com/LUMIA-Group/Cluster-wise-Graph-Transformer/blob/HEAD/Cluster_GT_N2C_L.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, LUMIA-Group/Cluster-wise-Graph-Transformer when it was checked","code_sha256":"97e6235979044fb2","code_sha256_prefix":"97e6235979044fb2","mcp_get_code":{"code_sha256":"97e6235979044fb2"}},{"arxiv_id":"2407.07084","arxiv_id_is_arxiv":true,"paper":"/paper/stabilized-proximal-point-methods-for","title":"Stabilized Proximal-Point Methods for Federated Optimization","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlolab/s-dane","path":"src/base_classifier.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/base_classifier.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, mlolab/s-dane when it was checked","code_sha256":"759293e202b468dd","code_sha256_prefix":"759293e202b468dd","mcp_get_code":{"code_sha256":"759293e202b468dd"}},{"arxiv_id":"2310.00158","arxiv_id_is_arxiv":true,"paper":"/paper/feedback-guided-data-synthesis-for-imbalanced","title":"Feedback-guided Data Synthesis for Imbalanced Classification","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/feedback-guided-data-synthesis","path":"utils_gen.py","file_url":"https://github.com/facebookresearch/feedback-guided-data-synthesis/blob/HEAD/utils_gen.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, facebookresearch/feedback-guided-data-synthesis (NOASSERTION)","code_sha256":"5f8c4b3fc2498b7a","code_sha256_prefix":"5f8c4b3fc2498b7a","mcp_get_code":{"code_sha256":"5f8c4b3fc2498b7a"}},{"arxiv_id":"2307.16847","arxiv_id_is_arxiv":true,"paper":"/paper/latent-masking-for-multimodal-self-supervised","title":"CroSSL: Cross-modal Self-Supervised Learning for Time-series through Latent Masking","date":"2023-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dr-bell/crossl","path":"src/evaluation/classifier.py","file_url":"https://github.com/dr-bell/crossl/blob/HEAD/src/evaluation/classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, dr-bell/crossl, is not in the permissive set Syntology serves inline","code_sha256":"52ddac84b5418461","code_sha256_prefix":"52ddac84b5418461","mcp_get_code":{"code_sha256":"52ddac84b5418461"}},{"arxiv_id":"2307.06306","arxiv_id_is_arxiv":true,"paper":"/paper/locally-adaptive-federated-learning-via","title":"Locally Adaptive Federated Learning","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IssamLaradji/sps","path":"src/base_classifiers.py","file_url":"https://github.com/IssamLaradji/sps/blob/HEAD/src/base_classifiers.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, IssamLaradji/sps when it was checked","code_sha256":"a5848be464d3178c","code_sha256_prefix":"a5848be464d3178c","mcp_get_code":{"code_sha256":"a5848be464d3178c"}},{"arxiv_id":"2306.13091","arxiv_id_is_arxiv":true,"paper":"/paper/evading-forensic-classifiers-with-attribute-1","title":"Evading Forensic Classifiers with Attribute-Conditioned Adversarial Faces","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koushiksrivats/face_attribute_attack","path":"image_as_reference.py","file_url":"https://github.com/koushiksrivats/face_attribute_attack/blob/HEAD/image_as_reference.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, koushiksrivats/face_attribute_attack when it was checked","code_sha256":"dd91635c995516a5","code_sha256_prefix":"dd91635c995516a5","mcp_get_code":{"code_sha256":"dd91635c995516a5"}},{"arxiv_id":"2206.10843","arxiv_id_is_arxiv":true,"paper":"/paper/learning-debiased-classifier-with-biased","title":"Learning Debiased Classifier with Biased Committee","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nayeong-v-kim/lwbc","path":"LWBC/utils.py","file_url":"https://github.com/nayeong-v-kim/lwbc/blob/HEAD/LWBC/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":"ddba6a6202534e39","code_sha256_prefix":"ddba6a6202534e39","mcp_get_code":{"code_sha256":"ddba6a6202534e39"}},{"arxiv_id":"2106.00472","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-anomalies-in-semantic-segmentation","title":"Detecting Anomalies in Semantic Segmentation with Prototypes","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DarioFontanel/PAnS","path":"modules/classifier.py","file_url":"https://github.com/DarioFontanel/PAnS/blob/HEAD/modules/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":"2b60e0a0000bc62a","code_sha256_prefix":"2b60e0a0000bc62a","mcp_get_code":{"code_sha256":"2b60e0a0000bc62a"}},{"arxiv_id":"1912.02919","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-intrinsic-privacy-of-stochastic","title":"An Empirical Study on the Intrinsic Privacy of SGD","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/intrinsic-private-sgd","path":"aDPSGD/attacks.py","file_url":"https://github.com/microsoft/intrinsic-private-sgd/blob/HEAD/aDPSGD/attacks.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":"a8aefe19dea792d8","code_sha256_prefix":"a8aefe19dea792d8","mcp_get_code":{"code_sha256":"a8aefe19dea792d8"}},{"arxiv_id":"1409.7495","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenkang121/DANN","path":"DANN_minit_to_mnist_m.py","file_url":"https://github.com/chenkang121/DANN/blob/HEAD/DANN_minit_to_mnist_m.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"none","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chenkang121/DANN when it was checked","code_sha256":"d968cbdfc4dbc680","code_sha256_prefix":"d968cbdfc4dbc680","mcp_get_code":{"code_sha256":"d968cbdfc4dbc680"}},{"arxiv_id":"ijcai2025_0872","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0872","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HongxinXiang/EDG","path":"EDG-for-VisNet/visnet_for_EDG/distillation_utils.py","file_url":"https://github.com/HongxinXiang/EDG/blob/HEAD/EDG-for-VisNet/visnet_for_EDG/distillation_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":"593f351c6adc0616","code_sha256_prefix":"593f351c6adc0616","mcp_get_code":{"code_sha256":"593f351c6adc0616"}},{"arxiv_id":"ijcai2024_0675","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0675","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HongxinXiang/IEM","path":"model/model_utils.py","file_url":"https://github.com/HongxinXiang/IEM/blob/HEAD/model/model_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":"593f351c6adc0616","code_sha256_prefix":"593f351c6adc0616","mcp_get_code":{"code_sha256":"593f351c6adc0616"}},{"arxiv_id":"aaai_26741","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26741","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lygjwy/READ","path":"models/utils.py","file_url":"https://github.com/lygjwy/READ/blob/HEAD/models/utils.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":"ba1f61f13be189e5","code_sha256_prefix":"ba1f61f13be189e5","mcp_get_code":{"code_sha256":"ba1f61f13be189e5"}}],"record_sha256":"82e41879f80c25e9288c198aceb5284fd3aa115cb96c7c2e900aec83c8f2f05f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}