{"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/normal-2","entry":"normal","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":11,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":6,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":6,"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":3,"ran_fixture":0,"ran":5,"unverified":0},"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":"2606.15207","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15207","title":"Controlled Dynamics Attractor Transformer","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d67b0a557c3733b2","code_sha256_prefix":"d67b0a557c3733b2","mcp_get_code":{"code_sha256":"d67b0a557c3733b2"}},{"arxiv_id":"2601.12079","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12079","title":"EmoLat: Text-driven Image Sentiment Transfer via Emotion Latent Space","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JingVIPLab/EmoLat","path":"model/function.py","file_url":"https://github.com/JingVIPLab/EmoLat/blob/HEAD/model/function.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JingVIPLab/EmoLat when it was checked","code_sha256":"9cfa20df1a35d293","code_sha256_prefix":"9cfa20df1a35d293","mcp_get_code":{"code_sha256":"9cfa20df1a35d293"}},{"arxiv_id":"2409.10385","arxiv_id_is_arxiv":true,"paper":"/paper/mamba-st-state-space-model-for-efficient","title":"Mamba-ST: State Space Model for Efficient Style Transfer","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"filippobotti/mambast","path":"function.py","file_url":"https://github.com/filippobotti/mambast/blob/HEAD/function.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, filippobotti/mambast when it was checked","code_sha256":"9cfa20df1a35d293","code_sha256_prefix":"9cfa20df1a35d293","mcp_get_code":{"code_sha256":"9cfa20df1a35d293"}},{"arxiv_id":"2405.19775","arxiv_id_is_arxiv":true,"paper":"/paper/puff-net-efficient-style-transfer-with-pure","title":"Puff-Net: Efficient Style Transfer with Pure Content and Style Feature Fusion Network","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZszYmy9/Puff-Net","path":"PuffNet.py","file_url":"https://github.com/ZszYmy9/Puff-Net/blob/HEAD/PuffNet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ZszYmy9/Puff-Net when it was checked","code_sha256":"9cfa20df1a35d293","code_sha256_prefix":"9cfa20df1a35d293","mcp_get_code":{"code_sha256":"9cfa20df1a35d293"}},{"arxiv_id":"2402.12984","arxiv_id_is_arxiv":true,"paper":"/paper/can-gnn-be-good-adapter-for-llms","title":"Can GNN be Good Adapter for LLMs?","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hxttkl/GraphAdapter","path":"finetune_utils.py","file_url":"https://github.com/hxttkl/GraphAdapter/blob/HEAD/finetune_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hxttkl/GraphAdapter when it was checked","code_sha256":"1c429c89fb9d3c9c","code_sha256_prefix":"1c429c89fb9d3c9c","mcp_get_code":{"code_sha256":"1c429c89fb9d3c9c"}},{"arxiv_id":"2310.00615","arxiv_id_is_arxiv":true,"paper":"/paper/scene-aware-human-motion-forecasting-via","title":"Scene-aware Human Motion Forecasting via Mutual Distance Prediction","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xccyue/MutualDistance","path":"GTAIM/finalmodel/utils/geo_utils.py","file_url":"https://github.com/xccyue/MutualDistance/blob/HEAD/GTAIM/finalmodel/utils/geo_utils.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, xccyue/MutualDistance when it was checked","code_sha256":"34993200383d2f69","code_sha256_prefix":"34993200383d2f69","mcp_get_code":{"code_sha256":"34993200383d2f69"}},{"arxiv_id":"2302.07253","arxiv_id_is_arxiv":true,"paper":"/paper/energy-transformer","title":"Energy Transformer","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lemon-cmd/energy-transformer-graph","path":"src/model/et.py","file_url":"https://github.com/Lemon-cmd/energy-transformer-graph/blob/HEAD/src/model/et.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d67b0a557c3733b2","code_sha256_prefix":"d67b0a557c3733b2","mcp_get_code":{"code_sha256":"d67b0a557c3733b2"}},{"arxiv_id":"2301.01456","arxiv_id_is_arxiv":true,"paper":"/paper/audio-visual-efficient-conformer-for-robust","title":"Audio-Visual Efficient Conformer for Robust Speech Recognition","date":"2023-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"burchim/avec","path":"nnet/initializations.py","file_url":"https://github.com/burchim/avec/blob/HEAD/nnet/initializations.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":"a1dfc6d6c96e610b","code_sha256_prefix":"a1dfc6d6c96e610b","mcp_get_code":{"code_sha256":"a1dfc6d6c96e610b"}},{"arxiv_id":"2208.08270","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-privacy-effect-of-data-enhancement-via","title":"On the Privacy Effect of Data Enhancement via the Lens of Memorization","date":"2022-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixiaothu/privacy_and_aug","path":"eval_privacy.py","file_url":"https://github.com/lixiaothu/privacy_and_aug/blob/HEAD/eval_privacy.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":"5f7d0e7a485b4a1a","code_sha256_prefix":"5f7d0e7a485b4a1a","mcp_get_code":{"code_sha256":"5f7d0e7a485b4a1a"}},{"arxiv_id":"2005.01703","arxiv_id_is_arxiv":true,"paper":"/paper/transforming-and-projecting-images-into-class","title":"Transforming and Projecting Images into Class-conditional Generative Networks","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minyoungg/pix2latent","path":"pix2latent/distribution.py","file_url":"https://github.com/minyoungg/pix2latent/blob/HEAD/pix2latent/distribution.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":"acf89c8da2fe2d27","code_sha256_prefix":"acf89c8da2fe2d27","mcp_get_code":{"code_sha256":"acf89c8da2fe2d27"}},{"arxiv_id":"1206.1901","arxiv_id_is_arxiv":true,"paper":"/paper/mcmc-using-hamiltonian-dynamics","title":"MCMC using Hamiltonian dynamics","date":null,"month_inferred_from_arxiv_id":"2012-06","title_source":"archive","repo":"ricvalp/aisampler","path":"aisampler/logistic_regression/densities.py","file_url":"https://github.com/ricvalp/aisampler/blob/HEAD/aisampler/logistic_regression/densities.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":"0bd227a6783875bd","code_sha256_prefix":"0bd227a6783875bd","mcp_get_code":{"code_sha256":"0bd227a6783875bd"}}],"record_sha256":"a82d60872c3d5feae5967ce1934640bc5e58cf075fafcf4f257a2a54c498dd35","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}