{"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/pil-to-tensor","entry":"pil_to_tensor","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":4,"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":2,"ran_fixture":2,"ran":1,"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":"2601.04520","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04520","title":"FaceRefiner: High-Fidelity Facial Texture Refinement with Differentiable Rendering-based Style Transfer","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"HarshWinterBytes/FaceRefiner","path":"style_transfer_3d.py","file_url":"https://github.com/HarshWinterBytes/FaceRefiner/blob/HEAD/style_transfer_3d.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":"8a62e6ae5a393b69","code_sha256_prefix":"8a62e6ae5a393b69","mcp_get_code":{"code_sha256":"8a62e6ae5a393b69"}},{"arxiv_id":"2511.01307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-01307","title":"Perturb a Model, Not an Image: Towards Robust Privacy Protection via Anti-Personalized Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"KU-VGI/APDM","path":"evaluation/dino.py","file_url":"https://github.com/KU-VGI/APDM/blob/HEAD/evaluation/dino.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, KU-VGI/APDM when it was checked","code_sha256":"49d329492296a105","code_sha256_prefix":"49d329492296a105","mcp_get_code":{"code_sha256":"49d329492296a105"}},{"arxiv_id":"2502.13146","arxiv_id_is_arxiv":true,"paper":"/paper/re-align-aligning-vision-language-models-via","title":"Re-Align: Aligning Vision Language Models via Retrieval-Augmented Direct Preference Optimization","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taco-group/re-align","path":"train_rdpo.py","file_url":"https://github.com/taco-group/re-align/blob/HEAD/train_rdpo.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":"f445d7bdccdc3673","code_sha256_prefix":"f445d7bdccdc3673","mcp_get_code":{"code_sha256":"f445d7bdccdc3673"}},{"arxiv_id":"2412.08486","arxiv_id_is_arxiv":true,"paper":"/paper/learning-flow-fields-in-attention-for","title":"Learning Flow Fields in Attention for Controllable Person Image Generation","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"franciszzj/leffa","path":"leffa/inference.py","file_url":"https://github.com/franciszzj/leffa/blob/HEAD/leffa/inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13618485a328150e","code_sha256_prefix":"13618485a328150e","mcp_get_code":{"code_sha256":"13618485a328150e"}},{"arxiv_id":"2412.06566","arxiv_id_is_arxiv":true,"paper":"/paper/dex-data-channel-extension-for-efficient-cnn","title":"DEX: Data Channel Extension for Efficient CNN Inference on Tiny AI Accelerators","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nokia-Bell-Labs/data-channel-extension","path":"utils/data_augmentation.py","file_url":"https://github.com/Nokia-Bell-Labs/data-channel-extension/blob/HEAD/utils/data_augmentation.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, Nokia-Bell-Labs/data-channel-extension (NOASSERTION)","code_sha256":"9d51aae93715644d","code_sha256_prefix":"9d51aae93715644d","mcp_get_code":{"code_sha256":"9d51aae93715644d"}},{"arxiv_id":"2407.11394","arxiv_id_is_arxiv":true,"paper":"/paper/dreamcatalyst-fast-and-high-quality-3d","title":"DreamCatalyst: Fast and High-Quality 3D Editing via Controlling Editability and Identity Preservation","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-cvml-lab/DreamCatalyst","path":"nerfstudio/dc/dc.py","file_url":"https://github.com/kaist-cvml-lab/DreamCatalyst/blob/HEAD/nerfstudio/dc/dc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, kaist-cvml-lab/DreamCatalyst when it was checked","code_sha256":"bbfe55502fe5c92f","code_sha256_prefix":"bbfe55502fe5c92f","mcp_get_code":{"code_sha256":"bbfe55502fe5c92f"}},{"arxiv_id":"2406.01843","arxiv_id_is_arxiv":true,"paper":"/paper/l-magic-language-model-assisted-generation-of","title":"L-MAGIC: Language Model Assisted Generation of Images with Coherence","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intellabs/mmpano","path":"mm_pano/utils/image_utils.py","file_url":"https://github.com/intellabs/mmpano/blob/HEAD/mm_pano/utils/image_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ea023ab195f66cf3","code_sha256_prefix":"ea023ab195f66cf3","mcp_get_code":{"code_sha256":"ea023ab195f66cf3"}},{"arxiv_id":"2404.11120","arxiv_id_is_arxiv":true,"paper":"/paper/tino-edit-timestep-and-noise-optimization-for","title":"TiNO-Edit: Timestep and Noise Optimization for Robust Diffusion-Based Image Editing","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sherryxtchen/tino-edit","path":"latentclip/utils.py","file_url":"https://github.com/sherryxtchen/tino-edit/blob/HEAD/latentclip/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1bfefaf0ecc0034b","code_sha256_prefix":"1bfefaf0ecc0034b","mcp_get_code":{"code_sha256":"1bfefaf0ecc0034b"}},{"arxiv_id":"2403.05139","arxiv_id_is_arxiv":true,"paper":"/paper/improving-diffusion-models-for-virtual-try-on","title":"Improving Diffusion Models for Authentic Virtual Try-on in the Wild","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yisol/IDM-VTON","path":"inference.py","file_url":"https://github.com/yisol/IDM-VTON/blob/HEAD/inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, yisol/IDM-VTON when it was checked","code_sha256":"13618485a328150e","code_sha256_prefix":"13618485a328150e","mcp_get_code":{"code_sha256":"13618485a328150e"}}],"record_sha256":"f8297cf9e4099829c2c91ede6eaef2d8cffdb1c0a960bf9a72a2f081112151b7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}