{"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-idx","entry":"get_idx","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":14,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":14,"n_places_pointer_only":2,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":9,"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":"2607.17653","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-17653","title":"LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"iamjingli/LFM","path":"train_target.py","file_url":"https://github.com/iamjingli/LFM/blob/HEAD/train_target.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":"780faf558bba6b54","code_sha256_prefix":"780faf558bba6b54","mcp_get_code":{"code_sha256":"780faf558bba6b54"}},{"arxiv_id":"2310.00567","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-robustness-of-randomized","title":"Understanding the Robustness of Randomized Feature Defense Against Query-Based Adversarial Attacks","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mail-research/randomized_defenses","path":"attack/nes.py","file_url":"https://github.com/mail-research/randomized_defenses/blob/HEAD/attack/nes.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, mail-research/randomized_defenses, is not in the permissive set Syntology serves inline","code_sha256":"3cb33b36db4150ca","code_sha256_prefix":"3cb33b36db4150ca","mcp_get_code":{"code_sha256":"3cb33b36db4150ca"}},{"arxiv_id":"2306.11443","arxiv_id_is_arxiv":true,"paper":"/paper/uukg-unified-urban-knowledge-graph-dataset-1","title":"UUKG: Unified Urban Knowledge Graph Dataset for Urban Spatiotemporal Prediction","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usail-hkust/UUKG","path":"UrbanKG_Embedding_Model/datasets/process.py","file_url":"https://github.com/usail-hkust/UUKG/blob/HEAD/UrbanKG_Embedding_Model/datasets/process.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":"e236aeb29b50d533","code_sha256_prefix":"e236aeb29b50d533","mcp_get_code":{"code_sha256":"e236aeb29b50d533"}},{"arxiv_id":"2305.19912","arxiv_id_is_arxiv":true,"paper":"/paper/structure-aware-language-model-pretraining","title":"Structure-Aware Language Model Pretraining Improves Dense Retrieval on Structured Data","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/openmatch","path":"src/openmatch/dataset/inference_dataset.py","file_url":"https://github.com/openmatch/openmatch/blob/HEAD/src/openmatch/dataset/inference_dataset.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":"90f77daf63ac2f1f","code_sha256_prefix":"90f77daf63ac2f1f","mcp_get_code":{"code_sha256":"90f77daf63ac2f1f"}},{"arxiv_id":"2305.17331","arxiv_id_is_arxiv":true,"paper":"/paper/augmentation-adapted-retriever-improves","title":"Augmentation-Adapted Retriever Improves Generalization of Language Models as Generic Plug-In","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenMatch/Augmentation-Adapted-Retriever","path":"src/Retriever/dataset/inference_dataset.py","file_url":"https://github.com/OpenMatch/Augmentation-Adapted-Retriever/blob/HEAD/src/Retriever/dataset/inference_dataset.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":"5648464c24fcb9de","code_sha256_prefix":"5648464c24fcb9de","mcp_get_code":{"code_sha256":"5648464c24fcb9de"}},{"arxiv_id":"2303.03004","arxiv_id_is_arxiv":true,"paper":"/paper/xcodeeval-a-large-scale-multilingual","title":"xCodeEval: A Large Scale Multilingual Multitask Benchmark for Code Understanding, Generation, Translation and Retrieval","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntunlp/xCodeEval","path":"evaluation/apr/eval_apr.py","file_url":"https://github.com/ntunlp/xCodeEval/blob/HEAD/evaluation/apr/eval_apr.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":"0e1583e6dd5914dd","code_sha256_prefix":"0e1583e6dd5914dd","mcp_get_code":{"code_sha256":"0e1583e6dd5914dd"}},{"arxiv_id":"2211.13449","arxiv_id_is_arxiv":true,"paper":"/paper/fast-sampling-of-diffusion-models-via","title":"Fast Sampling of Diffusion Models via Operator Learning","date":"2022-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devzhk/dsno-pytorch","path":"generate_imagenet.py","file_url":"https://github.com/devzhk/dsno-pytorch/blob/HEAD/generate_imagenet.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":"a57d49ef17dbed05","code_sha256_prefix":"a57d49ef17dbed05","mcp_get_code":{"code_sha256":"a57d49ef17dbed05"}},{"arxiv_id":"2111.12050","arxiv_id_is_arxiv":true,"paper":"/paper/simple-stochastic-and-online-gradient","title":"Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise Learning","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenhuan-yang/simple-pairwise","path":"alg/auc_olp_1_hinge.py","file_url":"https://github.com/zhenhuan-yang/simple-pairwise/blob/HEAD/alg/auc_olp_1_hinge.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, zhenhuan-yang/simple-pairwise when it was checked","code_sha256":"7f75b419fa227545","code_sha256_prefix":"7f75b419fa227545","mcp_get_code":{"code_sha256":"7f75b419fa227545"}},{"arxiv_id":"2110.13475","arxiv_id_is_arxiv":true,"paper":"/paper/vector-valued-distance-and-gyrocalculus-on","title":"Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fedelopez77/gyrospd","path":"preprocess.py","file_url":"https://github.com/fedelopez77/gyrospd/blob/HEAD/preprocess.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":"626b615eb7fb469f","code_sha256_prefix":"626b615eb7fb469f","mcp_get_code":{"code_sha256":"626b615eb7fb469f"}},{"arxiv_id":"2103.16694","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-unsupervised-domain-adaptation-for","title":"Geometric Unsupervised Domain Adaptation for Semantic Segmentation","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tri-ml/packnet-sfm","path":"packnet_sfm/datasets/image_dataset.py","file_url":"https://github.com/tri-ml/packnet-sfm/blob/HEAD/packnet_sfm/datasets/image_dataset.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":"6d3ca8f94497d761","code_sha256_prefix":"6d3ca8f94497d761","mcp_get_code":{"code_sha256":"6d3ca8f94497d761"}},{"arxiv_id":"2002.12319","arxiv_id_is_arxiv":true,"paper":"/paper/semantically-guided-representation-learning-1","title":"Semantically-Guided Representation Learning for Self-Supervised Monocular Depth","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TRI-ML/packnet-sfm","path":"packnet_sfm/datasets/image_dataset.py","file_url":"https://github.com/TRI-ML/packnet-sfm/blob/HEAD/packnet_sfm/datasets/image_dataset.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":"6d3ca8f94497d761","code_sha256_prefix":"6d3ca8f94497d761","mcp_get_code":{"code_sha256":"6d3ca8f94497d761"}},{"arxiv_id":"1902.01932","arxiv_id_is_arxiv":true,"paper":"/paper/the-zwicky-transient-facility-system-overview","title":"The Zwicky Transient Facility: System Overview, Performance, and First Results","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"cherry0116/RB-C1000","path":"cls_code/load_bestckpt.py","file_url":"https://github.com/cherry0116/RB-C1000/blob/HEAD/cls_code/load_bestckpt.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":"7655e7b7a2e7b792","code_sha256_prefix":"7655e7b7a2e7b792","mcp_get_code":{"code_sha256":"7655e7b7a2e7b792"}},{"arxiv_id":"aaai_30169","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_30169","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jacobwang925/path-integral-PINN","path":"src/autoencoder/utils.py","file_url":"https://github.com/jacobwang925/path-integral-PINN/blob/HEAD/src/autoencoder/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":"491a46325b8b6d0a","code_sha256_prefix":"491a46325b8b6d0a","mcp_get_code":{"code_sha256":"491a46325b8b6d0a"}},{"arxiv_id":"2023.findings-acl.734","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.734","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"OpenMatch/OpenMatch","path":"src/openmatch/dataset/inference_dataset.py","file_url":"https://github.com/OpenMatch/OpenMatch/blob/HEAD/src/openmatch/dataset/inference_dataset.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":"90f77daf63ac2f1f","code_sha256_prefix":"90f77daf63ac2f1f","mcp_get_code":{"code_sha256":"90f77daf63ac2f1f"}}],"record_sha256":"8eed7749b7e83152c6fab6ffdcbbe7cf6b3291194d9a53b539d01cd04b933a56","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}