{"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-image-size","entry":"get_image_size","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":10,"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":11,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":12,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":7,"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":"2604.08005","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-08005","title":"Preference Redirection via Attention Concentration: An Attack on Computer Use Agents","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Dominik5431/PRAC","path":"prac/models/glm_differentiable_processor.py","file_url":"https://github.com/Dominik5431/PRAC/blob/HEAD/prac/models/glm_differentiable_processor.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, Dominik5431/PRAC (NOASSERTION)","code_sha256":"ed6f9f96e3bd7c19","code_sha256_prefix":"ed6f9f96e3bd7c19","mcp_get_code":{"code_sha256":"ed6f9f96e3bd7c19"}},{"arxiv_id":"2406.10427","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-randomized-smoothing-certifying","title":"Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-systopia/adaptive-randomized-smoothing","path":"src/utils.py","file_url":"https://github.com/ubc-systopia/adaptive-randomized-smoothing/blob/HEAD/src/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"08eb4421ab56d4d0","code_sha256_prefix":"08eb4421ab56d4d0","mcp_get_code":{"code_sha256":"08eb4421ab56d4d0"}},{"arxiv_id":"2405.16034","arxiv_id_is_arxiv":true,"paper":"/paper/diffubox-refining-3d-object-detection-with","title":"DiffuBox: Refining 3D Object Detection with Point Diffusion","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cxy1997/DiffuBox","path":"gen_obj_shape.py","file_url":"https://github.com/cxy1997/DiffuBox/blob/HEAD/gen_obj_shape.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, cxy1997/DiffuBox (NOASSERTION)","code_sha256":"07aa57390b99e27c","code_sha256_prefix":"07aa57390b99e27c","mcp_get_code":{"code_sha256":"07aa57390b99e27c"}},{"arxiv_id":"2312.12726","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-shape-radiance-ambiguity-in-radiance-1","title":"Reducing Shape-Radiance Ambiguity in Radiance Fields with a Closed-Form Color Estimation Method","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qihangGH/Closed-form-color-field","path":"opt/util/load_llff.py","file_url":"https://github.com/qihangGH/Closed-form-color-field/blob/HEAD/opt/util/load_llff.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"848824c9cee292ce","code_sha256_prefix":"848824c9cee292ce","mcp_get_code":{"code_sha256":"848824c9cee292ce"}},{"arxiv_id":"2309.08957","arxiv_id_is_arxiv":true,"paper":"/paper/exblurf-efficient-radiance-fields-for-extreme","title":"ExBluRF: Efficient Radiance Fields for Extreme Motion Blurred Images","date":"2023-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taekkii/exblurf","path":"plenoxel/load_llff.py","file_url":"https://github.com/taekkii/exblurf/blob/HEAD/plenoxel/load_llff.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"848824c9cee292ce","code_sha256_prefix":"848824c9cee292ce","mcp_get_code":{"code_sha256":"848824c9cee292ce"}},{"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_constants.py","file_url":"https://github.com/da03/markup2im/blob/HEAD/src/markup2im_constants.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":"c4c8ed0cccf40206","code_sha256_prefix":"c4c8ed0cccf40206","mcp_get_code":{"code_sha256":"c4c8ed0cccf40206"}},{"arxiv_id":"2207.11240","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-key-value-bottleneck","title":"Discrete Key-Value Bottleneck","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ftraeuble/experiments_discrete_key_value_bottleneck","path":"kv_bottleneck_experiments/utils/base.py","file_url":"https://github.com/ftraeuble/experiments_discrete_key_value_bottleneck/blob/HEAD/kv_bottleneck_experiments/utils/base.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":"1e4efca94cf1e079","code_sha256_prefix":"1e4efca94cf1e079","mcp_get_code":{"code_sha256":"1e4efca94cf1e079"}},{"arxiv_id":"2207.06825","arxiv_id_is_arxiv":true,"paper":"/paper/refign-align-and-refine-for-adaptation-of","title":"Refign: Align and Refine for Adaptation of Semantic Segmentation to Adverse Conditions","date":"2022-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brdav/refign","path":"data_modules/transforms.py","file_url":"https://github.com/brdav/refign/blob/HEAD/data_modules/transforms.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":"00a098bec6ba382a","code_sha256_prefix":"00a098bec6ba382a","mcp_get_code":{"code_sha256":"00a098bec6ba382a"}},{"arxiv_id":"1902.07104","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-cross-modal-few-shot-learning","title":"Adaptive Cross-Modal Few-Shot Learning","date":"2019-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ElementAI/am3","path":"AM3_protonet++.py","file_url":"https://github.com/ElementAI/am3/blob/HEAD/AM3_protonet%2B%2B.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":"0168d492531ad3ee","code_sha256_prefix":"0168d492531ad3ee","mcp_get_code":{"code_sha256":"0168d492531ad3ee"}},{"arxiv_id":"1902.07104","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-cross-modal-few-shot-learning","title":"Adaptive Cross-Modal Few-Shot Learning","date":"2019-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ElementAI/am3","path":"protonet++.py","file_url":"https://github.com/ElementAI/am3/blob/HEAD/protonet%2B%2B.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":"b6df602c207be4b9","code_sha256_prefix":"b6df602c207be4b9","mcp_get_code":{"code_sha256":"b6df602c207be4b9"}},{"arxiv_id":"1805.10123","arxiv_id_is_arxiv":true,"paper":"/paper/tadam-task-dependent-adaptive-metric-for","title":"TADAM: Task dependent adaptive metric for improved few-shot learning","date":"2018-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ElementAI/TADAM","path":"model/tadam.py","file_url":"https://github.com/ElementAI/TADAM/blob/HEAD/model/tadam.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":"4109ef235133a0b8","code_sha256_prefix":"4109ef235133a0b8","mcp_get_code":{"code_sha256":"4109ef235133a0b8"}},{"arxiv_id":"1612.00005","arxiv_id_is_arxiv":true,"paper":"/paper/plug-play-generative-networks-conditional","title":"Plug & Play Generative Networks: Conditional Iterative Generation of Images in Latent Space","date":"2016-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Evolving-AI-Lab/ppgn","path":"util.py","file_url":"https://github.com/Evolving-AI-Lab/ppgn/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a4d31f2245435a58","code_sha256_prefix":"a4d31f2245435a58","mcp_get_code":{"code_sha256":"a4d31f2245435a58"}}],"record_sha256":"0741b42c1cec653853b7e4a18459b20b864ce56e696df22865a677671f0be74f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}