{"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/encode-text","entry":"encode_text","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":11,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"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":11,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":11,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":5,"unverified":3},"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":"2609.00411","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00411","title":"Unmasking Face Embeddings: Reading, Rendering and Naming with Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"Fizza-Rubab/unmasking-face-embeddings","path":"experiments/eval_text_retrieval.py","file_url":"https://github.com/Fizza-Rubab/unmasking-face-embeddings/blob/HEAD/experiments/eval_text_retrieval.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":"f079564e623fd094","code_sha256_prefix":"f079564e623fd094","mcp_get_code":{"code_sha256":"f079564e623fd094"}},{"arxiv_id":"2605.20188","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20188","title":"GraphDiffMed: Knowledge-Constrained Differential Attention with Pharmacological Graph Priors for Medication Recommendation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"saxenakrati09/GraphDiffMed","path":"src/modules/GraphDiffMed.py","file_url":"https://github.com/saxenakrati09/GraphDiffMed/blob/HEAD/src/modules/GraphDiffMed.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":"6fe5cfad897a3bfd","code_sha256_prefix":"6fe5cfad897a3bfd","mcp_get_code":{"code_sha256":"6fe5cfad897a3bfd"}},{"arxiv_id":"2604.12668","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-12668","title":"OFA-Diffusion Compression: Compressing Diffusion Model in One-Shot Manner","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"atrijhy/OFA-Diffusion_Compression","path":"sd/train_ofa.py","file_url":"https://github.com/atrijhy/OFA-Diffusion_Compression/blob/HEAD/sd/train_ofa.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, atrijhy/OFA-Diffusion_Compression when it was checked","code_sha256":"8ee0a711cba8a0c8","code_sha256_prefix":"8ee0a711cba8a0c8","mcp_get_code":{"code_sha256":"8ee0a711cba8a0c8"}},{"arxiv_id":"2509.01624","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-01624","title":"Q-Sched: Pushing the Boundaries of Few-Step Diffusion Models with Quantization-Aware Scheduling","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"enyac-group/q-sched","path":"src/metrics/pqmap.py","file_url":"https://github.com/enyac-group/q-sched/blob/HEAD/src/metrics/pqmap.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f296a9164f5381b8","code_sha256_prefix":"f296a9164f5381b8","mcp_get_code":{"code_sha256":"f296a9164f5381b8"}},{"arxiv_id":"2506.04624","arxiv_id_is_arxiv":true,"paper":"/paper/static-word-embeddings-for-sentence-semantic","title":"Static Word Embeddings for Sentence Semantic Representation","date":"2025-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twadada/swe4semantics","path":"util.py","file_url":"https://github.com/twadada/swe4semantics/blob/HEAD/util.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":"51357003448ec154","code_sha256_prefix":"51357003448ec154","mcp_get_code":{"code_sha256":"51357003448ec154"}},{"arxiv_id":"2405.12211","arxiv_id_is_arxiv":true,"paper":"/paper/slicedit-zero-shot-video-editing-with-text-to","title":"Slicedit: Zero-Shot Video Editing With Text-to-Image Diffusion Models Using Spatio-Temporal Slices","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fallenshock/Slicedit","path":"Slicedit/inversion_utils.py","file_url":"https://github.com/fallenshock/Slicedit/blob/HEAD/Slicedit/inversion_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f10ef55e8b711ad5","code_sha256_prefix":"f10ef55e8b711ad5","mcp_get_code":{"code_sha256":"f10ef55e8b711ad5"}},{"arxiv_id":"2303.07902","arxiv_id_is_arxiv":true,"paper":"/paper/blat-bootstrapping-language-audio-pre","title":"BLAT: Bootstrapping Language-Audio Pre-training based on AudioSet Tag-guided Synthetic Data","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"wsntxxn/blat","path":"inference.py","file_url":"https://github.com/wsntxxn/blat/blob/HEAD/inference.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wsntxxn/blat when it was checked","code_sha256":"69f817e3020b2fd6","code_sha256_prefix":"69f817e3020b2fd6","mcp_get_code":{"code_sha256":"69f817e3020b2fd6"}},{"arxiv_id":"2210.05147","arxiv_id_is_arxiv":true,"paper":"/paper/markup-to-image-diffusion-models-with","title":"Markup-to-Image Diffusion Models with Scheduled Sampling","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"da03/markup2im","path":"src/markup2im_models.py","file_url":"https://github.com/da03/markup2im/blob/HEAD/src/markup2im_models.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":"c02507c005d13ce7","code_sha256_prefix":"c02507c005d13ce7","mcp_get_code":{"code_sha256":"c02507c005d13ce7"}},{"arxiv_id":"2107.07651","arxiv_id_is_arxiv":true,"paper":"/paper/align-before-fuse-vision-and-language","title":"Align before Fuse: Vision and Language Representation Learning with Momentum Distillation","date":"2021-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/multimodal","path":"examples/albef/finetune_retrieval.py","file_url":"https://github.com/facebookresearch/multimodal/blob/HEAD/examples/albef/finetune_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e59b9b43e8146d5e","code_sha256_prefix":"e59b9b43e8146d5e","mcp_get_code":{"code_sha256":"e59b9b43e8146d5e"}},{"arxiv_id":"1512.05287","arxiv_id_is_arxiv":true,"paper":"/paper/a-theoretically-grounded-application-of","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","date":"2015-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martin-gorner/tensorflow-rnn-shakespeare","path":"my_txtutils.py","file_url":"https://github.com/martin-gorner/tensorflow-rnn-shakespeare/blob/HEAD/my_txtutils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89e3c1684fe53b8b","code_sha256_prefix":"89e3c1684fe53b8b","mcp_get_code":{"code_sha256":"89e3c1684fe53b8b"}},{"arxiv_id":"1508.01211","arxiv_id_is_arxiv":true,"paper":"/paper/listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sciforce/phones-las","path":"text_preprocess.py","file_url":"https://github.com/sciforce/phones-las/blob/HEAD/text_preprocess.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":"24b568092a10eca5","code_sha256_prefix":"24b568092a10eca5","mcp_get_code":{"code_sha256":"24b568092a10eca5"}}],"record_sha256":"94e0c710d38fa81941e28c4caeb300dc3cf63e1e00b8a49085bc9b1ac04261d8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}