{"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/basemodule","entry":"BaseModule","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":10,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":10,"n_samples_ran":1,"n_samples_constructed":1,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":5,"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":0,"ran":1,"unverified":9},"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":"2601.11161","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11161","title":"GMM-COMET: Continual Source-Free Universal Domain Adaptation via a Mean Teacher and Gaussian Mixture Model-Based Pseudo-Labeling","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"pascalschlachter/GMM-COMET","path":"adaptation.py","file_url":"https://github.com/pascalschlachter/GMM-COMET/blob/HEAD/adaptation.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, pascalschlachter/GMM-COMET when it was checked","code_sha256":"18c7e044059b010b","code_sha256_prefix":"18c7e044059b010b","mcp_get_code":{"code_sha256":"18c7e044059b010b"}},{"arxiv_id":"2404.11599","arxiv_id_is_arxiv":true,"paper":"/paper/variational-bayesian-last-layers","title":"Variational Bayesian Last Layers","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightning-uq-box/lightning-uq-box","path":"lightning_uq_box/uq_methods/vbll.py","file_url":"https://github.com/lightning-uq-box/lightning-uq-box/blob/HEAD/lightning_uq_box/uq_methods/vbll.py","status":"unverified","verification_level":0,"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":"d36cc2dac0856730","code_sha256_prefix":"d36cc2dac0856730","mcp_get_code":{"code_sha256":"d36cc2dac0856730"}},{"arxiv_id":"2402.05706","arxiv_id_is_arxiv":true,"paper":"/paper/unified-speech-text-pretraining-for-spoken","title":"Paralinguistics-Aware Speech-Empowered Large Language Models for Natural Conversation","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/usdm","path":"src/decoder/voicebox/model/voicebox.py","file_url":"https://github.com/naver-ai/usdm/blob/HEAD/src/decoder/voicebox/model/voicebox.py","status":"unverified","verification_level":0,"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":"76cadc87e9fc55ed","code_sha256_prefix":"76cadc87e9fc55ed","mcp_get_code":{"code_sha256":"76cadc87e9fc55ed"}},{"arxiv_id":"2309.04475","arxiv_id_is_arxiv":true,"paper":"/paper/crystal-structure-prediction-by-joint-1","title":"Crystal Structure Prediction by Joint Equivariant Diffusion","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaor17/DiffCSP","path":"diffcsp/pl_modules/diffusion.py","file_url":"https://github.com/jiaor17/DiffCSP/blob/HEAD/diffcsp/pl_modules/diffusion.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":"ecbf0e6842d69df1","code_sha256_prefix":"ecbf0e6842d69df1","mcp_get_code":{"code_sha256":"ecbf0e6842d69df1"}},{"arxiv_id":"2307.14008","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-frequency-filters-as-efficient","title":"Adaptive Frequency Filters As Efficient Global Token Mixers","date":"2023-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NWPU-Li/AFFNet","path":"aff_block_LL.py","file_url":"https://github.com/NWPU-Li/AFFNet/blob/HEAD/aff_block_LL.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, NWPU-Li/AFFNet when it was checked","code_sha256":"7f97a3538e5957e4","code_sha256_prefix":"7f97a3538e5957e4","mcp_get_code":{"code_sha256":"7f97a3538e5957e4"}},{"arxiv_id":"2302.02601","arxiv_id_is_arxiv":true,"paper":"/paper/learning-representations-of-bi-level","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdi-lab/BiVE","path":"openke/module/model/BiVE_B.py","file_url":"https://github.com/bdi-lab/BiVE/blob/HEAD/openke/module/model/BiVE_B.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, bdi-lab/BiVE (NOASSERTION)","code_sha256":"36a090ccec0c8601","code_sha256_prefix":"36a090ccec0c8601","mcp_get_code":{"code_sha256":"36a090ccec0c8601"}},{"arxiv_id":"2203.03952","arxiv_id_is_arxiv":true,"paper":"/paper/edgeformer-improving-light-weight-convnets-by","title":"ParC-Net: Position Aware Circular Convolution with Merits from ConvNets and Transformer","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkzhang91/parc-net","path":"cvnets/modules/edgeformer_block.py","file_url":"https://github.com/hkzhang91/parc-net/blob/HEAD/cvnets/modules/edgeformer_block.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, hkzhang91/parc-net when it was checked","code_sha256":"bf2ef049fe8a2900","code_sha256_prefix":"bf2ef049fe8a2900","mcp_get_code":{"code_sha256":"bf2ef049fe8a2900"}},{"arxiv_id":"2203.01824","arxiv_id_is_arxiv":true,"paper":"/paper/lgt-net-indoor-panoramic-room-layout","title":"LGT-Net: Indoor Panoramic Room Layout Estimation with Geometry-Aware Transformer Network","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhigangjiang/LGT-Net","path":"models/lgt_net.py","file_url":"https://github.com/zhigangjiang/LGT-Net/blob/HEAD/models/lgt_net.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":"9964cf34a550253f","code_sha256_prefix":"9964cf34a550253f","mcp_get_code":{"code_sha256":"9964cf34a550253f"}},{"arxiv_id":"2104.06849","arxiv_id_is_arxiv":true,"paper":"/paper/leap-learning-articulated-occupancy-of-people","title":"LEAP: Learning Articulated Occupancy of People","date":"2021-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuralbodies/leap","path":"leap/modules/modules.py","file_url":"https://github.com/neuralbodies/leap/blob/HEAD/leap/modules/modules.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, neuralbodies/leap (NOASSERTION)","code_sha256":"861701d1c4950f80","code_sha256_prefix":"861701d1c4950f80","mcp_get_code":{"code_sha256":"861701d1c4950f80"}},{"arxiv_id":"2009.14193","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-sets-for-image-classifiers-using","title":"Uncertainty Sets for Image Classifiers using Conformal Prediction","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightning-uq-box/lightning-uq-box","path":"lightning_uq_box/uq_methods/raps.py","file_url":"https://github.com/lightning-uq-box/lightning-uq-box/blob/HEAD/lightning_uq_box/uq_methods/raps.py","status":"unverified","verification_level":0,"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":"466b72a3e0124a34","code_sha256_prefix":"466b72a3e0124a34","mcp_get_code":{"code_sha256":"466b72a3e0124a34"}}],"record_sha256":"e7b9b06d776486ff037b99fe87333483d45915c013023780a8cbd623e836a3aa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}