{"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-emb","entry":"get_emb","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":20,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":17,"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":10,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":21,"n_places_pointer_only":9,"n_places_pointer_only_link_open":1,"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":1,"ran_fixture":0,"ran":6,"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":"2603.04317","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04317","title":"World Properties without World Models: Recovering Spatial and Temporal Structure from Co-occurrence Statistics in Static Word Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"elanbarenholtz/static-embeddings-space-time","path":"glove_multi_probe.py","file_url":"https://github.com/elanbarenholtz/static-embeddings-space-time/blob/HEAD/glove_multi_probe.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, elanbarenholtz/static-embeddings-space-time when it was checked","code_sha256":"c8d30e013152acdb","code_sha256_prefix":"c8d30e013152acdb","mcp_get_code":{"code_sha256":"c8d30e013152acdb"}},{"arxiv_id":"2602.00407","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-00407","title":"Fed-Listing: Federated Label Distribution Inference in Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"suprimnakarmi/Fed-Listing","path":"source_code/baselines/EC-LDA-node-classification/iLRG/methods.py","file_url":"https://github.com/suprimnakarmi/Fed-Listing/blob/HEAD/source_code/baselines/EC-LDA-node-classification/iLRG/methods.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, suprimnakarmi/Fed-Listing when it was checked","code_sha256":"d2dd16caa88e2faa","code_sha256_prefix":"d2dd16caa88e2faa","mcp_get_code":{"code_sha256":"d2dd16caa88e2faa"}},{"arxiv_id":"2411.00066","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-language-modeling-via-induction","title":"Interpretable Language Modeling via Induction-head Ngram Models","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejkim47/induction-gram","path":"alm/models/mini_gpt.py","file_url":"https://github.com/ejkim47/induction-gram/blob/HEAD/alm/models/mini_gpt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2409.16288","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-any-point-tracking-by","title":"Self-Supervised Any-Point Tracking by Contrastive Random Walks","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ayshrv/gmrw","path":"models/gmflow_model/position.py","file_url":"https://github.com/ayshrv/gmrw/blob/HEAD/models/gmflow_model/position.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2407.13335","arxiv_id_is_arxiv":true,"paper":"/paper/oat-object-level-attention-transformer-for","title":"OAT: Object-Level Attention Transformer for Gaze Scanpath Prediction","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-nisl/oat_eccv24","path":"src/model/positionalEncoding.py","file_url":"https://github.com/hkust-nisl/oat_eccv24/blob/HEAD/src/model/positionalEncoding.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, hkust-nisl/oat_eccv24 when it was checked","code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2406.08380","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unsupervised-speech-recognition","title":"Towards Unsupervised Speech Recognition Without Pronunciation Models","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeromeni/wholeword-uasr-jstti","path":"GradSeg/data_loader.py","file_url":"https://github.com/jeromeni/wholeword-uasr-jstti/blob/HEAD/GradSeg/data_loader.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":"a73490164e4bb95c","code_sha256_prefix":"a73490164e4bb95c","mcp_get_code":{"code_sha256":"a73490164e4bb95c"}},{"arxiv_id":"2405.07395","arxiv_id_is_arxiv":true,"paper":"/paper/cafa-global-weather-forecasting-with","title":"CaFA: Global Weather Forecasting with Factorized Attention on Sphere","date":"2024-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BaratiLab/CaFA","path":"libs/positional_encoding_module.py","file_url":"https://github.com/BaratiLab/CaFA/blob/HEAD/libs/positional_encoding_module.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2402.04396","arxiv_id_is_arxiv":true,"paper":"/paper/quip-even-better-llm-quantization-with","title":"QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebooks","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cornell-RelaxML/quip-sharp","path":"quantize_llama/finetune_e2e_llama.py","file_url":"https://github.com/Cornell-RelaxML/quip-sharp/blob/HEAD/quantize_llama/finetune_e2e_llama.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, Cornell-RelaxML/quip-sharp, is not in the permissive set Syntology serves inline","code_sha256":"71304b57668d33e4","code_sha256_prefix":"71304b57668d33e4","mcp_get_code":{"code_sha256":"71304b57668d33e4"}},{"arxiv_id":"2312.04552","arxiv_id_is_arxiv":true,"paper":"/paper/generating-illustrated-instructions","title":"Generating Illustrated Instructions","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sachit-menon/generating-illustrated-instructions-reproduction","path":"layers.py","file_url":"https://github.com/sachit-menon/generating-illustrated-instructions-reproduction/blob/HEAD/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sachit-menon/generating-illustrated-instructions-reproduction when it was checked","code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2311.08863","arxiv_id_is_arxiv":true,"paper":"/paper/toulouse-hyperspectral-data-set-a-benchmark","title":"Toulouse Hyperspectral Data Set: a benchmark data set to assess semi-supervised spectral representation learning and pixel-wise classification techniques","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"romain3ch216/tlse-experiments","path":"models/utils.py","file_url":"https://github.com/romain3ch216/tlse-experiments/blob/HEAD/models/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, romain3ch216/tlse-experiments when it was checked","code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2311.00136","arxiv_id_is_arxiv":true,"paper":"/paper/neuroformer-multimodal-and-multitask","title":"Neuroformer: Multimodal and Multitask Generative Pretraining for Brain Data","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a-antoniades/neuroformer","path":"neuroformer/model_neuroformer.py","file_url":"https://github.com/a-antoniades/neuroformer/blob/HEAD/neuroformer/model_neuroformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2310.20030","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-riemannian-diffusion-models","title":"Scaling Riemannian Diffusion Models","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louaaron/Scaling-Riemannian-Diffusion","path":"lattice_qcd/model.py","file_url":"https://github.com/louaaron/Scaling-Riemannian-Diffusion/blob/HEAD/lattice_qcd/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, louaaron/Scaling-Riemannian-Diffusion when it was checked","code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2303.15269","arxiv_id_is_arxiv":true,"paper":"/paper/handwritten-text-generation-from-visual","title":"Handwritten Text Generation from Visual Archetypes","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aimagelab/VATr","path":"models/model.py","file_url":"https://github.com/aimagelab/VATr/blob/HEAD/models/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2303.12733","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-de-duplication-of-laion-2b","title":"On the De-duplication of LAION-2B","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryanwebster90/snip-dedup","path":"retrieve_dup_urls_demo.py","file_url":"https://github.com/ryanwebster90/snip-dedup/blob/HEAD/retrieve_dup_urls_demo.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":"8e236fba907d13b4","code_sha256_prefix":"8e236fba907d13b4","mcp_get_code":{"code_sha256":"8e236fba907d13b4"}},{"arxiv_id":"2211.13220","arxiv_id_is_arxiv":true,"paper":"/paper/tetrahedral-diffusion-models-for-3d-shape","title":"TetraDiffusion: Tetrahedral Diffusion Models for 3D Shape Generation","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PeterTor/TetraDiffusion","path":"lib/UVIT.py","file_url":"https://github.com/PeterTor/TetraDiffusion/blob/HEAD/lib/UVIT.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":"33805df68cb6892e","code_sha256_prefix":"33805df68cb6892e","mcp_get_code":{"code_sha256":"33805df68cb6892e"}},{"arxiv_id":"2211.03329","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-graphon-neural-representation","title":"Implicit Graphon Neural Representation","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mishne-lab/ignr","path":"c-IGNR/evaluation.py","file_url":"https://github.com/mishne-lab/ignr/blob/HEAD/c-IGNR/evaluation.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":"b444e94d464426b5","code_sha256_prefix":"b444e94d464426b5","mcp_get_code":{"code_sha256":"b444e94d464426b5"}},{"arxiv_id":"2204.13094","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-word-segmentation-using-k","title":"Unsupervised Word Segmentation using K Nearest Neighbors","date":null,"month_inferred_from_arxiv_id":"2022-04","title_source":"archive","repo":"mlspeech/gradseg","path":"data_loader.py","file_url":"https://github.com/mlspeech/gradseg/blob/HEAD/data_loader.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":"a73490164e4bb95c","code_sha256_prefix":"a73490164e4bb95c","mcp_get_code":{"code_sha256":"a73490164e4bb95c"}},{"arxiv_id":"2112.05194","arxiv_id_is_arxiv":true,"paper":"/paper/word-embeddings-via-causal-inference-gender","title":"Word Embeddings via Causal Inference: Gender Bias Reducing and Semantic Information Preserving","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lei-Ding07/Word_Debias_DeSIP","path":"load_embedding.py","file_url":"https://github.com/Lei-Ding07/Word_Debias_DeSIP/blob/HEAD/load_embedding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Lei-Ding07/Word_Debias_DeSIP when it was checked","code_sha256":"7722c58b6cc84546","code_sha256_prefix":"7722c58b6cc84546","mcp_get_code":{"code_sha256":"7722c58b6cc84546"}},{"arxiv_id":"1911.01196","arxiv_id_is_arxiv":true,"paper":"/paper/spherical-text-embedding","title":"Spherical Text Embedding","date":"2019-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yumeng5/Spherical-Text-Embedding","path":"sim.py","file_url":"https://github.com/yumeng5/Spherical-Text-Embedding/blob/HEAD/sim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Lei-Ding07/Word_Debias_DeSIP, and GitHub detected no licence in that repository when it was checked","code_sha256":"7722c58b6cc84546","code_sha256_prefix":"7722c58b6cc84546","mcp_get_code":{"code_sha256":"7722c58b6cc84546"}},{"arxiv_id":"1911.01196","arxiv_id_is_arxiv":true,"paper":"/paper/spherical-text-embedding","title":"Spherical Text Embedding","date":"2019-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yumeng5/Spherical-Text-Embedding","path":"classify.py","file_url":"https://github.com/yumeng5/Spherical-Text-Embedding/blob/HEAD/classify.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":"c152449a72ec7914","code_sha256_prefix":"c152449a72ec7914","mcp_get_code":{"code_sha256":"c152449a72ec7914"}},{"arxiv_id":"1805.08318","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alfagao/DeOldify","path":"fastai/column_data.py","file_url":"https://github.com/alfagao/DeOldify/blob/HEAD/fastai/column_data.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":"2e0a726be884ad1d","code_sha256_prefix":"2e0a726be884ad1d","mcp_get_code":{"code_sha256":"2e0a726be884ad1d"}}],"record_sha256":"ea472f54cb83266ec2a0873325fcb042c84a677bf2045660b2ad5022222243c3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}